./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ssh/s3_clnt.blast.03.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_2fb571f0-c533-4462-b3d8-9c5ca00d3182/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_2fb571f0-c533-4462-b3d8-9c5ca00d3182/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_2fb571f0-c533-4462-b3d8-9c5ca00d3182/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_2fb571f0-c533-4462-b3d8-9c5ca00d3182/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh/s3_clnt.blast.03.i.cil-1.c -s /tmp/vcloud-vcloud-master/worker/run_dir_2fb571f0-c533-4462-b3d8-9c5ca00d3182/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_2fb571f0-c533-4462-b3d8-9c5ca00d3182/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 ed035556db4b60d2bb3e3e70af5f975a04e628c4 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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_2fb571f0-c533-4462-b3d8-9c5ca00d3182/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_2fb571f0-c533-4462-b3d8-9c5ca00d3182/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_2fb571f0-c533-4462-b3d8-9c5ca00d3182/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_2fb571f0-c533-4462-b3d8-9c5ca00d3182/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh/s3_clnt.blast.03.i.cil-1.c -s /tmp/vcloud-vcloud-master/worker/run_dir_2fb571f0-c533-4462-b3d8-9c5ca00d3182/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_2fb571f0-c533-4462-b3d8-9c5ca00d3182/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 ed035556db4b60d2bb3e3e70af5f975a04e628c4 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 16:04:22,712 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 16:04:22,713 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 16:04:22,721 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 16:04:22,721 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 16:04:22,722 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 16:04:22,723 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 16:04:22,724 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 16:04:22,726 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 16:04:22,726 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 16:04:22,727 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 16:04:22,727 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 16:04:22,728 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 16:04:22,728 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 16:04:22,729 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 16:04:22,730 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 16:04:22,730 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 16:04:22,731 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 16:04:22,732 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 16:04:22,734 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 16:04:22,735 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 16:04:22,736 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 16:04:22,737 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 16:04:22,737 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 16:04:22,739 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 16:04:22,739 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 16:04:22,740 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 16:04:22,740 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 16:04:22,740 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 16:04:22,741 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 16:04:22,741 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 16:04:22,741 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 16:04:22,742 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 16:04:22,742 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 16:04:22,743 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 16:04:22,743 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 16:04:22,743 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 16:04:22,744 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 16:04:22,744 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 16:04:22,744 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 16:04:22,745 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 16:04:22,745 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_2fb571f0-c533-4462-b3d8-9c5ca00d3182/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 16:04:22,754 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 16:04:22,754 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 16:04:22,755 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 16:04:22,755 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 16:04:22,755 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 16:04:22,756 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 16:04:22,756 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 16:04:22,756 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 16:04:22,756 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 16:04:22,756 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 16:04:22,756 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 16:04:22,756 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 16:04:22,756 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 16:04:22,757 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 16:04:22,757 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 16:04:22,757 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 16:04:22,757 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 16:04:22,757 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 16:04:22,757 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 16:04:22,757 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 16:04:22,758 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 16:04:22,758 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 16:04:22,758 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 16:04:22,758 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 16:04:22,758 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 16:04:22,758 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 16:04:22,758 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 16:04:22,758 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 16:04:22,759 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 16:04:22,759 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_2fb571f0-c533-4462-b3d8-9c5ca00d3182/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 -> ed035556db4b60d2bb3e3e70af5f975a04e628c4 [2019-12-07 16:04:22,863 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 16:04:22,873 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 16:04:22,875 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 16:04:22,876 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 16:04:22,876 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 16:04:22,877 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_2fb571f0-c533-4462-b3d8-9c5ca00d3182/bin/uautomizer/../../sv-benchmarks/c/ssh/s3_clnt.blast.03.i.cil-1.c [2019-12-07 16:04:22,915 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_2fb571f0-c533-4462-b3d8-9c5ca00d3182/bin/uautomizer/data/1c50671c8/0a967bc568aa40e898ffe485e19d5290/FLAG651e24ff8 [2019-12-07 16:04:23,445 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 16:04:23,446 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_2fb571f0-c533-4462-b3d8-9c5ca00d3182/sv-benchmarks/c/ssh/s3_clnt.blast.03.i.cil-1.c [2019-12-07 16:04:23,458 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_2fb571f0-c533-4462-b3d8-9c5ca00d3182/bin/uautomizer/data/1c50671c8/0a967bc568aa40e898ffe485e19d5290/FLAG651e24ff8 [2019-12-07 16:04:23,947 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_2fb571f0-c533-4462-b3d8-9c5ca00d3182/bin/uautomizer/data/1c50671c8/0a967bc568aa40e898ffe485e19d5290 [2019-12-07 16:04:23,949 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 16:04:23,950 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 16:04:23,950 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 16:04:23,950 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 16:04:23,953 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 16:04:23,953 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 04:04:23" (1/1) ... [2019-12-07 16:04:23,955 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@352f3a1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:04:23, skipping insertion in model container [2019-12-07 16:04:23,955 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 04:04:23" (1/1) ... [2019-12-07 16:04:23,960 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 16:04:23,997 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 16:04:24,256 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 16:04:24,267 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 16:04:24,352 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 16:04:24,367 INFO L208 MainTranslator]: Completed translation [2019-12-07 16:04:24,367 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:04:24 WrapperNode [2019-12-07 16:04:24,367 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 16:04:24,368 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 16:04:24,368 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 16:04:24,368 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 16:04:24,374 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:04:24" (1/1) ... [2019-12-07 16:04:24,395 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:04:24" (1/1) ... [2019-12-07 16:04:24,425 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 16:04:24,425 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 16:04:24,425 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 16:04:24,425 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 16:04:24,432 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:04:24" (1/1) ... [2019-12-07 16:04:24,432 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:04:24" (1/1) ... [2019-12-07 16:04:24,439 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:04:24" (1/1) ... [2019-12-07 16:04:24,439 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:04:24" (1/1) ... [2019-12-07 16:04:24,464 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:04:24" (1/1) ... [2019-12-07 16:04:24,469 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:04:24" (1/1) ... [2019-12-07 16:04:24,472 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:04:24" (1/1) ... [2019-12-07 16:04:24,475 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 16:04:24,476 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 16:04:24,476 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 16:04:24,476 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 16:04:24,477 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:04:24" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2fb571f0-c533-4462-b3d8-9c5ca00d3182/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 16:04:24,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-12-07 16:04:24,518 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 16:04:24,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 16:04:24,518 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-07 16:04:24,518 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-12-07 16:04:24,519 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-12-07 16:04:24,519 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 16:04:24,519 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 16:04:24,654 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-12-07 16:04:25,141 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2019-12-07 16:04:25,141 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2019-12-07 16:04:25,142 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 16:04:25,142 INFO L287 CfgBuilder]: Removed 7 assume(true) statements. [2019-12-07 16:04:25,143 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 04:04:25 BoogieIcfgContainer [2019-12-07 16:04:25,143 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 16:04:25,144 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 16:04:25,144 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 16:04:25,146 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 16:04:25,146 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 04:04:23" (1/3) ... [2019-12-07 16:04:25,146 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5647517c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 04:04:25, skipping insertion in model container [2019-12-07 16:04:25,147 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:04:24" (2/3) ... [2019-12-07 16:04:25,147 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5647517c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 04:04:25, skipping insertion in model container [2019-12-07 16:04:25,147 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 04:04:25" (3/3) ... [2019-12-07 16:04:25,148 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_clnt.blast.03.i.cil-1.c [2019-12-07 16:04:25,154 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 16:04:25,159 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 16:04:25,166 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 16:04:25,184 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 16:04:25,184 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 16:04:25,184 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 16:04:25,184 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 16:04:25,184 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 16:04:25,184 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 16:04:25,184 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 16:04:25,184 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 16:04:25,197 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states. [2019-12-07 16:04:25,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-07 16:04:25,201 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:04:25,202 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 16:04:25,202 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:04:25,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:04:25,206 INFO L82 PathProgramCache]: Analyzing trace with hash -1457695037, now seen corresponding path program 1 times [2019-12-07 16:04:25,211 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:04:25,211 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680276709] [2019-12-07 16:04:25,212 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:04:25,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:04:25,395 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 16:04:25,396 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680276709] [2019-12-07 16:04:25,396 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:04:25,397 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:04:25,398 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307149719] [2019-12-07 16:04:25,401 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:04:25,402 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:04:25,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:04:25,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:04:25,412 INFO L87 Difference]: Start difference. First operand 129 states. Second operand 4 states. [2019-12-07 16:04:25,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:04:25,660 INFO L93 Difference]: Finished difference Result 255 states and 430 transitions. [2019-12-07 16:04:25,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:04:25,662 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2019-12-07 16:04:25,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:04:25,670 INFO L225 Difference]: With dead ends: 255 [2019-12-07 16:04:25,670 INFO L226 Difference]: Without dead ends: 116 [2019-12-07 16:04:25,673 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 16:04:25,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-12-07 16:04:25,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 115. [2019-12-07 16:04:25,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-12-07 16:04:25,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 172 transitions. [2019-12-07 16:04:25,704 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 172 transitions. Word has length 24 [2019-12-07 16:04:25,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:04:25,705 INFO L462 AbstractCegarLoop]: Abstraction has 115 states and 172 transitions. [2019-12-07 16:04:25,705 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:04:25,705 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 172 transitions. [2019-12-07 16:04:25,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-12-07 16:04:25,706 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:04:25,706 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 16:04:25,707 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:04:25,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:04:25,707 INFO L82 PathProgramCache]: Analyzing trace with hash 1001988123, now seen corresponding path program 1 times [2019-12-07 16:04:25,707 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:04:25,707 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462198609] [2019-12-07 16:04:25,707 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:04:25,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:04:25,796 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 16:04:25,797 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462198609] [2019-12-07 16:04:25,797 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:04:25,797 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:04:25,797 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255943617] [2019-12-07 16:04:25,798 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:04:25,798 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:04:25,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:04:25,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:04:25,799 INFO L87 Difference]: Start difference. First operand 115 states and 172 transitions. Second operand 3 states. [2019-12-07 16:04:25,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:04:25,832 INFO L93 Difference]: Finished difference Result 321 states and 484 transitions. [2019-12-07 16:04:25,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:04:25,832 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2019-12-07 16:04:25,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:04:25,834 INFO L225 Difference]: With dead ends: 321 [2019-12-07 16:04:25,834 INFO L226 Difference]: Without dead ends: 216 [2019-12-07 16:04:25,835 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 16:04:25,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2019-12-07 16:04:25,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 216. [2019-12-07 16:04:25,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2019-12-07 16:04:25,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 320 transitions. [2019-12-07 16:04:25,850 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 320 transitions. Word has length 38 [2019-12-07 16:04:25,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:04:25,850 INFO L462 AbstractCegarLoop]: Abstraction has 216 states and 320 transitions. [2019-12-07 16:04:25,850 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:04:25,850 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 320 transitions. [2019-12-07 16:04:25,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-07 16:04:25,852 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:04:25,852 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 16:04:25,852 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:04:25,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:04:25,853 INFO L82 PathProgramCache]: Analyzing trace with hash -596933037, now seen corresponding path program 1 times [2019-12-07 16:04:25,853 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:04:25,853 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105717783] [2019-12-07 16:04:25,853 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:04:25,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:04:25,922 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 16:04:25,922 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105717783] [2019-12-07 16:04:25,923 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:04:25,923 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:04:25,923 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747804759] [2019-12-07 16:04:25,924 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:04:25,924 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:04:25,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:04:25,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:04:25,924 INFO L87 Difference]: Start difference. First operand 216 states and 320 transitions. Second operand 3 states. [2019-12-07 16:04:25,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:04:25,988 INFO L93 Difference]: Finished difference Result 420 states and 629 transitions. [2019-12-07 16:04:25,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:04:25,989 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-12-07 16:04:25,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:04:25,991 INFO L225 Difference]: With dead ends: 420 [2019-12-07 16:04:25,991 INFO L226 Difference]: Without dead ends: 315 [2019-12-07 16:04:25,992 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 16:04:25,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2019-12-07 16:04:26,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 315. [2019-12-07 16:04:26,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2019-12-07 16:04:26,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 466 transitions. [2019-12-07 16:04:26,008 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 466 transitions. Word has length 53 [2019-12-07 16:04:26,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:04:26,009 INFO L462 AbstractCegarLoop]: Abstraction has 315 states and 466 transitions. [2019-12-07 16:04:26,009 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:04:26,009 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 466 transitions. [2019-12-07 16:04:26,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-07 16:04:26,012 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:04:26,012 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 16:04:26,012 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:04:26,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:04:26,012 INFO L82 PathProgramCache]: Analyzing trace with hash -1173568974, now seen corresponding path program 1 times [2019-12-07 16:04:26,013 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:04:26,013 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263873431] [2019-12-07 16:04:26,013 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:04:26,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:04:26,096 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 16:04:26,097 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263873431] [2019-12-07 16:04:26,097 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:04:26,097 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:04:26,098 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780313757] [2019-12-07 16:04:26,098 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:04:26,098 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:04:26,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:04:26,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:04:26,099 INFO L87 Difference]: Start difference. First operand 315 states and 466 transitions. Second operand 4 states. [2019-12-07 16:04:26,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:04:26,460 INFO L93 Difference]: Finished difference Result 806 states and 1197 transitions. [2019-12-07 16:04:26,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:04:26,461 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 71 [2019-12-07 16:04:26,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:04:26,463 INFO L225 Difference]: With dead ends: 806 [2019-12-07 16:04:26,463 INFO L226 Difference]: Without dead ends: 501 [2019-12-07 16:04:26,465 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 16:04:26,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2019-12-07 16:04:26,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 365. [2019-12-07 16:04:26,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 365 states. [2019-12-07 16:04:26,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 552 transitions. [2019-12-07 16:04:26,477 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 552 transitions. Word has length 71 [2019-12-07 16:04:26,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:04:26,477 INFO L462 AbstractCegarLoop]: Abstraction has 365 states and 552 transitions. [2019-12-07 16:04:26,477 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:04:26,477 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 552 transitions. [2019-12-07 16:04:26,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-07 16:04:26,480 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:04:26,480 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 16:04:26,480 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:04:26,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:04:26,480 INFO L82 PathProgramCache]: Analyzing trace with hash -1307582480, now seen corresponding path program 1 times [2019-12-07 16:04:26,480 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:04:26,481 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174986334] [2019-12-07 16:04:26,481 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:04:26,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:04:26,538 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 16:04:26,539 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174986334] [2019-12-07 16:04:26,539 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:04:26,539 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:04:26,539 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855343098] [2019-12-07 16:04:26,539 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:04:26,539 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:04:26,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:04:26,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:04:26,540 INFO L87 Difference]: Start difference. First operand 365 states and 552 transitions. Second operand 4 states. [2019-12-07 16:04:26,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:04:26,787 INFO L93 Difference]: Finished difference Result 806 states and 1218 transitions. [2019-12-07 16:04:26,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:04:26,788 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 71 [2019-12-07 16:04:26,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:04:26,790 INFO L225 Difference]: With dead ends: 806 [2019-12-07 16:04:26,790 INFO L226 Difference]: Without dead ends: 451 [2019-12-07 16:04:26,791 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 16:04:26,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2019-12-07 16:04:26,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 405. [2019-12-07 16:04:26,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 405 states. [2019-12-07 16:04:26,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 620 transitions. [2019-12-07 16:04:26,800 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 620 transitions. Word has length 71 [2019-12-07 16:04:26,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:04:26,800 INFO L462 AbstractCegarLoop]: Abstraction has 405 states and 620 transitions. [2019-12-07 16:04:26,800 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:04:26,800 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 620 transitions. [2019-12-07 16:04:26,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-07 16:04:26,802 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:04:26,802 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 16:04:26,802 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:04:26,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:04:26,802 INFO L82 PathProgramCache]: Analyzing trace with hash -2025585655, now seen corresponding path program 1 times [2019-12-07 16:04:26,802 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:04:26,803 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883754007] [2019-12-07 16:04:26,803 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:04:26,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:04:26,858 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 16:04:26,859 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883754007] [2019-12-07 16:04:26,859 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:04:26,859 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:04:26,859 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249633968] [2019-12-07 16:04:26,860 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:04:26,860 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:04:26,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:04:26,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:04:26,860 INFO L87 Difference]: Start difference. First operand 405 states and 620 transitions. Second operand 4 states. [2019-12-07 16:04:27,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:04:27,205 INFO L93 Difference]: Finished difference Result 928 states and 1409 transitions. [2019-12-07 16:04:27,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:04:27,205 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 72 [2019-12-07 16:04:27,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:04:27,208 INFO L225 Difference]: With dead ends: 928 [2019-12-07 16:04:27,209 INFO L226 Difference]: Without dead ends: 533 [2019-12-07 16:04:27,209 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 16:04:27,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2019-12-07 16:04:27,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 407. [2019-12-07 16:04:27,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2019-12-07 16:04:27,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 622 transitions. [2019-12-07 16:04:27,222 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 622 transitions. Word has length 72 [2019-12-07 16:04:27,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:04:27,222 INFO L462 AbstractCegarLoop]: Abstraction has 407 states and 622 transitions. [2019-12-07 16:04:27,222 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:04:27,222 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 622 transitions. [2019-12-07 16:04:27,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-12-07 16:04:27,224 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:04:27,224 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 16:04:27,224 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:04:27,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:04:27,224 INFO L82 PathProgramCache]: Analyzing trace with hash 703880522, now seen corresponding path program 2 times [2019-12-07 16:04:27,224 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:04:27,225 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114424248] [2019-12-07 16:04:27,225 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:04:27,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:04:27,290 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 16:04:27,291 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114424248] [2019-12-07 16:04:27,291 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:04:27,291 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:04:27,291 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768358475] [2019-12-07 16:04:27,292 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:04:27,292 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:04:27,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:04:27,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:04:27,292 INFO L87 Difference]: Start difference. First operand 407 states and 622 transitions. Second operand 4 states. [2019-12-07 16:04:27,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:04:27,638 INFO L93 Difference]: Finished difference Result 928 states and 1407 transitions. [2019-12-07 16:04:27,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:04:27,638 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 85 [2019-12-07 16:04:27,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:04:27,641 INFO L225 Difference]: With dead ends: 928 [2019-12-07 16:04:27,641 INFO L226 Difference]: Without dead ends: 531 [2019-12-07 16:04:27,642 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 16:04:27,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2019-12-07 16:04:27,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 407. [2019-12-07 16:04:27,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2019-12-07 16:04:27,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 620 transitions. [2019-12-07 16:04:27,651 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 620 transitions. Word has length 85 [2019-12-07 16:04:27,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:04:27,651 INFO L462 AbstractCegarLoop]: Abstraction has 407 states and 620 transitions. [2019-12-07 16:04:27,651 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:04:27,651 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 620 transitions. [2019-12-07 16:04:27,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-12-07 16:04:27,652 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:04:27,652 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 16:04:27,652 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:04:27,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:04:27,652 INFO L82 PathProgramCache]: Analyzing trace with hash -405099924, now seen corresponding path program 1 times [2019-12-07 16:04:27,652 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:04:27,652 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45867856] [2019-12-07 16:04:27,653 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:04:27,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:04:27,714 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 16:04:27,714 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45867856] [2019-12-07 16:04:27,714 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:04:27,714 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:04:27,715 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75418242] [2019-12-07 16:04:27,715 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:04:27,715 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:04:27,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:04:27,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:04:27,715 INFO L87 Difference]: Start difference. First operand 407 states and 620 transitions. Second operand 4 states. [2019-12-07 16:04:28,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:04:28,044 INFO L93 Difference]: Finished difference Result 928 states and 1403 transitions. [2019-12-07 16:04:28,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:04:28,044 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 85 [2019-12-07 16:04:28,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:04:28,047 INFO L225 Difference]: With dead ends: 928 [2019-12-07 16:04:28,047 INFO L226 Difference]: Without dead ends: 531 [2019-12-07 16:04:28,048 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 16:04:28,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2019-12-07 16:04:28,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 407. [2019-12-07 16:04:28,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2019-12-07 16:04:28,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 618 transitions. [2019-12-07 16:04:28,059 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 618 transitions. Word has length 85 [2019-12-07 16:04:28,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:04:28,060 INFO L462 AbstractCegarLoop]: Abstraction has 407 states and 618 transitions. [2019-12-07 16:04:28,060 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:04:28,060 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 618 transitions. [2019-12-07 16:04:28,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-12-07 16:04:28,061 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:04:28,061 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 16:04:28,062 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:04:28,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:04:28,062 INFO L82 PathProgramCache]: Analyzing trace with hash -325478776, now seen corresponding path program 2 times [2019-12-07 16:04:28,062 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:04:28,062 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569230991] [2019-12-07 16:04:28,062 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:04:28,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:04:28,118 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 16:04:28,118 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569230991] [2019-12-07 16:04:28,118 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:04:28,119 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:04:28,119 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86638068] [2019-12-07 16:04:28,119 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:04:28,119 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:04:28,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:04:28,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:04:28,120 INFO L87 Difference]: Start difference. First operand 407 states and 618 transitions. Second operand 4 states. [2019-12-07 16:04:28,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:04:28,399 INFO L93 Difference]: Finished difference Result 848 states and 1278 transitions. [2019-12-07 16:04:28,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:04:28,400 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 85 [2019-12-07 16:04:28,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:04:28,402 INFO L225 Difference]: With dead ends: 848 [2019-12-07 16:04:28,402 INFO L226 Difference]: Without dead ends: 451 [2019-12-07 16:04:28,402 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 16:04:28,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2019-12-07 16:04:28,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 407. [2019-12-07 16:04:28,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2019-12-07 16:04:28,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 616 transitions. [2019-12-07 16:04:28,410 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 616 transitions. Word has length 85 [2019-12-07 16:04:28,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:04:28,410 INFO L462 AbstractCegarLoop]: Abstraction has 407 states and 616 transitions. [2019-12-07 16:04:28,410 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:04:28,410 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 616 transitions. [2019-12-07 16:04:28,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-12-07 16:04:28,411 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:04:28,411 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 16:04:28,411 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:04:28,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:04:28,412 INFO L82 PathProgramCache]: Analyzing trace with hash -1434459222, now seen corresponding path program 1 times [2019-12-07 16:04:28,412 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:04:28,412 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014155023] [2019-12-07 16:04:28,412 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:04:28,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:04:28,453 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 16:04:28,453 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014155023] [2019-12-07 16:04:28,453 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:04:28,454 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:04:28,454 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584932375] [2019-12-07 16:04:28,454 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:04:28,454 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:04:28,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:04:28,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:04:28,455 INFO L87 Difference]: Start difference. First operand 407 states and 616 transitions. Second operand 4 states. [2019-12-07 16:04:28,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:04:28,718 INFO L93 Difference]: Finished difference Result 848 states and 1274 transitions. [2019-12-07 16:04:28,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:04:28,719 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 85 [2019-12-07 16:04:28,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:04:28,721 INFO L225 Difference]: With dead ends: 848 [2019-12-07 16:04:28,721 INFO L226 Difference]: Without dead ends: 451 [2019-12-07 16:04:28,722 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 16:04:28,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2019-12-07 16:04:28,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 407. [2019-12-07 16:04:28,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2019-12-07 16:04:28,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 614 transitions. [2019-12-07 16:04:28,733 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 614 transitions. Word has length 85 [2019-12-07 16:04:28,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:04:28,733 INFO L462 AbstractCegarLoop]: Abstraction has 407 states and 614 transitions. [2019-12-07 16:04:28,733 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:04:28,733 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 614 transitions. [2019-12-07 16:04:28,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-12-07 16:04:28,734 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:04:28,735 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 16:04:28,735 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:04:28,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:04:28,735 INFO L82 PathProgramCache]: Analyzing trace with hash 381197251, now seen corresponding path program 1 times [2019-12-07 16:04:28,735 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:04:28,735 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516395726] [2019-12-07 16:04:28,735 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:04:28,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:04:28,785 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 16:04:28,785 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516395726] [2019-12-07 16:04:28,786 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:04:28,786 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:04:28,786 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640358027] [2019-12-07 16:04:28,786 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:04:28,786 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:04:28,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:04:28,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:04:28,787 INFO L87 Difference]: Start difference. First operand 407 states and 614 transitions. Second operand 4 states. [2019-12-07 16:04:29,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:04:29,094 INFO L93 Difference]: Finished difference Result 928 states and 1391 transitions. [2019-12-07 16:04:29,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:04:29,095 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 86 [2019-12-07 16:04:29,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:04:29,097 INFO L225 Difference]: With dead ends: 928 [2019-12-07 16:04:29,097 INFO L226 Difference]: Without dead ends: 531 [2019-12-07 16:04:29,097 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 16:04:29,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2019-12-07 16:04:29,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 407. [2019-12-07 16:04:29,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2019-12-07 16:04:29,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 612 transitions. [2019-12-07 16:04:29,105 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 612 transitions. Word has length 86 [2019-12-07 16:04:29,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:04:29,105 INFO L462 AbstractCegarLoop]: Abstraction has 407 states and 612 transitions. [2019-12-07 16:04:29,105 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:04:29,105 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 612 transitions. [2019-12-07 16:04:29,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-12-07 16:04:29,106 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:04:29,106 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:04:29,106 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:04:29,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:04:29,106 INFO L82 PathProgramCache]: Analyzing trace with hash 681258334, now seen corresponding path program 1 times [2019-12-07 16:04:29,106 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:04:29,106 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223015231] [2019-12-07 16:04:29,107 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:04:29,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:04:29,149 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 16:04:29,150 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223015231] [2019-12-07 16:04:29,150 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:04:29,150 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:04:29,150 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670825109] [2019-12-07 16:04:29,150 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:04:29,151 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:04:29,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:04:29,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:04:29,151 INFO L87 Difference]: Start difference. First operand 407 states and 612 transitions. Second operand 4 states. [2019-12-07 16:04:29,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:04:29,517 INFO L93 Difference]: Finished difference Result 783 states and 1168 transitions. [2019-12-07 16:04:29,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:04:29,518 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 86 [2019-12-07 16:04:29,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:04:29,520 INFO L225 Difference]: With dead ends: 783 [2019-12-07 16:04:29,520 INFO L226 Difference]: Without dead ends: 531 [2019-12-07 16:04:29,520 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 16:04:29,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2019-12-07 16:04:29,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 407. [2019-12-07 16:04:29,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2019-12-07 16:04:29,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 610 transitions. [2019-12-07 16:04:29,527 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 610 transitions. Word has length 86 [2019-12-07 16:04:29,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:04:29,527 INFO L462 AbstractCegarLoop]: Abstraction has 407 states and 610 transitions. [2019-12-07 16:04:29,527 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:04:29,527 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 610 transitions. [2019-12-07 16:04:29,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-12-07 16:04:29,528 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:04:29,528 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 16:04:29,528 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:04:29,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:04:29,529 INFO L82 PathProgramCache]: Analyzing trace with hash -1464169915, now seen corresponding path program 1 times [2019-12-07 16:04:29,529 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:04:29,529 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972255863] [2019-12-07 16:04:29,529 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:04:29,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:04:29,570 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 16:04:29,570 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972255863] [2019-12-07 16:04:29,570 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:04:29,570 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:04:29,570 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814018135] [2019-12-07 16:04:29,571 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:04:29,571 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:04:29,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:04:29,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:04:29,571 INFO L87 Difference]: Start difference. First operand 407 states and 610 transitions. Second operand 4 states. [2019-12-07 16:04:29,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:04:29,793 INFO L93 Difference]: Finished difference Result 848 states and 1262 transitions. [2019-12-07 16:04:29,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:04:29,793 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 86 [2019-12-07 16:04:29,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:04:29,795 INFO L225 Difference]: With dead ends: 848 [2019-12-07 16:04:29,795 INFO L226 Difference]: Without dead ends: 451 [2019-12-07 16:04:29,795 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 16:04:29,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2019-12-07 16:04:29,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 407. [2019-12-07 16:04:29,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2019-12-07 16:04:29,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 608 transitions. [2019-12-07 16:04:29,802 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 608 transitions. Word has length 86 [2019-12-07 16:04:29,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:04:29,802 INFO L462 AbstractCegarLoop]: Abstraction has 407 states and 608 transitions. [2019-12-07 16:04:29,802 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:04:29,802 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 608 transitions. [2019-12-07 16:04:29,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-12-07 16:04:29,803 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:04:29,803 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:04:29,803 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:04:29,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:04:29,803 INFO L82 PathProgramCache]: Analyzing trace with hash -1164108832, now seen corresponding path program 1 times [2019-12-07 16:04:29,803 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:04:29,803 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846318465] [2019-12-07 16:04:29,804 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:04:29,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:04:29,841 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 16:04:29,841 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846318465] [2019-12-07 16:04:29,841 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:04:29,841 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:04:29,842 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586762835] [2019-12-07 16:04:29,842 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:04:29,842 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:04:29,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:04:29,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:04:29,842 INFO L87 Difference]: Start difference. First operand 407 states and 608 transitions. Second operand 4 states. [2019-12-07 16:04:30,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:04:30,050 INFO L93 Difference]: Finished difference Result 703 states and 1041 transitions. [2019-12-07 16:04:30,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:04:30,051 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 86 [2019-12-07 16:04:30,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:04:30,052 INFO L225 Difference]: With dead ends: 703 [2019-12-07 16:04:30,053 INFO L226 Difference]: Without dead ends: 451 [2019-12-07 16:04:30,053 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 16:04:30,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2019-12-07 16:04:30,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 407. [2019-12-07 16:04:30,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2019-12-07 16:04:30,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 606 transitions. [2019-12-07 16:04:30,059 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 606 transitions. Word has length 86 [2019-12-07 16:04:30,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:04:30,060 INFO L462 AbstractCegarLoop]: Abstraction has 407 states and 606 transitions. [2019-12-07 16:04:30,060 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:04:30,060 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 606 transitions. [2019-12-07 16:04:30,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-12-07 16:04:30,060 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:04:30,061 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 16:04:30,061 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:04:30,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:04:30,061 INFO L82 PathProgramCache]: Analyzing trace with hash -956813465, now seen corresponding path program 1 times [2019-12-07 16:04:30,061 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:04:30,061 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265398319] [2019-12-07 16:04:30,061 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:04:30,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:04:30,100 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 16:04:30,100 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265398319] [2019-12-07 16:04:30,100 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:04:30,100 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:04:30,101 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438492981] [2019-12-07 16:04:30,101 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:04:30,101 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:04:30,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:04:30,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:04:30,102 INFO L87 Difference]: Start difference. First operand 407 states and 606 transitions. Second operand 4 states. [2019-12-07 16:04:30,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:04:30,430 INFO L93 Difference]: Finished difference Result 928 states and 1375 transitions. [2019-12-07 16:04:30,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:04:30,431 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2019-12-07 16:04:30,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:04:30,433 INFO L225 Difference]: With dead ends: 928 [2019-12-07 16:04:30,433 INFO L226 Difference]: Without dead ends: 531 [2019-12-07 16:04:30,433 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 16:04:30,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2019-12-07 16:04:30,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 407. [2019-12-07 16:04:30,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2019-12-07 16:04:30,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 604 transitions. [2019-12-07 16:04:30,441 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 604 transitions. Word has length 87 [2019-12-07 16:04:30,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:04:30,441 INFO L462 AbstractCegarLoop]: Abstraction has 407 states and 604 transitions. [2019-12-07 16:04:30,441 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:04:30,441 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 604 transitions. [2019-12-07 16:04:30,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-12-07 16:04:30,442 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:04:30,442 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:04:30,442 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:04:30,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:04:30,443 INFO L82 PathProgramCache]: Analyzing trace with hash 2048176167, now seen corresponding path program 1 times [2019-12-07 16:04:30,443 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:04:30,443 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029189815] [2019-12-07 16:04:30,443 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:04:30,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:04:30,485 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 16:04:30,486 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029189815] [2019-12-07 16:04:30,486 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:04:30,486 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:04:30,486 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12881537] [2019-12-07 16:04:30,486 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:04:30,486 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:04:30,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:04:30,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:04:30,487 INFO L87 Difference]: Start difference. First operand 407 states and 604 transitions. Second operand 4 states. [2019-12-07 16:04:30,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:04:30,845 INFO L93 Difference]: Finished difference Result 777 states and 1149 transitions. [2019-12-07 16:04:30,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:04:30,846 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2019-12-07 16:04:30,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:04:30,848 INFO L225 Difference]: With dead ends: 777 [2019-12-07 16:04:30,848 INFO L226 Difference]: Without dead ends: 525 [2019-12-07 16:04:30,848 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 16:04:30,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2019-12-07 16:04:30,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 407. [2019-12-07 16:04:30,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2019-12-07 16:04:30,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 602 transitions. [2019-12-07 16:04:30,855 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 602 transitions. Word has length 87 [2019-12-07 16:04:30,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:04:30,855 INFO L462 AbstractCegarLoop]: Abstraction has 407 states and 602 transitions. [2019-12-07 16:04:30,855 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:04:30,855 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 602 transitions. [2019-12-07 16:04:30,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-12-07 16:04:30,856 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:04:30,856 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 16:04:30,856 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:04:30,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:04:30,856 INFO L82 PathProgramCache]: Analyzing trace with hash 1966346533, now seen corresponding path program 1 times [2019-12-07 16:04:30,857 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:04:30,857 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896964341] [2019-12-07 16:04:30,857 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:04:30,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:04:30,893 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 16:04:30,893 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896964341] [2019-12-07 16:04:30,894 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:04:30,894 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:04:30,894 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382667686] [2019-12-07 16:04:30,894 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:04:30,894 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:04:30,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:04:30,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:04:30,894 INFO L87 Difference]: Start difference. First operand 407 states and 602 transitions. Second operand 4 states. [2019-12-07 16:04:31,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:04:31,150 INFO L93 Difference]: Finished difference Result 848 states and 1246 transitions. [2019-12-07 16:04:31,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:04:31,151 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2019-12-07 16:04:31,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:04:31,152 INFO L225 Difference]: With dead ends: 848 [2019-12-07 16:04:31,152 INFO L226 Difference]: Without dead ends: 451 [2019-12-07 16:04:31,153 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 16:04:31,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2019-12-07 16:04:31,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 407. [2019-12-07 16:04:31,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2019-12-07 16:04:31,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 600 transitions. [2019-12-07 16:04:31,159 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 600 transitions. Word has length 87 [2019-12-07 16:04:31,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:04:31,159 INFO L462 AbstractCegarLoop]: Abstraction has 407 states and 600 transitions. [2019-12-07 16:04:31,159 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:04:31,159 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 600 transitions. [2019-12-07 16:04:31,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-12-07 16:04:31,160 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:04:31,160 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:04:31,160 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:04:31,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:04:31,161 INFO L82 PathProgramCache]: Analyzing trace with hash 676368869, now seen corresponding path program 1 times [2019-12-07 16:04:31,161 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:04:31,161 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326880632] [2019-12-07 16:04:31,161 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:04:31,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:04:31,196 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-12-07 16:04:31,196 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326880632] [2019-12-07 16:04:31,196 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:04:31,196 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:04:31,196 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875223307] [2019-12-07 16:04:31,197 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:04:31,197 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:04:31,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:04:31,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:04:31,197 INFO L87 Difference]: Start difference. First operand 407 states and 600 transitions. Second operand 4 states. [2019-12-07 16:04:31,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:04:31,457 INFO L93 Difference]: Finished difference Result 697 states and 1022 transitions. [2019-12-07 16:04:31,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:04:31,457 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2019-12-07 16:04:31,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:04:31,459 INFO L225 Difference]: With dead ends: 697 [2019-12-07 16:04:31,459 INFO L226 Difference]: Without dead ends: 445 [2019-12-07 16:04:31,459 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 16:04:31,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2019-12-07 16:04:31,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 407. [2019-12-07 16:04:31,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2019-12-07 16:04:31,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 598 transitions. [2019-12-07 16:04:31,469 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 598 transitions. Word has length 87 [2019-12-07 16:04:31,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:04:31,469 INFO L462 AbstractCegarLoop]: Abstraction has 407 states and 598 transitions. [2019-12-07 16:04:31,469 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:04:31,469 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 598 transitions. [2019-12-07 16:04:31,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-12-07 16:04:31,470 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:04:31,470 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 16:04:31,470 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:04:31,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:04:31,471 INFO L82 PathProgramCache]: Analyzing trace with hash 571107934, now seen corresponding path program 1 times [2019-12-07 16:04:31,471 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:04:31,471 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233778288] [2019-12-07 16:04:31,471 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:04:31,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:04:31,514 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 16:04:31,514 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233778288] [2019-12-07 16:04:31,514 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:04:31,514 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:04:31,514 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089417341] [2019-12-07 16:04:31,515 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:04:31,515 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:04:31,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:04:31,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:04:31,515 INFO L87 Difference]: Start difference. First operand 407 states and 598 transitions. Second operand 4 states. [2019-12-07 16:04:31,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:04:31,799 INFO L93 Difference]: Finished difference Result 904 states and 1330 transitions. [2019-12-07 16:04:31,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:04:31,799 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-12-07 16:04:31,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:04:31,801 INFO L225 Difference]: With dead ends: 904 [2019-12-07 16:04:31,801 INFO L226 Difference]: Without dead ends: 507 [2019-12-07 16:04:31,802 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 16:04:31,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2019-12-07 16:04:31,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 407. [2019-12-07 16:04:31,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2019-12-07 16:04:31,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 596 transitions. [2019-12-07 16:04:31,808 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 596 transitions. Word has length 88 [2019-12-07 16:04:31,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:04:31,808 INFO L462 AbstractCegarLoop]: Abstraction has 407 states and 596 transitions. [2019-12-07 16:04:31,808 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:04:31,808 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 596 transitions. [2019-12-07 16:04:31,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-12-07 16:04:31,809 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:04:31,809 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 16:04:31,809 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:04:31,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:04:31,809 INFO L82 PathProgramCache]: Analyzing trace with hash 994754656, now seen corresponding path program 1 times [2019-12-07 16:04:31,810 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:04:31,810 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498974792] [2019-12-07 16:04:31,810 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:04:31,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:04:31,846 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 16:04:31,846 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498974792] [2019-12-07 16:04:31,846 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:04:31,846 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:04:31,846 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459347875] [2019-12-07 16:04:31,847 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:04:31,847 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:04:31,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:04:31,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:04:31,847 INFO L87 Difference]: Start difference. First operand 407 states and 596 transitions. Second operand 4 states. [2019-12-07 16:04:32,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:04:32,061 INFO L93 Difference]: Finished difference Result 824 states and 1205 transitions. [2019-12-07 16:04:32,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:04:32,062 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-12-07 16:04:32,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:04:32,063 INFO L225 Difference]: With dead ends: 824 [2019-12-07 16:04:32,063 INFO L226 Difference]: Without dead ends: 427 [2019-12-07 16:04:32,064 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 16:04:32,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2019-12-07 16:04:32,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 407. [2019-12-07 16:04:32,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2019-12-07 16:04:32,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 594 transitions. [2019-12-07 16:04:32,069 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 594 transitions. Word has length 88 [2019-12-07 16:04:32,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:04:32,070 INFO L462 AbstractCegarLoop]: Abstraction has 407 states and 594 transitions. [2019-12-07 16:04:32,070 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:04:32,070 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 594 transitions. [2019-12-07 16:04:32,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-12-07 16:04:32,070 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:04:32,071 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 16:04:32,071 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:04:32,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:04:32,071 INFO L82 PathProgramCache]: Analyzing trace with hash -433365501, now seen corresponding path program 1 times [2019-12-07 16:04:32,071 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:04:32,071 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396765680] [2019-12-07 16:04:32,071 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:04:32,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:04:32,110 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 16:04:32,110 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396765680] [2019-12-07 16:04:32,110 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:04:32,110 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:04:32,110 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467730465] [2019-12-07 16:04:32,111 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:04:32,111 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:04:32,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:04:32,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:04:32,111 INFO L87 Difference]: Start difference. First operand 407 states and 594 transitions. Second operand 4 states. [2019-12-07 16:04:32,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:04:32,373 INFO L93 Difference]: Finished difference Result 904 states and 1322 transitions. [2019-12-07 16:04:32,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:04:32,374 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 89 [2019-12-07 16:04:32,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:04:32,376 INFO L225 Difference]: With dead ends: 904 [2019-12-07 16:04:32,376 INFO L226 Difference]: Without dead ends: 507 [2019-12-07 16:04:32,376 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 16:04:32,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2019-12-07 16:04:32,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 407. [2019-12-07 16:04:32,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2019-12-07 16:04:32,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 592 transitions. [2019-12-07 16:04:32,382 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 592 transitions. Word has length 89 [2019-12-07 16:04:32,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:04:32,382 INFO L462 AbstractCegarLoop]: Abstraction has 407 states and 592 transitions. [2019-12-07 16:04:32,382 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:04:32,382 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 592 transitions. [2019-12-07 16:04:32,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-12-07 16:04:32,383 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:04:32,383 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 16:04:32,383 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:04:32,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:04:32,383 INFO L82 PathProgramCache]: Analyzing trace with hash -185219007, now seen corresponding path program 1 times [2019-12-07 16:04:32,384 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:04:32,384 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691038291] [2019-12-07 16:04:32,384 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:04:32,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:04:32,416 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 16:04:32,416 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691038291] [2019-12-07 16:04:32,416 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:04:32,416 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:04:32,417 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54779104] [2019-12-07 16:04:32,417 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:04:32,417 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:04:32,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:04:32,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:04:32,417 INFO L87 Difference]: Start difference. First operand 407 states and 592 transitions. Second operand 3 states. [2019-12-07 16:04:32,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:04:32,439 INFO L93 Difference]: Finished difference Result 806 states and 1179 transitions. [2019-12-07 16:04:32,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:04:32,440 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 89 [2019-12-07 16:04:32,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:04:32,442 INFO L225 Difference]: With dead ends: 806 [2019-12-07 16:04:32,442 INFO L226 Difference]: Without dead ends: 556 [2019-12-07 16:04:32,442 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 16:04:32,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2019-12-07 16:04:32,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 556. [2019-12-07 16:04:32,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 556 states. [2019-12-07 16:04:32,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 809 transitions. [2019-12-07 16:04:32,449 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 809 transitions. Word has length 89 [2019-12-07 16:04:32,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:04:32,450 INFO L462 AbstractCegarLoop]: Abstraction has 556 states and 809 transitions. [2019-12-07 16:04:32,450 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:04:32,450 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 809 transitions. [2019-12-07 16:04:32,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-12-07 16:04:32,450 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:04:32,451 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 16:04:32,451 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:04:32,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:04:32,451 INFO L82 PathProgramCache]: Analyzing trace with hash 1027809079, now seen corresponding path program 1 times [2019-12-07 16:04:32,451 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:04:32,451 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521020879] [2019-12-07 16:04:32,451 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:04:32,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:04:32,482 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 16:04:32,482 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521020879] [2019-12-07 16:04:32,482 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:04:32,483 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:04:32,483 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882016040] [2019-12-07 16:04:32,483 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:04:32,483 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:04:32,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:04:32,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:04:32,483 INFO L87 Difference]: Start difference. First operand 556 states and 809 transitions. Second operand 3 states. [2019-12-07 16:04:32,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:04:32,509 INFO L93 Difference]: Finished difference Result 1104 states and 1613 transitions. [2019-12-07 16:04:32,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:04:32,509 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 91 [2019-12-07 16:04:32,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:04:32,512 INFO L225 Difference]: With dead ends: 1104 [2019-12-07 16:04:32,512 INFO L226 Difference]: Without dead ends: 705 [2019-12-07 16:04:32,512 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 16:04:32,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 705 states. [2019-12-07 16:04:32,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 705 to 705. [2019-12-07 16:04:32,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 705 states. [2019-12-07 16:04:32,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 705 states to 705 states and 1027 transitions. [2019-12-07 16:04:32,524 INFO L78 Accepts]: Start accepts. Automaton has 705 states and 1027 transitions. Word has length 91 [2019-12-07 16:04:32,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:04:32,524 INFO L462 AbstractCegarLoop]: Abstraction has 705 states and 1027 transitions. [2019-12-07 16:04:32,524 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:04:32,524 INFO L276 IsEmpty]: Start isEmpty. Operand 705 states and 1027 transitions. [2019-12-07 16:04:32,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-12-07 16:04:32,525 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:04:32,525 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 16:04:32,525 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:04:32,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:04:32,526 INFO L82 PathProgramCache]: Analyzing trace with hash 1254631592, now seen corresponding path program 1 times [2019-12-07 16:04:32,526 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:04:32,526 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894858643] [2019-12-07 16:04:32,526 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:04:32,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 16:04:32,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 16:04:32,800 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 16:04:32,800 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 16:04:32,865 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 04:04:32 BoogieIcfgContainer [2019-12-07 16:04:32,865 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 16:04:32,865 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 16:04:32,865 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 16:04:32,866 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 16:04:32,866 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 04:04:25" (3/4) ... [2019-12-07 16:04:32,868 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-12-07 16:04:32,868 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 16:04:32,870 INFO L168 Benchmark]: Toolchain (without parser) took 8919.56 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 216.5 MB). Free memory was 932.6 MB in the beginning and 1.2 GB in the end (delta: -233.3 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 16:04:32,870 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 955.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 16:04:32,870 INFO L168 Benchmark]: CACSL2BoogieTranslator took 417.35 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 90.7 MB). Free memory was 932.6 MB in the beginning and 1.1 GB in the end (delta: -135.0 MB). Peak memory consumption was 23.9 MB. Max. memory is 11.5 GB. [2019-12-07 16:04:32,870 INFO L168 Benchmark]: Boogie Procedure Inliner took 56.68 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 16:04:32,871 INFO L168 Benchmark]: Boogie Preprocessor took 50.78 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: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 11.5 GB. [2019-12-07 16:04:32,871 INFO L168 Benchmark]: RCFGBuilder took 667.55 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 959.8 MB in the end (delta: 91.7 MB). Peak memory consumption was 91.7 MB. Max. memory is 11.5 GB. [2019-12-07 16:04:32,871 INFO L168 Benchmark]: TraceAbstraction took 7721.28 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 125.8 MB). Free memory was 959.8 MB in the beginning and 1.2 GB in the end (delta: -206.1 MB). Peak memory consumption was 293.2 MB. Max. memory is 11.5 GB. [2019-12-07 16:04:32,871 INFO L168 Benchmark]: Witness Printer took 2.95 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 16:04:32,873 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 955.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 417.35 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 90.7 MB). Free memory was 932.6 MB in the beginning and 1.1 GB in the end (delta: -135.0 MB). Peak memory consumption was 23.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 56.68 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 50.78 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: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 667.55 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 959.8 MB in the end (delta: 91.7 MB). Peak memory consumption was 91.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 7721.28 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 125.8 MB). Free memory was 959.8 MB in the beginning and 1.2 GB in the end (delta: -206.1 MB). Peak memory consumption was 293.2 MB. Max. memory is 11.5 GB. * Witness Printer took 2.95 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 1641]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of bitwiseAnd at line 1336. Possible FailurePath: [L1042] static int init = 1; [L1043] static SSL_METHOD SSLv3_client_data ; VAL [init=1, SSLv3_client_data={9:0}] [L1065] SSL *s = (SSL*)malloc(sizeof(SSL)) ; [L1069] s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1070] s->ctx = malloc(sizeof(SSL_CTX)) [L1071] s->session = malloc(sizeof(SSL_SESSION)) [L1072] s->state = 12292 [L1073] s->version = __VERIFIER_nondet_int() [L1080] BUF_MEM *buf ; [L1081] unsigned long tmp ; [L1082] unsigned long l ; [L1083] long num1 ; [L1084] void (*cb)() ; [L1085] int ret ; [L1086] int new_state ; [L1087] int state ; [L1088] int skip ; [L1089] int tmp___1 = __VERIFIER_nondet_int() ; [L1090] int tmp___2 = __VERIFIER_nondet_int() ; [L1091] int tmp___3 = __VERIFIER_nondet_int() ; [L1092] int tmp___4 = __VERIFIER_nondet_int() ; [L1093] int tmp___5 = __VERIFIER_nondet_int() ; [L1094] int tmp___6 = __VERIFIER_nondet_int() ; [L1095] int tmp___7 = __VERIFIER_nondet_int() ; [L1096] int tmp___8 = __VERIFIER_nondet_int() ; [L1097] long tmp___9 = __VERIFIER_nondet_long() ; [L1098] int blastFlag ; [L1101] blastFlag = 0 [L1102] s->hit=__VERIFIER_nondet_int () [L1103] s->state = 12292 [L1104] tmp = __VERIFIER_nondet_int() [L1105] cb = (void (*)())((void *)0) [L1106] ret = -1 [L1107] skip = 0 [L1108] EXPR s->info_callback VAL [init=1, SSLv3_client_data={9:0}] [L1108] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1109] EXPR s->info_callback [L1109] cb = s->info_callback [L1117] EXPR s->in_handshake [L1117] s->in_handshake += 1 [L1118] COND FALSE !(tmp___1 & 12288) VAL [init=1, SSLv3_client_data={9:0}] [L1128] COND TRUE 1 VAL [init=1, SSLv3_client_data={9:0}] [L1130] EXPR s->state [L1130] state = s->state [L1131] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1131] COND TRUE s->state == 12292 [L1234] s->new_session = 1 [L1235] s->state = 4096 [L1236] EXPR s->ctx [L1236] EXPR (s->ctx)->stats.sess_connect_renegotiate [L1236] (s->ctx)->stats.sess_connect_renegotiate += 1 [L1241] s->server = 0 VAL [init=1, SSLv3_client_data={9:0}] [L1242] COND TRUE (unsigned long )cb != (unsigned long )((void *)0) VAL [init=1, SSLv3_client_data={9:0}] [L1247] EXPR s->version VAL [init=1, SSLv3_client_data={9:0}] [L1247] COND FALSE !((s->version & 65280) != 768) [L1253] s->type = 4096 [L1254] EXPR s->init_buf VAL [init=1, SSLv3_client_data={9:0}] [L1254] COND FALSE !((unsigned long )s->init_buf == (unsigned long )((void *)0)) [L1272] COND FALSE !(! tmp___4) VAL [init=1, SSLv3_client_data={9:0}] [L1278] COND FALSE !(! tmp___5) [L1284] s->state = 4368 [L1285] EXPR s->ctx [L1285] EXPR (s->ctx)->stats.sess_connect [L1285] (s->ctx)->stats.sess_connect += 1 [L1286] s->init_num = 0 VAL [init=1, SSLv3_client_data={9:0}] [L1600] EXPR s->s3 [L1600] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_client_data={9:0}] [L1600] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1629] skip = 0 VAL [init=1, SSLv3_client_data={9:0}] [L1128] COND TRUE 1 VAL [init=1, SSLv3_client_data={9:0}] [L1130] EXPR s->state [L1130] state = s->state [L1131] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1131] COND FALSE !(s->state == 12292) [L1134] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1134] COND FALSE !(s->state == 16384) [L1137] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1137] COND FALSE !(s->state == 4096) [L1140] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1140] COND FALSE !(s->state == 20480) [L1143] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1143] COND FALSE !(s->state == 4099) [L1146] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1146] COND TRUE s->state == 4368 [L1290] s->shutdown = 0 [L1291] ret = __VERIFIER_nondet_int() [L1292] COND TRUE blastFlag == 0 [L1293] blastFlag = 1 VAL [init=1, SSLv3_client_data={9:0}] [L1297] COND FALSE !(ret <= 0) [L1302] s->state = 4384 [L1303] s->init_num = 0 [L1304] EXPR s->bbio [L1304] EXPR s->wbio VAL [init=1, SSLv3_client_data={9:0}] [L1304] COND TRUE (unsigned long )s->bbio != (unsigned long )s->wbio [L1600] EXPR s->s3 [L1600] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_client_data={9:0}] [L1600] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1629] skip = 0 VAL [init=1, SSLv3_client_data={9:0}] [L1128] COND TRUE 1 VAL [init=1, SSLv3_client_data={9:0}] [L1130] EXPR s->state [L1130] state = s->state [L1131] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1131] COND FALSE !(s->state == 12292) [L1134] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1134] COND FALSE !(s->state == 16384) [L1137] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1137] COND FALSE !(s->state == 4096) [L1140] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1140] COND FALSE !(s->state == 20480) [L1143] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1143] COND FALSE !(s->state == 4099) [L1146] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1146] COND FALSE !(s->state == 4368) [L1149] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1149] COND FALSE !(s->state == 4369) [L1152] EXPR s->state VAL [init=1, SSLv3_client_data={9:0}] [L1152] COND TRUE s->state == 4384 [L1312] ret = __VERIFIER_nondet_int() [L1313] COND TRUE blastFlag == 1 [L1314] blastFlag = 2 VAL [init=1, SSLv3_client_data={9:0}] [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.6s, OverallIterations: 24, TraceHistogramMax: 6, AutomataDifference: 5.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 4903 SDtfs, 1790 SDslu, 6305 SDs, 0 SdLazy, 3605 SolverSat, 135 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.5s 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, 1525 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 1918 NumberOfCodeBlocks, 1918 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 1783 ConstructedInterpolants, 0 QuantifiedInterpolants, 373356 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 23 InterpolantComputations, 23 PerfectInterpolantSequences, 1532/1532 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.25-f470102 [2019-12-07 16:04:34,226 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 16:04:34,227 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 16:04:34,235 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 16:04:34,235 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 16:04:34,236 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 16:04:34,237 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 16:04:34,238 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 16:04:34,239 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 16:04:34,240 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 16:04:34,241 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 16:04:34,241 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 16:04:34,242 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 16:04:34,242 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 16:04:34,243 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 16:04:34,244 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 16:04:34,244 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 16:04:34,245 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 16:04:34,246 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 16:04:34,248 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 16:04:34,249 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 16:04:34,250 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 16:04:34,250 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 16:04:34,251 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 16:04:34,253 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 16:04:34,253 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 16:04:34,253 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 16:04:34,254 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 16:04:34,254 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 16:04:34,255 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 16:04:34,255 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 16:04:34,255 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 16:04:34,256 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 16:04:34,256 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 16:04:34,257 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 16:04:34,257 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 16:04:34,257 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 16:04:34,258 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 16:04:34,258 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 16:04:34,258 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 16:04:34,259 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 16:04:34,260 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_2fb571f0-c533-4462-b3d8-9c5ca00d3182/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-12-07 16:04:34,269 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 16:04:34,270 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 16:04:34,270 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 16:04:34,271 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 16:04:34,271 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 16:04:34,271 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 16:04:34,271 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 16:04:34,271 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 16:04:34,271 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 16:04:34,271 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 16:04:34,271 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 16:04:34,272 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 16:04:34,272 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-12-07 16:04:34,272 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-12-07 16:04:34,272 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 16:04:34,272 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 16:04:34,272 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 16:04:34,272 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 16:04:34,273 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 16:04:34,273 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 16:04:34,273 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 16:04:34,273 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 16:04:34,273 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 16:04:34,273 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 16:04:34,273 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 16:04:34,273 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 16:04:34,274 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-12-07 16:04:34,274 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-12-07 16:04:34,274 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 16:04:34,274 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 16:04:34,274 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 16:04:34,274 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_2fb571f0-c533-4462-b3d8-9c5ca00d3182/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 -> ed035556db4b60d2bb3e3e70af5f975a04e628c4 [2019-12-07 16:04:34,444 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 16:04:34,451 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 16:04:34,454 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 16:04:34,455 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 16:04:34,455 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 16:04:34,455 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_2fb571f0-c533-4462-b3d8-9c5ca00d3182/bin/uautomizer/../../sv-benchmarks/c/ssh/s3_clnt.blast.03.i.cil-1.c [2019-12-07 16:04:34,493 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_2fb571f0-c533-4462-b3d8-9c5ca00d3182/bin/uautomizer/data/dc3c19e0f/9c67ebb2bdea464cb79090d38a71662a/FLAG0d9c5ec9c [2019-12-07 16:04:34,880 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 16:04:34,880 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_2fb571f0-c533-4462-b3d8-9c5ca00d3182/sv-benchmarks/c/ssh/s3_clnt.blast.03.i.cil-1.c [2019-12-07 16:04:34,892 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_2fb571f0-c533-4462-b3d8-9c5ca00d3182/bin/uautomizer/data/dc3c19e0f/9c67ebb2bdea464cb79090d38a71662a/FLAG0d9c5ec9c [2019-12-07 16:04:34,901 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_2fb571f0-c533-4462-b3d8-9c5ca00d3182/bin/uautomizer/data/dc3c19e0f/9c67ebb2bdea464cb79090d38a71662a [2019-12-07 16:04:34,903 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 16:04:34,904 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 16:04:34,905 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 16:04:34,905 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 16:04:34,907 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 16:04:34,907 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 04:04:34" (1/1) ... [2019-12-07 16:04:34,909 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@171b6e36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:04:34, skipping insertion in model container [2019-12-07 16:04:34,909 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 04:04:34" (1/1) ... [2019-12-07 16:04:34,914 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 16:04:34,948 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 16:04:35,238 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 16:04:35,254 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 16:04:35,342 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 16:04:35,361 INFO L208 MainTranslator]: Completed translation [2019-12-07 16:04:35,361 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:04:35 WrapperNode [2019-12-07 16:04:35,362 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 16:04:35,362 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 16:04:35,362 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 16:04:35,362 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 16:04:35,368 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:04:35" (1/1) ... [2019-12-07 16:04:35,391 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:04:35" (1/1) ... [2019-12-07 16:04:35,428 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 16:04:35,429 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 16:04:35,429 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 16:04:35,429 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 16:04:35,437 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:04:35" (1/1) ... [2019-12-07 16:04:35,437 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:04:35" (1/1) ... [2019-12-07 16:04:35,445 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:04:35" (1/1) ... [2019-12-07 16:04:35,445 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:04:35" (1/1) ... [2019-12-07 16:04:35,479 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:04:35" (1/1) ... [2019-12-07 16:04:35,486 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:04:35" (1/1) ... [2019-12-07 16:04:35,490 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:04:35" (1/1) ... [2019-12-07 16:04:35,495 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 16:04:35,496 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 16:04:35,496 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 16:04:35,496 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 16:04:35,497 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:04:35" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2fb571f0-c533-4462-b3d8-9c5ca00d3182/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 16:04:35,539 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-12-07 16:04:35,539 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 16:04:35,539 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-12-07 16:04:35,539 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-12-07 16:04:35,540 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-12-07 16:04:35,540 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 16:04:35,540 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 16:04:35,540 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-12-07 16:04:35,670 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-12-07 16:04:37,386 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2019-12-07 16:04:37,386 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2019-12-07 16:04:37,387 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 16:04:37,387 INFO L287 CfgBuilder]: Removed 7 assume(true) statements. [2019-12-07 16:04:37,388 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 04:04:37 BoogieIcfgContainer [2019-12-07 16:04:37,388 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 16:04:37,389 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 16:04:37,389 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 16:04:37,391 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 16:04:37,391 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 04:04:34" (1/3) ... [2019-12-07 16:04:37,391 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32ab883 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 04:04:37, skipping insertion in model container [2019-12-07 16:04:37,391 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:04:35" (2/3) ... [2019-12-07 16:04:37,392 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32ab883 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 04:04:37, skipping insertion in model container [2019-12-07 16:04:37,392 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 04:04:37" (3/3) ... [2019-12-07 16:04:37,393 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_clnt.blast.03.i.cil-1.c [2019-12-07 16:04:37,399 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 16:04:37,404 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 16:04:37,411 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 16:04:37,427 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 16:04:37,427 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 16:04:37,428 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 16:04:37,428 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 16:04:37,428 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 16:04:37,428 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 16:04:37,428 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 16:04:37,429 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 16:04:37,442 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states. [2019-12-07 16:04:37,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-07 16:04:37,447 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:04:37,448 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 16:04:37,448 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:04:37,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:04:37,452 INFO L82 PathProgramCache]: Analyzing trace with hash -1457695037, now seen corresponding path program 1 times [2019-12-07 16:04:37,460 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 16:04:37,460 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [475674758] [2019-12-07 16:04:37,460 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2fb571f0-c533-4462-b3d8-9c5ca00d3182/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 16:04:37,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:04:37,570 INFO L264 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 16:04:37,575 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:04:37,603 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 16:04:37,603 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:04:37,617 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 16:04:37,618 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [475674758] [2019-12-07 16:04:37,619 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:04:37,619 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-12-07 16:04:37,620 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279155929] [2019-12-07 16:04:37,624 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:04:37,624 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 16:04:37,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:04:37,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:04:37,637 INFO L87 Difference]: Start difference. First operand 129 states. Second operand 4 states. [2019-12-07 16:04:37,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:04:37,733 INFO L93 Difference]: Finished difference Result 485 states and 820 transitions. [2019-12-07 16:04:37,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:04:37,734 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2019-12-07 16:04:37,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:04:37,745 INFO L225 Difference]: With dead ends: 485 [2019-12-07 16:04:37,746 INFO L226 Difference]: Without dead ends: 312 [2019-12-07 16:04:37,748 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 16:04:37,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2019-12-07 16:04:37,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 312. [2019-12-07 16:04:37,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 312 states. [2019-12-07 16:04:37,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 467 transitions. [2019-12-07 16:04:37,795 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 467 transitions. Word has length 24 [2019-12-07 16:04:37,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:04:37,796 INFO L462 AbstractCegarLoop]: Abstraction has 312 states and 467 transitions. [2019-12-07 16:04:37,796 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:04:37,796 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 467 transitions. [2019-12-07 16:04:37,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-07 16:04:37,799 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:04:37,799 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 16:04:38,000 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-12-07 16:04:38,000 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:04:38,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:04:38,001 INFO L82 PathProgramCache]: Analyzing trace with hash -1854239308, now seen corresponding path program 1 times [2019-12-07 16:04:38,002 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 16:04:38,002 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [86373200] [2019-12-07 16:04:38,003 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2fb571f0-c533-4462-b3d8-9c5ca00d3182/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 16:04:38,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:04:38,200 INFO L264 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 16:04:38,203 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:04:38,214 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 16:04:38,215 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:04:38,227 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 16:04:38,227 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [86373200] [2019-12-07 16:04:38,228 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:04:38,228 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-12-07 16:04:38,228 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721085774] [2019-12-07 16:04:38,229 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:04:38,229 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 16:04:38,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:04:38,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:04:38,230 INFO L87 Difference]: Start difference. First operand 312 states and 467 transitions. Second operand 4 states. [2019-12-07 16:04:40,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:04:40,300 INFO L93 Difference]: Finished difference Result 716 states and 1078 transitions. [2019-12-07 16:04:40,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:04:40,301 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2019-12-07 16:04:40,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:04:40,305 INFO L225 Difference]: With dead ends: 716 [2019-12-07 16:04:40,305 INFO L226 Difference]: Without dead ends: 512 [2019-12-07 16:04:40,307 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 16:04:40,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2019-12-07 16:04:40,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 512. [2019-12-07 16:04:40,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 512 states. [2019-12-07 16:04:40,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 764 transitions. [2019-12-07 16:04:40,342 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 764 transitions. Word has length 60 [2019-12-07 16:04:40,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:04:40,342 INFO L462 AbstractCegarLoop]: Abstraction has 512 states and 764 transitions. [2019-12-07 16:04:40,342 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:04:40,342 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 764 transitions. [2019-12-07 16:04:40,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-07 16:04:40,348 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:04:40,348 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 16:04:40,549 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-12-07 16:04:40,550 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:04:40,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:04:40,551 INFO L82 PathProgramCache]: Analyzing trace with hash 922615118, now seen corresponding path program 1 times [2019-12-07 16:04:40,552 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 16:04:40,553 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1944781776] [2019-12-07 16:04:40,553 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2fb571f0-c533-4462-b3d8-9c5ca00d3182/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 16:04:40,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:04:40,769 INFO L264 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 16:04:40,774 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:05:07,351 WARN L192 SmtUtils]: Spent 26.54 s on a formula simplification. DAG size of input: 54 DAG size of output: 38 [2019-12-07 16:05:07,352 INFO L343 Elim1Store]: treesize reduction 140, result has 40.9 percent of original size [2019-12-07 16:05:07,353 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 16:05:07,353 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:05:23,628 WARN L192 SmtUtils]: Spent 16.27 s on a formula simplification. DAG size of input: 40 DAG size of output: 37 [2019-12-07 16:05:23,629 INFO L614 ElimStorePlain]: treesize reduction 18, result has 83.0 percent of original size [2019-12-07 16:05:23,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:05:23,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:05:23,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:05:23,639 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 16:05:23,640 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:44, output treesize:9 [2019-12-07 16:05:23,664 INFO L343 Elim1Store]: treesize reduction 41, result has 18.0 percent of original size [2019-12-07 16:05:23,664 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 16:05:23,665 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:05:23,668 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:05:23,668 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:05:23,669 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:11 [2019-12-07 16:05:23,673 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 16:05:23,673 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:05:23,675 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:05:23,675 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 16:05:23,676 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:21, output treesize:5 [2019-12-07 16:05:23,706 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 16:05:23,707 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:05:23,729 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 16:05:23,730 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1944781776] [2019-12-07 16:05:23,730 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:05:23,730 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-12-07 16:05:23,730 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662521495] [2019-12-07 16:05:23,730 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:05:23,731 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 16:05:23,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:05:23,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:05:23,731 INFO L87 Difference]: Start difference. First operand 512 states and 764 transitions. Second operand 4 states. [2019-12-07 16:05:25,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:05:25,500 INFO L93 Difference]: Finished difference Result 1021 states and 1522 transitions. [2019-12-07 16:05:25,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:05:25,501 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-12-07 16:05:25,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:05:25,504 INFO L225 Difference]: With dead ends: 1021 [2019-12-07 16:05:25,504 INFO L226 Difference]: Without dead ends: 516 [2019-12-07 16:05:25,505 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 16:05:25,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2019-12-07 16:05:25,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 515. [2019-12-07 16:05:25,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 515 states. [2019-12-07 16:05:25,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 767 transitions. [2019-12-07 16:05:25,519 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 767 transitions. Word has length 98 [2019-12-07 16:05:25,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:05:25,519 INFO L462 AbstractCegarLoop]: Abstraction has 515 states and 767 transitions. [2019-12-07 16:05:25,519 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:05:25,519 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 767 transitions. [2019-12-07 16:05:25,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-12-07 16:05:25,522 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:05:25,522 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 16:05:25,722 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-12-07 16:05:25,723 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:05:25,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:05:25,723 INFO L82 PathProgramCache]: Analyzing trace with hash -1354155866, now seen corresponding path program 1 times [2019-12-07 16:05:25,725 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 16:05:25,725 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1337431394] [2019-12-07 16:05:25,726 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2fb571f0-c533-4462-b3d8-9c5ca00d3182/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 16:05:25,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:05:25,965 INFO L264 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 16:05:25,969 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:05:25,975 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 16:05:25,976 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:05:25,979 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:05:25,980 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:05:25,980 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 16:05:26,001 INFO L343 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-12-07 16:05:26,001 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 16:05:26,002 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:05:26,009 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:05:26,010 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:05:26,010 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2019-12-07 16:05:26,028 INFO L343 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-12-07 16:05:26,028 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 16:05:26,028 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:05:26,030 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:05:26,030 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 16:05:26,030 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2019-12-07 16:05:26,047 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 16:05:26,047 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:05:26,084 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 16:05:26,084 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1337431394] [2019-12-07 16:05:26,084 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:05:26,084 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [] total 7 [2019-12-07 16:05:26,084 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709997239] [2019-12-07 16:05:26,085 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 16:05:26,085 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 16:05:26,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 16:05:26,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 16:05:26,085 INFO L87 Difference]: Start difference. First operand 515 states and 767 transitions. Second operand 7 states. [2019-12-07 16:05:36,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:05:36,910 INFO L93 Difference]: Finished difference Result 1748 states and 2616 transitions. [2019-12-07 16:05:36,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 16:05:36,912 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 112 [2019-12-07 16:05:36,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:05:36,919 INFO L225 Difference]: With dead ends: 1748 [2019-12-07 16:05:36,919 INFO L226 Difference]: Without dead ends: 1243 [2019-12-07 16:05:36,921 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 16:05:36,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1243 states. [2019-12-07 16:05:36,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1243 to 618. [2019-12-07 16:05:36,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 618 states. [2019-12-07 16:05:36,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 940 transitions. [2019-12-07 16:05:36,949 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 940 transitions. Word has length 112 [2019-12-07 16:05:36,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:05:36,950 INFO L462 AbstractCegarLoop]: Abstraction has 618 states and 940 transitions. [2019-12-07 16:05:36,950 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 16:05:36,950 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 940 transitions. [2019-12-07 16:05:36,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-12-07 16:05:36,952 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:05:36,952 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 16:05:37,153 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-12-07 16:05:37,153 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:05:37,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:05:37,153 INFO L82 PathProgramCache]: Analyzing trace with hash 1254631592, now seen corresponding path program 1 times [2019-12-07 16:05:37,154 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 16:05:37,154 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [573546424] [2019-12-07 16:05:37,154 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2fb571f0-c533-4462-b3d8-9c5ca00d3182/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 16:05:37,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 16:05:37,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 16:05:38,045 INFO L174 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2019-12-07 16:05:38,045 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 16:05:38,245 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2019-12-07 16:05:38,367 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 04:05:38 BoogieIcfgContainer [2019-12-07 16:05:38,367 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 16:05:38,367 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 16:05:38,367 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 16:05:38,367 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 16:05:38,368 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 04:04:37" (3/4) ... [2019-12-07 16:05:38,370 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 16:05:38,440 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_2fb571f0-c533-4462-b3d8-9c5ca00d3182/bin/uautomizer/witness.graphml [2019-12-07 16:05:38,440 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 16:05:38,441 INFO L168 Benchmark]: Toolchain (without parser) took 63537.27 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 210.8 MB). Free memory was 945.7 MB in the beginning and 862.2 MB in the end (delta: 83.5 MB). Peak memory consumption was 294.3 MB. Max. memory is 11.5 GB. [2019-12-07 16:05:38,441 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 16:05:38,442 INFO L168 Benchmark]: CACSL2BoogieTranslator took 457.15 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.6 MB). Free memory was 945.7 MB in the beginning and 1.1 GB in the end (delta: -159.2 MB). Peak memory consumption was 28.3 MB. Max. memory is 11.5 GB. [2019-12-07 16:05:38,442 INFO L168 Benchmark]: Boogie Procedure Inliner took 66.49 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: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. [2019-12-07 16:05:38,442 INFO L168 Benchmark]: Boogie Preprocessor took 66.68 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: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. [2019-12-07 16:05:38,442 INFO L168 Benchmark]: RCFGBuilder took 1892.31 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: 84.6 MB). Peak memory consumption was 84.6 MB. Max. memory is 11.5 GB. [2019-12-07 16:05:38,442 INFO L168 Benchmark]: TraceAbstraction took 60978.33 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 79.2 MB). Free memory was 999.4 MB in the beginning and 870.0 MB in the end (delta: 129.4 MB). Peak memory consumption was 208.6 MB. Max. memory is 11.5 GB. [2019-12-07 16:05:38,443 INFO L168 Benchmark]: Witness Printer took 73.03 ms. Allocated memory is still 1.2 GB. Free memory was 870.0 MB in the beginning and 862.2 MB in the end (delta: 7.8 MB). Peak memory consumption was 7.8 MB. Max. memory is 11.5 GB. [2019-12-07 16:05:38,444 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 457.15 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.6 MB). Free memory was 945.7 MB in the beginning and 1.1 GB in the end (delta: -159.2 MB). Peak memory consumption was 28.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 66.49 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: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 66.68 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: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1892.31 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: 84.6 MB). Peak memory consumption was 84.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 60978.33 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 79.2 MB). Free memory was 999.4 MB in the beginning and 870.0 MB in the end (delta: 129.4 MB). Peak memory consumption was 208.6 MB. Max. memory is 11.5 GB. * Witness Printer took 73.03 ms. Allocated memory is still 1.2 GB. Free memory was 870.0 MB in the beginning and 862.2 MB in the end (delta: 7.8 MB). Peak memory consumption was 7.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1641]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L1042] static int init = 1; [L1043] static SSL_METHOD SSLv3_client_data ; VAL [init=1, SSLv3_client_data={15:0}] [L1065] SSL *s = (SSL*)malloc(sizeof(SSL)) ; [L1069] s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1070] s->ctx = malloc(sizeof(SSL_CTX)) [L1071] s->session = malloc(sizeof(SSL_SESSION)) [L1072] s->state = 12292 [L1073] s->version = __VERIFIER_nondet_int() [L1080] BUF_MEM *buf ; [L1081] unsigned long tmp ; [L1082] unsigned long l ; [L1083] long num1 ; [L1084] void (*cb)() ; [L1085] int ret ; [L1086] int new_state ; [L1087] int state ; [L1088] int skip ; [L1089] int tmp___1 = __VERIFIER_nondet_int() ; [L1090] int tmp___2 = __VERIFIER_nondet_int() ; [L1091] int tmp___3 = __VERIFIER_nondet_int() ; [L1092] int tmp___4 = __VERIFIER_nondet_int() ; [L1093] int tmp___5 = __VERIFIER_nondet_int() ; [L1094] int tmp___6 = __VERIFIER_nondet_int() ; [L1095] int tmp___7 = __VERIFIER_nondet_int() ; [L1096] int tmp___8 = __VERIFIER_nondet_int() ; [L1097] long tmp___9 = __VERIFIER_nondet_long() ; [L1098] int blastFlag ; [L1101] blastFlag = 0 [L1102] s->hit=__VERIFIER_nondet_int () [L1103] s->state = 12292 [L1104] tmp = __VERIFIER_nondet_int() [L1105] cb = (void (*)())((void *)0) [L1106] ret = -1 [L1107] skip = 0 [L1108] EXPR s->info_callback VAL [init=1, SSLv3_client_data={15:0}] [L1108] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1109] EXPR s->info_callback [L1109] cb = s->info_callback [L1117] EXPR s->in_handshake [L1117] s->in_handshake += 1 [L1118] COND FALSE !(tmp___1 & 12288) VAL [init=1, SSLv3_client_data={15:0}] [L1128] COND TRUE 1 VAL [init=1, SSLv3_client_data={15:0}] [L1130] EXPR s->state [L1130] state = s->state [L1131] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1131] COND TRUE s->state == 12292 [L1234] s->new_session = 1 [L1235] s->state = 4096 [L1236] EXPR s->ctx [L1236] EXPR (s->ctx)->stats.sess_connect_renegotiate [L1236] (s->ctx)->stats.sess_connect_renegotiate += 1 [L1241] s->server = 0 VAL [init=1, SSLv3_client_data={15:0}] [L1242] COND TRUE (unsigned long )cb != (unsigned long )((void *)0) VAL [init=1, SSLv3_client_data={15:0}] [L1247] EXPR s->version VAL [init=1, SSLv3_client_data={15:0}] [L1247] COND FALSE !((s->version & 65280) != 768) [L1253] s->type = 4096 [L1254] EXPR s->init_buf VAL [init=1, SSLv3_client_data={15:0}] [L1254] COND FALSE !((unsigned long )s->init_buf == (unsigned long )((void *)0)) [L1272] COND FALSE !(! tmp___4) VAL [init=1, SSLv3_client_data={15:0}] [L1278] COND FALSE !(! tmp___5) [L1284] s->state = 4368 [L1285] EXPR s->ctx [L1285] EXPR (s->ctx)->stats.sess_connect [L1285] (s->ctx)->stats.sess_connect += 1 [L1286] s->init_num = 0 VAL [init=1, SSLv3_client_data={15:0}] [L1600] EXPR s->s3 [L1600] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_client_data={15:0}] [L1600] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1629] skip = 0 VAL [init=1, SSLv3_client_data={15:0}] [L1128] COND TRUE 1 VAL [init=1, SSLv3_client_data={15:0}] [L1130] EXPR s->state [L1130] state = s->state [L1131] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1131] COND FALSE !(s->state == 12292) [L1134] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1134] COND FALSE !(s->state == 16384) [L1137] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1137] COND FALSE !(s->state == 4096) [L1140] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1140] COND FALSE !(s->state == 20480) [L1143] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1143] COND FALSE !(s->state == 4099) [L1146] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1146] COND TRUE s->state == 4368 [L1290] s->shutdown = 0 [L1291] ret = __VERIFIER_nondet_int() [L1292] COND TRUE blastFlag == 0 [L1293] blastFlag = 1 VAL [init=1, SSLv3_client_data={15:0}] [L1297] COND FALSE !(ret <= 0) [L1302] s->state = 4384 [L1303] s->init_num = 0 [L1304] EXPR s->bbio [L1304] EXPR s->wbio VAL [init=1, SSLv3_client_data={15:0}] [L1304] COND TRUE (unsigned long )s->bbio != (unsigned long )s->wbio [L1600] EXPR s->s3 [L1600] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_client_data={15:0}] [L1600] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1629] skip = 0 VAL [init=1, SSLv3_client_data={15:0}] [L1128] COND TRUE 1 VAL [init=1, SSLv3_client_data={15:0}] [L1130] EXPR s->state [L1130] state = s->state [L1131] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1131] COND FALSE !(s->state == 12292) [L1134] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1134] COND FALSE !(s->state == 16384) [L1137] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1137] COND FALSE !(s->state == 4096) [L1140] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1140] COND FALSE !(s->state == 20480) [L1143] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1143] COND FALSE !(s->state == 4099) [L1146] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1146] COND FALSE !(s->state == 4368) [L1149] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1149] COND FALSE !(s->state == 4369) [L1152] EXPR s->state VAL [init=1, SSLv3_client_data={15:0}] [L1152] COND TRUE s->state == 4384 [L1312] ret = __VERIFIER_nondet_int() [L1313] COND TRUE blastFlag == 1 [L1314] blastFlag = 2 VAL [init=1, SSLv3_client_data={15:0}] [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: 60.8s, OverallIterations: 5, TraceHistogramMax: 6, AutomataDifference: 14.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 823 SDtfs, 1037 SDslu, 1322 SDs, 0 SdLazy, 694 SolverSat, 84 SolverUnsat, 3 SolverUnknown, 0 SolverNotchecked, 14.1s 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=618occurred 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.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 626 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 43.2s 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...