./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 f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_26d53605-b91a-4a69-9fb7-ef71d6d44580/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_26d53605-b91a-4a69-9fb7-ef71d6d44580/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_26d53605-b91a-4a69-9fb7-ef71d6d44580/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_26d53605-b91a-4a69-9fb7-ef71d6d44580/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_26d53605-b91a-4a69-9fb7-ef71d6d44580/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_26d53605-b91a-4a69-9fb7-ef71d6d44580/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_26d53605-b91a-4a69-9fb7-ef71d6d44580/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_26d53605-b91a-4a69-9fb7-ef71d6d44580/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_26d53605-b91a-4a69-9fb7-ef71d6d44580/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_26d53605-b91a-4a69-9fb7-ef71d6d44580/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_26d53605-b91a-4a69-9fb7-ef71d6d44580/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_26d53605-b91a-4a69-9fb7-ef71d6d44580/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 51cadc06c77079b30c04df95b2f5f78586c8d429 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 10:07:28,719 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 10:07:28,720 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 10:07:28,727 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 10:07:28,728 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 10:07:28,728 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 10:07:28,729 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 10:07:28,731 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 10:07:28,732 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 10:07:28,733 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 10:07:28,733 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 10:07:28,734 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 10:07:28,734 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 10:07:28,735 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 10:07:28,736 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 10:07:28,737 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 10:07:28,737 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 10:07:28,738 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 10:07:28,740 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 10:07:28,741 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 10:07:28,743 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 10:07:28,743 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 10:07:28,744 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 10:07:28,744 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 10:07:28,746 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 10:07:28,747 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 10:07:28,747 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 10:07:28,747 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 10:07:28,748 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 10:07:28,748 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 10:07:28,748 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 10:07:28,749 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 10:07:28,749 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 10:07:28,750 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 10:07:28,751 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 10:07:28,751 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 10:07:28,752 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 10:07:28,752 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 10:07:28,752 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 10:07:28,753 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 10:07:28,753 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 10:07:28,754 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_26d53605-b91a-4a69-9fb7-ef71d6d44580/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 10:07:28,766 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 10:07:28,767 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 10:07:28,768 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 10:07:28,768 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 10:07:28,768 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 10:07:28,768 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 10:07:28,768 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 10:07:28,769 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 10:07:28,769 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 10:07:28,769 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 10:07:28,769 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 10:07:28,769 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 10:07:28,770 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 10:07:28,770 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 10:07:28,770 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 10:07:28,770 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 10:07:28,770 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 10:07:28,770 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 10:07:28,771 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 10:07:28,771 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 10:07:28,771 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 10:07:28,771 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 10:07:28,771 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 10:07:28,772 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 10:07:28,772 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 10:07:28,772 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 10:07:28,772 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 10:07:28,772 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 10:07:28,772 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 10:07:28,773 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_26d53605-b91a-4a69-9fb7-ef71d6d44580/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-12-07 10:07:28,883 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 10:07:28,893 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 10:07:28,896 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 10:07:28,897 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 10:07:28,898 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 10:07:28,898 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_26d53605-b91a-4a69-9fb7-ef71d6d44580/bin/uautomizer/../../sv-benchmarks/c/ssh/s3_clnt.blast.02.i.cil-1.c [2019-12-07 10:07:28,937 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_26d53605-b91a-4a69-9fb7-ef71d6d44580/bin/uautomizer/data/05b660c43/3197a9588b4f42f3921554fd7d4a2b91/FLAG0fce036ad [2019-12-07 10:07:29,316 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 10:07:29,317 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_26d53605-b91a-4a69-9fb7-ef71d6d44580/sv-benchmarks/c/ssh/s3_clnt.blast.02.i.cil-1.c [2019-12-07 10:07:29,329 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_26d53605-b91a-4a69-9fb7-ef71d6d44580/bin/uautomizer/data/05b660c43/3197a9588b4f42f3921554fd7d4a2b91/FLAG0fce036ad [2019-12-07 10:07:29,337 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_26d53605-b91a-4a69-9fb7-ef71d6d44580/bin/uautomizer/data/05b660c43/3197a9588b4f42f3921554fd7d4a2b91 [2019-12-07 10:07:29,339 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 10:07:29,340 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 10:07:29,340 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 10:07:29,340 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 10:07:29,342 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 10:07:29,343 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 10:07:29" (1/1) ... [2019-12-07 10:07:29,345 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19857750 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:29, skipping insertion in model container [2019-12-07 10:07:29,345 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 10:07:29" (1/1) ... [2019-12-07 10:07:29,349 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 10:07:29,384 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 10:07:29,660 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 10:07:29,670 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 10:07:29,729 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 10:07:29,742 INFO L208 MainTranslator]: Completed translation [2019-12-07 10:07:29,742 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:29 WrapperNode [2019-12-07 10:07:29,743 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 10:07:29,743 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 10:07:29,743 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 10:07:29,743 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 10:07:29,749 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:29" (1/1) ... [2019-12-07 10:07:29,765 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:29" (1/1) ... [2019-12-07 10:07:29,793 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 10:07:29,794 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 10:07:29,794 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 10:07:29,794 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 10:07:29,800 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:29" (1/1) ... [2019-12-07 10:07:29,801 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:29" (1/1) ... [2019-12-07 10:07:29,807 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:29" (1/1) ... [2019-12-07 10:07:29,808 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:29" (1/1) ... [2019-12-07 10:07:29,833 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:29" (1/1) ... [2019-12-07 10:07:29,839 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:29" (1/1) ... [2019-12-07 10:07:29,841 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:29" (1/1) ... [2019-12-07 10:07:29,845 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 10:07:29,846 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 10:07:29,846 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 10:07:29,846 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 10:07:29,846 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:29" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_26d53605-b91a-4a69-9fb7-ef71d6d44580/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 10:07:29,889 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-12-07 10:07:29,890 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 10:07:29,890 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 10:07:29,890 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-07 10:07:29,890 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-12-07 10:07:29,890 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-12-07 10:07:29,890 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 10:07:29,890 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 10:07:30,075 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-12-07 10:07:30,550 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2019-12-07 10:07:30,550 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2019-12-07 10:07:30,550 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 10:07:30,551 INFO L287 CfgBuilder]: Removed 7 assume(true) statements. [2019-12-07 10:07:30,551 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:07:30 BoogieIcfgContainer [2019-12-07 10:07:30,552 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 10:07:30,552 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 10:07:30,552 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 10:07:30,554 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 10:07:30,554 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 10:07:29" (1/3) ... [2019-12-07 10:07:30,555 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d72123 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 10:07:30, skipping insertion in model container [2019-12-07 10:07:30,555 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:29" (2/3) ... [2019-12-07 10:07:30,555 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d72123 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 10:07:30, skipping insertion in model container [2019-12-07 10:07:30,555 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:07:30" (3/3) ... [2019-12-07 10:07:30,556 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_clnt.blast.02.i.cil-1.c [2019-12-07 10:07:30,562 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 10:07:30,567 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 10:07:30,574 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 10:07:30,589 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 10:07:30,589 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 10:07:30,589 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 10:07:30,589 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 10:07:30,589 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 10:07:30,589 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 10:07:30,589 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 10:07:30,590 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 10:07:30,604 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states. [2019-12-07 10:07:30,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-07 10:07:30,610 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:07:30,610 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:07:30,611 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:07:30,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:07:30,614 INFO L82 PathProgramCache]: Analyzing trace with hash -1457695037, now seen corresponding path program 1 times [2019-12-07 10:07:30,620 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:07:30,620 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099951979] [2019-12-07 10:07:30,620 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:07:30,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:07:30,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:07:30,835 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099951979] [2019-12-07 10:07:30,835 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:07:30,835 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 10:07:30,836 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649517221] [2019-12-07 10:07:30,839 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:07:30,839 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:07:30,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:07:30,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:07:30,849 INFO L87 Difference]: Start difference. First operand 129 states. Second operand 4 states. [2019-12-07 10:07:31,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:07:31,121 INFO L93 Difference]: Finished difference Result 255 states and 430 transitions. [2019-12-07 10:07:31,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 10:07:31,123 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2019-12-07 10:07:31,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:07:31,132 INFO L225 Difference]: With dead ends: 255 [2019-12-07 10:07:31,132 INFO L226 Difference]: Without dead ends: 116 [2019-12-07 10:07:31,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-12-07 10:07:31,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-12-07 10:07:31,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 115. [2019-12-07 10:07:31,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-12-07 10:07:31,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 172 transitions. [2019-12-07 10:07:31,170 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 172 transitions. Word has length 24 [2019-12-07 10:07:31,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:07:31,170 INFO L462 AbstractCegarLoop]: Abstraction has 115 states and 172 transitions. [2019-12-07 10:07:31,170 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:07:31,170 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 172 transitions. [2019-12-07 10:07:31,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-12-07 10:07:31,172 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:07:31,172 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:07:31,173 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:07:31,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:07:31,173 INFO L82 PathProgramCache]: Analyzing trace with hash 1001988123, now seen corresponding path program 1 times [2019-12-07 10:07:31,173 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:07:31,174 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075406832] [2019-12-07 10:07:31,174 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:07:31,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:07:31,273 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 10:07:31,273 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075406832] [2019-12-07 10:07:31,273 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:07:31,274 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:07:31,274 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308287899] [2019-12-07 10:07:31,275 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:07:31,275 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:07:31,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:07:31,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:07:31,276 INFO L87 Difference]: Start difference. First operand 115 states and 172 transitions. Second operand 3 states. [2019-12-07 10:07:31,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:07:31,307 INFO L93 Difference]: Finished difference Result 320 states and 482 transitions. [2019-12-07 10:07:31,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:07:31,308 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2019-12-07 10:07:31,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:07:31,310 INFO L225 Difference]: With dead ends: 320 [2019-12-07 10:07:31,310 INFO L226 Difference]: Without dead ends: 215 [2019-12-07 10:07:31,311 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:07:31,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2019-12-07 10:07:31,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 215. [2019-12-07 10:07:31,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2019-12-07 10:07:31,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 319 transitions. [2019-12-07 10:07:31,324 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 319 transitions. Word has length 38 [2019-12-07 10:07:31,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:07:31,325 INFO L462 AbstractCegarLoop]: Abstraction has 215 states and 319 transitions. [2019-12-07 10:07:31,325 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:07:31,325 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 319 transitions. [2019-12-07 10:07:31,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-07 10:07:31,327 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:07:31,327 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:07:31,327 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:07:31,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:07:31,327 INFO L82 PathProgramCache]: Analyzing trace with hash 996888307, now seen corresponding path program 1 times [2019-12-07 10:07:31,327 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:07:31,328 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022771762] [2019-12-07 10:07:31,328 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:07:31,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:07:31,395 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 10:07:31,396 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022771762] [2019-12-07 10:07:31,396 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:07:31,396 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:07:31,396 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110865707] [2019-12-07 10:07:31,397 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:07:31,397 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:07:31,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:07:31,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:07:31,398 INFO L87 Difference]: Start difference. First operand 215 states and 319 transitions. Second operand 3 states. [2019-12-07 10:07:31,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:07:31,451 INFO L93 Difference]: Finished difference Result 420 states and 630 transitions. [2019-12-07 10:07:31,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:07:31,452 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-12-07 10:07:31,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:07:31,453 INFO L225 Difference]: With dead ends: 420 [2019-12-07 10:07:31,454 INFO L226 Difference]: Without dead ends: 315 [2019-12-07 10:07:31,454 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:07:31,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2019-12-07 10:07:31,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 315. [2019-12-07 10:07:31,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2019-12-07 10:07:31,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 466 transitions. [2019-12-07 10:07:31,469 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 466 transitions. Word has length 53 [2019-12-07 10:07:31,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:07:31,469 INFO L462 AbstractCegarLoop]: Abstraction has 315 states and 466 transitions. [2019-12-07 10:07:31,469 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:07:31,469 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 466 transitions. [2019-12-07 10:07:31,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-07 10:07:31,472 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:07:31,472 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:07:31,472 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:07:31,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:07:31,472 INFO L82 PathProgramCache]: Analyzing trace with hash -973367758, now seen corresponding path program 1 times [2019-12-07 10:07:31,473 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:07:31,473 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120935955] [2019-12-07 10:07:31,473 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:07:31,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:07:31,547 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-12-07 10:07:31,547 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120935955] [2019-12-07 10:07:31,547 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:07:31,547 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 10:07:31,548 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342264837] [2019-12-07 10:07:31,548 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:07:31,548 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:07:31,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:07:31,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:07:31,549 INFO L87 Difference]: Start difference. First operand 315 states and 466 transitions. Second operand 4 states. [2019-12-07 10:07:31,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:07:31,937 INFO L93 Difference]: Finished difference Result 805 states and 1196 transitions. [2019-12-07 10:07:31,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 10:07:31,937 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 71 [2019-12-07 10:07:31,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:07:31,940 INFO L225 Difference]: With dead ends: 805 [2019-12-07 10:07:31,940 INFO L226 Difference]: Without dead ends: 500 [2019-12-07 10:07:31,941 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:07:31,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2019-12-07 10:07:31,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 365. [2019-12-07 10:07:31,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 365 states. [2019-12-07 10:07:31,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 552 transitions. [2019-12-07 10:07:31,953 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 552 transitions. Word has length 71 [2019-12-07 10:07:31,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:07:31,953 INFO L462 AbstractCegarLoop]: Abstraction has 365 states and 552 transitions. [2019-12-07 10:07:31,954 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:07:31,954 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 552 transitions. [2019-12-07 10:07:31,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-07 10:07:31,956 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:07:31,956 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:07:31,956 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:07:31,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:07:31,956 INFO L82 PathProgramCache]: Analyzing trace with hash -1107381264, now seen corresponding path program 1 times [2019-12-07 10:07:31,957 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:07:31,957 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343666812] [2019-12-07 10:07:31,957 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:07:31,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:07:32,013 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-12-07 10:07:32,013 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343666812] [2019-12-07 10:07:32,013 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:07:32,013 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 10:07:32,013 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652502453] [2019-12-07 10:07:32,014 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:07:32,014 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:07:32,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:07:32,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:07:32,014 INFO L87 Difference]: Start difference. First operand 365 states and 552 transitions. Second operand 4 states. [2019-12-07 10:07:32,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:07:32,254 INFO L93 Difference]: Finished difference Result 805 states and 1217 transitions. [2019-12-07 10:07:32,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 10:07:32,254 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 71 [2019-12-07 10:07:32,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:07:32,257 INFO L225 Difference]: With dead ends: 805 [2019-12-07 10:07:32,257 INFO L226 Difference]: Without dead ends: 450 [2019-12-07 10:07:32,257 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:07:32,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2019-12-07 10:07:32,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 405. [2019-12-07 10:07:32,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 405 states. [2019-12-07 10:07:32,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 620 transitions. [2019-12-07 10:07:32,266 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 620 transitions. Word has length 71 [2019-12-07 10:07:32,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:07:32,266 INFO L462 AbstractCegarLoop]: Abstraction has 405 states and 620 transitions. [2019-12-07 10:07:32,266 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:07:32,266 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 620 transitions. [2019-12-07 10:07:32,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-07 10:07:32,267 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:07:32,267 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:07:32,268 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:07:32,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:07:32,268 INFO L82 PathProgramCache]: Analyzing trace with hash -114315255, now seen corresponding path program 1 times [2019-12-07 10:07:32,268 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:07:32,268 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970654272] [2019-12-07 10:07:32,268 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:07:32,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:07:32,320 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-12-07 10:07:32,321 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970654272] [2019-12-07 10:07:32,321 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:07:32,321 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 10:07:32,321 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351946861] [2019-12-07 10:07:32,321 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:07:32,322 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:07:32,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:07:32,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:07:32,322 INFO L87 Difference]: Start difference. First operand 405 states and 620 transitions. Second operand 4 states. [2019-12-07 10:07:32,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:07:32,659 INFO L93 Difference]: Finished difference Result 927 states and 1408 transitions. [2019-12-07 10:07:32,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 10:07:32,659 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 72 [2019-12-07 10:07:32,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:07:32,662 INFO L225 Difference]: With dead ends: 927 [2019-12-07 10:07:32,662 INFO L226 Difference]: Without dead ends: 532 [2019-12-07 10:07:32,663 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:07:32,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2019-12-07 10:07:32,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 407. [2019-12-07 10:07:32,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2019-12-07 10:07:32,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 622 transitions. [2019-12-07 10:07:32,673 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 622 transitions. Word has length 72 [2019-12-07 10:07:32,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:07:32,673 INFO L462 AbstractCegarLoop]: Abstraction has 407 states and 622 transitions. [2019-12-07 10:07:32,673 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:07:32,673 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 622 transitions. [2019-12-07 10:07:32,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-12-07 10:07:32,674 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:07:32,674 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:07:32,674 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:07:32,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:07:32,675 INFO L82 PathProgramCache]: Analyzing trace with hash 1902129482, now seen corresponding path program 2 times [2019-12-07 10:07:32,675 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:07:32,675 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166636687] [2019-12-07 10:07:32,675 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:07:32,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:07:32,737 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-12-07 10:07:32,737 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166636687] [2019-12-07 10:07:32,737 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:07:32,737 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 10:07:32,737 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850609193] [2019-12-07 10:07:32,738 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:07:32,738 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:07:32,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:07:32,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:07:32,738 INFO L87 Difference]: Start difference. First operand 407 states and 622 transitions. Second operand 4 states. [2019-12-07 10:07:33,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:07:33,090 INFO L93 Difference]: Finished difference Result 927 states and 1406 transitions. [2019-12-07 10:07:33,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 10:07:33,091 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 85 [2019-12-07 10:07:33,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:07:33,093 INFO L225 Difference]: With dead ends: 927 [2019-12-07 10:07:33,093 INFO L226 Difference]: Without dead ends: 530 [2019-12-07 10:07:33,094 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:07:33,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2019-12-07 10:07:33,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 407. [2019-12-07 10:07:33,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2019-12-07 10:07:33,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 620 transitions. [2019-12-07 10:07:33,102 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 620 transitions. Word has length 85 [2019-12-07 10:07:33,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:07:33,103 INFO L462 AbstractCegarLoop]: Abstraction has 407 states and 620 transitions. [2019-12-07 10:07:33,103 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:07:33,103 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 620 transitions. [2019-12-07 10:07:33,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-12-07 10:07:33,104 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:07:33,104 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:07:33,104 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:07:33,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:07:33,104 INFO L82 PathProgramCache]: Analyzing trace with hash 793149036, now seen corresponding path program 1 times [2019-12-07 10:07:33,104 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:07:33,104 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904001360] [2019-12-07 10:07:33,105 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:07:33,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:07:33,160 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-12-07 10:07:33,160 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904001360] [2019-12-07 10:07:33,161 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:07:33,161 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 10:07:33,161 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693198076] [2019-12-07 10:07:33,161 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:07:33,161 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:07:33,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:07:33,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:07:33,162 INFO L87 Difference]: Start difference. First operand 407 states and 620 transitions. Second operand 4 states. [2019-12-07 10:07:33,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:07:33,543 INFO L93 Difference]: Finished difference Result 927 states and 1402 transitions. [2019-12-07 10:07:33,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 10:07:33,544 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 85 [2019-12-07 10:07:33,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:07:33,547 INFO L225 Difference]: With dead ends: 927 [2019-12-07 10:07:33,547 INFO L226 Difference]: Without dead ends: 530 [2019-12-07 10:07:33,548 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:07:33,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2019-12-07 10:07:33,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 407. [2019-12-07 10:07:33,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2019-12-07 10:07:33,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 618 transitions. [2019-12-07 10:07:33,560 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 618 transitions. Word has length 85 [2019-12-07 10:07:33,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:07:33,560 INFO L462 AbstractCegarLoop]: Abstraction has 407 states and 618 transitions. [2019-12-07 10:07:33,560 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:07:33,561 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 618 transitions. [2019-12-07 10:07:33,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-12-07 10:07:33,562 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:07:33,562 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:07:33,562 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:07:33,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:07:33,563 INFO L82 PathProgramCache]: Analyzing trace with hash 872770184, now seen corresponding path program 2 times [2019-12-07 10:07:33,563 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:07:33,563 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645753831] [2019-12-07 10:07:33,563 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:07:33,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:07:33,613 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-12-07 10:07:33,613 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645753831] [2019-12-07 10:07:33,614 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:07:33,614 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 10:07:33,614 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329554047] [2019-12-07 10:07:33,614 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:07:33,614 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:07:33,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:07:33,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:07:33,615 INFO L87 Difference]: Start difference. First operand 407 states and 618 transitions. Second operand 4 states. [2019-12-07 10:07:33,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:07:33,890 INFO L93 Difference]: Finished difference Result 847 states and 1277 transitions. [2019-12-07 10:07:33,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 10:07:33,891 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 85 [2019-12-07 10:07:33,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:07:33,893 INFO L225 Difference]: With dead ends: 847 [2019-12-07 10:07:33,893 INFO L226 Difference]: Without dead ends: 450 [2019-12-07 10:07:33,894 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:07:33,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2019-12-07 10:07:33,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 407. [2019-12-07 10:07:33,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2019-12-07 10:07:33,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 616 transitions. [2019-12-07 10:07:33,901 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 616 transitions. Word has length 85 [2019-12-07 10:07:33,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:07:33,901 INFO L462 AbstractCegarLoop]: Abstraction has 407 states and 616 transitions. [2019-12-07 10:07:33,901 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:07:33,901 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 616 transitions. [2019-12-07 10:07:33,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-12-07 10:07:33,902 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:07:33,902 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:07:33,903 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:07:33,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:07:33,903 INFO L82 PathProgramCache]: Analyzing trace with hash -236210262, now seen corresponding path program 1 times [2019-12-07 10:07:33,903 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:07:33,903 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741234040] [2019-12-07 10:07:33,903 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:07:33,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:07:33,942 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-12-07 10:07:33,942 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741234040] [2019-12-07 10:07:33,942 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:07:33,942 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 10:07:33,942 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158636629] [2019-12-07 10:07:33,942 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:07:33,943 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:07:33,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:07:33,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:07:33,943 INFO L87 Difference]: Start difference. First operand 407 states and 616 transitions. Second operand 4 states. [2019-12-07 10:07:34,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:07:34,179 INFO L93 Difference]: Finished difference Result 847 states and 1273 transitions. [2019-12-07 10:07:34,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 10:07:34,179 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 85 [2019-12-07 10:07:34,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:07:34,182 INFO L225 Difference]: With dead ends: 847 [2019-12-07 10:07:34,182 INFO L226 Difference]: Without dead ends: 450 [2019-12-07 10:07:34,183 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:07:34,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2019-12-07 10:07:34,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 407. [2019-12-07 10:07:34,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2019-12-07 10:07:34,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 614 transitions. [2019-12-07 10:07:34,194 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 614 transitions. Word has length 85 [2019-12-07 10:07:34,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:07:34,194 INFO L462 AbstractCegarLoop]: Abstraction has 407 states and 614 transitions. [2019-12-07 10:07:34,194 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:07:34,194 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 614 transitions. [2019-12-07 10:07:34,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-12-07 10:07:34,196 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:07:34,196 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:07:34,196 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:07:34,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:07:34,196 INFO L82 PathProgramCache]: Analyzing trace with hash -1127790653, now seen corresponding path program 1 times [2019-12-07 10:07:34,196 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:07:34,197 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678271982] [2019-12-07 10:07:34,197 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:07:34,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:07:34,241 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-12-07 10:07:34,241 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678271982] [2019-12-07 10:07:34,241 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:07:34,241 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 10:07:34,241 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864184674] [2019-12-07 10:07:34,241 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:07:34,241 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:07:34,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:07:34,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:07:34,242 INFO L87 Difference]: Start difference. First operand 407 states and 614 transitions. Second operand 4 states. [2019-12-07 10:07:34,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:07:34,604 INFO L93 Difference]: Finished difference Result 927 states and 1390 transitions. [2019-12-07 10:07:34,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 10:07:34,604 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 86 [2019-12-07 10:07:34,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:07:34,607 INFO L225 Difference]: With dead ends: 927 [2019-12-07 10:07:34,607 INFO L226 Difference]: Without dead ends: 530 [2019-12-07 10:07:34,608 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:07:34,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2019-12-07 10:07:34,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 407. [2019-12-07 10:07:34,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2019-12-07 10:07:34,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 612 transitions. [2019-12-07 10:07:34,619 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 612 transitions. Word has length 86 [2019-12-07 10:07:34,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:07:34,619 INFO L462 AbstractCegarLoop]: Abstraction has 407 states and 612 transitions. [2019-12-07 10:07:34,619 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:07:34,620 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 612 transitions. [2019-12-07 10:07:34,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-12-07 10:07:34,621 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:07:34,621 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:07:34,621 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:07:34,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:07:34,621 INFO L82 PathProgramCache]: Analyzing trace with hash 1321809477, now seen corresponding path program 1 times [2019-12-07 10:07:34,622 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:07:34,622 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275988979] [2019-12-07 10:07:34,622 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:07:34,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:07:34,673 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-12-07 10:07:34,674 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275988979] [2019-12-07 10:07:34,674 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:07:34,674 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 10:07:34,674 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227391336] [2019-12-07 10:07:34,674 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:07:34,674 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:07:34,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:07:34,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:07:34,675 INFO L87 Difference]: Start difference. First operand 407 states and 612 transitions. Second operand 4 states. [2019-12-07 10:07:34,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:07:34,958 INFO L93 Difference]: Finished difference Result 847 states and 1265 transitions. [2019-12-07 10:07:34,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 10:07:34,959 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 86 [2019-12-07 10:07:34,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:07:34,961 INFO L225 Difference]: With dead ends: 847 [2019-12-07 10:07:34,961 INFO L226 Difference]: Without dead ends: 450 [2019-12-07 10:07:34,961 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:07:34,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2019-12-07 10:07:34,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 407. [2019-12-07 10:07:34,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2019-12-07 10:07:34,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 610 transitions. [2019-12-07 10:07:34,969 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 610 transitions. Word has length 86 [2019-12-07 10:07:34,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:07:34,969 INFO L462 AbstractCegarLoop]: Abstraction has 407 states and 610 transitions. [2019-12-07 10:07:34,969 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:07:34,969 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 610 transitions. [2019-12-07 10:07:34,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-12-07 10:07:34,970 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:07:34,970 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:07:34,970 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:07:34,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:07:34,971 INFO L82 PathProgramCache]: Analyzing trace with hash -490798233, now seen corresponding path program 1 times [2019-12-07 10:07:34,971 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:07:34,971 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884208008] [2019-12-07 10:07:34,971 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:07:34,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:07:35,023 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-12-07 10:07:35,024 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884208008] [2019-12-07 10:07:35,024 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:07:35,024 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 10:07:35,024 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154800526] [2019-12-07 10:07:35,025 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:07:35,025 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:07:35,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:07:35,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:07:35,025 INFO L87 Difference]: Start difference. First operand 407 states and 610 transitions. Second operand 4 states. [2019-12-07 10:07:35,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:07:35,358 INFO L93 Difference]: Finished difference Result 927 states and 1382 transitions. [2019-12-07 10:07:35,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 10:07:35,358 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2019-12-07 10:07:35,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:07:35,361 INFO L225 Difference]: With dead ends: 927 [2019-12-07 10:07:35,361 INFO L226 Difference]: Without dead ends: 530 [2019-12-07 10:07:35,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-12-07 10:07:35,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2019-12-07 10:07:35,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 407. [2019-12-07 10:07:35,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2019-12-07 10:07:35,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 608 transitions. [2019-12-07 10:07:35,372 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 608 transitions. Word has length 87 [2019-12-07 10:07:35,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:07:35,372 INFO L462 AbstractCegarLoop]: Abstraction has 407 states and 608 transitions. [2019-12-07 10:07:35,372 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:07:35,372 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 608 transitions. [2019-12-07 10:07:35,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-12-07 10:07:35,374 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:07:35,374 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-12-07 10:07:35,374 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:07:35,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:07:35,374 INFO L82 PathProgramCache]: Analyzing trace with hash 1383461914, now seen corresponding path program 1 times [2019-12-07 10:07:35,375 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:07:35,375 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138212454] [2019-12-07 10:07:35,375 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:07:35,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:07:35,428 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-12-07 10:07:35,429 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138212454] [2019-12-07 10:07:35,429 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:07:35,429 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 10:07:35,429 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631002986] [2019-12-07 10:07:35,429 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:07:35,430 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:07:35,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:07:35,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:07:35,430 INFO L87 Difference]: Start difference. First operand 407 states and 608 transitions. Second operand 4 states. [2019-12-07 10:07:35,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:07:35,764 INFO L93 Difference]: Finished difference Result 783 states and 1162 transitions. [2019-12-07 10:07:35,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 10:07:35,764 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2019-12-07 10:07:35,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:07:35,766 INFO L225 Difference]: With dead ends: 783 [2019-12-07 10:07:35,766 INFO L226 Difference]: Without dead ends: 530 [2019-12-07 10:07:35,767 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:07:35,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2019-12-07 10:07:35,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 407. [2019-12-07 10:07:35,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2019-12-07 10:07:35,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 606 transitions. [2019-12-07 10:07:35,777 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 606 transitions. Word has length 87 [2019-12-07 10:07:35,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:07:35,777 INFO L462 AbstractCegarLoop]: Abstraction has 407 states and 606 transitions. [2019-12-07 10:07:35,777 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:07:35,777 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 606 transitions. [2019-12-07 10:07:35,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-12-07 10:07:35,778 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:07:35,779 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:07:35,779 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:07:35,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:07:35,779 INFO L82 PathProgramCache]: Analyzing trace with hash -1862605531, now seen corresponding path program 1 times [2019-12-07 10:07:35,779 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:07:35,779 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41501510] [2019-12-07 10:07:35,780 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:07:35,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:07:35,829 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-12-07 10:07:35,829 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41501510] [2019-12-07 10:07:35,829 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:07:35,829 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 10:07:35,829 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242338492] [2019-12-07 10:07:35,829 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:07:35,830 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:07:35,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:07:35,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:07:35,830 INFO L87 Difference]: Start difference. First operand 407 states and 606 transitions. Second operand 4 states. [2019-12-07 10:07:36,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:07:36,079 INFO L93 Difference]: Finished difference Result 847 states and 1253 transitions. [2019-12-07 10:07:36,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 10:07:36,080 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2019-12-07 10:07:36,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:07:36,081 INFO L225 Difference]: With dead ends: 847 [2019-12-07 10:07:36,081 INFO L226 Difference]: Without dead ends: 450 [2019-12-07 10:07:36,082 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:07:36,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2019-12-07 10:07:36,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 407. [2019-12-07 10:07:36,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2019-12-07 10:07:36,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 604 transitions. [2019-12-07 10:07:36,089 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 604 transitions. Word has length 87 [2019-12-07 10:07:36,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:07:36,089 INFO L462 AbstractCegarLoop]: Abstraction has 407 states and 604 transitions. [2019-12-07 10:07:36,089 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:07:36,089 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 604 transitions. [2019-12-07 10:07:36,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-12-07 10:07:36,090 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:07:36,090 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-12-07 10:07:36,090 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:07:36,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:07:36,090 INFO L82 PathProgramCache]: Analyzing trace with hash 11654616, now seen corresponding path program 1 times [2019-12-07 10:07:36,090 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:07:36,090 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164706203] [2019-12-07 10:07:36,091 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:07:36,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:07:36,128 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-12-07 10:07:36,128 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164706203] [2019-12-07 10:07:36,128 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:07:36,128 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 10:07:36,129 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888455247] [2019-12-07 10:07:36,129 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:07:36,129 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:07:36,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:07:36,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:07:36,129 INFO L87 Difference]: Start difference. First operand 407 states and 604 transitions. Second operand 4 states. [2019-12-07 10:07:36,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:07:36,395 INFO L93 Difference]: Finished difference Result 703 states and 1035 transitions. [2019-12-07 10:07:36,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 10:07:36,396 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2019-12-07 10:07:36,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:07:36,397 INFO L225 Difference]: With dead ends: 703 [2019-12-07 10:07:36,397 INFO L226 Difference]: Without dead ends: 450 [2019-12-07 10:07:36,398 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:07:36,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2019-12-07 10:07:36,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 407. [2019-12-07 10:07:36,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2019-12-07 10:07:36,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 602 transitions. [2019-12-07 10:07:36,404 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 602 transitions. Word has length 87 [2019-12-07 10:07:36,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:07:36,404 INFO L462 AbstractCegarLoop]: Abstraction has 407 states and 602 transitions. [2019-12-07 10:07:36,404 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:07:36,404 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 602 transitions. [2019-12-07 10:07:36,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-12-07 10:07:36,405 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:07:36,405 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:07:36,405 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:07:36,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:07:36,406 INFO L82 PathProgramCache]: Analyzing trace with hash 2132678238, now seen corresponding path program 1 times [2019-12-07 10:07:36,406 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:07:36,406 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446738839] [2019-12-07 10:07:36,406 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:07:36,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:07:36,445 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-12-07 10:07:36,445 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446738839] [2019-12-07 10:07:36,445 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:07:36,445 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 10:07:36,445 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233679270] [2019-12-07 10:07:36,446 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:07:36,446 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:07:36,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:07:36,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:07:36,446 INFO L87 Difference]: Start difference. First operand 407 states and 602 transitions. Second operand 4 states. [2019-12-07 10:07:36,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:07:36,780 INFO L93 Difference]: Finished difference Result 909 states and 1344 transitions. [2019-12-07 10:07:36,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 10:07:36,781 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-12-07 10:07:36,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:07:36,783 INFO L225 Difference]: With dead ends: 909 [2019-12-07 10:07:36,783 INFO L226 Difference]: Without dead ends: 512 [2019-12-07 10:07:36,783 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:07:36,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2019-12-07 10:07:36,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 407. [2019-12-07 10:07:36,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2019-12-07 10:07:36,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 600 transitions. [2019-12-07 10:07:36,790 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 600 transitions. Word has length 88 [2019-12-07 10:07:36,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:07:36,791 INFO L462 AbstractCegarLoop]: Abstraction has 407 states and 600 transitions. [2019-12-07 10:07:36,791 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:07:36,791 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 600 transitions. [2019-12-07 10:07:36,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-12-07 10:07:36,792 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:07:36,792 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-12-07 10:07:36,792 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:07:36,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:07:36,793 INFO L82 PathProgramCache]: Analyzing trace with hash 1903796849, now seen corresponding path program 1 times [2019-12-07 10:07:36,793 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:07:36,793 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391352890] [2019-12-07 10:07:36,793 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:07:36,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:07:36,843 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-12-07 10:07:36,843 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391352890] [2019-12-07 10:07:36,843 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:07:36,844 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 10:07:36,844 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494530726] [2019-12-07 10:07:36,844 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:07:36,844 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:07:36,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:07:36,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:07:36,845 INFO L87 Difference]: Start difference. First operand 407 states and 600 transitions. Second operand 4 states. [2019-12-07 10:07:37,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:07:37,174 INFO L93 Difference]: Finished difference Result 758 states and 1119 transitions. [2019-12-07 10:07:37,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 10:07:37,175 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-12-07 10:07:37,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:07:37,177 INFO L225 Difference]: With dead ends: 758 [2019-12-07 10:07:37,177 INFO L226 Difference]: Without dead ends: 505 [2019-12-07 10:07:37,177 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:07:37,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2019-12-07 10:07:37,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 407. [2019-12-07 10:07:37,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2019-12-07 10:07:37,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 598 transitions. [2019-12-07 10:07:37,184 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 598 transitions. Word has length 88 [2019-12-07 10:07:37,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:07:37,184 INFO L462 AbstractCegarLoop]: Abstraction has 407 states and 598 transitions. [2019-12-07 10:07:37,184 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:07:37,184 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 598 transitions. [2019-12-07 10:07:37,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-12-07 10:07:37,185 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:07:37,185 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:07:37,185 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:07:37,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:07:37,185 INFO L82 PathProgramCache]: Analyzing trace with hash -1738642336, now seen corresponding path program 1 times [2019-12-07 10:07:37,185 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:07:37,185 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130798677] [2019-12-07 10:07:37,186 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:07:37,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:07:37,223 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-12-07 10:07:37,224 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130798677] [2019-12-07 10:07:37,224 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:07:37,224 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 10:07:37,224 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848251737] [2019-12-07 10:07:37,225 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:07:37,225 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:07:37,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:07:37,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:07:37,225 INFO L87 Difference]: Start difference. First operand 407 states and 598 transitions. Second operand 4 states. [2019-12-07 10:07:37,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:07:37,453 INFO L93 Difference]: Finished difference Result 829 states and 1215 transitions. [2019-12-07 10:07:37,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 10:07:37,453 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-12-07 10:07:37,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:07:37,455 INFO L225 Difference]: With dead ends: 829 [2019-12-07 10:07:37,455 INFO L226 Difference]: Without dead ends: 432 [2019-12-07 10:07:37,455 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:07:37,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2019-12-07 10:07:37,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 407. [2019-12-07 10:07:37,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2019-12-07 10:07:37,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 596 transitions. [2019-12-07 10:07:37,461 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 596 transitions. Word has length 88 [2019-12-07 10:07:37,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:07:37,461 INFO L462 AbstractCegarLoop]: Abstraction has 407 states and 596 transitions. [2019-12-07 10:07:37,461 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:07:37,461 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 596 transitions. [2019-12-07 10:07:37,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-12-07 10:07:37,462 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:07:37,462 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-12-07 10:07:37,462 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:07:37,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:07:37,462 INFO L82 PathProgramCache]: Analyzing trace with hash -1967523725, now seen corresponding path program 1 times [2019-12-07 10:07:37,463 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:07:37,463 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169110748] [2019-12-07 10:07:37,463 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:07:37,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:07:37,498 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-12-07 10:07:37,498 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169110748] [2019-12-07 10:07:37,498 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:07:37,499 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 10:07:37,499 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908188449] [2019-12-07 10:07:37,499 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:07:37,499 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:07:37,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:07:37,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:07:37,499 INFO L87 Difference]: Start difference. First operand 407 states and 596 transitions. Second operand 4 states. [2019-12-07 10:07:37,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:07:37,704 INFO L93 Difference]: Finished difference Result 678 states and 992 transitions. [2019-12-07 10:07:37,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 10:07:37,704 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-12-07 10:07:37,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:07:37,706 INFO L225 Difference]: With dead ends: 678 [2019-12-07 10:07:37,706 INFO L226 Difference]: Without dead ends: 425 [2019-12-07 10:07:37,706 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:07:37,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2019-12-07 10:07:37,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 407. [2019-12-07 10:07:37,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2019-12-07 10:07:37,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 594 transitions. [2019-12-07 10:07:37,715 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 594 transitions. Word has length 88 [2019-12-07 10:07:37,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:07:37,715 INFO L462 AbstractCegarLoop]: Abstraction has 407 states and 594 transitions. [2019-12-07 10:07:37,715 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:07:37,715 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 594 transitions. [2019-12-07 10:07:37,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-12-07 10:07:37,716 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:07:37,716 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:07:37,717 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:07:37,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:07:37,717 INFO L82 PathProgramCache]: Analyzing trace with hash 730673667, now seen corresponding path program 1 times [2019-12-07 10:07:37,717 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:07:37,717 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315087389] [2019-12-07 10:07:37,717 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:07:37,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:07:37,765 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-12-07 10:07:37,766 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315087389] [2019-12-07 10:07:37,766 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:07:37,766 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 10:07:37,766 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473675187] [2019-12-07 10:07:37,766 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:07:37,767 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:07:37,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:07:37,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:07:37,767 INFO L87 Difference]: Start difference. First operand 407 states and 594 transitions. Second operand 4 states. [2019-12-07 10:07:38,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:07:38,042 INFO L93 Difference]: Finished difference Result 902 states and 1319 transitions. [2019-12-07 10:07:38,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 10:07:38,043 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 89 [2019-12-07 10:07:38,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:07:38,045 INFO L225 Difference]: With dead ends: 902 [2019-12-07 10:07:38,045 INFO L226 Difference]: Without dead ends: 505 [2019-12-07 10:07:38,045 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:07:38,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2019-12-07 10:07:38,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 407. [2019-12-07 10:07:38,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2019-12-07 10:07:38,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 592 transitions. [2019-12-07 10:07:38,052 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 592 transitions. Word has length 89 [2019-12-07 10:07:38,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:07:38,052 INFO L462 AbstractCegarLoop]: Abstraction has 407 states and 592 transitions. [2019-12-07 10:07:38,052 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:07:38,052 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 592 transitions. [2019-12-07 10:07:38,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-12-07 10:07:38,053 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:07:38,053 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:07:38,053 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:07:38,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:07:38,053 INFO L82 PathProgramCache]: Analyzing trace with hash 978820161, now seen corresponding path program 1 times [2019-12-07 10:07:38,053 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:07:38,054 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892536972] [2019-12-07 10:07:38,054 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:07:38,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:07:38,087 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-12-07 10:07:38,087 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892536972] [2019-12-07 10:07:38,087 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:07:38,087 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:07:38,088 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965296056] [2019-12-07 10:07:38,088 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:07:38,088 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:07:38,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:07:38,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:07:38,088 INFO L87 Difference]: Start difference. First operand 407 states and 592 transitions. Second operand 3 states. [2019-12-07 10:07:38,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:07:38,113 INFO L93 Difference]: Finished difference Result 807 states and 1180 transitions. [2019-12-07 10:07:38,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:07:38,113 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 89 [2019-12-07 10:07:38,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:07:38,115 INFO L225 Difference]: With dead ends: 807 [2019-12-07 10:07:38,115 INFO L226 Difference]: Without dead ends: 556 [2019-12-07 10:07:38,116 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:07:38,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2019-12-07 10:07:38,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 556. [2019-12-07 10:07:38,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 556 states. [2019-12-07 10:07:38,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 809 transitions. [2019-12-07 10:07:38,123 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 809 transitions. Word has length 89 [2019-12-07 10:07:38,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:07:38,123 INFO L462 AbstractCegarLoop]: Abstraction has 556 states and 809 transitions. [2019-12-07 10:07:38,123 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:07:38,123 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 809 transitions. [2019-12-07 10:07:38,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-12-07 10:07:38,124 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:07:38,124 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:07:38,124 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:07:38,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:07:38,125 INFO L82 PathProgramCache]: Analyzing trace with hash -1317014729, now seen corresponding path program 1 times [2019-12-07 10:07:38,125 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:07:38,125 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258703901] [2019-12-07 10:07:38,125 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:07:38,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:07:38,155 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-12-07 10:07:38,155 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258703901] [2019-12-07 10:07:38,156 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:07:38,156 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:07:38,156 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624795029] [2019-12-07 10:07:38,156 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:07:38,156 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:07:38,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:07:38,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:07:38,156 INFO L87 Difference]: Start difference. First operand 556 states and 809 transitions. Second operand 3 states. [2019-12-07 10:07:38,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:07:38,189 INFO L93 Difference]: Finished difference Result 1105 states and 1614 transitions. [2019-12-07 10:07:38,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:07:38,190 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 91 [2019-12-07 10:07:38,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:07:38,193 INFO L225 Difference]: With dead ends: 1105 [2019-12-07 10:07:38,193 INFO L226 Difference]: Without dead ends: 705 [2019-12-07 10:07:38,194 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:07:38,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 705 states. [2019-12-07 10:07:38,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 705 to 705. [2019-12-07 10:07:38,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 705 states. [2019-12-07 10:07:38,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 705 states to 705 states and 1027 transitions. [2019-12-07 10:07:38,206 INFO L78 Accepts]: Start accepts. Automaton has 705 states and 1027 transitions. Word has length 91 [2019-12-07 10:07:38,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:07:38,206 INFO L462 AbstractCegarLoop]: Abstraction has 705 states and 1027 transitions. [2019-12-07 10:07:38,206 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:07:38,206 INFO L276 IsEmpty]: Start isEmpty. Operand 705 states and 1027 transitions. [2019-12-07 10:07:38,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-12-07 10:07:38,207 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:07:38,208 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:07:38,208 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:07:38,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:07:38,208 INFO L82 PathProgramCache]: Analyzing trace with hash -761801560, now seen corresponding path program 1 times [2019-12-07 10:07:38,208 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:07:38,208 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273330077] [2019-12-07 10:07:38,208 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:07:38,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 10:07:38,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 10:07:38,469 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 10:07:38,470 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 10:07:38,534 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 10:07:38 BoogieIcfgContainer [2019-12-07 10:07:38,534 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 10:07:38,534 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 10:07:38,534 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 10:07:38,534 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 10:07:38,535 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:07:30" (3/4) ... [2019-12-07 10:07:38,537 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-12-07 10:07:38,537 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 10:07:38,539 INFO L168 Benchmark]: Toolchain (without parser) took 9198.72 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 203.4 MB). Free memory was 942.4 MB in the beginning and 1.1 GB in the end (delta: -196.1 MB). Peak memory consumption was 7.3 MB. Max. memory is 11.5 GB. [2019-12-07 10:07:38,539 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.0 GB. Free memory is still 963.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 10:07:38,539 INFO L168 Benchmark]: CACSL2BoogieTranslator took 402.54 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 97.5 MB). Free memory was 942.4 MB in the beginning and 1.1 GB in the end (delta: -133.3 MB). Peak memory consumption was 24.1 MB. Max. memory is 11.5 GB. [2019-12-07 10:07:38,540 INFO L168 Benchmark]: Boogie Procedure Inliner took 50.40 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 10:07:38,540 INFO L168 Benchmark]: Boogie Preprocessor took 51.66 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 10:07:38,540 INFO L168 Benchmark]: RCFGBuilder took 706.08 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 972.2 MB in the end (delta: 87.4 MB). Peak memory consumption was 87.4 MB. Max. memory is 11.5 GB. [2019-12-07 10:07:38,540 INFO L168 Benchmark]: TraceAbstraction took 7981.83 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 105.9 MB). Free memory was 972.2 MB in the beginning and 1.1 GB in the end (delta: -166.4 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 10:07:38,541 INFO L168 Benchmark]: Witness Printer took 3.32 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 10:07:38,542 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 963.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 402.54 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 97.5 MB). Free memory was 942.4 MB in the beginning and 1.1 GB in the end (delta: -133.3 MB). Peak memory consumption was 24.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 50.40 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 51.66 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 706.08 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 972.2 MB in the end (delta: 87.4 MB). Peak memory consumption was 87.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 7981.83 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 105.9 MB). Free memory was 972.2 MB in the beginning and 1.1 GB in the end (delta: -166.4 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 3.32 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * 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: 7.8s, OverallIterations: 24, TraceHistogramMax: 6, AutomataDifference: 5.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 4890 SDtfs, 1774 SDslu, 6292 SDs, 0 SdLazy, 3593 SolverSat, 131 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 126 GetRequests, 46 SyntacticMatches, 19 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=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.2s AutomataMinimizationTime, 23 MinimizatonAttempts, 1480 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.6s 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.25-f470102 [2019-12-07 10:07:39,973 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 10:07:39,975 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 10:07:39,983 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 10:07:39,983 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 10:07:39,984 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 10:07:39,985 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 10:07:39,986 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 10:07:39,987 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 10:07:39,988 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 10:07:39,988 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 10:07:39,989 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 10:07:39,990 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 10:07:39,990 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 10:07:39,991 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 10:07:39,992 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 10:07:39,993 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 10:07:39,994 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 10:07:39,995 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 10:07:39,997 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 10:07:39,998 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 10:07:39,999 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 10:07:40,000 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 10:07:40,001 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 10:07:40,004 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 10:07:40,004 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 10:07:40,004 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 10:07:40,005 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 10:07:40,005 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 10:07:40,006 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 10:07:40,006 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 10:07:40,007 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 10:07:40,008 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 10:07:40,008 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 10:07:40,009 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 10:07:40,009 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 10:07:40,010 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 10:07:40,010 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 10:07:40,010 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 10:07:40,011 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 10:07:40,012 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 10:07:40,012 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_26d53605-b91a-4a69-9fb7-ef71d6d44580/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-12-07 10:07:40,025 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 10:07:40,025 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 10:07:40,026 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 10:07:40,027 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 10:07:40,027 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 10:07:40,027 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 10:07:40,027 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 10:07:40,027 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 10:07:40,028 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 10:07:40,028 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 10:07:40,028 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 10:07:40,028 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 10:07:40,028 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-12-07 10:07:40,029 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-12-07 10:07:40,029 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 10:07:40,029 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 10:07:40,029 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 10:07:40,029 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 10:07:40,030 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 10:07:40,030 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 10:07:40,030 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 10:07:40,030 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 10:07:40,030 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 10:07:40,031 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 10:07:40,031 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 10:07:40,031 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 10:07:40,031 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-12-07 10:07:40,031 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-12-07 10:07:40,031 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 10:07:40,032 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 10:07:40,032 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 10:07:40,032 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_26d53605-b91a-4a69-9fb7-ef71d6d44580/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-12-07 10:07:40,204 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 10:07:40,215 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 10:07:40,217 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 10:07:40,219 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 10:07:40,219 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 10:07:40,220 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_26d53605-b91a-4a69-9fb7-ef71d6d44580/bin/uautomizer/../../sv-benchmarks/c/ssh/s3_clnt.blast.02.i.cil-1.c [2019-12-07 10:07:40,268 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_26d53605-b91a-4a69-9fb7-ef71d6d44580/bin/uautomizer/data/15ad55bfe/3b90d1727c744d319f40e08b3605f1e9/FLAGa780cccf9 [2019-12-07 10:07:40,724 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 10:07:40,724 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_26d53605-b91a-4a69-9fb7-ef71d6d44580/sv-benchmarks/c/ssh/s3_clnt.blast.02.i.cil-1.c [2019-12-07 10:07:40,736 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_26d53605-b91a-4a69-9fb7-ef71d6d44580/bin/uautomizer/data/15ad55bfe/3b90d1727c744d319f40e08b3605f1e9/FLAGa780cccf9 [2019-12-07 10:07:41,051 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_26d53605-b91a-4a69-9fb7-ef71d6d44580/bin/uautomizer/data/15ad55bfe/3b90d1727c744d319f40e08b3605f1e9 [2019-12-07 10:07:41,055 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 10:07:41,057 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 10:07:41,059 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 10:07:41,059 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 10:07:41,063 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 10:07:41,064 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 10:07:41" (1/1) ... [2019-12-07 10:07:41,067 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5258ce92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:41, skipping insertion in model container [2019-12-07 10:07:41,067 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 10:07:41" (1/1) ... [2019-12-07 10:07:41,074 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 10:07:41,110 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 10:07:41,392 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 10:07:41,405 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 10:07:41,482 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 10:07:41,496 INFO L208 MainTranslator]: Completed translation [2019-12-07 10:07:41,497 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:41 WrapperNode [2019-12-07 10:07:41,497 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 10:07:41,497 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 10:07:41,497 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 10:07:41,497 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 10:07:41,503 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:41" (1/1) ... [2019-12-07 10:07:41,521 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:41" (1/1) ... [2019-12-07 10:07:41,553 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 10:07:41,553 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 10:07:41,553 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 10:07:41,553 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 10:07:41,560 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:41" (1/1) ... [2019-12-07 10:07:41,560 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:41" (1/1) ... [2019-12-07 10:07:41,567 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:41" (1/1) ... [2019-12-07 10:07:41,567 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:41" (1/1) ... [2019-12-07 10:07:41,593 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:41" (1/1) ... [2019-12-07 10:07:41,599 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:41" (1/1) ... [2019-12-07 10:07:41,602 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:41" (1/1) ... [2019-12-07 10:07:41,606 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 10:07:41,606 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 10:07:41,606 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 10:07:41,606 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 10:07:41,607 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:41" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_26d53605-b91a-4a69-9fb7-ef71d6d44580/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 10:07:41,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-12-07 10:07:41,651 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 10:07:41,651 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-12-07 10:07:41,651 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-12-07 10:07:41,651 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-12-07 10:07:41,651 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 10:07:41,651 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 10:07:41,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-12-07 10:07:41,793 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-12-07 10:07:43,891 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2019-12-07 10:07:43,891 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2019-12-07 10:07:43,892 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 10:07:43,892 INFO L287 CfgBuilder]: Removed 7 assume(true) statements. [2019-12-07 10:07:43,893 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:07:43 BoogieIcfgContainer [2019-12-07 10:07:43,893 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 10:07:43,894 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 10:07:43,894 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 10:07:43,896 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 10:07:43,896 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 10:07:41" (1/3) ... [2019-12-07 10:07:43,896 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e2b1a48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 10:07:43, skipping insertion in model container [2019-12-07 10:07:43,896 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:41" (2/3) ... [2019-12-07 10:07:43,897 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e2b1a48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 10:07:43, skipping insertion in model container [2019-12-07 10:07:43,897 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:07:43" (3/3) ... [2019-12-07 10:07:43,898 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_clnt.blast.02.i.cil-1.c [2019-12-07 10:07:43,904 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 10:07:43,909 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 10:07:43,916 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 10:07:43,932 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 10:07:43,932 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 10:07:43,932 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 10:07:43,933 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 10:07:43,933 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 10:07:43,933 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 10:07:43,933 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 10:07:43,933 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 10:07:43,945 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states. [2019-12-07 10:07:43,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-07 10:07:43,950 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:07:43,951 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:07:43,951 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:07:43,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:07:43,955 INFO L82 PathProgramCache]: Analyzing trace with hash -1457695037, now seen corresponding path program 1 times [2019-12-07 10:07:43,963 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 10:07:43,963 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [925084894] [2019-12-07 10:07:43,963 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_26d53605-b91a-4a69-9fb7-ef71d6d44580/bin/uautomizer/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2019-12-07 10:07:44,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:07:44,070 INFO L264 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 10:07:44,075 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:07:44,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:07:44,100 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 10:07:44,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:07:44,112 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [925084894] [2019-12-07 10:07:44,112 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:07:44,113 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-12-07 10:07:44,113 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020921431] [2019-12-07 10:07:44,116 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:07:44,117 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 10:07:44,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:07:44,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:07:44,127 INFO L87 Difference]: Start difference. First operand 129 states. Second operand 4 states. [2019-12-07 10:07:44,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:07:44,216 INFO L93 Difference]: Finished difference Result 485 states and 819 transitions. [2019-12-07 10:07:44,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 10:07:44,218 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2019-12-07 10:07:44,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:07:44,232 INFO L225 Difference]: With dead ends: 485 [2019-12-07 10:07:44,232 INFO L226 Difference]: Without dead ends: 312 [2019-12-07 10:07:44,236 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:07:44,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2019-12-07 10:07:44,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 312. [2019-12-07 10:07:44,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 312 states. [2019-12-07 10:07:44,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 467 transitions. [2019-12-07 10:07:44,286 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 467 transitions. Word has length 24 [2019-12-07 10:07:44,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:07:44,287 INFO L462 AbstractCegarLoop]: Abstraction has 312 states and 467 transitions. [2019-12-07 10:07:44,287 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:07:44,287 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 467 transitions. [2019-12-07 10:07:44,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-07 10:07:44,290 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:07:44,290 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:07:44,491 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-12-07 10:07:44,491 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:07:44,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:07:44,492 INFO L82 PathProgramCache]: Analyzing trace with hash 1698457876, now seen corresponding path program 1 times [2019-12-07 10:07:44,493 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 10:07:44,494 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [661577976] [2019-12-07 10:07:44,494 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_26d53605-b91a-4a69-9fb7-ef71d6d44580/bin/uautomizer/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2019-12-07 10:07:44,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:07:44,709 INFO L264 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 10:07:44,712 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:07:44,727 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:07:44,727 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 10:07:44,740 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:07:44,741 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [661577976] [2019-12-07 10:07:44,741 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:07:44,741 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-12-07 10:07:44,741 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171157401] [2019-12-07 10:07:44,742 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:07:44,743 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 10:07:44,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:07:44,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:07:44,743 INFO L87 Difference]: Start difference. First operand 312 states and 467 transitions. Second operand 4 states. [2019-12-07 10:07:46,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:07:46,218 INFO L93 Difference]: Finished difference Result 718 states and 1080 transitions. [2019-12-07 10:07:46,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 10:07:46,218 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2019-12-07 10:07:46,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:07:46,221 INFO L225 Difference]: With dead ends: 718 [2019-12-07 10:07:46,221 INFO L226 Difference]: Without dead ends: 513 [2019-12-07 10:07:46,223 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:07:46,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2019-12-07 10:07:46,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 513. [2019-12-07 10:07:46,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 513 states. [2019-12-07 10:07:46,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 765 transitions. [2019-12-07 10:07:46,248 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 765 transitions. Word has length 60 [2019-12-07 10:07:46,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:07:46,248 INFO L462 AbstractCegarLoop]: Abstraction has 513 states and 765 transitions. [2019-12-07 10:07:46,249 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:07:46,249 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 765 transitions. [2019-12-07 10:07:46,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-07 10:07:46,253 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:07:46,254 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:07:46,454 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-12-07 10:07:46,455 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:07:46,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:07:46,455 INFO L82 PathProgramCache]: Analyzing trace with hash -1093818034, now seen corresponding path program 1 times [2019-12-07 10:07:46,457 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 10:07:46,457 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1689116680] [2019-12-07 10:07:46,457 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_26d53605-b91a-4a69-9fb7-ef71d6d44580/bin/uautomizer/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2019-12-07 10:07:46,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:07:46,676 INFO L264 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 10:07:46,681 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:08:23,372 WARN L192 SmtUtils]: Spent 36.66 s on a formula simplification. DAG size of input: 54 DAG size of output: 38 [2019-12-07 10:08:23,373 INFO L343 Elim1Store]: treesize reduction 140, result has 40.9 percent of original size [2019-12-07 10:08:23,373 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 106 [2019-12-07 10:08:23,374 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:08:39,682 WARN L192 SmtUtils]: Spent 16.31 s on a formula simplification. DAG size of input: 40 DAG size of output: 37 [2019-12-07 10:08:39,683 INFO L614 ElimStorePlain]: treesize reduction 18, result has 83.0 percent of original size [2019-12-07 10:08:39,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:08:39,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:08:39,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:08:39,692 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:08:39,692 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:44, output treesize:9 [2019-12-07 10:08:39,723 INFO L343 Elim1Store]: treesize reduction 41, result has 18.0 percent of original size [2019-12-07 10:08:39,723 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 26 [2019-12-07 10:08:39,724 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:08:39,727 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:08:39,727 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:08:39,728 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:11 [2019-12-07 10:08:39,732 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2019-12-07 10:08:39,732 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:08:39,733 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:08:39,734 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:08:39,734 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:21, output treesize:5 [2019-12-07 10:08:39,748 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-12-07 10:08:39,749 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 10:08:39,769 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-12-07 10:08:39,769 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1689116680] [2019-12-07 10:08:39,769 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:08:39,769 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-12-07 10:08:39,770 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886132381] [2019-12-07 10:08:39,770 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:08:39,770 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 10:08:39,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:08:39,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:08:39,771 INFO L87 Difference]: Start difference. First operand 513 states and 765 transitions. Second operand 4 states. [2019-12-07 10:08:41,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:08:41,004 INFO L93 Difference]: Finished difference Result 1023 states and 1524 transitions. [2019-12-07 10:08:41,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 10:08:41,005 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-12-07 10:08:41,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:08:41,007 INFO L225 Difference]: With dead ends: 1023 [2019-12-07 10:08:41,007 INFO L226 Difference]: Without dead ends: 517 [2019-12-07 10:08:41,008 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 190 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:08:41,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2019-12-07 10:08:41,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 516. [2019-12-07 10:08:41,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 516 states. [2019-12-07 10:08:41,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 768 transitions. [2019-12-07 10:08:41,020 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 768 transitions. Word has length 98 [2019-12-07 10:08:41,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:08:41,020 INFO L462 AbstractCegarLoop]: Abstraction has 516 states and 768 transitions. [2019-12-07 10:08:41,020 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:08:41,020 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 768 transitions. [2019-12-07 10:08:41,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-12-07 10:08:41,022 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:08:41,022 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:08:41,223 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-12-07 10:08:41,223 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:08:41,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:08:41,224 INFO L82 PathProgramCache]: Analyzing trace with hash 924378278, now seen corresponding path program 1 times [2019-12-07 10:08:41,225 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 10:08:41,225 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [695600711] [2019-12-07 10:08:41,225 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_26d53605-b91a-4a69-9fb7-ef71d6d44580/bin/uautomizer/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2019-12-07 10:08:41,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:08:41,472 INFO L264 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 10:08:41,476 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:08:41,481 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 10:08:41,481 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:08:41,484 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:08:41,484 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:08:41,484 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 10:08:41,507 INFO L343 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-12-07 10:08:41,507 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2019-12-07 10:08:41,508 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:08:41,516 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:08:41,517 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:08:41,517 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2019-12-07 10:08:41,535 INFO L343 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-12-07 10:08:41,535 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 10 [2019-12-07 10:08:41,536 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:08:41,537 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:08:41,537 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:08:41,537 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2019-12-07 10:08:41,554 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-12-07 10:08:41,555 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 10:08:41,593 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-12-07 10:08:41,593 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [695600711] [2019-12-07 10:08:41,593 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:08:41,593 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [] total 7 [2019-12-07 10:08:41,593 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458362977] [2019-12-07 10:08:41,594 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 10:08:41,594 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 10:08:41,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 10:08:41,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 10:08:41,594 INFO L87 Difference]: Start difference. First operand 516 states and 768 transitions. Second operand 7 states. [2019-12-07 10:08:51,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:08:51,726 INFO L93 Difference]: Finished difference Result 1842 states and 2759 transitions. [2019-12-07 10:08:51,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 10:08:51,727 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 112 [2019-12-07 10:08:51,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:08:51,733 INFO L225 Difference]: With dead ends: 1842 [2019-12-07 10:08:51,733 INFO L226 Difference]: Without dead ends: 1336 [2019-12-07 10:08:51,734 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 216 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-07 10:08:51,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1336 states. [2019-12-07 10:08:51,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1336 to 620. [2019-12-07 10:08:51,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 620 states. [2019-12-07 10:08:51,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 942 transitions. [2019-12-07 10:08:51,754 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 942 transitions. Word has length 112 [2019-12-07 10:08:51,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:08:51,754 INFO L462 AbstractCegarLoop]: Abstraction has 620 states and 942 transitions. [2019-12-07 10:08:51,755 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 10:08:51,755 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 942 transitions. [2019-12-07 10:08:51,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-12-07 10:08:51,756 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:08:51,756 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:08:51,956 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-12-07 10:08:51,957 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:08:51,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:08:51,957 INFO L82 PathProgramCache]: Analyzing trace with hash -761801560, now seen corresponding path program 1 times [2019-12-07 10:08:51,957 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 10:08:51,958 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1625735210] [2019-12-07 10:08:51,958 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_26d53605-b91a-4a69-9fb7-ef71d6d44580/bin/uautomizer/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2019-12-07 10:08:52,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 10:08:52,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 10:08:52,856 INFO L174 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2019-12-07 10:08:52,856 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 10:08:53,057 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2019-12-07 10:08:53,204 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 10:08:53 BoogieIcfgContainer [2019-12-07 10:08:53,204 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 10:08:53,204 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 10:08:53,204 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 10:08:53,204 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 10:08:53,205 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:07:43" (3/4) ... [2019-12-07 10:08:53,206 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 10:08:53,289 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_26d53605-b91a-4a69-9fb7-ef71d6d44580/bin/uautomizer/witness.graphml [2019-12-07 10:08:53,289 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 10:08:53,290 INFO L168 Benchmark]: Toolchain (without parser) took 72233.86 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 210.2 MB). Free memory was 947.0 MB in the beginning and 830.2 MB in the end (delta: 116.8 MB). Peak memory consumption was 327.1 MB. Max. memory is 11.5 GB. [2019-12-07 10:08:53,290 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 10:08:53,290 INFO L168 Benchmark]: CACSL2BoogieTranslator took 438.35 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -170.4 MB). Peak memory consumption was 28.2 MB. Max. memory is 11.5 GB. [2019-12-07 10:08:53,291 INFO L168 Benchmark]: Boogie Procedure Inliner took 55.56 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-12-07 10:08:53,291 INFO L168 Benchmark]: Boogie Preprocessor took 52.79 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-12-07 10:08:53,291 INFO L168 Benchmark]: RCFGBuilder took 2287.05 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 91.3 MB). Peak memory consumption was 91.3 MB. Max. memory is 11.5 GB. [2019-12-07 10:08:53,291 INFO L168 Benchmark]: TraceAbstraction took 69310.06 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 68.2 MB). Free memory was 1.0 GB in the beginning and 844.7 MB in the end (delta: 168.3 MB). Peak memory consumption was 236.5 MB. Max. memory is 11.5 GB. [2019-12-07 10:08:53,291 INFO L168 Benchmark]: Witness Printer took 85.08 ms. Allocated memory is still 1.2 GB. Free memory was 844.7 MB in the beginning and 830.2 MB in the end (delta: 14.5 MB). Peak memory consumption was 14.5 MB. Max. memory is 11.5 GB. [2019-12-07 10:08:53,293 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 438.35 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -170.4 MB). Peak memory consumption was 28.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 55.56 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 52.79 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 2287.05 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 91.3 MB). Peak memory consumption was 91.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 69310.06 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 68.2 MB). Free memory was 1.0 GB in the beginning and 844.7 MB in the end (delta: 168.3 MB). Peak memory consumption was 236.5 MB. Max. memory is 11.5 GB. * Witness Printer took 85.08 ms. Allocated memory is still 1.2 GB. Free memory was 844.7 MB in the beginning and 830.2 MB in the end (delta: 14.5 MB). Peak memory consumption was 14.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1641]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L1042] static int init = 1; [L1043] static SSL_METHOD SSLv3_client_data ; VAL [init=1, SSLv3_client_data={15:0}] [L1065] SSL *s = (SSL*)malloc(sizeof(SSL)) ; [L1069] s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1070] s->ctx = malloc(sizeof(SSL_CTX)) [L1071] s->session = malloc(sizeof(SSL_SESSION)) [L1072] s->state = 12292 [L1073] s->version = __VERIFIER_nondet_int() [L1080] BUF_MEM *buf ; [L1081] unsigned long tmp ; [L1082] unsigned long l ; [L1083] long num1 ; [L1084] void (*cb)() ; [L1085] int ret ; [L1086] int new_state ; [L1087] int state ; [L1088] int skip ; [L1089] int tmp___1 = __VERIFIER_nondet_int() ; [L1090] int tmp___2 = __VERIFIER_nondet_int() ; [L1091] int tmp___3 = __VERIFIER_nondet_int() ; [L1092] int tmp___4 = __VERIFIER_nondet_int() ; [L1093] int tmp___5 = __VERIFIER_nondet_int() ; [L1094] int tmp___6 = __VERIFIER_nondet_int() ; [L1095] int tmp___7 = __VERIFIER_nondet_int() ; [L1096] int tmp___8 = __VERIFIER_nondet_int() ; [L1097] long tmp___9 = __VERIFIER_nondet_long() ; [L1098] int blastFlag ; [L1101] blastFlag = 0 [L1102] s->hit=__VERIFIER_nondet_int () [L1103] s->state = 12292 [L1104] tmp = __VERIFIER_nondet_int() [L1105] cb = (void (*)())((void *)0) [L1106] ret = -1 [L1107] skip = 0 [L1108] EXPR s->info_callback VAL [init=1, SSLv3_client_data={15:0}] [L1108] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1109] EXPR s->info_callback [L1109] cb = s->info_callback [L1117] EXPR s->in_handshake [L1117] s->in_handshake += 1 [L1118] COND FALSE !(tmp___1 & 12288) VAL [init=1, SSLv3_client_data={15:0}] [L1128] COND TRUE 1 VAL [init=1, SSLv3_client_data={15:0}] [L1130] EXPR s->state [L1130] state = s->state [L1131] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1131] COND TRUE s->state == 12292 [L1234] s->new_session = 1 [L1235] s->state = 4096 [L1236] EXPR s->ctx [L1236] EXPR (s->ctx)->stats.sess_connect_renegotiate [L1236] (s->ctx)->stats.sess_connect_renegotiate += 1 [L1241] s->server = 0 VAL [init=1, SSLv3_client_data={15:0}] [L1242] COND TRUE (unsigned long )cb != (unsigned long )((void *)0) VAL [init=1, SSLv3_client_data={15:0}] [L1247] EXPR s->version VAL [init=1, SSLv3_client_data={15:0}] [L1247] COND FALSE !((s->version & 65280) != 768) [L1253] s->type = 4096 [L1254] EXPR s->init_buf VAL [init=1, SSLv3_client_data={15:0}] [L1254] COND FALSE !((unsigned long )s->init_buf == (unsigned long )((void *)0)) [L1272] COND FALSE !(! tmp___4) VAL [init=1, SSLv3_client_data={15:0}] [L1278] COND FALSE !(! tmp___5) [L1284] s->state = 4368 [L1285] EXPR s->ctx [L1285] EXPR (s->ctx)->stats.sess_connect [L1285] (s->ctx)->stats.sess_connect += 1 [L1286] s->init_num = 0 VAL [init=1, SSLv3_client_data={15:0}] [L1600] EXPR s->s3 [L1600] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_client_data={15:0}] [L1600] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1629] skip = 0 VAL [init=1, SSLv3_client_data={15:0}] [L1128] COND TRUE 1 VAL [init=1, SSLv3_client_data={15:0}] [L1130] EXPR s->state [L1130] state = s->state [L1131] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1131] COND FALSE !(s->state == 12292) [L1134] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1134] COND FALSE !(s->state == 16384) [L1137] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1137] COND FALSE !(s->state == 4096) [L1140] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1140] COND FALSE !(s->state == 20480) [L1143] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1143] COND FALSE !(s->state == 4099) [L1146] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1146] COND TRUE s->state == 4368 [L1290] s->shutdown = 0 [L1291] ret = __VERIFIER_nondet_int() [L1292] COND TRUE blastFlag == 0 [L1293] blastFlag = 1 VAL [init=1, SSLv3_client_data={15:0}] [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={15: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={15:0}] [L1600] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1629] skip = 0 VAL [init=1, SSLv3_client_data={15:0}] [L1128] COND TRUE 1 VAL [init=1, SSLv3_client_data={15:0}] [L1130] EXPR s->state [L1130] state = s->state [L1131] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1131] COND FALSE !(s->state == 12292) [L1134] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1134] COND FALSE !(s->state == 16384) [L1137] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1137] COND FALSE !(s->state == 4096) [L1140] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1140] COND FALSE !(s->state == 20480) [L1143] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1143] COND FALSE !(s->state == 4099) [L1146] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1146] COND FALSE !(s->state == 4368) [L1149] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1149] COND FALSE !(s->state == 4369) [L1152] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1152] COND TRUE s->state == 4384 [L1316] ret = __VERIFIER_nondet_int() [L1317] COND TRUE blastFlag == 1 [L1318] blastFlag = 2 VAL [init=1, SSLv3_client_data={15:0}] [L1322] COND FALSE !(ret <= 0) [L1327] s->hit VAL [init=1, SSLv3_client_data={15:0}] [L1327] COND FALSE !(s->hit) [L1330] s->state = 4400 VAL [init=1, SSLv3_client_data={15:0}] [L1332] s->init_num = 0 VAL [init=1, SSLv3_client_data={15:0}] [L1600] EXPR s->s3 [L1600] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_client_data={15:0}] [L1600] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1629] skip = 0 VAL [init=1, SSLv3_client_data={15:0}] [L1128] COND TRUE 1 VAL [init=1, SSLv3_client_data={15:0}] [L1130] EXPR s->state [L1130] state = s->state [L1131] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1131] COND FALSE !(s->state == 12292) [L1134] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1134] COND FALSE !(s->state == 16384) [L1137] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1137] COND FALSE !(s->state == 4096) [L1140] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1140] COND FALSE !(s->state == 20480) [L1143] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1143] COND FALSE !(s->state == 4099) [L1146] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1146] COND FALSE !(s->state == 4368) [L1149] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1149] COND FALSE !(s->state == 4369) [L1152] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1152] COND FALSE !(s->state == 4384) [L1155] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1155] COND FALSE !(s->state == 4385) [L1158] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1158] COND TRUE s->state == 4400 [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={15: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={15:0}] [L1345] COND FALSE !(ret <= 0) VAL [init=1, SSLv3_client_data={15:0}] [L1351] s->state = 4416 [L1352] s->init_num = 0 VAL [init=1, SSLv3_client_data={15:0}] [L1600] EXPR s->s3 [L1600] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_client_data={15:0}] [L1600] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1629] skip = 0 VAL [init=1, SSLv3_client_data={15:0}] [L1128] COND TRUE 1 VAL [init=1, SSLv3_client_data={15:0}] [L1130] EXPR s->state [L1130] state = s->state [L1131] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1131] COND FALSE !(s->state == 12292) [L1134] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1134] COND FALSE !(s->state == 16384) [L1137] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1137] COND FALSE !(s->state == 4096) [L1140] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1140] COND FALSE !(s->state == 20480) [L1143] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1143] COND FALSE !(s->state == 4099) [L1146] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1146] COND FALSE !(s->state == 4368) [L1149] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1149] COND FALSE !(s->state == 4369) [L1152] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1152] COND FALSE !(s->state == 4384) [L1155] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1155] COND FALSE !(s->state == 4385) [L1158] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1158] COND FALSE !(s->state == 4400) [L1161] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1161] COND FALSE !(s->state == 4401) [L1164] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1164] COND TRUE s->state == 4416 [L1356] ret = __VERIFIER_nondet_int() [L1357] COND TRUE blastFlag == 3 [L1358] blastFlag = 4 VAL [init=1, SSLv3_client_data={15:0}] [L1362] COND FALSE !(ret <= 0) [L1367] s->state = 4432 [L1368] s->init_num = 0 VAL [init=1, SSLv3_client_data={15:0}] [L1369] COND FALSE !(! tmp___6) VAL [init=1, SSLv3_client_data={15:0}] [L1600] EXPR s->s3 [L1600] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_client_data={15:0}] [L1600] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1629] skip = 0 VAL [init=1, SSLv3_client_data={15:0}] [L1128] COND TRUE 1 VAL [init=1, SSLv3_client_data={15:0}] [L1130] EXPR s->state [L1130] state = s->state [L1131] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1131] COND FALSE !(s->state == 12292) [L1134] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1134] COND FALSE !(s->state == 16384) [L1137] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1137] COND FALSE !(s->state == 4096) [L1140] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1140] COND FALSE !(s->state == 20480) [L1143] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1143] COND FALSE !(s->state == 4099) [L1146] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1146] COND FALSE !(s->state == 4368) [L1149] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1149] COND FALSE !(s->state == 4369) [L1152] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1152] COND FALSE !(s->state == 4384) [L1155] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1155] COND FALSE !(s->state == 4385) [L1158] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1158] COND FALSE !(s->state == 4400) [L1161] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1161] COND FALSE !(s->state == 4401) [L1164] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1164] COND FALSE !(s->state == 4416) [L1167] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1167] COND FALSE !(s->state == 4417) [L1170] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1170] COND TRUE s->state == 4432 [L1378] ret = __VERIFIER_nondet_int() [L1379] COND TRUE blastFlag == 4 VAL [init=1, SSLv3_client_data={15:0}] [L1641] __VERIFIER_error() VAL [init=1, SSLv3_client_data={15:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 129 locations, 1 error locations. Result: UNSAFE, OverallTime: 69.1s, OverallIterations: 5, TraceHistogramMax: 6, AutomataDifference: 12.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 826 SDtfs, 1140 SDslu, 1405 SDs, 0 SdLazy, 753 SolverSat, 91 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 12.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 583 GetRequests, 566 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=620occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 717 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 53.3s InterpolantComputationTime, 406 NumberOfCodeBlocks, 406 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 580 ConstructedInterpolants, 0 QuantifiedInterpolants, 114966 SizeOfPredicates, 9 NumberOfNonLiveVariables, 814 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 592/592 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...