./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ssh/s3_srvr.blast.04.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_e9b6a679-d9cb-4613-a4e1-8f5e8bfc7adf/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_e9b6a679-d9cb-4613-a4e1-8f5e8bfc7adf/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_e9b6a679-d9cb-4613-a4e1-8f5e8bfc7adf/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_e9b6a679-d9cb-4613-a4e1-8f5e8bfc7adf/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh/s3_srvr.blast.04.i.cil.c -s /tmp/vcloud-vcloud-master/worker/run_dir_e9b6a679-d9cb-4613-a4e1-8f5e8bfc7adf/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_e9b6a679-d9cb-4613-a4e1-8f5e8bfc7adf/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 a85198d3f93b8c751f2c6e712deab62f97c1022f ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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_e9b6a679-d9cb-4613-a4e1-8f5e8bfc7adf/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_e9b6a679-d9cb-4613-a4e1-8f5e8bfc7adf/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_e9b6a679-d9cb-4613-a4e1-8f5e8bfc7adf/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_e9b6a679-d9cb-4613-a4e1-8f5e8bfc7adf/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh/s3_srvr.blast.04.i.cil.c -s /tmp/vcloud-vcloud-master/worker/run_dir_e9b6a679-d9cb-4613-a4e1-8f5e8bfc7adf/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_e9b6a679-d9cb-4613-a4e1-8f5e8bfc7adf/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 a85198d3f93b8c751f2c6e712deab62f97c1022f ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-19 23:45:02,841 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-19 23:45:02,843 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-19 23:45:02,854 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-19 23:45:02,857 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-19 23:45:02,859 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-19 23:45:02,861 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-19 23:45:02,870 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-19 23:45:02,877 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-19 23:45:02,881 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-19 23:45:02,883 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-19 23:45:02,884 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-19 23:45:02,884 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-19 23:45:02,887 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-19 23:45:02,888 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-19 23:45:02,889 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-19 23:45:02,891 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-19 23:45:02,893 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-19 23:45:02,896 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-19 23:45:02,900 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-19 23:45:02,904 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-19 23:45:02,906 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-19 23:45:02,909 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-19 23:45:02,910 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-19 23:45:02,914 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-19 23:45:02,914 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-19 23:45:02,914 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-19 23:45:02,916 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-19 23:45:02,916 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-19 23:45:02,918 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-19 23:45:02,918 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-19 23:45:02,919 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-19 23:45:02,920 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-19 23:45:02,921 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-19 23:45:02,923 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-19 23:45:02,923 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-19 23:45:02,924 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-19 23:45:02,924 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-19 23:45:02,924 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-19 23:45:02,925 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-19 23:45:02,927 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-19 23:45:02,928 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_e9b6a679-d9cb-4613-a4e1-8f5e8bfc7adf/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-19 23:45:02,958 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-19 23:45:02,969 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-19 23:45:02,971 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-19 23:45:02,971 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-19 23:45:02,971 INFO L138 SettingsManager]: * Use SBE=true [2019-11-19 23:45:02,972 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-19 23:45:02,972 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-19 23:45:02,972 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-19 23:45:02,973 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-19 23:45:02,973 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-19 23:45:02,973 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-19 23:45:02,973 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-19 23:45:02,974 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-19 23:45:02,974 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-19 23:45:02,974 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-19 23:45:02,974 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-19 23:45:02,975 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-19 23:45:02,975 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-19 23:45:02,975 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-19 23:45:02,975 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-19 23:45:02,976 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-19 23:45:02,976 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-19 23:45:02,976 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-19 23:45:02,977 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-19 23:45:02,978 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-19 23:45:02,979 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-19 23:45:02,979 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-19 23:45:02,979 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-19 23:45:02,979 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_e9b6a679-d9cb-4613-a4e1-8f5e8bfc7adf/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 -> a85198d3f93b8c751f2c6e712deab62f97c1022f [2019-11-19 23:45:03,174 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-19 23:45:03,191 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-19 23:45:03,194 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-19 23:45:03,196 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-19 23:45:03,196 INFO L275 PluginConnector]: CDTParser initialized [2019-11-19 23:45:03,197 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_e9b6a679-d9cb-4613-a4e1-8f5e8bfc7adf/bin/uautomizer/../../sv-benchmarks/c/ssh/s3_srvr.blast.04.i.cil.c [2019-11-19 23:45:03,252 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_e9b6a679-d9cb-4613-a4e1-8f5e8bfc7adf/bin/uautomizer/data/c62448657/7fbcf90eb2694b1ba1878440b21bc9b8/FLAGe295f5de8 [2019-11-19 23:45:03,829 INFO L306 CDTParser]: Found 1 translation units. [2019-11-19 23:45:03,830 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_e9b6a679-d9cb-4613-a4e1-8f5e8bfc7adf/sv-benchmarks/c/ssh/s3_srvr.blast.04.i.cil.c [2019-11-19 23:45:03,860 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_e9b6a679-d9cb-4613-a4e1-8f5e8bfc7adf/bin/uautomizer/data/c62448657/7fbcf90eb2694b1ba1878440b21bc9b8/FLAGe295f5de8 [2019-11-19 23:45:04,270 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_e9b6a679-d9cb-4613-a4e1-8f5e8bfc7adf/bin/uautomizer/data/c62448657/7fbcf90eb2694b1ba1878440b21bc9b8 [2019-11-19 23:45:04,273 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-19 23:45:04,274 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-19 23:45:04,275 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-19 23:45:04,276 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-19 23:45:04,279 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-19 23:45:04,280 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 11:45:04" (1/1) ... [2019-11-19 23:45:04,283 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18f97bab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:45:04, skipping insertion in model container [2019-11-19 23:45:04,283 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 11:45:04" (1/1) ... [2019-11-19 23:45:04,291 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-19 23:45:04,358 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-19 23:45:04,883 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 23:45:04,903 INFO L188 MainTranslator]: Completed pre-run [2019-11-19 23:45:05,060 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 23:45:05,084 INFO L192 MainTranslator]: Completed translation [2019-11-19 23:45:05,085 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:45:05 WrapperNode [2019-11-19 23:45:05,086 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-19 23:45:05,087 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-19 23:45:05,087 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-19 23:45:05,087 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-19 23:45:05,096 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:45:05" (1/1) ... [2019-11-19 23:45:05,132 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:45:05" (1/1) ... [2019-11-19 23:45:05,198 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-19 23:45:05,199 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-19 23:45:05,199 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-19 23:45:05,199 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-19 23:45:05,209 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:45:05" (1/1) ... [2019-11-19 23:45:05,210 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:45:05" (1/1) ... [2019-11-19 23:45:05,230 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:45:05" (1/1) ... [2019-11-19 23:45:05,230 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:45:05" (1/1) ... [2019-11-19 23:45:05,284 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:45:05" (1/1) ... [2019-11-19 23:45:05,301 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:45:05" (1/1) ... [2019-11-19 23:45:05,319 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:45:05" (1/1) ... [2019-11-19 23:45:05,324 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-19 23:45:05,325 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-19 23:45:05,325 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-19 23:45:05,325 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-19 23:45:05,326 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:45:05" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e9b6a679-d9cb-4613-a4e1-8f5e8bfc7adf/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-19 23:45:05,398 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-19 23:45:05,398 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-19 23:45:05,398 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-19 23:45:05,398 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-19 23:45:05,399 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-19 23:45:05,399 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-19 23:45:05,400 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-19 23:45:05,400 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-19 23:45:05,666 WARN L736 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-19 23:45:06,646 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2019-11-19 23:45:06,646 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2019-11-19 23:45:06,647 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-19 23:45:06,648 INFO L285 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-19 23:45:06,649 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 11:45:06 BoogieIcfgContainer [2019-11-19 23:45:06,649 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-19 23:45:06,650 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-19 23:45:06,650 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-19 23:45:06,654 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-19 23:45:06,656 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 11:45:04" (1/3) ... [2019-11-19 23:45:06,658 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31256591 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 11:45:06, skipping insertion in model container [2019-11-19 23:45:06,658 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:45:05" (2/3) ... [2019-11-19 23:45:06,658 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31256591 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 11:45:06, skipping insertion in model container [2019-11-19 23:45:06,659 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 11:45:06" (3/3) ... [2019-11-19 23:45:06,660 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.04.i.cil.c [2019-11-19 23:45:06,670 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-19 23:45:06,677 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-19 23:45:06,687 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-19 23:45:06,711 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-19 23:45:06,712 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-19 23:45:06,712 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-19 23:45:06,712 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-19 23:45:06,712 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-19 23:45:06,712 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-19 23:45:06,713 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-19 23:45:06,713 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-19 23:45:06,732 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states. [2019-11-19 23:45:06,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-19 23:45:06,741 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:45:06,741 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-19 23:45:06,742 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:45:06,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:45:06,748 INFO L82 PathProgramCache]: Analyzing trace with hash 522836684, now seen corresponding path program 1 times [2019-11-19 23:45:06,756 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:45:06,757 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492321732] [2019-11-19 23:45:06,757 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:45:06,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:45:07,105 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-19 23:45:07,105 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492321732] [2019-11-19 23:45:07,106 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:45:07,107 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 23:45:07,108 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440614204] [2019-11-19 23:45:07,113 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:45:07,113 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:45:07,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:45:07,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:45:07,130 INFO L87 Difference]: Start difference. First operand 143 states. Second operand 4 states. [2019-11-19 23:45:07,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:45:07,688 INFO L93 Difference]: Finished difference Result 313 states and 527 transitions. [2019-11-19 23:45:07,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:45:07,691 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2019-11-19 23:45:07,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:45:07,715 INFO L225 Difference]: With dead ends: 313 [2019-11-19 23:45:07,716 INFO L226 Difference]: Without dead ends: 158 [2019-11-19 23:45:07,721 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-19 23:45:07,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-11-19 23:45:07,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 141. [2019-11-19 23:45:07,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-11-19 23:45:07,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 216 transitions. [2019-11-19 23:45:07,801 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 216 transitions. Word has length 45 [2019-11-19 23:45:07,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:45:07,802 INFO L462 AbstractCegarLoop]: Abstraction has 141 states and 216 transitions. [2019-11-19 23:45:07,802 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:45:07,802 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 216 transitions. [2019-11-19 23:45:07,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-11-19 23:45:07,805 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:45:07,805 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-19 23:45:07,806 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:45:07,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:45:07,806 INFO L82 PathProgramCache]: Analyzing trace with hash 968097209, now seen corresponding path program 1 times [2019-11-19 23:45:07,806 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:45:07,807 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321641827] [2019-11-19 23:45:07,807 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:45:07,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:45:07,925 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-19 23:45:07,925 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321641827] [2019-11-19 23:45:07,926 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:45:07,926 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 23:45:07,926 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111425698] [2019-11-19 23:45:07,928 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:45:07,928 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:45:07,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:45:07,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:45:07,929 INFO L87 Difference]: Start difference. First operand 141 states and 216 transitions. Second operand 4 states. [2019-11-19 23:45:08,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:45:08,361 INFO L93 Difference]: Finished difference Result 280 states and 423 transitions. [2019-11-19 23:45:08,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:45:08,362 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2019-11-19 23:45:08,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:45:08,364 INFO L225 Difference]: With dead ends: 280 [2019-11-19 23:45:08,364 INFO L226 Difference]: Without dead ends: 158 [2019-11-19 23:45:08,366 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-19 23:45:08,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-11-19 23:45:08,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 141. [2019-11-19 23:45:08,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-11-19 23:45:08,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 215 transitions. [2019-11-19 23:45:08,392 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 215 transitions. Word has length 58 [2019-11-19 23:45:08,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:45:08,393 INFO L462 AbstractCegarLoop]: Abstraction has 141 states and 215 transitions. [2019-11-19 23:45:08,393 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:45:08,394 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 215 transitions. [2019-11-19 23:45:08,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-11-19 23:45:08,402 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:45:08,402 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-19 23:45:08,403 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:45:08,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:45:08,404 INFO L82 PathProgramCache]: Analyzing trace with hash -461266997, now seen corresponding path program 1 times [2019-11-19 23:45:08,405 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:45:08,405 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026981330] [2019-11-19 23:45:08,406 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:45:08,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:45:08,562 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-19 23:45:08,563 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026981330] [2019-11-19 23:45:08,563 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:45:08,563 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 23:45:08,563 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750986399] [2019-11-19 23:45:08,564 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:45:08,564 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:45:08,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:45:08,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:45:08,565 INFO L87 Difference]: Start difference. First operand 141 states and 215 transitions. Second operand 4 states. [2019-11-19 23:45:08,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:45:08,945 INFO L93 Difference]: Finished difference Result 279 states and 421 transitions. [2019-11-19 23:45:08,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:45:08,947 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2019-11-19 23:45:08,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:45:08,949 INFO L225 Difference]: With dead ends: 279 [2019-11-19 23:45:08,949 INFO L226 Difference]: Without dead ends: 157 [2019-11-19 23:45:08,950 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-19 23:45:08,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-11-19 23:45:08,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 141. [2019-11-19 23:45:08,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-11-19 23:45:08,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 214 transitions. [2019-11-19 23:45:08,969 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 214 transitions. Word has length 59 [2019-11-19 23:45:08,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:45:08,970 INFO L462 AbstractCegarLoop]: Abstraction has 141 states and 214 transitions. [2019-11-19 23:45:08,970 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:45:08,970 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 214 transitions. [2019-11-19 23:45:08,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-11-19 23:45:08,976 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:45:08,977 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-19 23:45:08,977 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:45:08,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:45:08,977 INFO L82 PathProgramCache]: Analyzing trace with hash 881926454, now seen corresponding path program 1 times [2019-11-19 23:45:08,978 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:45:08,978 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141081959] [2019-11-19 23:45:08,978 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:45:09,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:45:09,109 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-19 23:45:09,109 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141081959] [2019-11-19 23:45:09,109 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:45:09,110 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 23:45:09,110 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760836654] [2019-11-19 23:45:09,110 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:45:09,111 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:45:09,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:45:09,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:45:09,112 INFO L87 Difference]: Start difference. First operand 141 states and 214 transitions. Second operand 4 states. [2019-11-19 23:45:09,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:45:09,445 INFO L93 Difference]: Finished difference Result 277 states and 418 transitions. [2019-11-19 23:45:09,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:45:09,445 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2019-11-19 23:45:09,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:45:09,447 INFO L225 Difference]: With dead ends: 277 [2019-11-19 23:45:09,447 INFO L226 Difference]: Without dead ends: 155 [2019-11-19 23:45:09,449 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-19 23:45:09,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-11-19 23:45:09,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 141. [2019-11-19 23:45:09,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-11-19 23:45:09,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 213 transitions. [2019-11-19 23:45:09,465 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 213 transitions. Word has length 59 [2019-11-19 23:45:09,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:45:09,467 INFO L462 AbstractCegarLoop]: Abstraction has 141 states and 213 transitions. [2019-11-19 23:45:09,467 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:45:09,467 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 213 transitions. [2019-11-19 23:45:09,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-11-19 23:45:09,469 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:45:09,469 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-19 23:45:09,470 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:45:09,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:45:09,470 INFO L82 PathProgramCache]: Analyzing trace with hash 1831274614, now seen corresponding path program 1 times [2019-11-19 23:45:09,470 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:45:09,471 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340890092] [2019-11-19 23:45:09,471 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:45:09,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:45:09,562 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-19 23:45:09,562 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340890092] [2019-11-19 23:45:09,562 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:45:09,562 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 23:45:09,563 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637167116] [2019-11-19 23:45:09,563 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:45:09,563 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:45:09,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:45:09,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:45:09,564 INFO L87 Difference]: Start difference. First operand 141 states and 213 transitions. Second operand 4 states. [2019-11-19 23:45:09,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:45:09,874 INFO L93 Difference]: Finished difference Result 276 states and 416 transitions. [2019-11-19 23:45:09,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:45:09,875 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2019-11-19 23:45:09,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:45:09,876 INFO L225 Difference]: With dead ends: 276 [2019-11-19 23:45:09,876 INFO L226 Difference]: Without dead ends: 154 [2019-11-19 23:45:09,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-19 23:45:09,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-11-19 23:45:09,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 141. [2019-11-19 23:45:09,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-11-19 23:45:09,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 212 transitions. [2019-11-19 23:45:09,885 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 212 transitions. Word has length 59 [2019-11-19 23:45:09,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:45:09,886 INFO L462 AbstractCegarLoop]: Abstraction has 141 states and 212 transitions. [2019-11-19 23:45:09,886 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:45:09,886 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 212 transitions. [2019-11-19 23:45:09,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-11-19 23:45:09,887 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:45:09,887 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-19 23:45:09,887 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:45:09,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:45:09,887 INFO L82 PathProgramCache]: Analyzing trace with hash 376743775, now seen corresponding path program 1 times [2019-11-19 23:45:09,888 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:45:09,888 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947798079] [2019-11-19 23:45:09,888 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:45:09,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:45:09,953 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-19 23:45:09,954 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947798079] [2019-11-19 23:45:09,954 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:45:09,954 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 23:45:09,955 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836358671] [2019-11-19 23:45:09,955 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:45:09,955 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:45:09,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:45:09,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:45:09,956 INFO L87 Difference]: Start difference. First operand 141 states and 212 transitions. Second operand 4 states. [2019-11-19 23:45:10,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:45:10,258 INFO L93 Difference]: Finished difference Result 276 states and 415 transitions. [2019-11-19 23:45:10,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:45:10,258 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2019-11-19 23:45:10,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:45:10,260 INFO L225 Difference]: With dead ends: 276 [2019-11-19 23:45:10,260 INFO L226 Difference]: Without dead ends: 154 [2019-11-19 23:45:10,261 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-19 23:45:10,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-11-19 23:45:10,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 141. [2019-11-19 23:45:10,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-11-19 23:45:10,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 211 transitions. [2019-11-19 23:45:10,267 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 211 transitions. Word has length 59 [2019-11-19 23:45:10,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:45:10,267 INFO L462 AbstractCegarLoop]: Abstraction has 141 states and 211 transitions. [2019-11-19 23:45:10,268 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:45:10,268 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 211 transitions. [2019-11-19 23:45:10,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-11-19 23:45:10,268 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:45:10,269 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-19 23:45:10,269 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:45:10,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:45:10,269 INFO L82 PathProgramCache]: Analyzing trace with hash 1718254146, now seen corresponding path program 1 times [2019-11-19 23:45:10,269 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:45:10,270 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607599837] [2019-11-19 23:45:10,270 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:45:10,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:45:10,354 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-19 23:45:10,356 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607599837] [2019-11-19 23:45:10,357 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:45:10,357 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 23:45:10,358 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821256018] [2019-11-19 23:45:10,359 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:45:10,360 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:45:10,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:45:10,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:45:10,362 INFO L87 Difference]: Start difference. First operand 141 states and 211 transitions. Second operand 4 states. [2019-11-19 23:45:10,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:45:10,637 INFO L93 Difference]: Finished difference Result 276 states and 414 transitions. [2019-11-19 23:45:10,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:45:10,638 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2019-11-19 23:45:10,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:45:10,639 INFO L225 Difference]: With dead ends: 276 [2019-11-19 23:45:10,639 INFO L226 Difference]: Without dead ends: 154 [2019-11-19 23:45:10,639 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-19 23:45:10,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-11-19 23:45:10,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 141. [2019-11-19 23:45:10,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-11-19 23:45:10,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 210 transitions. [2019-11-19 23:45:10,644 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 210 transitions. Word has length 60 [2019-11-19 23:45:10,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:45:10,644 INFO L462 AbstractCegarLoop]: Abstraction has 141 states and 210 transitions. [2019-11-19 23:45:10,644 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:45:10,645 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 210 transitions. [2019-11-19 23:45:10,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-11-19 23:45:10,645 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:45:10,645 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-19 23:45:10,646 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:45:10,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:45:10,646 INFO L82 PathProgramCache]: Analyzing trace with hash 316605892, now seen corresponding path program 1 times [2019-11-19 23:45:10,646 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:45:10,646 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081483038] [2019-11-19 23:45:10,647 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:45:10,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:45:10,737 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-19 23:45:10,738 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081483038] [2019-11-19 23:45:10,739 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:45:10,739 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 23:45:10,739 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652852957] [2019-11-19 23:45:10,740 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:45:10,740 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:45:10,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:45:10,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:45:10,741 INFO L87 Difference]: Start difference. First operand 141 states and 210 transitions. Second operand 4 states. [2019-11-19 23:45:11,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:45:11,062 INFO L93 Difference]: Finished difference Result 276 states and 413 transitions. [2019-11-19 23:45:11,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:45:11,062 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2019-11-19 23:45:11,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:45:11,064 INFO L225 Difference]: With dead ends: 276 [2019-11-19 23:45:11,064 INFO L226 Difference]: Without dead ends: 154 [2019-11-19 23:45:11,065 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-19 23:45:11,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-11-19 23:45:11,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 141. [2019-11-19 23:45:11,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-11-19 23:45:11,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 209 transitions. [2019-11-19 23:45:11,070 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 209 transitions. Word has length 61 [2019-11-19 23:45:11,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:45:11,070 INFO L462 AbstractCegarLoop]: Abstraction has 141 states and 209 transitions. [2019-11-19 23:45:11,071 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:45:11,071 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 209 transitions. [2019-11-19 23:45:11,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-11-19 23:45:11,072 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:45:11,072 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-19 23:45:11,072 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:45:11,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:45:11,072 INFO L82 PathProgramCache]: Analyzing trace with hash -223613817, now seen corresponding path program 1 times [2019-11-19 23:45:11,073 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:45:11,073 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588211957] [2019-11-19 23:45:11,073 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:45:11,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:45:11,160 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-19 23:45:11,161 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588211957] [2019-11-19 23:45:11,161 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:45:11,161 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 23:45:11,161 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051538565] [2019-11-19 23:45:11,161 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:45:11,162 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:45:11,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:45:11,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:45:11,162 INFO L87 Difference]: Start difference. First operand 141 states and 209 transitions. Second operand 4 states. [2019-11-19 23:45:11,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:45:11,417 INFO L93 Difference]: Finished difference Result 266 states and 399 transitions. [2019-11-19 23:45:11,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:45:11,418 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2019-11-19 23:45:11,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:45:11,419 INFO L225 Difference]: With dead ends: 266 [2019-11-19 23:45:11,420 INFO L226 Difference]: Without dead ends: 144 [2019-11-19 23:45:11,420 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-19 23:45:11,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2019-11-19 23:45:11,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 141. [2019-11-19 23:45:11,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-11-19 23:45:11,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 208 transitions. [2019-11-19 23:45:11,426 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 208 transitions. Word has length 62 [2019-11-19 23:45:11,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:45:11,426 INFO L462 AbstractCegarLoop]: Abstraction has 141 states and 208 transitions. [2019-11-19 23:45:11,426 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:45:11,426 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 208 transitions. [2019-11-19 23:45:11,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-11-19 23:45:11,427 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:45:11,427 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-19 23:45:11,428 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:45:11,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:45:11,428 INFO L82 PathProgramCache]: Analyzing trace with hash 176537583, now seen corresponding path program 1 times [2019-11-19 23:45:11,428 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:45:11,429 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994352508] [2019-11-19 23:45:11,429 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:45:11,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:45:11,517 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-19 23:45:11,518 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994352508] [2019-11-19 23:45:11,519 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:45:11,523 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 23:45:11,523 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640938947] [2019-11-19 23:45:11,524 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:45:11,524 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:45:11,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:45:11,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:45:11,525 INFO L87 Difference]: Start difference. First operand 141 states and 208 transitions. Second operand 4 states. [2019-11-19 23:45:11,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:45:11,914 INFO L93 Difference]: Finished difference Result 306 states and 460 transitions. [2019-11-19 23:45:11,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:45:11,915 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2019-11-19 23:45:11,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:45:11,917 INFO L225 Difference]: With dead ends: 306 [2019-11-19 23:45:11,917 INFO L226 Difference]: Without dead ends: 184 [2019-11-19 23:45:11,918 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-19 23:45:11,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2019-11-19 23:45:11,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 163. [2019-11-19 23:45:11,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-11-19 23:45:11,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 246 transitions. [2019-11-19 23:45:11,924 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 246 transitions. Word has length 62 [2019-11-19 23:45:11,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:45:11,931 INFO L462 AbstractCegarLoop]: Abstraction has 163 states and 246 transitions. [2019-11-19 23:45:11,932 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:45:11,932 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 246 transitions. [2019-11-19 23:45:11,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-11-19 23:45:11,933 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:45:11,933 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-19 23:45:11,933 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:45:11,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:45:11,934 INFO L82 PathProgramCache]: Analyzing trace with hash 551995766, now seen corresponding path program 1 times [2019-11-19 23:45:11,934 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:45:11,934 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955373391] [2019-11-19 23:45:11,935 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:45:11,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:45:12,003 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-19 23:45:12,004 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955373391] [2019-11-19 23:45:12,004 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:45:12,005 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 23:45:12,005 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77342644] [2019-11-19 23:45:12,005 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:45:12,005 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:45:12,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:45:12,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:45:12,006 INFO L87 Difference]: Start difference. First operand 163 states and 246 transitions. Second operand 4 states. [2019-11-19 23:45:12,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:45:12,365 INFO L93 Difference]: Finished difference Result 328 states and 497 transitions. [2019-11-19 23:45:12,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:45:12,366 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2019-11-19 23:45:12,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:45:12,367 INFO L225 Difference]: With dead ends: 328 [2019-11-19 23:45:12,367 INFO L226 Difference]: Without dead ends: 184 [2019-11-19 23:45:12,368 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-19 23:45:12,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2019-11-19 23:45:12,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 163. [2019-11-19 23:45:12,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-11-19 23:45:12,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 245 transitions. [2019-11-19 23:45:12,373 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 245 transitions. Word has length 75 [2019-11-19 23:45:12,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:45:12,374 INFO L462 AbstractCegarLoop]: Abstraction has 163 states and 245 transitions. [2019-11-19 23:45:12,374 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:45:12,374 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 245 transitions. [2019-11-19 23:45:12,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-11-19 23:45:12,375 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:45:12,375 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-19 23:45:12,375 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:45:12,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:45:12,375 INFO L82 PathProgramCache]: Analyzing trace with hash -475509842, now seen corresponding path program 1 times [2019-11-19 23:45:12,376 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:45:12,376 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484579436] [2019-11-19 23:45:12,376 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:45:12,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:45:12,423 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-19 23:45:12,424 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484579436] [2019-11-19 23:45:12,424 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:45:12,424 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 23:45:12,424 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336330867] [2019-11-19 23:45:12,425 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:45:12,425 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:45:12,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:45:12,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:45:12,425 INFO L87 Difference]: Start difference. First operand 163 states and 245 transitions. Second operand 4 states. [2019-11-19 23:45:12,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:45:12,767 INFO L93 Difference]: Finished difference Result 327 states and 494 transitions. [2019-11-19 23:45:12,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:45:12,767 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2019-11-19 23:45:12,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:45:12,769 INFO L225 Difference]: With dead ends: 327 [2019-11-19 23:45:12,769 INFO L226 Difference]: Without dead ends: 183 [2019-11-19 23:45:12,770 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-19 23:45:12,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2019-11-19 23:45:12,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 163. [2019-11-19 23:45:12,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-11-19 23:45:12,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 244 transitions. [2019-11-19 23:45:12,775 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 244 transitions. Word has length 76 [2019-11-19 23:45:12,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:45:12,775 INFO L462 AbstractCegarLoop]: Abstraction has 163 states and 244 transitions. [2019-11-19 23:45:12,775 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:45:12,776 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 244 transitions. [2019-11-19 23:45:12,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-11-19 23:45:12,776 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:45:12,777 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-19 23:45:12,777 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:45:12,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:45:12,777 INFO L82 PathProgramCache]: Analyzing trace with hash 867683609, now seen corresponding path program 1 times [2019-11-19 23:45:12,777 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:45:12,777 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577868674] [2019-11-19 23:45:12,778 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:45:12,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:45:12,827 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-19 23:45:12,827 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577868674] [2019-11-19 23:45:12,827 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:45:12,827 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 23:45:12,828 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074788762] [2019-11-19 23:45:12,828 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:45:12,828 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:45:12,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:45:12,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:45:12,829 INFO L87 Difference]: Start difference. First operand 163 states and 244 transitions. Second operand 4 states. [2019-11-19 23:45:13,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:45:13,169 INFO L93 Difference]: Finished difference Result 325 states and 490 transitions. [2019-11-19 23:45:13,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:45:13,169 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2019-11-19 23:45:13,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:45:13,171 INFO L225 Difference]: With dead ends: 325 [2019-11-19 23:45:13,171 INFO L226 Difference]: Without dead ends: 181 [2019-11-19 23:45:13,171 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-19 23:45:13,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2019-11-19 23:45:13,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 163. [2019-11-19 23:45:13,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-11-19 23:45:13,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 243 transitions. [2019-11-19 23:45:13,177 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 243 transitions. Word has length 76 [2019-11-19 23:45:13,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:45:13,178 INFO L462 AbstractCegarLoop]: Abstraction has 163 states and 243 transitions. [2019-11-19 23:45:13,178 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:45:13,178 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 243 transitions. [2019-11-19 23:45:13,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-11-19 23:45:13,179 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:45:13,179 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-19 23:45:13,179 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:45:13,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:45:13,180 INFO L82 PathProgramCache]: Analyzing trace with hash 1817031769, now seen corresponding path program 1 times [2019-11-19 23:45:13,180 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:45:13,180 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85072085] [2019-11-19 23:45:13,180 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:45:13,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:45:13,244 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-19 23:45:13,245 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85072085] [2019-11-19 23:45:13,245 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:45:13,246 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 23:45:13,246 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608453412] [2019-11-19 23:45:13,247 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:45:13,247 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:45:13,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:45:13,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:45:13,248 INFO L87 Difference]: Start difference. First operand 163 states and 243 transitions. Second operand 4 states. [2019-11-19 23:45:13,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:45:13,644 INFO L93 Difference]: Finished difference Result 324 states and 487 transitions. [2019-11-19 23:45:13,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:45:13,645 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2019-11-19 23:45:13,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:45:13,646 INFO L225 Difference]: With dead ends: 324 [2019-11-19 23:45:13,647 INFO L226 Difference]: Without dead ends: 180 [2019-11-19 23:45:13,647 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-19 23:45:13,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-11-19 23:45:13,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 163. [2019-11-19 23:45:13,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-11-19 23:45:13,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 242 transitions. [2019-11-19 23:45:13,653 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 242 transitions. Word has length 76 [2019-11-19 23:45:13,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:45:13,654 INFO L462 AbstractCegarLoop]: Abstraction has 163 states and 242 transitions. [2019-11-19 23:45:13,654 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:45:13,654 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 242 transitions. [2019-11-19 23:45:13,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-11-19 23:45:13,655 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:45:13,655 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-19 23:45:13,655 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:45:13,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:45:13,656 INFO L82 PathProgramCache]: Analyzing trace with hash 362500930, now seen corresponding path program 1 times [2019-11-19 23:45:13,656 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:45:13,656 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190271466] [2019-11-19 23:45:13,656 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:45:13,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:45:13,707 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-19 23:45:13,708 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190271466] [2019-11-19 23:45:13,708 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:45:13,708 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 23:45:13,708 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958977408] [2019-11-19 23:45:13,709 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:45:13,709 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:45:13,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:45:13,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:45:13,710 INFO L87 Difference]: Start difference. First operand 163 states and 242 transitions. Second operand 4 states. [2019-11-19 23:45:14,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:45:14,057 INFO L93 Difference]: Finished difference Result 324 states and 485 transitions. [2019-11-19 23:45:14,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:45:14,058 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2019-11-19 23:45:14,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:45:14,059 INFO L225 Difference]: With dead ends: 324 [2019-11-19 23:45:14,059 INFO L226 Difference]: Without dead ends: 180 [2019-11-19 23:45:14,060 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-19 23:45:14,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-11-19 23:45:14,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 163. [2019-11-19 23:45:14,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-11-19 23:45:14,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 241 transitions. [2019-11-19 23:45:14,068 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 241 transitions. Word has length 76 [2019-11-19 23:45:14,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:45:14,068 INFO L462 AbstractCegarLoop]: Abstraction has 163 states and 241 transitions. [2019-11-19 23:45:14,069 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:45:14,069 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 241 transitions. [2019-11-19 23:45:14,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-11-19 23:45:14,070 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:45:14,070 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-19 23:45:14,070 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:45:14,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:45:14,070 INFO L82 PathProgramCache]: Analyzing trace with hash 1276725951, now seen corresponding path program 1 times [2019-11-19 23:45:14,071 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:45:14,071 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676626196] [2019-11-19 23:45:14,071 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:45:14,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:45:14,131 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-19 23:45:14,131 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676626196] [2019-11-19 23:45:14,133 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:45:14,133 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 23:45:14,134 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915575244] [2019-11-19 23:45:14,134 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:45:14,134 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:45:14,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:45:14,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:45:14,135 INFO L87 Difference]: Start difference. First operand 163 states and 241 transitions. Second operand 4 states. [2019-11-19 23:45:14,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:45:14,456 INFO L93 Difference]: Finished difference Result 324 states and 483 transitions. [2019-11-19 23:45:14,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:45:14,456 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2019-11-19 23:45:14,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:45:14,458 INFO L225 Difference]: With dead ends: 324 [2019-11-19 23:45:14,458 INFO L226 Difference]: Without dead ends: 180 [2019-11-19 23:45:14,458 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-19 23:45:14,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-11-19 23:45:14,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 163. [2019-11-19 23:45:14,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-11-19 23:45:14,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 240 transitions. [2019-11-19 23:45:14,463 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 240 transitions. Word has length 77 [2019-11-19 23:45:14,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:45:14,463 INFO L462 AbstractCegarLoop]: Abstraction has 163 states and 240 transitions. [2019-11-19 23:45:14,463 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:45:14,463 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 240 transitions. [2019-11-19 23:45:14,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-11-19 23:45:14,464 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:45:14,468 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-19 23:45:14,468 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:45:14,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:45:14,469 INFO L82 PathProgramCache]: Analyzing trace with hash -485866265, now seen corresponding path program 1 times [2019-11-19 23:45:14,469 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:45:14,472 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601889842] [2019-11-19 23:45:14,472 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:45:14,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:45:14,531 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-19 23:45:14,531 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601889842] [2019-11-19 23:45:14,531 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:45:14,532 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 23:45:14,532 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312227347] [2019-11-19 23:45:14,532 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:45:14,532 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:45:14,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:45:14,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:45:14,533 INFO L87 Difference]: Start difference. First operand 163 states and 240 transitions. Second operand 4 states. [2019-11-19 23:45:14,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:45:14,849 INFO L93 Difference]: Finished difference Result 324 states and 481 transitions. [2019-11-19 23:45:14,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:45:14,850 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2019-11-19 23:45:14,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:45:14,851 INFO L225 Difference]: With dead ends: 324 [2019-11-19 23:45:14,852 INFO L226 Difference]: Without dead ends: 180 [2019-11-19 23:45:14,852 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-19 23:45:14,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-11-19 23:45:14,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 163. [2019-11-19 23:45:14,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-11-19 23:45:14,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 239 transitions. [2019-11-19 23:45:14,859 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 239 transitions. Word has length 78 [2019-11-19 23:45:14,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:45:14,859 INFO L462 AbstractCegarLoop]: Abstraction has 163 states and 239 transitions. [2019-11-19 23:45:14,859 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:45:14,859 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 239 transitions. [2019-11-19 23:45:14,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-11-19 23:45:14,860 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:45:14,861 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-19 23:45:14,861 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:45:14,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:45:14,861 INFO L82 PathProgramCache]: Analyzing trace with hash 669553092, now seen corresponding path program 1 times [2019-11-19 23:45:14,861 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:45:14,862 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854684141] [2019-11-19 23:45:14,862 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:45:14,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:45:14,920 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-19 23:45:14,920 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854684141] [2019-11-19 23:45:14,920 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:45:14,920 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 23:45:14,921 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794367725] [2019-11-19 23:45:14,921 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:45:14,921 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:45:14,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:45:14,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:45:14,922 INFO L87 Difference]: Start difference. First operand 163 states and 239 transitions. Second operand 4 states. [2019-11-19 23:45:15,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:45:15,207 INFO L93 Difference]: Finished difference Result 314 states and 466 transitions. [2019-11-19 23:45:15,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:45:15,207 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2019-11-19 23:45:15,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:45:15,208 INFO L225 Difference]: With dead ends: 314 [2019-11-19 23:45:15,209 INFO L226 Difference]: Without dead ends: 170 [2019-11-19 23:45:15,209 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-19 23:45:15,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2019-11-19 23:45:15,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 163. [2019-11-19 23:45:15,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-11-19 23:45:15,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 238 transitions. [2019-11-19 23:45:15,216 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 238 transitions. Word has length 79 [2019-11-19 23:45:15,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:45:15,216 INFO L462 AbstractCegarLoop]: Abstraction has 163 states and 238 transitions. [2019-11-19 23:45:15,216 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:45:15,216 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 238 transitions. [2019-11-19 23:45:15,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-19 23:45:15,217 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:45:15,217 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-19 23:45:15,218 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:45:15,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:45:15,218 INFO L82 PathProgramCache]: Analyzing trace with hash -1124223160, now seen corresponding path program 1 times [2019-11-19 23:45:15,218 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:45:15,218 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066213867] [2019-11-19 23:45:15,218 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:45:15,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:45:15,318 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-19 23:45:15,318 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066213867] [2019-11-19 23:45:15,319 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:45:15,319 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 23:45:15,319 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851799394] [2019-11-19 23:45:15,320 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:45:15,321 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:45:15,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:45:15,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:45:15,321 INFO L87 Difference]: Start difference. First operand 163 states and 238 transitions. Second operand 4 states. [2019-11-19 23:45:15,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:45:15,719 INFO L93 Difference]: Finished difference Result 402 states and 601 transitions. [2019-11-19 23:45:15,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:45:15,719 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 84 [2019-11-19 23:45:15,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:45:15,721 INFO L225 Difference]: With dead ends: 402 [2019-11-19 23:45:15,722 INFO L226 Difference]: Without dead ends: 258 [2019-11-19 23:45:15,722 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-19 23:45:15,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2019-11-19 23:45:15,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 206. [2019-11-19 23:45:15,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2019-11-19 23:45:15,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 316 transitions. [2019-11-19 23:45:15,730 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 316 transitions. Word has length 84 [2019-11-19 23:45:15,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:45:15,730 INFO L462 AbstractCegarLoop]: Abstraction has 206 states and 316 transitions. [2019-11-19 23:45:15,730 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:45:15,731 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 316 transitions. [2019-11-19 23:45:15,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-19 23:45:15,732 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:45:15,732 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-19 23:45:15,732 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:45:15,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:45:15,732 INFO L82 PathProgramCache]: Analyzing trace with hash -2021616438, now seen corresponding path program 1 times [2019-11-19 23:45:15,733 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:45:15,733 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600598777] [2019-11-19 23:45:15,733 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:45:15,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:45:15,793 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-19 23:45:15,794 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600598777] [2019-11-19 23:45:15,794 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:45:15,794 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 23:45:15,794 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440888367] [2019-11-19 23:45:15,795 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:45:15,795 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:45:15,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:45:15,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:45:15,796 INFO L87 Difference]: Start difference. First operand 206 states and 316 transitions. Second operand 4 states. [2019-11-19 23:45:16,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:45:16,151 INFO L93 Difference]: Finished difference Result 442 states and 685 transitions. [2019-11-19 23:45:16,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:45:16,152 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 84 [2019-11-19 23:45:16,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:45:16,153 INFO L225 Difference]: With dead ends: 442 [2019-11-19 23:45:16,154 INFO L226 Difference]: Without dead ends: 255 [2019-11-19 23:45:16,154 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-19 23:45:16,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2019-11-19 23:45:16,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 230. [2019-11-19 23:45:16,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2019-11-19 23:45:16,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 358 transitions. [2019-11-19 23:45:16,162 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 358 transitions. Word has length 84 [2019-11-19 23:45:16,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:45:16,162 INFO L462 AbstractCegarLoop]: Abstraction has 230 states and 358 transitions. [2019-11-19 23:45:16,162 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:45:16,163 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 358 transitions. [2019-11-19 23:45:16,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-11-19 23:45:16,164 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:45:16,164 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-19 23:45:16,164 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:45:16,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:45:16,165 INFO L82 PathProgramCache]: Analyzing trace with hash -344765763, now seen corresponding path program 1 times [2019-11-19 23:45:16,165 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:45:16,165 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288215392] [2019-11-19 23:45:16,165 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:45:16,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:45:16,232 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-19 23:45:16,233 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288215392] [2019-11-19 23:45:16,233 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:45:16,233 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 23:45:16,233 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310839191] [2019-11-19 23:45:16,234 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:45:16,234 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:45:16,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:45:16,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:45:16,235 INFO L87 Difference]: Start difference. First operand 230 states and 358 transitions. Second operand 4 states. [2019-11-19 23:45:16,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:45:16,741 INFO L93 Difference]: Finished difference Result 493 states and 762 transitions. [2019-11-19 23:45:16,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:45:16,742 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-11-19 23:45:16,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:45:16,743 INFO L225 Difference]: With dead ends: 493 [2019-11-19 23:45:16,744 INFO L226 Difference]: Without dead ends: 282 [2019-11-19 23:45:16,744 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-19 23:45:16,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2019-11-19 23:45:16,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 230. [2019-11-19 23:45:16,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2019-11-19 23:45:16,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 357 transitions. [2019-11-19 23:45:16,753 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 357 transitions. Word has length 97 [2019-11-19 23:45:16,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:45:16,753 INFO L462 AbstractCegarLoop]: Abstraction has 230 states and 357 transitions. [2019-11-19 23:45:16,753 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:45:16,754 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 357 transitions. [2019-11-19 23:45:16,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-11-19 23:45:16,755 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:45:16,755 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-19 23:45:16,755 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:45:16,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:45:16,755 INFO L82 PathProgramCache]: Analyzing trace with hash -304091013, now seen corresponding path program 1 times [2019-11-19 23:45:16,755 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:45:16,760 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178570534] [2019-11-19 23:45:16,760 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:45:16,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:45:16,829 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-19 23:45:16,829 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178570534] [2019-11-19 23:45:16,829 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:45:16,829 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 23:45:16,830 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518050433] [2019-11-19 23:45:16,830 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:45:16,830 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:45:16,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:45:16,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:45:16,831 INFO L87 Difference]: Start difference. First operand 230 states and 357 transitions. Second operand 4 states. [2019-11-19 23:45:17,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:45:17,209 INFO L93 Difference]: Finished difference Result 466 states and 724 transitions. [2019-11-19 23:45:17,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:45:17,210 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-11-19 23:45:17,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:45:17,212 INFO L225 Difference]: With dead ends: 466 [2019-11-19 23:45:17,212 INFO L226 Difference]: Without dead ends: 255 [2019-11-19 23:45:17,213 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-19 23:45:17,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2019-11-19 23:45:17,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 230. [2019-11-19 23:45:17,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2019-11-19 23:45:17,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 356 transitions. [2019-11-19 23:45:17,220 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 356 transitions. Word has length 97 [2019-11-19 23:45:17,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:45:17,220 INFO L462 AbstractCegarLoop]: Abstraction has 230 states and 356 transitions. [2019-11-19 23:45:17,221 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:45:17,221 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 356 transitions. [2019-11-19 23:45:17,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-19 23:45:17,222 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:45:17,222 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-19 23:45:17,222 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:45:17,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:45:17,223 INFO L82 PathProgramCache]: Analyzing trace with hash 1789653831, now seen corresponding path program 1 times [2019-11-19 23:45:17,223 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:45:17,223 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887746830] [2019-11-19 23:45:17,223 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:45:17,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:45:17,300 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-19 23:45:17,301 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887746830] [2019-11-19 23:45:17,301 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:45:17,301 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 23:45:17,302 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854010284] [2019-11-19 23:45:17,303 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:45:17,303 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:45:17,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:45:17,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:45:17,303 INFO L87 Difference]: Start difference. First operand 230 states and 356 transitions. Second operand 4 states. [2019-11-19 23:45:17,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:45:17,737 INFO L93 Difference]: Finished difference Result 492 states and 757 transitions. [2019-11-19 23:45:17,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:45:17,738 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-11-19 23:45:17,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:45:17,740 INFO L225 Difference]: With dead ends: 492 [2019-11-19 23:45:17,740 INFO L226 Difference]: Without dead ends: 281 [2019-11-19 23:45:17,741 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-19 23:45:17,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2019-11-19 23:45:17,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 230. [2019-11-19 23:45:17,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2019-11-19 23:45:17,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 355 transitions. [2019-11-19 23:45:17,748 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 355 transitions. Word has length 98 [2019-11-19 23:45:17,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:45:17,749 INFO L462 AbstractCegarLoop]: Abstraction has 230 states and 355 transitions. [2019-11-19 23:45:17,749 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:45:17,749 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 355 transitions. [2019-11-19 23:45:17,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-19 23:45:17,750 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:45:17,750 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-19 23:45:17,751 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:45:17,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:45:17,751 INFO L82 PathProgramCache]: Analyzing trace with hash -1162120014, now seen corresponding path program 1 times [2019-11-19 23:45:17,751 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:45:17,752 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101322107] [2019-11-19 23:45:17,752 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:45:17,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:45:17,808 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-19 23:45:17,808 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101322107] [2019-11-19 23:45:17,809 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:45:17,809 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 23:45:17,809 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789788940] [2019-11-19 23:45:17,809 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:45:17,810 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:45:17,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:45:17,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:45:17,811 INFO L87 Difference]: Start difference. First operand 230 states and 355 transitions. Second operand 4 states. [2019-11-19 23:45:18,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:45:18,332 INFO L93 Difference]: Finished difference Result 490 states and 753 transitions. [2019-11-19 23:45:18,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:45:18,332 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-11-19 23:45:18,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:45:18,334 INFO L225 Difference]: With dead ends: 490 [2019-11-19 23:45:18,334 INFO L226 Difference]: Without dead ends: 279 [2019-11-19 23:45:18,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-19 23:45:18,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2019-11-19 23:45:18,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 230. [2019-11-19 23:45:18,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2019-11-19 23:45:18,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 354 transitions. [2019-11-19 23:45:18,344 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 354 transitions. Word has length 98 [2019-11-19 23:45:18,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:45:18,344 INFO L462 AbstractCegarLoop]: Abstraction has 230 states and 354 transitions. [2019-11-19 23:45:18,344 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:45:18,344 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 354 transitions. [2019-11-19 23:45:18,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-19 23:45:18,346 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:45:18,346 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-19 23:45:18,346 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:45:18,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:45:18,346 INFO L82 PathProgramCache]: Analyzing trace with hash -212771854, now seen corresponding path program 1 times [2019-11-19 23:45:18,347 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:45:18,347 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035702833] [2019-11-19 23:45:18,347 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:45:18,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:45:18,429 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-19 23:45:18,429 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035702833] [2019-11-19 23:45:18,430 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:45:18,430 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 23:45:18,430 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930592225] [2019-11-19 23:45:18,431 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:45:18,431 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:45:18,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:45:18,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:45:18,432 INFO L87 Difference]: Start difference. First operand 230 states and 354 transitions. Second operand 4 states. [2019-11-19 23:45:18,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:45:18,953 INFO L93 Difference]: Finished difference Result 489 states and 750 transitions. [2019-11-19 23:45:18,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:45:18,953 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-11-19 23:45:18,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:45:18,956 INFO L225 Difference]: With dead ends: 489 [2019-11-19 23:45:18,956 INFO L226 Difference]: Without dead ends: 278 [2019-11-19 23:45:18,957 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-19 23:45:18,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2019-11-19 23:45:18,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 230. [2019-11-19 23:45:18,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2019-11-19 23:45:18,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 353 transitions. [2019-11-19 23:45:18,968 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 353 transitions. Word has length 98 [2019-11-19 23:45:18,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:45:18,968 INFO L462 AbstractCegarLoop]: Abstraction has 230 states and 353 transitions. [2019-11-19 23:45:18,968 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:45:18,968 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 353 transitions. [2019-11-19 23:45:18,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-19 23:45:18,970 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:45:18,970 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-19 23:45:18,971 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:45:18,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:45:18,971 INFO L82 PathProgramCache]: Analyzing trace with hash -1667302693, now seen corresponding path program 1 times [2019-11-19 23:45:18,971 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:45:18,972 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843096992] [2019-11-19 23:45:18,972 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:45:19,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:45:19,125 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-19 23:45:19,125 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843096992] [2019-11-19 23:45:19,125 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:45:19,125 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-19 23:45:19,126 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388236878] [2019-11-19 23:45:19,126 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-19 23:45:19,127 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:45:19,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-19 23:45:19,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-19 23:45:19,127 INFO L87 Difference]: Start difference. First operand 230 states and 353 transitions. Second operand 5 states. [2019-11-19 23:45:19,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:45:19,581 INFO L93 Difference]: Finished difference Result 462 states and 714 transitions. [2019-11-19 23:45:19,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-19 23:45:19,582 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 98 [2019-11-19 23:45:19,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:45:19,583 INFO L225 Difference]: With dead ends: 462 [2019-11-19 23:45:19,584 INFO L226 Difference]: Without dead ends: 251 [2019-11-19 23:45:19,584 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-19 23:45:19,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2019-11-19 23:45:19,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 250. [2019-11-19 23:45:19,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-11-19 23:45:19,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 379 transitions. [2019-11-19 23:45:19,592 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 379 transitions. Word has length 98 [2019-11-19 23:45:19,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:45:19,592 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 379 transitions. [2019-11-19 23:45:19,592 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-19 23:45:19,592 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 379 transitions. [2019-11-19 23:45:19,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-19 23:45:19,594 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:45:19,594 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-19 23:45:19,594 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:45:19,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:45:19,595 INFO L82 PathProgramCache]: Analyzing trace with hash 98797236, now seen corresponding path program 1 times [2019-11-19 23:45:19,595 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:45:19,595 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488814077] [2019-11-19 23:45:19,595 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:45:19,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:45:19,656 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-19 23:45:19,657 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488814077] [2019-11-19 23:45:19,657 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:45:19,657 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 23:45:19,657 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3264901] [2019-11-19 23:45:19,658 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:45:19,658 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:45:19,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:45:19,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:45:19,659 INFO L87 Difference]: Start difference. First operand 250 states and 379 transitions. Second operand 4 states. [2019-11-19 23:45:20,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:45:20,011 INFO L93 Difference]: Finished difference Result 503 states and 764 transitions. [2019-11-19 23:45:20,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:45:20,012 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-11-19 23:45:20,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:45:20,014 INFO L225 Difference]: With dead ends: 503 [2019-11-19 23:45:20,014 INFO L226 Difference]: Without dead ends: 272 [2019-11-19 23:45:20,014 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-19 23:45:20,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2019-11-19 23:45:20,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 250. [2019-11-19 23:45:20,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-11-19 23:45:20,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 378 transitions. [2019-11-19 23:45:20,024 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 378 transitions. Word has length 98 [2019-11-19 23:45:20,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:45:20,024 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 378 transitions. [2019-11-19 23:45:20,024 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:45:20,025 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 378 transitions. [2019-11-19 23:45:20,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-19 23:45:20,026 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:45:20,026 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-19 23:45:20,027 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:45:20,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:45:20,027 INFO L82 PathProgramCache]: Analyzing trace with hash 1048145396, now seen corresponding path program 1 times [2019-11-19 23:45:20,027 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:45:20,027 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375016412] [2019-11-19 23:45:20,028 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:45:20,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:45:20,106 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-19 23:45:20,106 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375016412] [2019-11-19 23:45:20,106 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:45:20,107 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 23:45:20,107 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500125591] [2019-11-19 23:45:20,107 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:45:20,108 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:45:20,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:45:20,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:45:20,108 INFO L87 Difference]: Start difference. First operand 250 states and 378 transitions. Second operand 4 states. [2019-11-19 23:45:20,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:45:20,458 INFO L93 Difference]: Finished difference Result 502 states and 761 transitions. [2019-11-19 23:45:20,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:45:20,458 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-11-19 23:45:20,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:45:20,460 INFO L225 Difference]: With dead ends: 502 [2019-11-19 23:45:20,460 INFO L226 Difference]: Without dead ends: 271 [2019-11-19 23:45:20,461 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-19 23:45:20,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2019-11-19 23:45:20,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 250. [2019-11-19 23:45:20,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-11-19 23:45:20,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 377 transitions. [2019-11-19 23:45:20,469 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 377 transitions. Word has length 98 [2019-11-19 23:45:20,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:45:20,470 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 377 transitions. [2019-11-19 23:45:20,470 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:45:20,470 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 377 transitions. [2019-11-19 23:45:20,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-19 23:45:20,471 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:45:20,472 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-19 23:45:20,472 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:45:20,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:45:20,473 INFO L82 PathProgramCache]: Analyzing trace with hash -645348551, now seen corresponding path program 1 times [2019-11-19 23:45:20,473 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:45:20,473 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410737188] [2019-11-19 23:45:20,473 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:45:20,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:45:20,536 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-19 23:45:20,536 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410737188] [2019-11-19 23:45:20,536 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:45:20,536 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 23:45:20,537 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003959452] [2019-11-19 23:45:20,537 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:45:20,537 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:45:20,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:45:20,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:45:20,538 INFO L87 Difference]: Start difference. First operand 250 states and 377 transitions. Second operand 4 states. [2019-11-19 23:45:20,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:45:20,996 INFO L93 Difference]: Finished difference Result 529 states and 795 transitions. [2019-11-19 23:45:20,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:45:20,996 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 99 [2019-11-19 23:45:20,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:45:20,999 INFO L225 Difference]: With dead ends: 529 [2019-11-19 23:45:20,999 INFO L226 Difference]: Without dead ends: 298 [2019-11-19 23:45:21,000 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-19 23:45:21,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2019-11-19 23:45:21,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 250. [2019-11-19 23:45:21,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-11-19 23:45:21,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 376 transitions. [2019-11-19 23:45:21,012 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 376 transitions. Word has length 99 [2019-11-19 23:45:21,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:45:21,012 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 376 transitions. [2019-11-19 23:45:21,012 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:45:21,013 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 376 transitions. [2019-11-19 23:45:21,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-19 23:45:21,014 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:45:21,014 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-19 23:45:21,015 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:45:21,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:45:21,015 INFO L82 PathProgramCache]: Analyzing trace with hash -211619465, now seen corresponding path program 1 times [2019-11-19 23:45:21,015 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:45:21,015 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121019943] [2019-11-19 23:45:21,016 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:45:21,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:45:21,068 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-19 23:45:21,069 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121019943] [2019-11-19 23:45:21,069 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:45:21,069 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 23:45:21,069 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097333637] [2019-11-19 23:45:21,070 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:45:21,070 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:45:21,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:45:21,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:45:21,070 INFO L87 Difference]: Start difference. First operand 250 states and 376 transitions. Second operand 4 states. [2019-11-19 23:45:21,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:45:21,413 INFO L93 Difference]: Finished difference Result 502 states and 757 transitions. [2019-11-19 23:45:21,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:45:21,414 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 99 [2019-11-19 23:45:21,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:45:21,416 INFO L225 Difference]: With dead ends: 502 [2019-11-19 23:45:21,416 INFO L226 Difference]: Without dead ends: 271 [2019-11-19 23:45:21,416 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-19 23:45:21,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2019-11-19 23:45:21,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 250. [2019-11-19 23:45:21,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-11-19 23:45:21,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 375 transitions. [2019-11-19 23:45:21,425 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 375 transitions. Word has length 99 [2019-11-19 23:45:21,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:45:21,425 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 375 transitions. [2019-11-19 23:45:21,425 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:45:21,425 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 375 transitions. [2019-11-19 23:45:21,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-11-19 23:45:21,427 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:45:21,427 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-19 23:45:21,427 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:45:21,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:45:21,428 INFO L82 PathProgramCache]: Analyzing trace with hash -300903122, now seen corresponding path program 1 times [2019-11-19 23:45:21,428 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:45:21,428 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020263519] [2019-11-19 23:45:21,428 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:45:21,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:45:21,483 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-19 23:45:21,484 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020263519] [2019-11-19 23:45:21,484 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:45:21,484 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 23:45:21,484 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454725328] [2019-11-19 23:45:21,485 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:45:21,485 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:45:21,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:45:21,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:45:21,485 INFO L87 Difference]: Start difference. First operand 250 states and 375 transitions. Second operand 4 states. [2019-11-19 23:45:21,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:45:21,938 INFO L93 Difference]: Finished difference Result 529 states and 791 transitions. [2019-11-19 23:45:21,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:45:21,939 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2019-11-19 23:45:21,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:45:21,941 INFO L225 Difference]: With dead ends: 529 [2019-11-19 23:45:21,941 INFO L226 Difference]: Without dead ends: 298 [2019-11-19 23:45:21,942 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-19 23:45:21,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2019-11-19 23:45:21,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 250. [2019-11-19 23:45:21,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-11-19 23:45:21,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 374 transitions. [2019-11-19 23:45:21,953 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 374 transitions. Word has length 100 [2019-11-19 23:45:21,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:45:21,953 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 374 transitions. [2019-11-19 23:45:21,953 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:45:21,953 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 374 transitions. [2019-11-19 23:45:21,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-11-19 23:45:21,955 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:45:21,955 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-19 23:45:21,956 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:45:21,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:45:21,956 INFO L82 PathProgramCache]: Analyzing trace with hash 259796656, now seen corresponding path program 1 times [2019-11-19 23:45:21,956 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:45:21,957 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306911374] [2019-11-19 23:45:21,957 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:45:22,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:45:22,051 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-19 23:45:22,052 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306911374] [2019-11-19 23:45:22,052 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:45:22,052 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 23:45:22,052 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547255870] [2019-11-19 23:45:22,053 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:45:22,053 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:45:22,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:45:22,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:45:22,054 INFO L87 Difference]: Start difference. First operand 250 states and 374 transitions. Second operand 4 states. [2019-11-19 23:45:22,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:45:22,407 INFO L93 Difference]: Finished difference Result 502 states and 753 transitions. [2019-11-19 23:45:22,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:45:22,408 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2019-11-19 23:45:22,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:45:22,410 INFO L225 Difference]: With dead ends: 502 [2019-11-19 23:45:22,410 INFO L226 Difference]: Without dead ends: 271 [2019-11-19 23:45:22,411 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-19 23:45:22,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2019-11-19 23:45:22,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 250. [2019-11-19 23:45:22,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-11-19 23:45:22,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 373 transitions. [2019-11-19 23:45:22,419 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 373 transitions. Word has length 100 [2019-11-19 23:45:22,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:45:22,419 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 373 transitions. [2019-11-19 23:45:22,419 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:45:22,420 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 373 transitions. [2019-11-19 23:45:22,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-11-19 23:45:22,421 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:45:22,421 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-19 23:45:22,421 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:45:22,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:45:22,421 INFO L82 PathProgramCache]: Analyzing trace with hash 584269940, now seen corresponding path program 1 times [2019-11-19 23:45:22,422 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:45:22,422 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803358372] [2019-11-19 23:45:22,422 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:45:22,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:45:22,476 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-19 23:45:22,476 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803358372] [2019-11-19 23:45:22,476 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:45:22,476 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 23:45:22,477 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725945673] [2019-11-19 23:45:22,477 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:45:22,477 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:45:22,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:45:22,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:45:22,478 INFO L87 Difference]: Start difference. First operand 250 states and 373 transitions. Second operand 4 states. [2019-11-19 23:45:22,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:45:22,907 INFO L93 Difference]: Finished difference Result 529 states and 787 transitions. [2019-11-19 23:45:22,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:45:22,908 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2019-11-19 23:45:22,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:45:22,910 INFO L225 Difference]: With dead ends: 529 [2019-11-19 23:45:22,910 INFO L226 Difference]: Without dead ends: 298 [2019-11-19 23:45:22,911 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-19 23:45:22,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2019-11-19 23:45:22,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 250. [2019-11-19 23:45:22,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-11-19 23:45:22,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 372 transitions. [2019-11-19 23:45:22,921 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 372 transitions. Word has length 101 [2019-11-19 23:45:22,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:45:22,922 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 372 transitions. [2019-11-19 23:45:22,922 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:45:22,922 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 372 transitions. [2019-11-19 23:45:22,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-11-19 23:45:22,923 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:45:22,923 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-19 23:45:22,924 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:45:22,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:45:22,924 INFO L82 PathProgramCache]: Analyzing trace with hash 786093874, now seen corresponding path program 1 times [2019-11-19 23:45:22,924 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:45:22,924 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695839135] [2019-11-19 23:45:22,925 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:45:22,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:45:22,983 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-19 23:45:22,983 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695839135] [2019-11-19 23:45:22,984 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:45:22,984 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 23:45:22,984 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632823479] [2019-11-19 23:45:22,984 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:45:22,984 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:45:22,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:45:22,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:45:22,985 INFO L87 Difference]: Start difference. First operand 250 states and 372 transitions. Second operand 4 states. [2019-11-19 23:45:23,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:45:23,344 INFO L93 Difference]: Finished difference Result 502 states and 749 transitions. [2019-11-19 23:45:23,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:45:23,345 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2019-11-19 23:45:23,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:45:23,346 INFO L225 Difference]: With dead ends: 502 [2019-11-19 23:45:23,346 INFO L226 Difference]: Without dead ends: 271 [2019-11-19 23:45:23,347 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-19 23:45:23,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2019-11-19 23:45:23,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 250. [2019-11-19 23:45:23,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-11-19 23:45:23,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 371 transitions. [2019-11-19 23:45:23,355 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 371 transitions. Word has length 101 [2019-11-19 23:45:23,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:45:23,356 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 371 transitions. [2019-11-19 23:45:23,356 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:45:23,356 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 371 transitions. [2019-11-19 23:45:23,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-11-19 23:45:23,357 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:45:23,358 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-19 23:45:23,358 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:45:23,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:45:23,359 INFO L82 PathProgramCache]: Analyzing trace with hash 1052130441, now seen corresponding path program 1 times [2019-11-19 23:45:23,359 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:45:23,359 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851428730] [2019-11-19 23:45:23,359 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:45:23,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:45:23,428 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-19 23:45:23,429 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851428730] [2019-11-19 23:45:23,429 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:45:23,429 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 23:45:23,430 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907522578] [2019-11-19 23:45:23,430 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:45:23,430 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:45:23,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:45:23,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:45:23,431 INFO L87 Difference]: Start difference. First operand 250 states and 371 transitions. Second operand 4 states. [2019-11-19 23:45:23,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:45:23,882 INFO L93 Difference]: Finished difference Result 519 states and 771 transitions. [2019-11-19 23:45:23,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:45:23,882 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-11-19 23:45:23,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:45:23,884 INFO L225 Difference]: With dead ends: 519 [2019-11-19 23:45:23,884 INFO L226 Difference]: Without dead ends: 288 [2019-11-19 23:45:23,885 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-19 23:45:23,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2019-11-19 23:45:23,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 250. [2019-11-19 23:45:23,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-11-19 23:45:23,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 370 transitions. [2019-11-19 23:45:23,893 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 370 transitions. Word has length 102 [2019-11-19 23:45:23,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:45:23,894 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 370 transitions. [2019-11-19 23:45:23,894 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:45:23,894 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 370 transitions. [2019-11-19 23:45:23,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-11-19 23:45:23,895 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:45:23,895 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-19 23:45:23,896 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:45:23,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:45:23,896 INFO L82 PathProgramCache]: Analyzing trace with hash -1281262197, now seen corresponding path program 1 times [2019-11-19 23:45:23,896 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:45:23,896 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802636971] [2019-11-19 23:45:23,897 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:45:23,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:45:23,961 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-19 23:45:23,961 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802636971] [2019-11-19 23:45:23,961 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:45:23,962 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 23:45:23,962 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39117161] [2019-11-19 23:45:23,962 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:45:23,962 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:45:23,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:45:23,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:45:23,963 INFO L87 Difference]: Start difference. First operand 250 states and 370 transitions. Second operand 4 states. [2019-11-19 23:45:24,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:45:24,263 INFO L93 Difference]: Finished difference Result 492 states and 733 transitions. [2019-11-19 23:45:24,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:45:24,263 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-11-19 23:45:24,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:45:24,265 INFO L225 Difference]: With dead ends: 492 [2019-11-19 23:45:24,265 INFO L226 Difference]: Without dead ends: 261 [2019-11-19 23:45:24,266 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-19 23:45:24,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2019-11-19 23:45:24,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 250. [2019-11-19 23:45:24,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-11-19 23:45:24,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 369 transitions. [2019-11-19 23:45:24,274 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 369 transitions. Word has length 102 [2019-11-19 23:45:24,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:45:24,274 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 369 transitions. [2019-11-19 23:45:24,274 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:45:24,274 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 369 transitions. [2019-11-19 23:45:24,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-11-19 23:45:24,275 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:45:24,276 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-19 23:45:24,276 INFO L410 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:45:24,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:45:24,276 INFO L82 PathProgramCache]: Analyzing trace with hash -251052971, now seen corresponding path program 1 times [2019-11-19 23:45:24,276 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:45:24,277 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765167510] [2019-11-19 23:45:24,277 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:45:24,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:45:24,333 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-19 23:45:24,334 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765167510] [2019-11-19 23:45:24,334 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:45:24,334 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 23:45:24,335 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744044281] [2019-11-19 23:45:24,335 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:45:24,336 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:45:24,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:45:24,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:45:24,336 INFO L87 Difference]: Start difference. First operand 250 states and 369 transitions. Second operand 4 states. [2019-11-19 23:45:24,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:45:24,694 INFO L93 Difference]: Finished difference Result 519 states and 767 transitions. [2019-11-19 23:45:24,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:45:24,694 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2019-11-19 23:45:24,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:45:24,696 INFO L225 Difference]: With dead ends: 519 [2019-11-19 23:45:24,696 INFO L226 Difference]: Without dead ends: 288 [2019-11-19 23:45:24,697 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-19 23:45:24,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2019-11-19 23:45:24,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 250. [2019-11-19 23:45:24,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-11-19 23:45:24,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 368 transitions. [2019-11-19 23:45:24,704 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 368 transitions. Word has length 106 [2019-11-19 23:45:24,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:45:24,705 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 368 transitions. [2019-11-19 23:45:24,705 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:45:24,705 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 368 transitions. [2019-11-19 23:45:24,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-11-19 23:45:24,706 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:45:24,706 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-19 23:45:24,706 INFO L410 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:45:24,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:45:24,706 INFO L82 PathProgramCache]: Analyzing trace with hash -1937232809, now seen corresponding path program 1 times [2019-11-19 23:45:24,707 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:45:24,707 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265814045] [2019-11-19 23:45:24,707 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:45:24,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:45:24,777 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-19 23:45:24,778 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265814045] [2019-11-19 23:45:24,778 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:45:24,778 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 23:45:24,778 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506904709] [2019-11-19 23:45:24,779 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 23:45:24,779 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:45:24,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 23:45:24,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:45:24,780 INFO L87 Difference]: Start difference. First operand 250 states and 368 transitions. Second operand 3 states. [2019-11-19 23:45:24,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:45:24,815 INFO L93 Difference]: Finished difference Result 710 states and 1059 transitions. [2019-11-19 23:45:24,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 23:45:24,815 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2019-11-19 23:45:24,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:45:24,818 INFO L225 Difference]: With dead ends: 710 [2019-11-19 23:45:24,818 INFO L226 Difference]: Without dead ends: 479 [2019-11-19 23:45:24,819 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-19 23:45:24,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2019-11-19 23:45:24,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 479. [2019-11-19 23:45:24,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 479 states. [2019-11-19 23:45:24,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 711 transitions. [2019-11-19 23:45:24,835 INFO L78 Accepts]: Start accepts. Automaton has 479 states and 711 transitions. Word has length 106 [2019-11-19 23:45:24,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:45:24,836 INFO L462 AbstractCegarLoop]: Abstraction has 479 states and 711 transitions. [2019-11-19 23:45:24,836 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 23:45:24,836 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 711 transitions. [2019-11-19 23:45:24,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-11-19 23:45:24,838 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:45:24,839 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-19 23:45:24,839 INFO L410 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:45:24,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:45:24,839 INFO L82 PathProgramCache]: Analyzing trace with hash -1707028326, now seen corresponding path program 1 times [2019-11-19 23:45:24,840 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:45:24,840 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83309121] [2019-11-19 23:45:24,840 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:45:24,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 23:45:25,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 23:45:25,172 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 23:45:25,172 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-19 23:45:25,333 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 11:45:25 BoogieIcfgContainer [2019-11-19 23:45:25,333 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-19 23:45:25,334 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-19 23:45:25,334 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-19 23:45:25,334 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-19 23:45:25,335 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 11:45:06" (3/4) ... [2019-11-19 23:45:25,357 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-19 23:45:25,357 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-19 23:45:25,359 INFO L168 Benchmark]: Toolchain (without parser) took 21084.86 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 370.7 MB). Free memory was 938.0 MB in the beginning and 835.7 MB in the end (delta: 102.3 MB). Peak memory consumption was 473.0 MB. Max. memory is 11.5 GB. [2019-11-19 23:45:25,360 INFO L168 Benchmark]: CDTParser took 0.52 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-19 23:45:25,360 INFO L168 Benchmark]: CACSL2BoogieTranslator took 810.97 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.1 MB). Free memory was 938.0 MB in the beginning and 1.1 GB in the end (delta: -167.1 MB). Peak memory consumption was 23.8 MB. Max. memory is 11.5 GB. [2019-11-19 23:45:25,360 INFO L168 Benchmark]: Boogie Procedure Inliner took 111.91 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-19 23:45:25,361 INFO L168 Benchmark]: Boogie Preprocessor took 125.90 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-19 23:45:25,361 INFO L168 Benchmark]: RCFGBuilder took 1324.25 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 92.4 MB). Peak memory consumption was 92.4 MB. Max. memory is 11.5 GB. [2019-11-19 23:45:25,362 INFO L168 Benchmark]: TraceAbstraction took 18683.56 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 238.6 MB). Free memory was 1.0 GB in the beginning and 835.7 MB in the end (delta: 166.3 MB). Peak memory consumption was 404.9 MB. Max. memory is 11.5 GB. [2019-11-19 23:45:25,362 INFO L168 Benchmark]: Witness Printer took 23.70 ms. Allocated memory is still 1.4 GB. Free memory is still 835.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 23:45:25,364 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.52 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 810.97 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.1 MB). Free memory was 938.0 MB in the beginning and 1.1 GB in the end (delta: -167.1 MB). Peak memory consumption was 23.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 111.91 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 125.90 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1324.25 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 92.4 MB). Peak memory consumption was 92.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 18683.56 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 238.6 MB). Free memory was 1.0 GB in the beginning and 835.7 MB in the end (delta: 166.3 MB). Peak memory consumption was 404.9 MB. Max. memory is 11.5 GB. * Witness Printer took 23.70 ms. Allocated memory is still 1.4 GB. Free memory is still 835.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 1702]: 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}] [L1661] EXPR s->s3 [L1661] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={9:0}] [L1661] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1690] 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}] [L1661] EXPR s->s3 [L1661] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={9:0}] [L1661] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1690] 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 [L1550] EXPR s->session [L1550] EXPR s->s3 [L1550] EXPR (s->s3)->tmp.new_cipher [L1550] (s->session)->cipher = (s->s3)->tmp.new_cipher [L1551] COND FALSE !(! tmp___9) [L1557] ret = __VERIFIER_nondet_int() [L1558] COND TRUE blastFlag == 2 [L1559] blastFlag = 4 VAL [init=1, SSLv3_server_data={9:0}] [L1567] COND FALSE !(ret <= 0) [L1572] s->state = 8672 [L1573] s->init_num = 0 VAL [init=1, SSLv3_server_data={9:0}] [L1574] COND FALSE !(! tmp___10) VAL [init=1, SSLv3_server_data={9:0}] [L1661] EXPR s->s3 [L1661] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={9:0}] [L1661] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1690] 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 [L1583] ret = __VERIFIER_nondet_int() [L1584] COND TRUE blastFlag == 4 VAL [init=1, SSLv3_server_data={9:0}] [L1702] __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: 18.6s, OverallIterations: 39, TraceHistogramMax: 4, AutomataDifference: 14.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 7075 SDtfs, 2083 SDslu, 10603 SDs, 0 SdLazy, 6863 SolverSat, 339 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 11.2s 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, 914 StatesRemovedByMinimization, 37 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 1.8s 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-19 23:45:27,485 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-19 23:45:27,488 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-19 23:45:27,503 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-19 23:45:27,503 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-19 23:45:27,505 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-19 23:45:27,507 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-19 23:45:27,516 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-19 23:45:27,521 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-19 23:45:27,524 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-19 23:45:27,525 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-19 23:45:27,527 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-19 23:45:27,527 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-19 23:45:27,529 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-19 23:45:27,530 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-19 23:45:27,532 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-19 23:45:27,533 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-19 23:45:27,534 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-19 23:45:27,536 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-19 23:45:27,541 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-19 23:45:27,546 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-19 23:45:27,548 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-19 23:45:27,552 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-19 23:45:27,553 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-19 23:45:27,556 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-19 23:45:27,556 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-19 23:45:27,556 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-19 23:45:27,558 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-19 23:45:27,559 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-19 23:45:27,560 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-19 23:45:27,560 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-19 23:45:27,561 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-19 23:45:27,562 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-19 23:45:27,562 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-19 23:45:27,564 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-19 23:45:27,564 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-19 23:45:27,565 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-19 23:45:27,565 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-19 23:45:27,566 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-19 23:45:27,566 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-19 23:45:27,568 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-19 23:45:27,569 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_e9b6a679-d9cb-4613-a4e1-8f5e8bfc7adf/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-11-19 23:45:27,604 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-19 23:45:27,615 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-19 23:45:27,616 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-19 23:45:27,617 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-19 23:45:27,617 INFO L138 SettingsManager]: * Use SBE=true [2019-11-19 23:45:27,617 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-19 23:45:27,618 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-19 23:45:27,618 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-19 23:45:27,618 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-19 23:45:27,618 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-19 23:45:27,619 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-19 23:45:27,619 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-19 23:45:27,619 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-19 23:45:27,619 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-19 23:45:27,620 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-19 23:45:27,620 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-19 23:45:27,620 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-19 23:45:27,620 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-19 23:45:27,623 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-19 23:45:27,623 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-19 23:45:27,623 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-19 23:45:27,624 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-19 23:45:27,624 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-19 23:45:27,624 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-19 23:45:27,625 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-19 23:45:27,625 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-19 23:45:27,625 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-19 23:45:27,625 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-19 23:45:27,626 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-19 23:45:27,627 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-19 23:45:27,627 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_e9b6a679-d9cb-4613-a4e1-8f5e8bfc7adf/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 -> a85198d3f93b8c751f2c6e712deab62f97c1022f [2019-11-19 23:45:27,943 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-19 23:45:27,964 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-19 23:45:27,967 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-19 23:45:27,970 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-19 23:45:27,970 INFO L275 PluginConnector]: CDTParser initialized [2019-11-19 23:45:27,971 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_e9b6a679-d9cb-4613-a4e1-8f5e8bfc7adf/bin/uautomizer/../../sv-benchmarks/c/ssh/s3_srvr.blast.04.i.cil.c [2019-11-19 23:45:28,037 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_e9b6a679-d9cb-4613-a4e1-8f5e8bfc7adf/bin/uautomizer/data/c0ec4de8b/66dfd34861e94603998c2013870dc574/FLAGc7402bce4 [2019-11-19 23:45:28,556 INFO L306 CDTParser]: Found 1 translation units. [2019-11-19 23:45:28,560 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_e9b6a679-d9cb-4613-a4e1-8f5e8bfc7adf/sv-benchmarks/c/ssh/s3_srvr.blast.04.i.cil.c [2019-11-19 23:45:28,593 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_e9b6a679-d9cb-4613-a4e1-8f5e8bfc7adf/bin/uautomizer/data/c0ec4de8b/66dfd34861e94603998c2013870dc574/FLAGc7402bce4 [2019-11-19 23:45:28,828 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_e9b6a679-d9cb-4613-a4e1-8f5e8bfc7adf/bin/uautomizer/data/c0ec4de8b/66dfd34861e94603998c2013870dc574 [2019-11-19 23:45:28,831 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-19 23:45:28,832 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-19 23:45:28,833 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-19 23:45:28,833 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-19 23:45:28,838 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-19 23:45:28,839 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 11:45:28" (1/1) ... [2019-11-19 23:45:28,841 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14e50c5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:45:28, skipping insertion in model container [2019-11-19 23:45:28,842 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 11:45:28" (1/1) ... [2019-11-19 23:45:28,847 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-19 23:45:28,904 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-19 23:45:29,465 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 23:45:29,484 INFO L188 MainTranslator]: Completed pre-run [2019-11-19 23:45:29,660 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 23:45:29,696 INFO L192 MainTranslator]: Completed translation [2019-11-19 23:45:29,697 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:45:29 WrapperNode [2019-11-19 23:45:29,697 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-19 23:45:29,698 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-19 23:45:29,698 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-19 23:45:29,698 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-19 23:45:29,708 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:45:29" (1/1) ... [2019-11-19 23:45:29,755 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:45:29" (1/1) ... [2019-11-19 23:45:29,827 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-19 23:45:29,827 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-19 23:45:29,827 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-19 23:45:29,828 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-19 23:45:29,839 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:45:29" (1/1) ... [2019-11-19 23:45:29,839 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:45:29" (1/1) ... [2019-11-19 23:45:29,863 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:45:29" (1/1) ... [2019-11-19 23:45:29,872 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:45:29" (1/1) ... [2019-11-19 23:45:29,928 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:45:29" (1/1) ... [2019-11-19 23:45:29,948 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:45:29" (1/1) ... [2019-11-19 23:45:29,954 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:45:29" (1/1) ... [2019-11-19 23:45:29,962 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-19 23:45:29,962 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-19 23:45:29,963 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-19 23:45:29,963 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-19 23:45:29,964 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:45:29" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e9b6a679-d9cb-4613-a4e1-8f5e8bfc7adf/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-19 23:45:30,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-19 23:45:30,043 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-19 23:45:30,043 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-19 23:45:30,044 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-19 23:45:30,044 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-19 23:45:30,044 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-19 23:45:30,044 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-19 23:45:30,045 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-19 23:45:30,308 WARN L736 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-19 23:45:34,293 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2019-11-19 23:45:34,293 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2019-11-19 23:45:34,295 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-19 23:45:34,295 INFO L285 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-19 23:45:34,297 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 11:45:34 BoogieIcfgContainer [2019-11-19 23:45:34,297 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-19 23:45:34,299 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-19 23:45:34,299 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-19 23:45:34,302 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-19 23:45:34,303 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 11:45:28" (1/3) ... [2019-11-19 23:45:34,304 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1eadbb5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 11:45:34, skipping insertion in model container [2019-11-19 23:45:34,304 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:45:29" (2/3) ... [2019-11-19 23:45:34,305 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1eadbb5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 11:45:34, skipping insertion in model container [2019-11-19 23:45:34,305 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 11:45:34" (3/3) ... [2019-11-19 23:45:34,308 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.04.i.cil.c [2019-11-19 23:45:34,323 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-19 23:45:34,329 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-19 23:45:34,338 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-19 23:45:34,365 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-19 23:45:34,365 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-19 23:45:34,366 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-19 23:45:34,366 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-19 23:45:34,366 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-19 23:45:34,366 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-19 23:45:34,367 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-19 23:45:34,367 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-19 23:45:34,387 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states. [2019-11-19 23:45:34,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-19 23:45:34,398 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:45:34,399 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-19 23:45:34,400 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:45:34,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:45:34,406 INFO L82 PathProgramCache]: Analyzing trace with hash 522836684, now seen corresponding path program 1 times [2019-11-19 23:45:34,420 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 23:45:34,420 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [852121946] [2019-11-19 23:45:34,421 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e9b6a679-d9cb-4613-a4e1-8f5e8bfc7adf/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-19 23:45:34,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:45:34,652 INFO L255 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-19 23:45:34,660 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 23:45:34,709 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-19 23:45:34,709 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 23:45:34,736 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-19 23:45:34,737 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [852121946] [2019-11-19 23:45:34,737 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:45:34,738 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-19 23:45:34,739 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950993755] [2019-11-19 23:45:34,744 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:45:34,744 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 23:45:34,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:45:34,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:45:34,761 INFO L87 Difference]: Start difference. First operand 143 states. Second operand 4 states. [2019-11-19 23:45:34,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:45:34,938 INFO L93 Difference]: Finished difference Result 540 states and 917 transitions. [2019-11-19 23:45:34,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:45:34,940 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2019-11-19 23:45:34,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:45:34,968 INFO L225 Difference]: With dead ends: 540 [2019-11-19 23:45:34,969 INFO L226 Difference]: Without dead ends: 366 [2019-11-19 23:45:34,974 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-19 23:45:34,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2019-11-19 23:45:35,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 366. [2019-11-19 23:45:35,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 366 states. [2019-11-19 23:45:35,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 556 transitions. [2019-11-19 23:45:35,072 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 556 transitions. Word has length 45 [2019-11-19 23:45:35,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:45:35,073 INFO L462 AbstractCegarLoop]: Abstraction has 366 states and 556 transitions. [2019-11-19 23:45:35,073 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:45:35,073 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 556 transitions. [2019-11-19 23:45:35,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-11-19 23:45:35,085 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:45:35,086 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-19 23:45:35,297 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 23:45:35,297 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:45:35,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:45:35,297 INFO L82 PathProgramCache]: Analyzing trace with hash 577204179, now seen corresponding path program 1 times [2019-11-19 23:45:35,298 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 23:45:35,299 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1942978843] [2019-11-19 23:45:35,299 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e9b6a679-d9cb-4613-a4e1-8f5e8bfc7adf/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-19 23:45:35,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:45:35,581 INFO L255 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-19 23:45:35,587 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 23:45:35,631 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-19 23:45:35,632 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 23:45:35,681 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-19 23:45:35,681 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1942978843] [2019-11-19 23:45:35,682 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:45:35,682 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-19 23:45:35,682 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699685586] [2019-11-19 23:45:35,685 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:45:35,685 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 23:45:35,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:45:35,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:45:35,686 INFO L87 Difference]: Start difference. First operand 366 states and 556 transitions. Second operand 4 states. [2019-11-19 23:45:35,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:45:35,981 INFO L93 Difference]: Finished difference Result 839 states and 1282 transitions. [2019-11-19 23:45:35,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:45:35,982 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2019-11-19 23:45:35,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:45:35,986 INFO L225 Difference]: With dead ends: 839 [2019-11-19 23:45:35,986 INFO L226 Difference]: Without dead ends: 600 [2019-11-19 23:45:35,989 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-19 23:45:35,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2019-11-19 23:45:36,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 600. [2019-11-19 23:45:36,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 600 states. [2019-11-19 23:45:36,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 910 transitions. [2019-11-19 23:45:36,021 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 910 transitions. Word has length 103 [2019-11-19 23:45:36,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:45:36,022 INFO L462 AbstractCegarLoop]: Abstraction has 600 states and 910 transitions. [2019-11-19 23:45:36,022 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:45:36,023 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 910 transitions. [2019-11-19 23:45:36,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-11-19 23:45:36,025 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:45:36,026 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-19 23:45:36,238 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 23:45:36,239 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:45:36,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:45:36,239 INFO L82 PathProgramCache]: Analyzing trace with hash -1707028326, now seen corresponding path program 1 times [2019-11-19 23:45:36,240 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 23:45:36,241 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [2124564540] [2019-11-19 23:45:36,241 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e9b6a679-d9cb-4613-a4e1-8f5e8bfc7adf/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-19 23:45:37,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 23:45:38,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 23:45:38,948 INFO L174 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2019-11-19 23:45:38,949 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-19 23:45:39,167 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 23:45:39,380 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 11:45:39 BoogieIcfgContainer [2019-11-19 23:45:39,380 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-19 23:45:39,381 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-19 23:45:39,381 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-19 23:45:39,381 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-19 23:45:39,382 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 11:45:34" (3/4) ... [2019-11-19 23:45:39,384 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-19 23:45:39,546 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_e9b6a679-d9cb-4613-a4e1-8f5e8bfc7adf/bin/uautomizer/witness.graphml [2019-11-19 23:45:39,546 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-19 23:45:39,549 INFO L168 Benchmark]: Toolchain (without parser) took 10716.24 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 192.9 MB). Free memory was 949.7 MB in the beginning and 1.1 GB in the end (delta: -168.7 MB). Peak memory consumption was 24.3 MB. Max. memory is 11.5 GB. [2019-11-19 23:45:39,549 INFO L168 Benchmark]: CDTParser took 0.30 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 23:45:39,550 INFO L168 Benchmark]: CACSL2BoogieTranslator took 864.70 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 102.8 MB). Free memory was 949.7 MB in the beginning and 1.1 GB in the end (delta: -124.6 MB). Peak memory consumption was 28.4 MB. Max. memory is 11.5 GB. [2019-11-19 23:45:39,551 INFO L168 Benchmark]: Boogie Procedure Inliner took 129.23 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. [2019-11-19 23:45:39,551 INFO L168 Benchmark]: Boogie Preprocessor took 134.68 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. [2019-11-19 23:45:39,552 INFO L168 Benchmark]: RCFGBuilder took 4335.14 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 972.3 MB in the end (delta: 88.1 MB). Peak memory consumption was 88.1 MB. Max. memory is 11.5 GB. [2019-11-19 23:45:39,552 INFO L168 Benchmark]: TraceAbstraction took 5081.68 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 90.2 MB). Free memory was 972.3 MB in the beginning and 1.1 GB in the end (delta: -162.2 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 23:45:39,553 INFO L168 Benchmark]: Witness Printer took 165.95 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: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2019-11-19 23:45:39,555 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.30 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 864.70 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 102.8 MB). Free memory was 949.7 MB in the beginning and 1.1 GB in the end (delta: -124.6 MB). Peak memory consumption was 28.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 129.23 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 134.68 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. * RCFGBuilder took 4335.14 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 972.3 MB in the end (delta: 88.1 MB). Peak memory consumption was 88.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 5081.68 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 90.2 MB). Free memory was 972.3 MB in the beginning and 1.1 GB in the end (delta: -162.2 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 165.95 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: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1702]: 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}] [L1661] EXPR s->s3 [L1661] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={2147483645:0}] [L1661] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1690] 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}] [L1661] EXPR s->s3 [L1661] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={2147483645:0}] [L1661] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1690] 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 [L1550] EXPR s->session [L1550] EXPR s->s3 [L1550] EXPR (s->s3)->tmp.new_cipher [L1550] (s->session)->cipher = (s->s3)->tmp.new_cipher [L1551] COND FALSE !(! tmp___9) [L1557] ret = __VERIFIER_nondet_int() [L1558] COND TRUE blastFlag == 2 [L1559] blastFlag = 4 VAL [init=1, SSLv3_server_data={2147483645:0}] [L1567] COND FALSE !(ret <= 0) [L1572] s->state = 8672 [L1573] s->init_num = 0 VAL [init=1, SSLv3_server_data={2147483645:0}] [L1574] COND FALSE !(! tmp___10) VAL [init=1, SSLv3_server_data={2147483645:0}] [L1661] EXPR s->s3 [L1661] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={2147483645:0}] [L1661] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1690] 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 [L1583] ret = __VERIFIER_nondet_int() [L1584] COND TRUE blastFlag == 4 VAL [init=1, SSLv3_server_data={2147483645:0}] [L1702] __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: 5.0s, OverallIterations: 3, TraceHistogramMax: 4, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 587 SDtfs, 659 SDslu, 792 SDs, 0 SdLazy, 51 SolverSat, 17 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=600occurred 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.2s SatisfiabilityAnalysisTime, 0.1s 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...