./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ssh/s3_srvr.blast.03.i.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 678e0110 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_f172c062-8e40-4e5b-9817-212625c0e236/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_f172c062-8e40-4e5b-9817-212625c0e236/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_f172c062-8e40-4e5b-9817-212625c0e236/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_f172c062-8e40-4e5b-9817-212625c0e236/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh/s3_srvr.blast.03.i.cil.c -s /tmp/vcloud-vcloud-master/worker/run_dir_f172c062-8e40-4e5b-9817-212625c0e236/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_f172c062-8e40-4e5b-9817-212625c0e236/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 09d651c8899349531493fefbd169797d0022b4a3 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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_f172c062-8e40-4e5b-9817-212625c0e236/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_f172c062-8e40-4e5b-9817-212625c0e236/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_f172c062-8e40-4e5b-9817-212625c0e236/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_f172c062-8e40-4e5b-9817-212625c0e236/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh/s3_srvr.blast.03.i.cil.c -s /tmp/vcloud-vcloud-master/worker/run_dir_f172c062-8e40-4e5b-9817-212625c0e236/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_f172c062-8e40-4e5b-9817-212625c0e236/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 09d651c8899349531493fefbd169797d0022b4a3 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-678e011 [2019-11-20 00:46:43,700 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 00:46:43,702 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 00:46:43,716 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 00:46:43,716 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 00:46:43,718 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 00:46:43,719 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 00:46:43,727 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 00:46:43,732 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 00:46:43,736 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 00:46:43,737 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 00:46:43,738 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 00:46:43,738 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 00:46:43,740 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 00:46:43,741 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 00:46:43,742 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 00:46:43,743 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 00:46:43,744 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 00:46:43,746 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 00:46:43,749 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 00:46:43,753 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 00:46:43,754 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 00:46:43,757 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 00:46:43,758 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 00:46:43,760 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 00:46:43,760 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 00:46:43,761 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 00:46:43,762 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 00:46:43,762 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 00:46:43,763 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 00:46:43,763 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 00:46:43,764 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 00:46:43,764 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 00:46:43,765 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 00:46:43,766 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 00:46:43,766 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 00:46:43,767 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 00:46:43,767 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 00:46:43,767 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 00:46:43,768 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 00:46:43,770 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 00:46:43,771 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_f172c062-8e40-4e5b-9817-212625c0e236/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-20 00:46:43,800 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 00:46:43,801 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 00:46:43,808 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 00:46:43,809 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 00:46:43,809 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 00:46:43,809 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 00:46:43,809 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 00:46:43,810 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 00:46:43,810 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 00:46:43,810 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 00:46:43,810 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-20 00:46:43,810 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 00:46:43,811 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-20 00:46:43,811 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 00:46:43,811 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 00:46:43,811 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 00:46:43,811 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-20 00:46:43,811 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 00:46:43,812 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 00:46:43,812 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 00:46:43,812 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 00:46:43,812 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 00:46:43,813 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 00:46:43,813 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 00:46:43,813 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-20 00:46:43,813 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-20 00:46:43,813 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-20 00:46:43,814 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-20 00:46:43,814 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_f172c062-8e40-4e5b-9817-212625c0e236/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 -> 09d651c8899349531493fefbd169797d0022b4a3 [2019-11-20 00:46:43,946 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 00:46:43,956 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 00:46:43,959 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 00:46:43,960 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 00:46:43,960 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 00:46:43,961 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_f172c062-8e40-4e5b-9817-212625c0e236/bin/uautomizer/../../sv-benchmarks/c/ssh/s3_srvr.blast.03.i.cil.c [2019-11-20 00:46:44,013 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_f172c062-8e40-4e5b-9817-212625c0e236/bin/uautomizer/data/6ada0dfef/9c141654e8cc437ea36e9199714e81e9/FLAGd5f2a66cf [2019-11-20 00:46:44,529 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 00:46:44,533 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_f172c062-8e40-4e5b-9817-212625c0e236/sv-benchmarks/c/ssh/s3_srvr.blast.03.i.cil.c [2019-11-20 00:46:44,564 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_f172c062-8e40-4e5b-9817-212625c0e236/bin/uautomizer/data/6ada0dfef/9c141654e8cc437ea36e9199714e81e9/FLAGd5f2a66cf [2019-11-20 00:46:44,781 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_f172c062-8e40-4e5b-9817-212625c0e236/bin/uautomizer/data/6ada0dfef/9c141654e8cc437ea36e9199714e81e9 [2019-11-20 00:46:44,783 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 00:46:44,785 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 00:46:44,785 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 00:46:44,786 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 00:46:44,789 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 00:46:44,790 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 12:46:44" (1/1) ... [2019-11-20 00:46:44,792 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3bdd4980 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:46:44, skipping insertion in model container [2019-11-20 00:46:44,792 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 12:46:44" (1/1) ... [2019-11-20 00:46:44,799 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 00:46:44,863 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 00:46:45,397 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 00:46:45,409 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 00:46:45,546 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 00:46:45,576 INFO L192 MainTranslator]: Completed translation [2019-11-20 00:46:45,576 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:46:45 WrapperNode [2019-11-20 00:46:45,576 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 00:46:45,577 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 00:46:45,577 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 00:46:45,578 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 00:46:45,585 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:46:45" (1/1) ... [2019-11-20 00:46:45,620 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:46:45" (1/1) ... [2019-11-20 00:46:45,675 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 00:46:45,680 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 00:46:45,681 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 00:46:45,681 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 00:46:45,690 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:46:45" (1/1) ... [2019-11-20 00:46:45,690 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:46:45" (1/1) ... [2019-11-20 00:46:45,705 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:46:45" (1/1) ... [2019-11-20 00:46:45,706 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:46:45" (1/1) ... [2019-11-20 00:46:45,780 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:46:45" (1/1) ... [2019-11-20 00:46:45,788 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:46:45" (1/1) ... [2019-11-20 00:46:45,791 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:46:45" (1/1) ... [2019-11-20 00:46:45,796 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 00:46:45,797 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 00:46:45,797 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 00:46:45,797 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 00:46:45,798 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:46:45" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f172c062-8e40-4e5b-9817-212625c0e236/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 00:46:45,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-20 00:46:45,865 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-20 00:46:45,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-20 00:46:45,865 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-20 00:46:45,866 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-20 00:46:45,867 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-20 00:46:45,867 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 00:46:45,867 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 00:46:46,094 WARN L736 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-20 00:46:46,855 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2019-11-20 00:46:46,856 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2019-11-20 00:46:46,857 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 00:46:46,857 INFO L285 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-20 00:46:46,861 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:46:46 BoogieIcfgContainer [2019-11-20 00:46:46,862 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 00:46:46,863 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-20 00:46:46,864 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-20 00:46:46,866 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-20 00:46:46,866 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 12:46:44" (1/3) ... [2019-11-20 00:46:46,867 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1732d6dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 12:46:46, skipping insertion in model container [2019-11-20 00:46:46,868 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:46:45" (2/3) ... [2019-11-20 00:46:46,869 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1732d6dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 12:46:46, skipping insertion in model container [2019-11-20 00:46:46,869 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:46:46" (3/3) ... [2019-11-20 00:46:46,871 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.03.i.cil.c [2019-11-20 00:46:46,879 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-20 00:46:46,887 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-20 00:46:46,897 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-20 00:46:46,920 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-20 00:46:46,920 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-20 00:46:46,920 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-20 00:46:46,920 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 00:46:46,920 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 00:46:46,921 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-20 00:46:46,921 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 00:46:46,921 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-20 00:46:46,942 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states. [2019-11-20 00:46:46,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-20 00:46:46,949 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:46:46,950 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:46:46,950 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:46:46,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:46:46,955 INFO L82 PathProgramCache]: Analyzing trace with hash 522837677, now seen corresponding path program 1 times [2019-11-20 00:46:46,962 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:46:46,962 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082257215] [2019-11-20 00:46:46,962 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:46:47,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:46:47,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:46:47,255 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082257215] [2019-11-20 00:46:47,256 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:46:47,256 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 00:46:47,257 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002465298] [2019-11-20 00:46:47,262 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 00:46:47,262 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:46:47,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 00:46:47,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 00:46:47,280 INFO L87 Difference]: Start difference. First operand 143 states. Second operand 4 states. [2019-11-20 00:46:47,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:46:47,770 INFO L93 Difference]: Finished difference Result 313 states and 527 transitions. [2019-11-20 00:46:47,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 00:46:47,772 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2019-11-20 00:46:47,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:46:47,792 INFO L225 Difference]: With dead ends: 313 [2019-11-20 00:46:47,793 INFO L226 Difference]: Without dead ends: 158 [2019-11-20 00:46:47,798 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 00:46:47,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-11-20 00:46:47,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 141. [2019-11-20 00:46:47,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-11-20 00:46:47,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 216 transitions. [2019-11-20 00:46:47,858 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 216 transitions. Word has length 45 [2019-11-20 00:46:47,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:46:47,859 INFO L462 AbstractCegarLoop]: Abstraction has 141 states and 216 transitions. [2019-11-20 00:46:47,859 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 00:46:47,859 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 216 transitions. [2019-11-20 00:46:47,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-11-20 00:46:47,866 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:46:47,866 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:46:47,866 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:46:47,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:46:47,867 INFO L82 PathProgramCache]: Analyzing trace with hash -428665669, now seen corresponding path program 1 times [2019-11-20 00:46:47,867 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:46:47,867 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343596321] [2019-11-20 00:46:47,868 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:46:47,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:46:48,051 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:46:48,053 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343596321] [2019-11-20 00:46:48,053 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:46:48,053 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 00:46:48,054 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445047787] [2019-11-20 00:46:48,055 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 00:46:48,055 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:46:48,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 00:46:48,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 00:46:48,056 INFO L87 Difference]: Start difference. First operand 141 states and 216 transitions. Second operand 4 states. [2019-11-20 00:46:48,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:46:48,438 INFO L93 Difference]: Finished difference Result 280 states and 423 transitions. [2019-11-20 00:46:48,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 00:46:48,439 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2019-11-20 00:46:48,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:46:48,441 INFO L225 Difference]: With dead ends: 280 [2019-11-20 00:46:48,441 INFO L226 Difference]: Without dead ends: 158 [2019-11-20 00:46:48,443 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 00:46:48,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-11-20 00:46:48,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 141. [2019-11-20 00:46:48,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-11-20 00:46:48,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 215 transitions. [2019-11-20 00:46:48,459 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 215 transitions. Word has length 58 [2019-11-20 00:46:48,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:46:48,459 INFO L462 AbstractCegarLoop]: Abstraction has 141 states and 215 transitions. [2019-11-20 00:46:48,460 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 00:46:48,460 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 215 transitions. [2019-11-20 00:46:48,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-11-20 00:46:48,461 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:46:48,461 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:46:48,461 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:46:48,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:46:48,462 INFO L82 PathProgramCache]: Analyzing trace with hash -1858029875, now seen corresponding path program 1 times [2019-11-20 00:46:48,462 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:46:48,462 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735690004] [2019-11-20 00:46:48,462 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:46:48,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:46:48,580 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:46:48,580 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735690004] [2019-11-20 00:46:48,580 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:46:48,581 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 00:46:48,581 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076326106] [2019-11-20 00:46:48,581 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 00:46:48,582 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:46:48,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 00:46:48,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 00:46:48,582 INFO L87 Difference]: Start difference. First operand 141 states and 215 transitions. Second operand 4 states. [2019-11-20 00:46:48,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:46:48,874 INFO L93 Difference]: Finished difference Result 279 states and 421 transitions. [2019-11-20 00:46:48,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 00:46:48,875 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2019-11-20 00:46:48,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:46:48,876 INFO L225 Difference]: With dead ends: 279 [2019-11-20 00:46:48,876 INFO L226 Difference]: Without dead ends: 157 [2019-11-20 00:46:48,877 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 00:46:48,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-11-20 00:46:48,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 141. [2019-11-20 00:46:48,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-11-20 00:46:48,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 214 transitions. [2019-11-20 00:46:48,892 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 214 transitions. Word has length 59 [2019-11-20 00:46:48,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:46:48,893 INFO L462 AbstractCegarLoop]: Abstraction has 141 states and 214 transitions. [2019-11-20 00:46:48,893 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 00:46:48,893 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 214 transitions. [2019-11-20 00:46:48,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-11-20 00:46:48,894 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:46:48,894 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:46:48,894 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:46:48,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:46:48,895 INFO L82 PathProgramCache]: Analyzing trace with hash -514836424, now seen corresponding path program 1 times [2019-11-20 00:46:48,895 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:46:48,895 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556428057] [2019-11-20 00:46:48,895 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:46:48,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:46:48,969 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:46:48,969 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556428057] [2019-11-20 00:46:48,970 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:46:48,970 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 00:46:48,970 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092949554] [2019-11-20 00:46:48,970 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 00:46:48,970 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:46:48,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 00:46:48,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 00:46:48,971 INFO L87 Difference]: Start difference. First operand 141 states and 214 transitions. Second operand 4 states. [2019-11-20 00:46:49,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:46:49,328 INFO L93 Difference]: Finished difference Result 277 states and 418 transitions. [2019-11-20 00:46:49,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 00:46:49,332 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2019-11-20 00:46:49,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:46:49,334 INFO L225 Difference]: With dead ends: 277 [2019-11-20 00:46:49,334 INFO L226 Difference]: Without dead ends: 155 [2019-11-20 00:46:49,335 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 00:46:49,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-11-20 00:46:49,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 141. [2019-11-20 00:46:49,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-11-20 00:46:49,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 213 transitions. [2019-11-20 00:46:49,344 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 213 transitions. Word has length 59 [2019-11-20 00:46:49,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:46:49,344 INFO L462 AbstractCegarLoop]: Abstraction has 141 states and 213 transitions. [2019-11-20 00:46:49,344 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 00:46:49,344 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 213 transitions. [2019-11-20 00:46:49,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-11-20 00:46:49,346 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:46:49,346 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:46:49,346 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:46:49,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:46:49,347 INFO L82 PathProgramCache]: Analyzing trace with hash 434511736, now seen corresponding path program 1 times [2019-11-20 00:46:49,347 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:46:49,347 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202260316] [2019-11-20 00:46:49,347 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:46:49,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:46:49,412 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:46:49,412 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202260316] [2019-11-20 00:46:49,412 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:46:49,412 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 00:46:49,413 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024537810] [2019-11-20 00:46:49,413 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 00:46:49,413 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:46:49,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 00:46:49,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 00:46:49,414 INFO L87 Difference]: Start difference. First operand 141 states and 213 transitions. Second operand 4 states. [2019-11-20 00:46:49,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:46:49,736 INFO L93 Difference]: Finished difference Result 276 states and 416 transitions. [2019-11-20 00:46:49,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 00:46:49,737 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2019-11-20 00:46:49,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:46:49,738 INFO L225 Difference]: With dead ends: 276 [2019-11-20 00:46:49,738 INFO L226 Difference]: Without dead ends: 154 [2019-11-20 00:46:49,739 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 00:46:49,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-11-20 00:46:49,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 141. [2019-11-20 00:46:49,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-11-20 00:46:49,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 212 transitions. [2019-11-20 00:46:49,747 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 212 transitions. Word has length 59 [2019-11-20 00:46:49,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:46:49,747 INFO L462 AbstractCegarLoop]: Abstraction has 141 states and 212 transitions. [2019-11-20 00:46:49,747 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 00:46:49,747 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 212 transitions. [2019-11-20 00:46:49,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-11-20 00:46:49,748 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:46:49,748 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:46:49,749 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:46:49,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:46:49,749 INFO L82 PathProgramCache]: Analyzing trace with hash -1020019103, now seen corresponding path program 1 times [2019-11-20 00:46:49,749 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:46:49,749 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676050650] [2019-11-20 00:46:49,749 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:46:49,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:46:49,802 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:46:49,802 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676050650] [2019-11-20 00:46:49,803 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:46:49,803 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 00:46:49,803 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018945497] [2019-11-20 00:46:49,803 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 00:46:49,804 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:46:49,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 00:46:49,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 00:46:49,805 INFO L87 Difference]: Start difference. First operand 141 states and 212 transitions. Second operand 4 states. [2019-11-20 00:46:50,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:46:50,060 INFO L93 Difference]: Finished difference Result 276 states and 415 transitions. [2019-11-20 00:46:50,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 00:46:50,068 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2019-11-20 00:46:50,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:46:50,069 INFO L225 Difference]: With dead ends: 276 [2019-11-20 00:46:50,069 INFO L226 Difference]: Without dead ends: 154 [2019-11-20 00:46:50,070 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 00:46:50,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-11-20 00:46:50,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 141. [2019-11-20 00:46:50,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-11-20 00:46:50,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 211 transitions. [2019-11-20 00:46:50,075 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 211 transitions. Word has length 59 [2019-11-20 00:46:50,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:46:50,076 INFO L462 AbstractCegarLoop]: Abstraction has 141 states and 211 transitions. [2019-11-20 00:46:50,076 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 00:46:50,076 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 211 transitions. [2019-11-20 00:46:50,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-11-20 00:46:50,077 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:46:50,078 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:46:50,078 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:46:50,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:46:50,078 INFO L82 PathProgramCache]: Analyzing trace with hash 321491268, now seen corresponding path program 1 times [2019-11-20 00:46:50,078 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:46:50,079 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250582338] [2019-11-20 00:46:50,079 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:46:50,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:46:50,145 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:46:50,147 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250582338] [2019-11-20 00:46:50,147 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:46:50,148 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 00:46:50,148 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367370021] [2019-11-20 00:46:50,148 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 00:46:50,149 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:46:50,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 00:46:50,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 00:46:50,152 INFO L87 Difference]: Start difference. First operand 141 states and 211 transitions. Second operand 4 states. [2019-11-20 00:46:50,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:46:50,440 INFO L93 Difference]: Finished difference Result 276 states and 414 transitions. [2019-11-20 00:46:50,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 00:46:50,440 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2019-11-20 00:46:50,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:46:50,442 INFO L225 Difference]: With dead ends: 276 [2019-11-20 00:46:50,442 INFO L226 Difference]: Without dead ends: 154 [2019-11-20 00:46:50,442 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 00:46:50,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-11-20 00:46:50,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 141. [2019-11-20 00:46:50,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-11-20 00:46:50,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 210 transitions. [2019-11-20 00:46:50,447 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 210 transitions. Word has length 60 [2019-11-20 00:46:50,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:46:50,447 INFO L462 AbstractCegarLoop]: Abstraction has 141 states and 210 transitions. [2019-11-20 00:46:50,447 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 00:46:50,447 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 210 transitions. [2019-11-20 00:46:50,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-11-20 00:46:50,452 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:46:50,452 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:46:50,452 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:46:50,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:46:50,453 INFO L82 PathProgramCache]: Analyzing trace with hash -1080156986, now seen corresponding path program 1 times [2019-11-20 00:46:50,453 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:46:50,453 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047125664] [2019-11-20 00:46:50,454 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:46:50,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:46:50,551 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:46:50,552 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047125664] [2019-11-20 00:46:50,552 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:46:50,552 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 00:46:50,552 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098098932] [2019-11-20 00:46:50,553 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 00:46:50,553 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:46:50,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 00:46:50,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 00:46:50,554 INFO L87 Difference]: Start difference. First operand 141 states and 210 transitions. Second operand 4 states. [2019-11-20 00:46:50,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:46:50,869 INFO L93 Difference]: Finished difference Result 276 states and 413 transitions. [2019-11-20 00:46:50,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 00:46:50,869 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2019-11-20 00:46:50,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:46:50,871 INFO L225 Difference]: With dead ends: 276 [2019-11-20 00:46:50,871 INFO L226 Difference]: Without dead ends: 154 [2019-11-20 00:46:50,871 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 00:46:50,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-11-20 00:46:50,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 141. [2019-11-20 00:46:50,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-11-20 00:46:50,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 209 transitions. [2019-11-20 00:46:50,876 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 209 transitions. Word has length 61 [2019-11-20 00:46:50,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:46:50,877 INFO L462 AbstractCegarLoop]: Abstraction has 141 states and 209 transitions. [2019-11-20 00:46:50,877 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 00:46:50,877 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 209 transitions. [2019-11-20 00:46:50,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-11-20 00:46:50,877 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:46:50,878 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:46:50,878 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:46:50,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:46:50,878 INFO L82 PathProgramCache]: Analyzing trace with hash -1620376695, now seen corresponding path program 1 times [2019-11-20 00:46:50,878 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:46:50,879 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847597247] [2019-11-20 00:46:50,879 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:46:50,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:46:50,959 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:46:50,959 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847597247] [2019-11-20 00:46:50,960 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:46:50,960 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 00:46:50,960 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920685675] [2019-11-20 00:46:50,960 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 00:46:50,961 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:46:50,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 00:46:50,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 00:46:50,961 INFO L87 Difference]: Start difference. First operand 141 states and 209 transitions. Second operand 4 states. [2019-11-20 00:46:51,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:46:51,205 INFO L93 Difference]: Finished difference Result 266 states and 399 transitions. [2019-11-20 00:46:51,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 00:46:51,206 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2019-11-20 00:46:51,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:46:51,208 INFO L225 Difference]: With dead ends: 266 [2019-11-20 00:46:51,208 INFO L226 Difference]: Without dead ends: 144 [2019-11-20 00:46:51,208 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 00:46:51,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2019-11-20 00:46:51,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 141. [2019-11-20 00:46:51,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-11-20 00:46:51,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 208 transitions. [2019-11-20 00:46:51,215 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 208 transitions. Word has length 62 [2019-11-20 00:46:51,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:46:51,216 INFO L462 AbstractCegarLoop]: Abstraction has 141 states and 208 transitions. [2019-11-20 00:46:51,216 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 00:46:51,216 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 208 transitions. [2019-11-20 00:46:51,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-11-20 00:46:51,218 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:46:51,219 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:46:51,219 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:46:51,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:46:51,219 INFO L82 PathProgramCache]: Analyzing trace with hash -1220225295, now seen corresponding path program 1 times [2019-11-20 00:46:51,220 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:46:51,220 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670075723] [2019-11-20 00:46:51,220 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:46:51,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:46:51,298 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:46:51,299 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670075723] [2019-11-20 00:46:51,299 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:46:51,302 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 00:46:51,303 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170757813] [2019-11-20 00:46:51,303 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 00:46:51,304 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:46:51,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 00:46:51,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 00:46:51,305 INFO L87 Difference]: Start difference. First operand 141 states and 208 transitions. Second operand 4 states. [2019-11-20 00:46:51,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:46:51,671 INFO L93 Difference]: Finished difference Result 306 states and 460 transitions. [2019-11-20 00:46:51,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 00:46:51,671 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2019-11-20 00:46:51,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:46:51,673 INFO L225 Difference]: With dead ends: 306 [2019-11-20 00:46:51,673 INFO L226 Difference]: Without dead ends: 184 [2019-11-20 00:46:51,673 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 00:46:51,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2019-11-20 00:46:51,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 163. [2019-11-20 00:46:51,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-11-20 00:46:51,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 246 transitions. [2019-11-20 00:46:51,678 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 246 transitions. Word has length 62 [2019-11-20 00:46:51,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:46:51,679 INFO L462 AbstractCegarLoop]: Abstraction has 163 states and 246 transitions. [2019-11-20 00:46:51,679 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 00:46:51,679 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 246 transitions. [2019-11-20 00:46:51,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-11-20 00:46:51,689 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:46:51,689 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:46:51,689 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:46:51,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:46:51,690 INFO L82 PathProgramCache]: Analyzing trace with hash -1563120905, now seen corresponding path program 1 times [2019-11-20 00:46:51,690 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:46:51,690 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752264316] [2019-11-20 00:46:51,690 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:46:51,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:46:51,771 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:46:51,771 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752264316] [2019-11-20 00:46:51,771 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:46:51,772 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 00:46:51,772 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17394646] [2019-11-20 00:46:51,772 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 00:46:51,772 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:46:51,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 00:46:51,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 00:46:51,773 INFO L87 Difference]: Start difference. First operand 163 states and 246 transitions. Second operand 4 states. [2019-11-20 00:46:52,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:46:52,080 INFO L93 Difference]: Finished difference Result 328 states and 497 transitions. [2019-11-20 00:46:52,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 00:46:52,081 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2019-11-20 00:46:52,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:46:52,082 INFO L225 Difference]: With dead ends: 328 [2019-11-20 00:46:52,082 INFO L226 Difference]: Without dead ends: 184 [2019-11-20 00:46:52,083 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 00:46:52,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2019-11-20 00:46:52,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 163. [2019-11-20 00:46:52,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-11-20 00:46:52,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 245 transitions. [2019-11-20 00:46:52,088 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 245 transitions. Word has length 75 [2019-11-20 00:46:52,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:46:52,089 INFO L462 AbstractCegarLoop]: Abstraction has 163 states and 245 transitions. [2019-11-20 00:46:52,089 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 00:46:52,089 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 245 transitions. [2019-11-20 00:46:52,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-11-20 00:46:52,090 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:46:52,090 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:46:52,090 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:46:52,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:46:52,090 INFO L82 PathProgramCache]: Analyzing trace with hash 1628563473, now seen corresponding path program 1 times [2019-11-20 00:46:52,090 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:46:52,091 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659595134] [2019-11-20 00:46:52,091 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:46:52,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:46:52,138 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:46:52,138 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659595134] [2019-11-20 00:46:52,138 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:46:52,139 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 00:46:52,139 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123992127] [2019-11-20 00:46:52,139 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 00:46:52,139 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:46:52,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 00:46:52,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 00:46:52,140 INFO L87 Difference]: Start difference. First operand 163 states and 245 transitions. Second operand 4 states. [2019-11-20 00:46:52,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:46:52,486 INFO L93 Difference]: Finished difference Result 327 states and 494 transitions. [2019-11-20 00:46:52,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 00:46:52,486 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2019-11-20 00:46:52,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:46:52,488 INFO L225 Difference]: With dead ends: 327 [2019-11-20 00:46:52,488 INFO L226 Difference]: Without dead ends: 183 [2019-11-20 00:46:52,488 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 00:46:52,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2019-11-20 00:46:52,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 163. [2019-11-20 00:46:52,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-11-20 00:46:52,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 244 transitions. [2019-11-20 00:46:52,494 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 244 transitions. Word has length 76 [2019-11-20 00:46:52,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:46:52,494 INFO L462 AbstractCegarLoop]: Abstraction has 163 states and 244 transitions. [2019-11-20 00:46:52,494 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 00:46:52,494 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 244 transitions. [2019-11-20 00:46:52,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-11-20 00:46:52,495 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:46:52,495 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:46:52,495 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:46:52,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:46:52,495 INFO L82 PathProgramCache]: Analyzing trace with hash -1323210372, now seen corresponding path program 1 times [2019-11-20 00:46:52,495 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:46:52,496 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012173242] [2019-11-20 00:46:52,496 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:46:52,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:46:52,545 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:46:52,546 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012173242] [2019-11-20 00:46:52,546 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:46:52,546 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 00:46:52,546 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968591688] [2019-11-20 00:46:52,547 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 00:46:52,547 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:46:52,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 00:46:52,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 00:46:52,548 INFO L87 Difference]: Start difference. First operand 163 states and 244 transitions. Second operand 4 states. [2019-11-20 00:46:52,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:46:52,879 INFO L93 Difference]: Finished difference Result 325 states and 490 transitions. [2019-11-20 00:46:52,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 00:46:52,879 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2019-11-20 00:46:52,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:46:52,881 INFO L225 Difference]: With dead ends: 325 [2019-11-20 00:46:52,881 INFO L226 Difference]: Without dead ends: 181 [2019-11-20 00:46:52,881 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 00:46:52,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2019-11-20 00:46:52,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 163. [2019-11-20 00:46:52,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-11-20 00:46:52,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 243 transitions. [2019-11-20 00:46:52,886 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 243 transitions. Word has length 76 [2019-11-20 00:46:52,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:46:52,887 INFO L462 AbstractCegarLoop]: Abstraction has 163 states and 243 transitions. [2019-11-20 00:46:52,887 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 00:46:52,887 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 243 transitions. [2019-11-20 00:46:52,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-11-20 00:46:52,887 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:46:52,892 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:46:52,893 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:46:52,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:46:52,896 INFO L82 PathProgramCache]: Analyzing trace with hash -373862212, now seen corresponding path program 1 times [2019-11-20 00:46:52,896 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:46:52,896 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307777261] [2019-11-20 00:46:52,897 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:46:52,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:46:52,958 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:46:52,958 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307777261] [2019-11-20 00:46:52,958 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:46:52,959 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 00:46:52,959 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586870897] [2019-11-20 00:46:52,959 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 00:46:52,959 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:46:52,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 00:46:52,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 00:46:52,960 INFO L87 Difference]: Start difference. First operand 163 states and 243 transitions. Second operand 4 states. [2019-11-20 00:46:53,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:46:53,304 INFO L93 Difference]: Finished difference Result 324 states and 487 transitions. [2019-11-20 00:46:53,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 00:46:53,304 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2019-11-20 00:46:53,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:46:53,305 INFO L225 Difference]: With dead ends: 324 [2019-11-20 00:46:53,306 INFO L226 Difference]: Without dead ends: 180 [2019-11-20 00:46:53,306 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 00:46:53,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-11-20 00:46:53,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 163. [2019-11-20 00:46:53,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-11-20 00:46:53,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 242 transitions. [2019-11-20 00:46:53,311 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 242 transitions. Word has length 76 [2019-11-20 00:46:53,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:46:53,311 INFO L462 AbstractCegarLoop]: Abstraction has 163 states and 242 transitions. [2019-11-20 00:46:53,311 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 00:46:53,311 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 242 transitions. [2019-11-20 00:46:53,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-11-20 00:46:53,313 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:46:53,313 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:46:53,313 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:46:53,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:46:53,314 INFO L82 PathProgramCache]: Analyzing trace with hash -1828393051, now seen corresponding path program 1 times [2019-11-20 00:46:53,314 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:46:53,314 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564928518] [2019-11-20 00:46:53,314 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:46:53,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:46:53,355 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:46:53,355 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564928518] [2019-11-20 00:46:53,356 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:46:53,356 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 00:46:53,356 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881750300] [2019-11-20 00:46:53,356 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 00:46:53,356 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:46:53,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 00:46:53,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 00:46:53,357 INFO L87 Difference]: Start difference. First operand 163 states and 242 transitions. Second operand 4 states. [2019-11-20 00:46:53,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:46:53,683 INFO L93 Difference]: Finished difference Result 324 states and 485 transitions. [2019-11-20 00:46:53,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 00:46:53,684 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2019-11-20 00:46:53,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:46:53,685 INFO L225 Difference]: With dead ends: 324 [2019-11-20 00:46:53,686 INFO L226 Difference]: Without dead ends: 180 [2019-11-20 00:46:53,686 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 00:46:53,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-11-20 00:46:53,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 163. [2019-11-20 00:46:53,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-11-20 00:46:53,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 241 transitions. [2019-11-20 00:46:53,692 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 241 transitions. Word has length 76 [2019-11-20 00:46:53,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:46:53,695 INFO L462 AbstractCegarLoop]: Abstraction has 163 states and 241 transitions. [2019-11-20 00:46:53,695 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 00:46:53,696 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 241 transitions. [2019-11-20 00:46:53,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-11-20 00:46:53,697 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:46:53,697 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:46:53,697 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:46:53,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:46:53,698 INFO L82 PathProgramCache]: Analyzing trace with hash 1031702656, now seen corresponding path program 1 times [2019-11-20 00:46:53,698 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:46:53,698 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737737617] [2019-11-20 00:46:53,698 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:46:53,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:46:53,744 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:46:53,745 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737737617] [2019-11-20 00:46:53,746 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:46:53,747 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 00:46:53,747 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993880947] [2019-11-20 00:46:53,747 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 00:46:53,747 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:46:53,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 00:46:53,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 00:46:53,748 INFO L87 Difference]: Start difference. First operand 163 states and 241 transitions. Second operand 4 states. [2019-11-20 00:46:54,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:46:54,154 INFO L93 Difference]: Finished difference Result 324 states and 483 transitions. [2019-11-20 00:46:54,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 00:46:54,155 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2019-11-20 00:46:54,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:46:54,156 INFO L225 Difference]: With dead ends: 324 [2019-11-20 00:46:54,156 INFO L226 Difference]: Without dead ends: 180 [2019-11-20 00:46:54,157 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 00:46:54,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-11-20 00:46:54,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 163. [2019-11-20 00:46:54,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-11-20 00:46:54,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 240 transitions. [2019-11-20 00:46:54,163 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 240 transitions. Word has length 77 [2019-11-20 00:46:54,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:46:54,163 INFO L462 AbstractCegarLoop]: Abstraction has 163 states and 240 transitions. [2019-11-20 00:46:54,163 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 00:46:54,163 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 240 transitions. [2019-11-20 00:46:54,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-11-20 00:46:54,168 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:46:54,169 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:46:54,169 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:46:54,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:46:54,169 INFO L82 PathProgramCache]: Analyzing trace with hash -538440438, now seen corresponding path program 1 times [2019-11-20 00:46:54,170 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:46:54,170 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527290196] [2019-11-20 00:46:54,170 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:46:54,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:46:54,233 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:46:54,234 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527290196] [2019-11-20 00:46:54,234 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:46:54,234 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 00:46:54,234 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109370365] [2019-11-20 00:46:54,235 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 00:46:54,235 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:46:54,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 00:46:54,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 00:46:54,236 INFO L87 Difference]: Start difference. First operand 163 states and 240 transitions. Second operand 4 states. [2019-11-20 00:46:54,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:46:54,560 INFO L93 Difference]: Finished difference Result 324 states and 481 transitions. [2019-11-20 00:46:54,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 00:46:54,561 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2019-11-20 00:46:54,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:46:54,562 INFO L225 Difference]: With dead ends: 324 [2019-11-20 00:46:54,562 INFO L226 Difference]: Without dead ends: 180 [2019-11-20 00:46:54,563 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 00:46:54,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-11-20 00:46:54,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 163. [2019-11-20 00:46:54,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-11-20 00:46:54,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 239 transitions. [2019-11-20 00:46:54,568 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 239 transitions. Word has length 78 [2019-11-20 00:46:54,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:46:54,568 INFO L462 AbstractCegarLoop]: Abstraction has 163 states and 239 transitions. [2019-11-20 00:46:54,568 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 00:46:54,568 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 239 transitions. [2019-11-20 00:46:54,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-11-20 00:46:54,569 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:46:54,569 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:46:54,569 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:46:54,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:46:54,570 INFO L82 PathProgramCache]: Analyzing trace with hash -2007032891, now seen corresponding path program 1 times [2019-11-20 00:46:54,570 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:46:54,570 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145299514] [2019-11-20 00:46:54,570 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:46:54,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:46:54,632 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:46:54,632 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145299514] [2019-11-20 00:46:54,632 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:46:54,633 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 00:46:54,633 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821047711] [2019-11-20 00:46:54,633 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 00:46:54,633 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:46:54,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 00:46:54,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 00:46:54,634 INFO L87 Difference]: Start difference. First operand 163 states and 239 transitions. Second operand 4 states. [2019-11-20 00:46:54,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:46:54,965 INFO L93 Difference]: Finished difference Result 314 states and 466 transitions. [2019-11-20 00:46:54,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 00:46:54,965 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2019-11-20 00:46:54,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:46:54,967 INFO L225 Difference]: With dead ends: 314 [2019-11-20 00:46:54,967 INFO L226 Difference]: Without dead ends: 170 [2019-11-20 00:46:54,967 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 00:46:54,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2019-11-20 00:46:54,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 163. [2019-11-20 00:46:54,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-11-20 00:46:54,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 238 transitions. [2019-11-20 00:46:54,972 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 238 transitions. Word has length 79 [2019-11-20 00:46:54,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:46:54,972 INFO L462 AbstractCegarLoop]: Abstraction has 163 states and 238 transitions. [2019-11-20 00:46:54,972 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 00:46:54,972 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 238 transitions. [2019-11-20 00:46:54,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-20 00:46:54,973 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:46:54,973 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:46:54,974 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:46:54,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:46:54,974 INFO L82 PathProgramCache]: Analyzing trace with hash -1409260885, now seen corresponding path program 1 times [2019-11-20 00:46:54,974 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:46:54,974 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804437905] [2019-11-20 00:46:54,974 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:46:54,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:46:55,045 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 00:46:55,045 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804437905] [2019-11-20 00:46:55,045 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:46:55,045 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 00:46:55,046 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462631780] [2019-11-20 00:46:55,047 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 00:46:55,047 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:46:55,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 00:46:55,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 00:46:55,048 INFO L87 Difference]: Start difference. First operand 163 states and 238 transitions. Second operand 4 states. [2019-11-20 00:46:55,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:46:55,497 INFO L93 Difference]: Finished difference Result 403 states and 603 transitions. [2019-11-20 00:46:55,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 00:46:55,500 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 84 [2019-11-20 00:46:55,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:46:55,501 INFO L225 Difference]: With dead ends: 403 [2019-11-20 00:46:55,501 INFO L226 Difference]: Without dead ends: 259 [2019-11-20 00:46:55,502 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 00:46:55,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2019-11-20 00:46:55,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 206. [2019-11-20 00:46:55,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2019-11-20 00:46:55,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 316 transitions. [2019-11-20 00:46:55,508 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 316 transitions. Word has length 84 [2019-11-20 00:46:55,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:46:55,509 INFO L462 AbstractCegarLoop]: Abstraction has 206 states and 316 transitions. [2019-11-20 00:46:55,509 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 00:46:55,509 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 316 transitions. [2019-11-20 00:46:55,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-20 00:46:55,510 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:46:55,510 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:46:55,510 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:46:55,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:46:55,510 INFO L82 PathProgramCache]: Analyzing trace with hash 1988313133, now seen corresponding path program 1 times [2019-11-20 00:46:55,511 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:46:55,511 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781591520] [2019-11-20 00:46:55,511 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:46:55,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:46:55,565 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 00:46:55,566 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781591520] [2019-11-20 00:46:55,566 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:46:55,566 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 00:46:55,566 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715178012] [2019-11-20 00:46:55,567 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 00:46:55,567 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:46:55,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 00:46:55,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 00:46:55,567 INFO L87 Difference]: Start difference. First operand 206 states and 316 transitions. Second operand 4 states. [2019-11-20 00:46:55,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:46:55,965 INFO L93 Difference]: Finished difference Result 442 states and 685 transitions. [2019-11-20 00:46:55,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 00:46:55,966 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 84 [2019-11-20 00:46:55,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:46:55,968 INFO L225 Difference]: With dead ends: 442 [2019-11-20 00:46:55,968 INFO L226 Difference]: Without dead ends: 255 [2019-11-20 00:46:55,968 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 00:46:55,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2019-11-20 00:46:55,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 230. [2019-11-20 00:46:55,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2019-11-20 00:46:55,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 358 transitions. [2019-11-20 00:46:55,975 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 358 transitions. Word has length 84 [2019-11-20 00:46:55,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:46:55,975 INFO L462 AbstractCegarLoop]: Abstraction has 230 states and 358 transitions. [2019-11-20 00:46:55,976 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 00:46:55,976 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 358 transitions. [2019-11-20 00:46:55,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-11-20 00:46:55,977 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:46:55,977 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:46:55,977 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:46:55,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:46:55,977 INFO L82 PathProgramCache]: Analyzing trace with hash -40403587, now seen corresponding path program 1 times [2019-11-20 00:46:55,978 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:46:55,978 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066100926] [2019-11-20 00:46:55,978 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:46:55,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:46:56,027 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 00:46:56,027 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066100926] [2019-11-20 00:46:56,027 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:46:56,027 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 00:46:56,028 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372220458] [2019-11-20 00:46:56,028 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 00:46:56,028 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:46:56,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 00:46:56,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 00:46:56,029 INFO L87 Difference]: Start difference. First operand 230 states and 358 transitions. Second operand 4 states. [2019-11-20 00:46:56,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:46:56,439 INFO L93 Difference]: Finished difference Result 494 states and 764 transitions. [2019-11-20 00:46:56,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 00:46:56,439 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-11-20 00:46:56,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:46:56,441 INFO L225 Difference]: With dead ends: 494 [2019-11-20 00:46:56,441 INFO L226 Difference]: Without dead ends: 283 [2019-11-20 00:46:56,442 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 00:46:56,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2019-11-20 00:46:56,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 230. [2019-11-20 00:46:56,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2019-11-20 00:46:56,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 357 transitions. [2019-11-20 00:46:56,450 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 357 transitions. Word has length 97 [2019-11-20 00:46:56,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:46:56,451 INFO L462 AbstractCegarLoop]: Abstraction has 230 states and 357 transitions. [2019-11-20 00:46:56,451 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 00:46:56,451 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 357 transitions. [2019-11-20 00:46:56,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-11-20 00:46:56,452 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:46:56,452 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:46:56,453 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:46:56,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:46:56,453 INFO L82 PathProgramCache]: Analyzing trace with hash 271163, now seen corresponding path program 1 times [2019-11-20 00:46:56,453 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:46:56,453 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994593818] [2019-11-20 00:46:56,454 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:46:56,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:46:56,509 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 00:46:56,510 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994593818] [2019-11-20 00:46:56,510 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:46:56,510 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 00:46:56,510 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603741649] [2019-11-20 00:46:56,511 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 00:46:56,511 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:46:56,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 00:46:56,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 00:46:56,512 INFO L87 Difference]: Start difference. First operand 230 states and 357 transitions. Second operand 4 states. [2019-11-20 00:46:56,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:46:56,879 INFO L93 Difference]: Finished difference Result 466 states and 724 transitions. [2019-11-20 00:46:56,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 00:46:56,880 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-11-20 00:46:56,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:46:56,882 INFO L225 Difference]: With dead ends: 466 [2019-11-20 00:46:56,882 INFO L226 Difference]: Without dead ends: 255 [2019-11-20 00:46:56,882 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 00:46:56,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2019-11-20 00:46:56,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 230. [2019-11-20 00:46:56,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2019-11-20 00:46:56,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 356 transitions. [2019-11-20 00:46:56,889 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 356 transitions. Word has length 97 [2019-11-20 00:46:56,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:46:56,889 INFO L462 AbstractCegarLoop]: Abstraction has 230 states and 356 transitions. [2019-11-20 00:46:56,889 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 00:46:56,889 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 356 transitions. [2019-11-20 00:46:56,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-20 00:46:56,890 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:46:56,891 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:46:56,891 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:46:56,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:46:56,891 INFO L82 PathProgramCache]: Analyzing trace with hash 1588160075, now seen corresponding path program 1 times [2019-11-20 00:46:56,891 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:46:56,892 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320592528] [2019-11-20 00:46:56,892 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:46:56,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:46:56,954 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 00:46:56,955 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320592528] [2019-11-20 00:46:56,955 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:46:56,955 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 00:46:56,956 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697276616] [2019-11-20 00:46:56,957 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 00:46:56,957 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:46:56,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 00:46:56,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 00:46:56,957 INFO L87 Difference]: Start difference. First operand 230 states and 356 transitions. Second operand 4 states. [2019-11-20 00:46:57,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:46:57,353 INFO L93 Difference]: Finished difference Result 493 states and 759 transitions. [2019-11-20 00:46:57,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 00:46:57,354 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-11-20 00:46:57,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:46:57,355 INFO L225 Difference]: With dead ends: 493 [2019-11-20 00:46:57,355 INFO L226 Difference]: Without dead ends: 282 [2019-11-20 00:46:57,356 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 00:46:57,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2019-11-20 00:46:57,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 230. [2019-11-20 00:46:57,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2019-11-20 00:46:57,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 355 transitions. [2019-11-20 00:46:57,363 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 355 transitions. Word has length 98 [2019-11-20 00:46:57,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:46:57,363 INFO L462 AbstractCegarLoop]: Abstraction has 230 states and 355 transitions. [2019-11-20 00:46:57,363 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 00:46:57,363 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 355 transitions. [2019-11-20 00:46:57,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-20 00:46:57,364 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:46:57,365 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:46:57,365 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:46:57,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:46:57,365 INFO L82 PathProgramCache]: Analyzing trace with hash -1363613770, now seen corresponding path program 1 times [2019-11-20 00:46:57,365 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:46:57,365 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961495681] [2019-11-20 00:46:57,365 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:46:57,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:46:57,428 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 00:46:57,428 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961495681] [2019-11-20 00:46:57,428 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:46:57,429 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 00:46:57,429 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041630416] [2019-11-20 00:46:57,429 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 00:46:57,429 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:46:57,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 00:46:57,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 00:46:57,430 INFO L87 Difference]: Start difference. First operand 230 states and 355 transitions. Second operand 4 states. [2019-11-20 00:46:57,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:46:57,839 INFO L93 Difference]: Finished difference Result 491 states and 755 transitions. [2019-11-20 00:46:57,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 00:46:57,839 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-11-20 00:46:57,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:46:57,841 INFO L225 Difference]: With dead ends: 491 [2019-11-20 00:46:57,841 INFO L226 Difference]: Without dead ends: 280 [2019-11-20 00:46:57,841 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 00:46:57,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2019-11-20 00:46:57,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 230. [2019-11-20 00:46:57,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2019-11-20 00:46:57,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 354 transitions. [2019-11-20 00:46:57,848 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 354 transitions. Word has length 98 [2019-11-20 00:46:57,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:46:57,848 INFO L462 AbstractCegarLoop]: Abstraction has 230 states and 354 transitions. [2019-11-20 00:46:57,848 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 00:46:57,849 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 354 transitions. [2019-11-20 00:46:57,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-20 00:46:57,850 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:46:57,850 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:46:57,850 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:46:57,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:46:57,850 INFO L82 PathProgramCache]: Analyzing trace with hash -414265610, now seen corresponding path program 1 times [2019-11-20 00:46:57,851 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:46:57,851 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753239124] [2019-11-20 00:46:57,851 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:46:57,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:46:57,906 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 00:46:57,906 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753239124] [2019-11-20 00:46:57,906 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:46:57,906 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 00:46:57,907 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704323500] [2019-11-20 00:46:57,907 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 00:46:57,907 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:46:57,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 00:46:57,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 00:46:57,908 INFO L87 Difference]: Start difference. First operand 230 states and 354 transitions. Second operand 4 states. [2019-11-20 00:46:58,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:46:58,367 INFO L93 Difference]: Finished difference Result 490 states and 752 transitions. [2019-11-20 00:46:58,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 00:46:58,368 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-11-20 00:46:58,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:46:58,370 INFO L225 Difference]: With dead ends: 490 [2019-11-20 00:46:58,370 INFO L226 Difference]: Without dead ends: 279 [2019-11-20 00:46:58,370 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 00:46:58,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2019-11-20 00:46:58,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 230. [2019-11-20 00:46:58,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2019-11-20 00:46:58,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 353 transitions. [2019-11-20 00:46:58,377 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 353 transitions. Word has length 98 [2019-11-20 00:46:58,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:46:58,377 INFO L462 AbstractCegarLoop]: Abstraction has 230 states and 353 transitions. [2019-11-20 00:46:58,377 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 00:46:58,377 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 353 transitions. [2019-11-20 00:46:58,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-20 00:46:58,378 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:46:58,378 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:46:58,378 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:46:58,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:46:58,379 INFO L82 PathProgramCache]: Analyzing trace with hash -1868796449, now seen corresponding path program 1 times [2019-11-20 00:46:58,379 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:46:58,379 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917533834] [2019-11-20 00:46:58,379 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:46:58,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:46:58,455 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-11-20 00:46:58,455 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917533834] [2019-11-20 00:46:58,456 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:46:58,456 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-20 00:46:58,456 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428988256] [2019-11-20 00:46:58,456 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 00:46:58,457 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:46:58,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 00:46:58,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-20 00:46:58,457 INFO L87 Difference]: Start difference. First operand 230 states and 353 transitions. Second operand 5 states. [2019-11-20 00:46:59,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:46:59,007 INFO L93 Difference]: Finished difference Result 462 states and 714 transitions. [2019-11-20 00:46:59,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 00:46:59,008 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 98 [2019-11-20 00:46:59,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:46:59,009 INFO L225 Difference]: With dead ends: 462 [2019-11-20 00:46:59,010 INFO L226 Difference]: Without dead ends: 251 [2019-11-20 00:46:59,010 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-20 00:46:59,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2019-11-20 00:46:59,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 250. [2019-11-20 00:46:59,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-11-20 00:46:59,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 379 transitions. [2019-11-20 00:46:59,018 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 379 transitions. Word has length 98 [2019-11-20 00:46:59,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:46:59,018 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 379 transitions. [2019-11-20 00:46:59,018 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 00:46:59,019 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 379 transitions. [2019-11-20 00:46:59,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-20 00:46:59,019 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:46:59,020 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:46:59,020 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:46:59,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:46:59,020 INFO L82 PathProgramCache]: Analyzing trace with hash -102696520, now seen corresponding path program 1 times [2019-11-20 00:46:59,021 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:46:59,021 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665990681] [2019-11-20 00:46:59,021 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:46:59,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:46:59,106 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 00:46:59,107 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665990681] [2019-11-20 00:46:59,107 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:46:59,107 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 00:46:59,107 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378496830] [2019-11-20 00:46:59,108 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 00:46:59,108 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:46:59,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 00:46:59,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 00:46:59,108 INFO L87 Difference]: Start difference. First operand 250 states and 379 transitions. Second operand 4 states. [2019-11-20 00:46:59,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:46:59,487 INFO L93 Difference]: Finished difference Result 503 states and 764 transitions. [2019-11-20 00:46:59,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 00:46:59,487 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-11-20 00:46:59,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:46:59,489 INFO L225 Difference]: With dead ends: 503 [2019-11-20 00:46:59,489 INFO L226 Difference]: Without dead ends: 272 [2019-11-20 00:46:59,490 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 00:46:59,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2019-11-20 00:46:59,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 250. [2019-11-20 00:46:59,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-11-20 00:46:59,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 378 transitions. [2019-11-20 00:46:59,501 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 378 transitions. Word has length 98 [2019-11-20 00:46:59,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:46:59,502 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 378 transitions. [2019-11-20 00:46:59,502 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 00:46:59,502 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 378 transitions. [2019-11-20 00:46:59,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-20 00:46:59,503 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:46:59,503 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:46:59,504 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:46:59,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:46:59,504 INFO L82 PathProgramCache]: Analyzing trace with hash 846651640, now seen corresponding path program 1 times [2019-11-20 00:46:59,504 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:46:59,504 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964311184] [2019-11-20 00:46:59,505 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:46:59,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:46:59,562 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 00:46:59,562 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964311184] [2019-11-20 00:46:59,562 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:46:59,563 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 00:46:59,563 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355943621] [2019-11-20 00:46:59,563 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 00:46:59,563 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:46:59,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 00:46:59,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 00:46:59,564 INFO L87 Difference]: Start difference. First operand 250 states and 378 transitions. Second operand 4 states. [2019-11-20 00:46:59,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:46:59,850 INFO L93 Difference]: Finished difference Result 502 states and 761 transitions. [2019-11-20 00:46:59,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 00:46:59,850 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-11-20 00:46:59,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:46:59,852 INFO L225 Difference]: With dead ends: 502 [2019-11-20 00:46:59,852 INFO L226 Difference]: Without dead ends: 271 [2019-11-20 00:46:59,852 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 00:46:59,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2019-11-20 00:46:59,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 250. [2019-11-20 00:46:59,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-11-20 00:46:59,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 377 transitions. [2019-11-20 00:46:59,859 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 377 transitions. Word has length 98 [2019-11-20 00:46:59,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:46:59,859 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 377 transitions. [2019-11-20 00:46:59,859 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 00:46:59,859 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 377 transitions. [2019-11-20 00:46:59,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-20 00:46:59,860 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:46:59,860 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:46:59,860 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:46:59,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:46:59,861 INFO L82 PathProgramCache]: Analyzing trace with hash 651492985, now seen corresponding path program 1 times [2019-11-20 00:46:59,861 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:46:59,861 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891673922] [2019-11-20 00:46:59,861 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:46:59,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:46:59,919 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 00:46:59,920 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891673922] [2019-11-20 00:46:59,920 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:46:59,920 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 00:46:59,920 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000573415] [2019-11-20 00:46:59,921 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 00:46:59,921 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:46:59,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 00:46:59,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 00:46:59,921 INFO L87 Difference]: Start difference. First operand 250 states and 377 transitions. Second operand 4 states. [2019-11-20 00:47:00,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:47:00,354 INFO L93 Difference]: Finished difference Result 530 states and 797 transitions. [2019-11-20 00:47:00,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 00:47:00,354 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 99 [2019-11-20 00:47:00,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:47:00,356 INFO L225 Difference]: With dead ends: 530 [2019-11-20 00:47:00,356 INFO L226 Difference]: Without dead ends: 299 [2019-11-20 00:47:00,357 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 00:47:00,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2019-11-20 00:47:00,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 250. [2019-11-20 00:47:00,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-11-20 00:47:00,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 376 transitions. [2019-11-20 00:47:00,366 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 376 transitions. Word has length 99 [2019-11-20 00:47:00,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:47:00,366 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 376 transitions. [2019-11-20 00:47:00,366 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 00:47:00,366 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 376 transitions. [2019-11-20 00:47:00,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-20 00:47:00,367 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:47:00,367 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:47:00,367 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:47:00,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:47:00,368 INFO L82 PathProgramCache]: Analyzing trace with hash 1085222071, now seen corresponding path program 1 times [2019-11-20 00:47:00,368 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:47:00,368 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378958574] [2019-11-20 00:47:00,368 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:47:00,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:47:00,424 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 00:47:00,424 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378958574] [2019-11-20 00:47:00,424 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:47:00,424 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 00:47:00,425 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856511617] [2019-11-20 00:47:00,425 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 00:47:00,426 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:47:00,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 00:47:00,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 00:47:00,426 INFO L87 Difference]: Start difference. First operand 250 states and 376 transitions. Second operand 4 states. [2019-11-20 00:47:00,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:47:00,754 INFO L93 Difference]: Finished difference Result 502 states and 757 transitions. [2019-11-20 00:47:00,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 00:47:00,754 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 99 [2019-11-20 00:47:00,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:47:00,756 INFO L225 Difference]: With dead ends: 502 [2019-11-20 00:47:00,756 INFO L226 Difference]: Without dead ends: 271 [2019-11-20 00:47:00,757 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 00:47:00,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2019-11-20 00:47:00,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 250. [2019-11-20 00:47:00,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-11-20 00:47:00,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 375 transitions. [2019-11-20 00:47:00,763 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 375 transitions. Word has length 99 [2019-11-20 00:47:00,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:47:00,764 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 375 transitions. [2019-11-20 00:47:00,764 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 00:47:00,764 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 375 transitions. [2019-11-20 00:47:00,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-11-20 00:47:00,765 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:47:00,766 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:47:00,766 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:47:00,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:47:00,766 INFO L82 PathProgramCache]: Analyzing trace with hash 199692210, now seen corresponding path program 1 times [2019-11-20 00:47:00,766 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:47:00,767 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562556219] [2019-11-20 00:47:00,767 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:47:00,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:47:00,821 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 00:47:00,822 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562556219] [2019-11-20 00:47:00,822 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:47:00,822 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 00:47:00,822 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147724983] [2019-11-20 00:47:00,823 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 00:47:00,823 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:47:00,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 00:47:00,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 00:47:00,823 INFO L87 Difference]: Start difference. First operand 250 states and 375 transitions. Second operand 4 states. [2019-11-20 00:47:01,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:47:01,272 INFO L93 Difference]: Finished difference Result 530 states and 793 transitions. [2019-11-20 00:47:01,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 00:47:01,272 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2019-11-20 00:47:01,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:47:01,274 INFO L225 Difference]: With dead ends: 530 [2019-11-20 00:47:01,274 INFO L226 Difference]: Without dead ends: 299 [2019-11-20 00:47:01,275 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 00:47:01,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2019-11-20 00:47:01,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 250. [2019-11-20 00:47:01,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-11-20 00:47:01,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 374 transitions. [2019-11-20 00:47:01,283 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 374 transitions. Word has length 100 [2019-11-20 00:47:01,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:47:01,283 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 374 transitions. [2019-11-20 00:47:01,283 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 00:47:01,284 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 374 transitions. [2019-11-20 00:47:01,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-11-20 00:47:01,285 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:47:01,285 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:47:01,286 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:47:01,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:47:01,286 INFO L82 PathProgramCache]: Analyzing trace with hash 760391988, now seen corresponding path program 1 times [2019-11-20 00:47:01,286 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:47:01,286 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047560277] [2019-11-20 00:47:01,287 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:47:01,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:47:01,351 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 00:47:01,352 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047560277] [2019-11-20 00:47:01,352 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:47:01,352 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 00:47:01,352 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784864283] [2019-11-20 00:47:01,353 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 00:47:01,353 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:47:01,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 00:47:01,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 00:47:01,354 INFO L87 Difference]: Start difference. First operand 250 states and 374 transitions. Second operand 4 states. [2019-11-20 00:47:01,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:47:01,715 INFO L93 Difference]: Finished difference Result 502 states and 753 transitions. [2019-11-20 00:47:01,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 00:47:01,716 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2019-11-20 00:47:01,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:47:01,718 INFO L225 Difference]: With dead ends: 502 [2019-11-20 00:47:01,718 INFO L226 Difference]: Without dead ends: 271 [2019-11-20 00:47:01,718 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 00:47:01,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2019-11-20 00:47:01,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 250. [2019-11-20 00:47:01,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-11-20 00:47:01,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 373 transitions. [2019-11-20 00:47:01,728 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 373 transitions. Word has length 100 [2019-11-20 00:47:01,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:47:01,728 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 373 transitions. [2019-11-20 00:47:01,728 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 00:47:01,728 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 373 transitions. [2019-11-20 00:47:01,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-11-20 00:47:01,729 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:47:01,730 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:47:01,730 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:47:01,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:47:01,730 INFO L82 PathProgramCache]: Analyzing trace with hash -2123930572, now seen corresponding path program 1 times [2019-11-20 00:47:01,730 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:47:01,731 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821634083] [2019-11-20 00:47:01,731 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:47:01,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:47:01,781 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 00:47:01,782 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821634083] [2019-11-20 00:47:01,782 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:47:01,782 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 00:47:01,782 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067653411] [2019-11-20 00:47:01,782 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 00:47:01,783 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:47:01,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 00:47:01,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 00:47:01,783 INFO L87 Difference]: Start difference. First operand 250 states and 373 transitions. Second operand 4 states. [2019-11-20 00:47:02,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:47:02,254 INFO L93 Difference]: Finished difference Result 530 states and 789 transitions. [2019-11-20 00:47:02,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 00:47:02,255 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2019-11-20 00:47:02,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:47:02,256 INFO L225 Difference]: With dead ends: 530 [2019-11-20 00:47:02,256 INFO L226 Difference]: Without dead ends: 299 [2019-11-20 00:47:02,257 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 00:47:02,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2019-11-20 00:47:02,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 250. [2019-11-20 00:47:02,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-11-20 00:47:02,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 372 transitions. [2019-11-20 00:47:02,264 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 372 transitions. Word has length 101 [2019-11-20 00:47:02,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:47:02,264 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 372 transitions. [2019-11-20 00:47:02,264 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 00:47:02,264 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 372 transitions. [2019-11-20 00:47:02,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-11-20 00:47:02,265 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:47:02,265 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:47:02,265 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:47:02,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:47:02,266 INFO L82 PathProgramCache]: Analyzing trace with hash -1922106638, now seen corresponding path program 1 times [2019-11-20 00:47:02,266 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:47:02,266 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047138442] [2019-11-20 00:47:02,266 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:47:02,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:47:02,321 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 00:47:02,321 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047138442] [2019-11-20 00:47:02,322 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:47:02,322 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 00:47:02,322 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526553386] [2019-11-20 00:47:02,322 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 00:47:02,323 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:47:02,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 00:47:02,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 00:47:02,323 INFO L87 Difference]: Start difference. First operand 250 states and 372 transitions. Second operand 4 states. [2019-11-20 00:47:02,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:47:02,645 INFO L93 Difference]: Finished difference Result 502 states and 749 transitions. [2019-11-20 00:47:02,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 00:47:02,646 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2019-11-20 00:47:02,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:47:02,647 INFO L225 Difference]: With dead ends: 502 [2019-11-20 00:47:02,647 INFO L226 Difference]: Without dead ends: 271 [2019-11-20 00:47:02,647 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 00:47:02,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2019-11-20 00:47:02,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 250. [2019-11-20 00:47:02,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-11-20 00:47:02,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 371 transitions. [2019-11-20 00:47:02,655 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 371 transitions. Word has length 101 [2019-11-20 00:47:02,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:47:02,655 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 371 transitions. [2019-11-20 00:47:02,655 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 00:47:02,656 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 371 transitions. [2019-11-20 00:47:02,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-11-20 00:47:02,657 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:47:02,657 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:47:02,657 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:47:02,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:47:02,658 INFO L82 PathProgramCache]: Analyzing trace with hash 1950473869, now seen corresponding path program 1 times [2019-11-20 00:47:02,658 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:47:02,658 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333353354] [2019-11-20 00:47:02,658 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:47:02,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:47:02,718 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 00:47:02,718 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333353354] [2019-11-20 00:47:02,718 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:47:02,718 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 00:47:02,718 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332564177] [2019-11-20 00:47:02,719 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 00:47:02,719 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:47:02,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 00:47:02,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 00:47:02,719 INFO L87 Difference]: Start difference. First operand 250 states and 371 transitions. Second operand 4 states. [2019-11-20 00:47:03,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:47:03,098 INFO L93 Difference]: Finished difference Result 520 states and 773 transitions. [2019-11-20 00:47:03,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 00:47:03,098 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-11-20 00:47:03,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:47:03,100 INFO L225 Difference]: With dead ends: 520 [2019-11-20 00:47:03,100 INFO L226 Difference]: Without dead ends: 289 [2019-11-20 00:47:03,101 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 00:47:03,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2019-11-20 00:47:03,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 250. [2019-11-20 00:47:03,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-11-20 00:47:03,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 370 transitions. [2019-11-20 00:47:03,109 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 370 transitions. Word has length 102 [2019-11-20 00:47:03,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:47:03,110 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 370 transitions. [2019-11-20 00:47:03,110 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 00:47:03,110 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 370 transitions. [2019-11-20 00:47:03,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-11-20 00:47:03,111 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:47:03,111 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:47:03,112 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:47:03,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:47:03,112 INFO L82 PathProgramCache]: Analyzing trace with hash -382918769, now seen corresponding path program 1 times [2019-11-20 00:47:03,112 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:47:03,112 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980591792] [2019-11-20 00:47:03,113 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:47:03,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:47:03,172 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 00:47:03,172 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980591792] [2019-11-20 00:47:03,172 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:47:03,172 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 00:47:03,173 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089888260] [2019-11-20 00:47:03,173 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 00:47:03,173 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:47:03,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 00:47:03,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 00:47:03,174 INFO L87 Difference]: Start difference. First operand 250 states and 370 transitions. Second operand 4 states. [2019-11-20 00:47:03,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:47:03,479 INFO L93 Difference]: Finished difference Result 492 states and 733 transitions. [2019-11-20 00:47:03,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 00:47:03,480 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-11-20 00:47:03,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:47:03,481 INFO L225 Difference]: With dead ends: 492 [2019-11-20 00:47:03,481 INFO L226 Difference]: Without dead ends: 261 [2019-11-20 00:47:03,481 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 00:47:03,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2019-11-20 00:47:03,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 250. [2019-11-20 00:47:03,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-11-20 00:47:03,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 369 transitions. [2019-11-20 00:47:03,488 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 369 transitions. Word has length 102 [2019-11-20 00:47:03,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:47:03,488 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 369 transitions. [2019-11-20 00:47:03,488 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 00:47:03,489 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 369 transitions. [2019-11-20 00:47:03,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-11-20 00:47:03,489 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:47:03,490 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:47:03,490 INFO L410 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:47:03,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:47:03,490 INFO L82 PathProgramCache]: Analyzing trace with hash -2022470311, now seen corresponding path program 1 times [2019-11-20 00:47:03,490 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:47:03,490 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812089341] [2019-11-20 00:47:03,490 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:47:03,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:47:03,549 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 00:47:03,549 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812089341] [2019-11-20 00:47:03,550 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:47:03,550 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 00:47:03,550 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273752563] [2019-11-20 00:47:03,550 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 00:47:03,551 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:47:03,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 00:47:03,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 00:47:03,551 INFO L87 Difference]: Start difference. First operand 250 states and 369 transitions. Second operand 4 states. [2019-11-20 00:47:03,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:47:03,862 INFO L93 Difference]: Finished difference Result 520 states and 769 transitions. [2019-11-20 00:47:03,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 00:47:03,862 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2019-11-20 00:47:03,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:47:03,864 INFO L225 Difference]: With dead ends: 520 [2019-11-20 00:47:03,864 INFO L226 Difference]: Without dead ends: 289 [2019-11-20 00:47:03,864 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 00:47:03,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2019-11-20 00:47:03,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 250. [2019-11-20 00:47:03,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-11-20 00:47:03,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 368 transitions. [2019-11-20 00:47:03,871 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 368 transitions. Word has length 106 [2019-11-20 00:47:03,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:47:03,871 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 368 transitions. [2019-11-20 00:47:03,871 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 00:47:03,871 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 368 transitions. [2019-11-20 00:47:03,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-11-20 00:47:03,872 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:47:03,872 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:47:03,873 INFO L410 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:47:03,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:47:03,873 INFO L82 PathProgramCache]: Analyzing trace with hash 586317147, now seen corresponding path program 1 times [2019-11-20 00:47:03,873 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:47:03,873 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703208654] [2019-11-20 00:47:03,873 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:47:03,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:47:03,930 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-11-20 00:47:03,931 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703208654] [2019-11-20 00:47:03,931 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:47:03,931 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 00:47:03,931 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825740320] [2019-11-20 00:47:03,932 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 00:47:03,932 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:47:03,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 00:47:03,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:47:03,932 INFO L87 Difference]: Start difference. First operand 250 states and 368 transitions. Second operand 3 states. [2019-11-20 00:47:03,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:47:03,969 INFO L93 Difference]: Finished difference Result 710 states and 1059 transitions. [2019-11-20 00:47:03,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 00:47:03,969 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2019-11-20 00:47:03,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:47:03,972 INFO L225 Difference]: With dead ends: 710 [2019-11-20 00:47:03,972 INFO L226 Difference]: Without dead ends: 479 [2019-11-20 00:47:03,973 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:47:03,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2019-11-20 00:47:03,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 479. [2019-11-20 00:47:03,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 479 states. [2019-11-20 00:47:03,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 711 transitions. [2019-11-20 00:47:03,986 INFO L78 Accepts]: Start accepts. Automaton has 479 states and 711 transitions. Word has length 106 [2019-11-20 00:47:03,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:47:03,986 INFO L462 AbstractCegarLoop]: Abstraction has 479 states and 711 transitions. [2019-11-20 00:47:03,986 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 00:47:03,986 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 711 transitions. [2019-11-20 00:47:03,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-11-20 00:47:03,988 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:47:03,988 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1] [2019-11-20 00:47:03,988 INFO L410 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:47:03,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:47:03,989 INFO L82 PathProgramCache]: Analyzing trace with hash -536013004, now seen corresponding path program 1 times [2019-11-20 00:47:03,989 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:47:03,989 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797629454] [2019-11-20 00:47:03,989 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:47:04,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 00:47:04,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 00:47:04,315 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 00:47:04,315 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-20 00:47:04,493 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 12:47:04 BoogieIcfgContainer [2019-11-20 00:47:04,493 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-20 00:47:04,494 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-20 00:47:04,494 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-20 00:47:04,494 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-20 00:47:04,496 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:46:46" (3/4) ... [2019-11-20 00:47:04,504 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-20 00:47:04,509 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-20 00:47:04,512 INFO L168 Benchmark]: Toolchain (without parser) took 19726.67 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 334.0 MB). Free memory was 938.0 MB in the beginning and 1.1 GB in the end (delta: -129.7 MB). Peak memory consumption was 204.2 MB. Max. memory is 11.5 GB. [2019-11-20 00:47:04,512 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 00:47:04,513 INFO L168 Benchmark]: CACSL2BoogieTranslator took 791.23 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 200.3 MB). Free memory was 938.0 MB in the beginning and 1.2 GB in the end (delta: -233.7 MB). Peak memory consumption was 24.2 MB. Max. memory is 11.5 GB. [2019-11-20 00:47:04,513 INFO L168 Benchmark]: Boogie Procedure Inliner took 103.32 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-11-20 00:47:04,514 INFO L168 Benchmark]: Boogie Preprocessor took 116.06 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-20 00:47:04,514 INFO L168 Benchmark]: RCFGBuilder took 1064.86 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 92.4 MB). Peak memory consumption was 92.4 MB. Max. memory is 11.5 GB. [2019-11-20 00:47:04,515 INFO L168 Benchmark]: TraceAbstraction took 17631.10 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 133.7 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 919.4 kB). Peak memory consumption was 134.6 MB. Max. memory is 11.5 GB. [2019-11-20 00:47:04,515 INFO L168 Benchmark]: Witness Printer took 15.77 ms. Allocated memory is still 1.4 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 00:47:04,517 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.21 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 791.23 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 200.3 MB). Free memory was 938.0 MB in the beginning and 1.2 GB in the end (delta: -233.7 MB). Peak memory consumption was 24.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 103.32 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. * Boogie Preprocessor took 116.06 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1064.86 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 92.4 MB). Peak memory consumption was 92.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 17631.10 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 133.7 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 919.4 kB). Peak memory consumption was 134.6 MB. Max. memory is 11.5 GB. * Witness Printer took 15.77 ms. Allocated memory is still 1.4 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 1703]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of bitwiseAnd at line 1121. Possible FailurePath: [L1042] static int init = 1; [L1043] static SSL_METHOD SSLv3_server_data ; VAL [init=1, SSLv3_server_data={9:0}] [L1065] SSL *s ; [L1066] int tmp ; [L1070] s = malloc(sizeof(SSL)) [L1071] s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1072] s->ctx = malloc(sizeof(SSL_CTX)) [L1073] s->session = malloc(sizeof(SSL_SESSION)) [L1074] s->state = 8464 [L1081] BUF_MEM *buf ; [L1082] unsigned long l ; [L1083] unsigned long Time ; [L1084] unsigned long tmp ; [L1085] void (*cb)() ; [L1086] long num1 ; [L1087] int ret ; [L1088] int new_state ; [L1089] int state ; [L1090] int skip ; [L1091] int got_new_session ; [L1092] int tmp___1 = __VERIFIER_nondet_int() ; [L1093] int tmp___2 = __VERIFIER_nondet_int() ; [L1094] int tmp___3 = __VERIFIER_nondet_int() ; [L1095] int tmp___4 = __VERIFIER_nondet_int() ; [L1096] int tmp___5 = __VERIFIER_nondet_int() ; [L1097] int tmp___6 = __VERIFIER_nondet_int() ; [L1098] int tmp___7 ; [L1099] long tmp___8 = __VERIFIER_nondet_long() ; [L1100] int tmp___9 = __VERIFIER_nondet_int() ; [L1101] int tmp___10 = __VERIFIER_nondet_int() ; [L1102] int blastFlag ; [L1106] blastFlag = 0 [L1107] s->hit=__VERIFIER_nondet_int () [L1108] s->state = 8464 [L1109] tmp = __VERIFIER_nondet_int() [L1110] Time = tmp [L1111] cb = (void (*)())((void *)0) [L1112] ret = -1 [L1113] skip = 0 [L1114] got_new_session = 0 [L1115] EXPR s->info_callback VAL [init=1, SSLv3_server_data={9:0}] [L1115] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1116] EXPR s->info_callback [L1116] cb = s->info_callback [L1120] EXPR s->in_handshake [L1120] s->in_handshake += 1 [L1121] COND FALSE !(tmp___1 & 12288) VAL [init=1, SSLv3_server_data={9:0}] [L1130] EXPR s->cert VAL [init=1, SSLv3_server_data={9:0}] [L1130] COND FALSE !((unsigned long )s->cert == (unsigned long )((void *)0)) [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={9:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1163] COND TRUE s->state == 8464 [L1323] s->shutdown = 0 [L1324] ret = __VERIFIER_nondet_int() [L1325] COND TRUE blastFlag == 0 [L1326] blastFlag = 1 VAL [init=1, SSLv3_server_data={9:0}] [L1330] COND FALSE !(ret <= 0) [L1335] got_new_session = 1 [L1336] s->state = 8496 [L1337] s->init_num = 0 VAL [init=1, SSLv3_server_data={9:0}] [L1662] EXPR s->s3 [L1662] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={9:0}] [L1662] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1691] skip = 0 VAL [init=1, SSLv3_server_data={9:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={9:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1172] COND TRUE s->state == 8496 [L1341] ret = __VERIFIER_nondet_int() [L1342] COND TRUE blastFlag == 1 [L1343] blastFlag = 2 VAL [init=1, SSLv3_server_data={9:0}] [L1347] COND FALSE !(ret <= 0) [L1352] s->hit VAL [init=1, SSLv3_server_data={9:0}] [L1352] COND TRUE s->hit [L1353] s->state = 8656 VAL [init=1, SSLv3_server_data={9:0}] [L1357] s->init_num = 0 VAL [init=1, SSLv3_server_data={9:0}] [L1662] EXPR s->s3 [L1662] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={9:0}] [L1662] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1691] skip = 0 VAL [init=1, SSLv3_server_data={9:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={9:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1202] COND FALSE !(s->state == 8448) [L1205] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1205] COND FALSE !(s->state == 8576) [L1208] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1208] COND FALSE !(s->state == 8577) [L1211] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1211] COND FALSE !(s->state == 8592) [L1214] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1214] COND FALSE !(s->state == 8593) [L1217] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1217] COND FALSE !(s->state == 8608) [L1220] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1220] COND FALSE !(s->state == 8609) [L1223] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1223] COND FALSE !(s->state == 8640) [L1226] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1226] COND FALSE !(s->state == 8641) [L1229] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1229] COND TRUE s->state == 8656 [L1555] EXPR s->session [L1555] EXPR s->s3 [L1555] EXPR (s->s3)->tmp.new_cipher [L1555] (s->session)->cipher = (s->s3)->tmp.new_cipher [L1556] COND FALSE !(! tmp___9) [L1562] ret = __VERIFIER_nondet_int() [L1563] COND TRUE blastFlag == 2 [L1564] blastFlag = 3 VAL [init=1, SSLv3_server_data={9:0}] [L1568] COND FALSE !(ret <= 0) [L1573] s->state = 8672 [L1574] s->init_num = 0 VAL [init=1, SSLv3_server_data={9:0}] [L1575] COND FALSE !(! tmp___10) VAL [init=1, SSLv3_server_data={9:0}] [L1662] EXPR s->s3 [L1662] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={9:0}] [L1662] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1691] skip = 0 VAL [init=1, SSLv3_server_data={9:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={9:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1202] COND FALSE !(s->state == 8448) [L1205] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1205] COND FALSE !(s->state == 8576) [L1208] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1208] COND FALSE !(s->state == 8577) [L1211] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1211] COND FALSE !(s->state == 8592) [L1214] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1214] COND FALSE !(s->state == 8593) [L1217] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1217] COND FALSE !(s->state == 8608) [L1220] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1220] COND FALSE !(s->state == 8609) [L1223] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1223] COND FALSE !(s->state == 8640) [L1226] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1226] COND FALSE !(s->state == 8641) [L1229] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1229] COND FALSE !(s->state == 8656) [L1232] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1232] COND FALSE !(s->state == 8657) [L1235] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1235] COND TRUE s->state == 8672 [L1584] ret = __VERIFIER_nondet_int() [L1585] COND TRUE blastFlag == 3 VAL [init=1, SSLv3_server_data={9:0}] [L1703] __VERIFIER_error() VAL [init=1, SSLv3_server_data={9:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 143 locations, 1 error locations. Result: UNSAFE, OverallTime: 17.5s, OverallIterations: 39, TraceHistogramMax: 4, AutomataDifference: 13.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 7073 SDtfs, 2105 SDslu, 10601 SDs, 0 SdLazy, 6863 SolverSat, 339 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 10.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 219 GetRequests, 76 SyntacticMatches, 29 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=479occurred in iteration=38, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 38 MinimizatonAttempts, 924 StatesRemovedByMinimization, 37 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 3288 NumberOfCodeBlocks, 3288 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 3125 ConstructedInterpolants, 0 QuantifiedInterpolants, 733119 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 38 InterpolantComputations, 38 PerfectInterpolantSequences, 1564/1564 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.24-678e011 [2019-11-20 00:47:06,404 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 00:47:06,406 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 00:47:06,423 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 00:47:06,424 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 00:47:06,425 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 00:47:06,427 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 00:47:06,438 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 00:47:06,443 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 00:47:06,446 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 00:47:06,447 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 00:47:06,449 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 00:47:06,449 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 00:47:06,452 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 00:47:06,454 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 00:47:06,455 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 00:47:06,457 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 00:47:06,459 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 00:47:06,461 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 00:47:06,465 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 00:47:06,469 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 00:47:06,471 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 00:47:06,474 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 00:47:06,475 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 00:47:06,478 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 00:47:06,479 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 00:47:06,479 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 00:47:06,480 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 00:47:06,481 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 00:47:06,483 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 00:47:06,484 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 00:47:06,484 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 00:47:06,485 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 00:47:06,486 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 00:47:06,487 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 00:47:06,487 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 00:47:06,488 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 00:47:06,489 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 00:47:06,489 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 00:47:06,490 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 00:47:06,491 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 00:47:06,492 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_f172c062-8e40-4e5b-9817-212625c0e236/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-11-20 00:47:06,518 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 00:47:06,528 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 00:47:06,529 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 00:47:06,529 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 00:47:06,530 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 00:47:06,530 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 00:47:06,530 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 00:47:06,530 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 00:47:06,531 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 00:47:06,531 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-20 00:47:06,531 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 00:47:06,531 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-20 00:47:06,533 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-20 00:47:06,534 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-20 00:47:06,534 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 00:47:06,534 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 00:47:06,534 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 00:47:06,534 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-20 00:47:06,535 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 00:47:06,535 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 00:47:06,536 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 00:47:06,536 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 00:47:06,536 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 00:47:06,536 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 00:47:06,537 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 00:47:06,537 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-20 00:47:06,537 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-20 00:47:06,537 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-20 00:47:06,538 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-20 00:47:06,538 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-20 00:47:06,539 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_f172c062-8e40-4e5b-9817-212625c0e236/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 -> 09d651c8899349531493fefbd169797d0022b4a3 [2019-11-20 00:47:06,860 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 00:47:06,872 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 00:47:06,875 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 00:47:06,878 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 00:47:06,878 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 00:47:06,879 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_f172c062-8e40-4e5b-9817-212625c0e236/bin/uautomizer/../../sv-benchmarks/c/ssh/s3_srvr.blast.03.i.cil.c [2019-11-20 00:47:06,940 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_f172c062-8e40-4e5b-9817-212625c0e236/bin/uautomizer/data/e8307dc17/6e33248822b54c8b82d3bbc2e167048b/FLAGbf906c0e8 [2019-11-20 00:47:07,444 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 00:47:07,446 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_f172c062-8e40-4e5b-9817-212625c0e236/sv-benchmarks/c/ssh/s3_srvr.blast.03.i.cil.c [2019-11-20 00:47:07,466 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_f172c062-8e40-4e5b-9817-212625c0e236/bin/uautomizer/data/e8307dc17/6e33248822b54c8b82d3bbc2e167048b/FLAGbf906c0e8 [2019-11-20 00:47:07,667 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_f172c062-8e40-4e5b-9817-212625c0e236/bin/uautomizer/data/e8307dc17/6e33248822b54c8b82d3bbc2e167048b [2019-11-20 00:47:07,669 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 00:47:07,670 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 00:47:07,672 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 00:47:07,674 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 00:47:07,678 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 00:47:07,679 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 12:47:07" (1/1) ... [2019-11-20 00:47:07,681 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@634da0c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:47:07, skipping insertion in model container [2019-11-20 00:47:07,682 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 12:47:07" (1/1) ... [2019-11-20 00:47:07,691 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 00:47:07,768 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 00:47:08,347 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 00:47:08,370 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 00:47:08,540 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 00:47:08,577 INFO L192 MainTranslator]: Completed translation [2019-11-20 00:47:08,577 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:47:08 WrapperNode [2019-11-20 00:47:08,577 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 00:47:08,578 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 00:47:08,578 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 00:47:08,578 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 00:47:08,588 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:47:08" (1/1) ... [2019-11-20 00:47:08,633 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:47:08" (1/1) ... [2019-11-20 00:47:08,720 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 00:47:08,721 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 00:47:08,721 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 00:47:08,721 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 00:47:08,737 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:47:08" (1/1) ... [2019-11-20 00:47:08,738 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:47:08" (1/1) ... [2019-11-20 00:47:08,763 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:47:08" (1/1) ... [2019-11-20 00:47:08,772 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:47:08" (1/1) ... [2019-11-20 00:47:08,851 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:47:08" (1/1) ... [2019-11-20 00:47:08,871 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:47:08" (1/1) ... [2019-11-20 00:47:08,875 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:47:08" (1/1) ... [2019-11-20 00:47:08,882 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 00:47:08,887 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 00:47:08,888 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 00:47:08,888 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 00:47:08,889 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:47:08" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f172c062-8e40-4e5b-9817-212625c0e236/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 00:47:08,939 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-20 00:47:08,939 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-20 00:47:08,941 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-20 00:47:08,941 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-20 00:47:08,941 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-20 00:47:08,942 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 00:47:08,942 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 00:47:08,942 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-20 00:47:09,128 WARN L736 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-20 00:47:11,500 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2019-11-20 00:47:11,500 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2019-11-20 00:47:11,502 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 00:47:11,502 INFO L285 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-20 00:47:11,503 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:47:11 BoogieIcfgContainer [2019-11-20 00:47:11,503 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 00:47:11,505 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-20 00:47:11,505 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-20 00:47:11,508 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-20 00:47:11,508 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 12:47:07" (1/3) ... [2019-11-20 00:47:11,509 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@623e2999 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 12:47:11, skipping insertion in model container [2019-11-20 00:47:11,510 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:47:08" (2/3) ... [2019-11-20 00:47:11,510 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@623e2999 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 12:47:11, skipping insertion in model container [2019-11-20 00:47:11,510 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:47:11" (3/3) ... [2019-11-20 00:47:11,516 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.03.i.cil.c [2019-11-20 00:47:11,528 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-20 00:47:11,536 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-20 00:47:11,549 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-20 00:47:11,577 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-20 00:47:11,578 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-20 00:47:11,578 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-20 00:47:11,578 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 00:47:11,578 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 00:47:11,579 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-20 00:47:11,579 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 00:47:11,579 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-20 00:47:11,604 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states. [2019-11-20 00:47:11,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-20 00:47:11,617 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:47:11,618 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:47:11,619 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:47:11,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:47:11,626 INFO L82 PathProgramCache]: Analyzing trace with hash 522837677, now seen corresponding path program 1 times [2019-11-20 00:47:11,639 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 00:47:11,639 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [474831723] [2019-11-20 00:47:11,640 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f172c062-8e40-4e5b-9817-212625c0e236/bin/uautomizer/cvc4 Starting monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 00:47:11,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:47:11,918 INFO L255 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 00:47:11,931 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 00:47:11,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:47:11,990 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 00:47:12,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:47:12,022 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [474831723] [2019-11-20 00:47:12,023 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:47:12,023 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-20 00:47:12,024 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235369648] [2019-11-20 00:47:12,029 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 00:47:12,030 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 00:47:12,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 00:47:12,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 00:47:12,047 INFO L87 Difference]: Start difference. First operand 143 states. Second operand 4 states. [2019-11-20 00:47:12,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:47:12,201 INFO L93 Difference]: Finished difference Result 537 states and 912 transitions. [2019-11-20 00:47:12,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 00:47:12,203 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2019-11-20 00:47:12,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:47:12,226 INFO L225 Difference]: With dead ends: 537 [2019-11-20 00:47:12,226 INFO L226 Difference]: Without dead ends: 363 [2019-11-20 00:47:12,230 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 00:47:12,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2019-11-20 00:47:12,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 363. [2019-11-20 00:47:12,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 363 states. [2019-11-20 00:47:12,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 551 transitions. [2019-11-20 00:47:12,325 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 551 transitions. Word has length 45 [2019-11-20 00:47:12,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:47:12,326 INFO L462 AbstractCegarLoop]: Abstraction has 363 states and 551 transitions. [2019-11-20 00:47:12,326 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 00:47:12,326 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 551 transitions. [2019-11-20 00:47:12,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-11-20 00:47:12,338 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:47:12,338 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-20 00:47:12,540 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 00:47:12,541 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:47:12,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:47:12,541 INFO L82 PathProgramCache]: Analyzing trace with hash 856140206, now seen corresponding path program 1 times [2019-11-20 00:47:12,542 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 00:47:12,542 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1189606080] [2019-11-20 00:47:12,543 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f172c062-8e40-4e5b-9817-212625c0e236/bin/uautomizer/cvc4 Starting monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 00:47:12,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:47:12,808 INFO L255 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 00:47:12,815 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 00:47:12,853 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:47:12,854 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 00:47:12,900 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:47:12,901 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1189606080] [2019-11-20 00:47:12,901 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:47:12,902 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-20 00:47:12,902 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15304394] [2019-11-20 00:47:12,904 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 00:47:12,904 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 00:47:12,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 00:47:12,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 00:47:12,905 INFO L87 Difference]: Start difference. First operand 363 states and 551 transitions. Second operand 4 states. [2019-11-20 00:47:13,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:47:13,184 INFO L93 Difference]: Finished difference Result 834 states and 1272 transitions. [2019-11-20 00:47:13,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 00:47:13,184 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2019-11-20 00:47:13,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:47:13,188 INFO L225 Difference]: With dead ends: 834 [2019-11-20 00:47:13,188 INFO L226 Difference]: Without dead ends: 598 [2019-11-20 00:47:13,190 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 00:47:13,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2019-11-20 00:47:13,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 598. [2019-11-20 00:47:13,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 598 states. [2019-11-20 00:47:13,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 906 transitions. [2019-11-20 00:47:13,221 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 906 transitions. Word has length 103 [2019-11-20 00:47:13,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:47:13,222 INFO L462 AbstractCegarLoop]: Abstraction has 598 states and 906 transitions. [2019-11-20 00:47:13,222 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 00:47:13,223 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 906 transitions. [2019-11-20 00:47:13,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-11-20 00:47:13,225 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:47:13,225 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1] [2019-11-20 00:47:13,432 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 00:47:13,432 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:47:13,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:47:13,433 INFO L82 PathProgramCache]: Analyzing trace with hash -536013004, now seen corresponding path program 1 times [2019-11-20 00:47:13,434 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 00:47:13,435 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [819056400] [2019-11-20 00:47:13,435 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f172c062-8e40-4e5b-9817-212625c0e236/bin/uautomizer/cvc4 Starting monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 00:47:14,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 00:47:15,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 00:47:16,000 INFO L174 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2019-11-20 00:47:16,000 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-20 00:47:16,211 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 00:47:16,361 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 12:47:16 BoogieIcfgContainer [2019-11-20 00:47:16,361 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-20 00:47:16,361 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-20 00:47:16,361 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-20 00:47:16,362 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-20 00:47:16,362 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:47:11" (3/4) ... [2019-11-20 00:47:16,364 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-20 00:47:16,512 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_f172c062-8e40-4e5b-9817-212625c0e236/bin/uautomizer/witness.graphml [2019-11-20 00:47:16,512 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-20 00:47:16,515 INFO L168 Benchmark]: Toolchain (without parser) took 8843.30 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 202.4 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -156.0 MB). Peak memory consumption was 46.3 MB. Max. memory is 11.5 GB. [2019-11-20 00:47:16,516 INFO L168 Benchmark]: CDTParser took 0.34 ms. Allocated memory is still 1.0 GB. Free memory is still 987.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 00:47:16,516 INFO L168 Benchmark]: CACSL2BoogieTranslator took 905.36 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 118.5 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -134.4 MB). Peak memory consumption was 28.5 MB. Max. memory is 11.5 GB. [2019-11-20 00:47:16,517 INFO L168 Benchmark]: Boogie Procedure Inliner took 142.27 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: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-11-20 00:47:16,517 INFO L168 Benchmark]: Boogie Preprocessor took 166.55 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: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-11-20 00:47:16,518 INFO L168 Benchmark]: RCFGBuilder took 2616.30 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 982.9 MB in the end (delta: 94.1 MB). Peak memory consumption was 94.1 MB. Max. memory is 11.5 GB. [2019-11-20 00:47:16,518 INFO L168 Benchmark]: TraceAbstraction took 4856.26 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 83.9 MB). Free memory was 982.9 MB in the beginning and 1.1 GB in the end (delta: -145.2 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 00:47:16,518 INFO L168 Benchmark]: Witness Printer took 150.88 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: 15.8 MB). Peak memory consumption was 15.8 MB. Max. memory is 11.5 GB. [2019-11-20 00:47:16,520 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.34 ms. Allocated memory is still 1.0 GB. Free memory is still 987.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 905.36 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 118.5 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -134.4 MB). Peak memory consumption was 28.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 142.27 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: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 166.55 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: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 2616.30 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 982.9 MB in the end (delta: 94.1 MB). Peak memory consumption was 94.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 4856.26 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 83.9 MB). Free memory was 982.9 MB in the beginning and 1.1 GB in the end (delta: -145.2 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 150.88 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: 15.8 MB). Peak memory consumption was 15.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1703]: 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_server_data ; VAL [init=1, SSLv3_server_data={2147483645:0}] [L1065] SSL *s ; [L1066] int tmp ; [L1070] s = malloc(sizeof(SSL)) [L1071] s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1072] s->ctx = malloc(sizeof(SSL_CTX)) [L1073] s->session = malloc(sizeof(SSL_SESSION)) [L1074] s->state = 8464 [L1081] BUF_MEM *buf ; [L1082] unsigned long l ; [L1083] unsigned long Time ; [L1084] unsigned long tmp ; [L1085] void (*cb)() ; [L1086] long num1 ; [L1087] int ret ; [L1088] int new_state ; [L1089] int state ; [L1090] int skip ; [L1091] int got_new_session ; [L1092] int tmp___1 = __VERIFIER_nondet_int() ; [L1093] int tmp___2 = __VERIFIER_nondet_int() ; [L1094] int tmp___3 = __VERIFIER_nondet_int() ; [L1095] int tmp___4 = __VERIFIER_nondet_int() ; [L1096] int tmp___5 = __VERIFIER_nondet_int() ; [L1097] int tmp___6 = __VERIFIER_nondet_int() ; [L1098] int tmp___7 ; [L1099] long tmp___8 = __VERIFIER_nondet_long() ; [L1100] int tmp___9 = __VERIFIER_nondet_int() ; [L1101] int tmp___10 = __VERIFIER_nondet_int() ; [L1102] int blastFlag ; [L1106] blastFlag = 0 [L1107] s->hit=__VERIFIER_nondet_int () [L1108] s->state = 8464 [L1109] tmp = __VERIFIER_nondet_int() [L1110] Time = tmp [L1111] cb = (void (*)())((void *)0) [L1112] ret = -1 [L1113] skip = 0 [L1114] got_new_session = 0 [L1115] EXPR s->info_callback VAL [init=1, SSLv3_server_data={2147483645:0}] [L1115] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1116] EXPR s->info_callback [L1116] cb = s->info_callback [L1120] EXPR s->in_handshake [L1120] s->in_handshake += 1 [L1121] COND FALSE !(tmp___1 & 12288) VAL [init=1, SSLv3_server_data={2147483645:0}] [L1130] EXPR s->cert VAL [init=1, SSLv3_server_data={2147483645:0}] [L1130] COND FALSE !((unsigned long )s->cert == (unsigned long )((void *)0)) [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={2147483645:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1163] COND TRUE s->state == 8464 [L1323] s->shutdown = 0 [L1324] ret = __VERIFIER_nondet_int() [L1325] COND TRUE blastFlag == 0 [L1326] blastFlag = 1 VAL [init=1, SSLv3_server_data={2147483645:0}] [L1330] COND FALSE !(ret <= 0) [L1335] got_new_session = 1 [L1336] s->state = 8496 [L1337] s->init_num = 0 VAL [init=1, SSLv3_server_data={2147483645:0}] [L1662] EXPR s->s3 [L1662] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={2147483645:0}] [L1662] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1691] skip = 0 VAL [init=1, SSLv3_server_data={2147483645:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={2147483645:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1172] COND TRUE s->state == 8496 [L1341] ret = __VERIFIER_nondet_int() [L1342] COND TRUE blastFlag == 1 [L1343] blastFlag = 2 VAL [init=1, SSLv3_server_data={2147483645:0}] [L1347] COND FALSE !(ret <= 0) [L1352] s->hit VAL [init=1, SSLv3_server_data={2147483645:0}] [L1352] COND TRUE s->hit [L1353] s->state = 8656 VAL [init=1, SSLv3_server_data={2147483645:0}] [L1357] s->init_num = 0 VAL [init=1, SSLv3_server_data={2147483645:0}] [L1662] EXPR s->s3 [L1662] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={2147483645:0}] [L1662] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1691] skip = 0 VAL [init=1, SSLv3_server_data={2147483645:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={2147483645:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1202] COND FALSE !(s->state == 8448) [L1205] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1205] COND FALSE !(s->state == 8576) [L1208] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1208] COND FALSE !(s->state == 8577) [L1211] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1211] COND FALSE !(s->state == 8592) [L1214] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1214] COND FALSE !(s->state == 8593) [L1217] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1217] COND FALSE !(s->state == 8608) [L1220] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1220] COND FALSE !(s->state == 8609) [L1223] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1223] COND FALSE !(s->state == 8640) [L1226] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1226] COND FALSE !(s->state == 8641) [L1229] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1229] COND TRUE s->state == 8656 [L1555] EXPR s->session [L1555] EXPR s->s3 [L1555] EXPR (s->s3)->tmp.new_cipher [L1555] (s->session)->cipher = (s->s3)->tmp.new_cipher [L1556] COND FALSE !(! tmp___9) [L1562] ret = __VERIFIER_nondet_int() [L1563] COND TRUE blastFlag == 2 [L1564] blastFlag = 3 VAL [init=1, SSLv3_server_data={2147483645:0}] [L1568] COND FALSE !(ret <= 0) [L1573] s->state = 8672 [L1574] s->init_num = 0 VAL [init=1, SSLv3_server_data={2147483645:0}] [L1575] COND FALSE !(! tmp___10) VAL [init=1, SSLv3_server_data={2147483645:0}] [L1662] EXPR s->s3 [L1662] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={2147483645:0}] [L1662] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1691] skip = 0 VAL [init=1, SSLv3_server_data={2147483645:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={2147483645:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1202] COND FALSE !(s->state == 8448) [L1205] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1205] COND FALSE !(s->state == 8576) [L1208] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1208] COND FALSE !(s->state == 8577) [L1211] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1211] COND FALSE !(s->state == 8592) [L1214] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1214] COND FALSE !(s->state == 8593) [L1217] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1217] COND FALSE !(s->state == 8608) [L1220] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1220] COND FALSE !(s->state == 8609) [L1223] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1223] COND FALSE !(s->state == 8640) [L1226] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1226] COND FALSE !(s->state == 8641) [L1229] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1229] COND FALSE !(s->state == 8656) [L1232] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1232] COND FALSE !(s->state == 8657) [L1235] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1235] COND TRUE s->state == 8672 [L1584] ret = __VERIFIER_nondet_int() [L1585] COND TRUE blastFlag == 3 VAL [init=1, SSLv3_server_data={2147483645:0}] [L1703] __VERIFIER_error() VAL [init=1, SSLv3_server_data={2147483645:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 143 locations, 1 error locations. Result: UNSAFE, OverallTime: 4.7s, OverallIterations: 3, TraceHistogramMax: 4, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 588 SDtfs, 658 SDslu, 785 SDs, 0 SdLazy, 51 SolverSat, 19 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 292 GetRequests, 288 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=598occurred in iteration=2, 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, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 273 NumberOfCodeBlocks, 273 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 292 ConstructedInterpolants, 0 QuantifiedInterpolants, 74336 SizeOfPredicates, 1 NumberOfNonLiveVariables, 399 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 116/116 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...