./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ssh/s3_srvr.blast.03.i.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6b5699aa Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_4bc5bd24-d1cf-4158-a58b-64f57e1b7a3e/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_4bc5bd24-d1cf-4158-a58b-64f57e1b7a3e/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_4bc5bd24-d1cf-4158-a58b-64f57e1b7a3e/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_4bc5bd24-d1cf-4158-a58b-64f57e1b7a3e/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh/s3_srvr.blast.03.i.cil.c -s /tmp/vcloud-vcloud-master/worker/run_dir_4bc5bd24-d1cf-4158-a58b-64f57e1b7a3e/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_4bc5bd24-d1cf-4158-a58b-64f57e1b7a3e/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 09d651c8899349531493fefbd169797d0022b4a3 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_4bc5bd24-d1cf-4158-a58b-64f57e1b7a3e/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_4bc5bd24-d1cf-4158-a58b-64f57e1b7a3e/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_4bc5bd24-d1cf-4158-a58b-64f57e1b7a3e/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_4bc5bd24-d1cf-4158-a58b-64f57e1b7a3e/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh/s3_srvr.blast.03.i.cil.c -s /tmp/vcloud-vcloud-master/worker/run_dir_4bc5bd24-d1cf-4158-a58b-64f57e1b7a3e/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_4bc5bd24-d1cf-4158-a58b-64f57e1b7a3e/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 09d651c8899349531493fefbd169797d0022b4a3 .............................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: UnsupportedOperationException: Unsupported type(() : VOID) --- Real Ultimate output --- This is Ultimate 0.1.24-6b5699a [2019-11-25 08:52:28,038 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-25 08:52:28,040 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-25 08:52:28,052 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-25 08:52:28,055 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-25 08:52:28,057 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-25 08:52:28,059 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-25 08:52:28,069 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-25 08:52:28,074 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-25 08:52:28,079 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-25 08:52:28,080 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-25 08:52:28,081 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-25 08:52:28,082 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-25 08:52:28,084 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-25 08:52:28,085 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-25 08:52:28,086 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-25 08:52:28,087 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-25 08:52:28,088 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-25 08:52:28,091 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-25 08:52:28,094 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-25 08:52:28,098 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-25 08:52:28,102 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-25 08:52:28,104 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-25 08:52:28,105 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-25 08:52:28,108 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-25 08:52:28,108 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-25 08:52:28,109 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-25 08:52:28,110 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-25 08:52:28,111 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-25 08:52:28,112 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-25 08:52:28,112 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-25 08:52:28,113 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-25 08:52:28,114 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-25 08:52:28,114 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-25 08:52:28,115 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-25 08:52:28,115 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-25 08:52:28,116 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-25 08:52:28,116 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-25 08:52:28,116 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-25 08:52:28,117 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-25 08:52:28,119 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-25 08:52:28,119 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_4bc5bd24-d1cf-4158-a58b-64f57e1b7a3e/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-25 08:52:28,146 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-25 08:52:28,157 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-25 08:52:28,158 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-25 08:52:28,158 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-25 08:52:28,159 INFO L138 SettingsManager]: * Use SBE=true [2019-11-25 08:52:28,159 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-25 08:52:28,159 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-25 08:52:28,159 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-25 08:52:28,160 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-25 08:52:28,160 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-25 08:52:28,160 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-25 08:52:28,160 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-25 08:52:28,160 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-25 08:52:28,161 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-25 08:52:28,161 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-25 08:52:28,161 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-25 08:52:28,161 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-25 08:52:28,162 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-25 08:52:28,162 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-25 08:52:28,162 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-25 08:52:28,162 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-25 08:52:28,163 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-25 08:52:28,163 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-25 08:52:28,163 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-25 08:52:28,164 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-25 08:52:28,165 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-25 08:52:28,165 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-25 08:52:28,165 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-25 08:52:28,165 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_4bc5bd24-d1cf-4158-a58b-64f57e1b7a3e/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 09d651c8899349531493fefbd169797d0022b4a3 [2019-11-25 08:52:28,357 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-25 08:52:28,371 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-25 08:52:28,374 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-25 08:52:28,375 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-25 08:52:28,376 INFO L275 PluginConnector]: CDTParser initialized [2019-11-25 08:52:28,376 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_4bc5bd24-d1cf-4158-a58b-64f57e1b7a3e/bin/uautomizer/../../sv-benchmarks/c/ssh/s3_srvr.blast.03.i.cil.c [2019-11-25 08:52:28,438 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_4bc5bd24-d1cf-4158-a58b-64f57e1b7a3e/bin/uautomizer/data/e8ed142be/101192ed07f34513a4883bbac11f59a8/FLAG8738eb74b [2019-11-25 08:52:29,066 INFO L306 CDTParser]: Found 1 translation units. [2019-11-25 08:52:29,066 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_4bc5bd24-d1cf-4158-a58b-64f57e1b7a3e/sv-benchmarks/c/ssh/s3_srvr.blast.03.i.cil.c [2019-11-25 08:52:29,090 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_4bc5bd24-d1cf-4158-a58b-64f57e1b7a3e/bin/uautomizer/data/e8ed142be/101192ed07f34513a4883bbac11f59a8/FLAG8738eb74b [2019-11-25 08:52:29,307 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_4bc5bd24-d1cf-4158-a58b-64f57e1b7a3e/bin/uautomizer/data/e8ed142be/101192ed07f34513a4883bbac11f59a8 [2019-11-25 08:52:29,310 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-25 08:52:29,311 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-25 08:52:29,312 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-25 08:52:29,312 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-25 08:52:29,315 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-25 08:52:29,316 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:52:29" (1/1) ... [2019-11-25 08:52:29,323 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3631baf1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:52:29, skipping insertion in model container [2019-11-25 08:52:29,324 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:52:29" (1/1) ... [2019-11-25 08:52:29,336 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-25 08:52:29,403 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-25 08:52:29,903 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 08:52:29,916 INFO L201 MainTranslator]: Completed pre-run [2019-11-25 08:52:30,031 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 08:52:30,050 INFO L205 MainTranslator]: Completed translation [2019-11-25 08:52:30,051 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:52:30 WrapperNode [2019-11-25 08:52:30,051 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-25 08:52:30,052 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-25 08:52:30,052 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-25 08:52:30,052 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-25 08:52:30,060 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:52:30" (1/1) ... [2019-11-25 08:52:30,081 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:52:30" (1/1) ... [2019-11-25 08:52:30,123 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-25 08:52:30,124 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-25 08:52:30,124 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-25 08:52:30,124 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-25 08:52:30,133 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:52:30" (1/1) ... [2019-11-25 08:52:30,133 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:52:30" (1/1) ... [2019-11-25 08:52:30,141 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:52:30" (1/1) ... [2019-11-25 08:52:30,142 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:52:30" (1/1) ... [2019-11-25 08:52:30,191 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:52:30" (1/1) ... [2019-11-25 08:52:30,198 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:52:30" (1/1) ... [2019-11-25 08:52:30,202 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:52:30" (1/1) ... [2019-11-25 08:52:30,208 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-25 08:52:30,208 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-25 08:52:30,208 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-25 08:52:30,208 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-25 08:52:30,209 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:52:30" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4bc5bd24-d1cf-4158-a58b-64f57e1b7a3e/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-25 08:52:30,283 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-25 08:52:30,283 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-25 08:52:30,283 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-25 08:52:30,284 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-25 08:52:30,284 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-25 08:52:30,285 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-25 08:52:30,285 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-25 08:52:30,285 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-25 08:52:30,545 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-25 08:52:31,441 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2019-11-25 08:52:31,441 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2019-11-25 08:52:31,442 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-25 08:52:31,442 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-25 08:52:31,443 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:52:31 BoogieIcfgContainer [2019-11-25 08:52:31,443 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-25 08:52:31,445 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-25 08:52:31,445 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-25 08:52:31,447 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-25 08:52:31,448 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 08:52:29" (1/3) ... [2019-11-25 08:52:31,448 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ecc67b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 08:52:31, skipping insertion in model container [2019-11-25 08:52:31,449 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:52:30" (2/3) ... [2019-11-25 08:52:31,449 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ecc67b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 08:52:31, skipping insertion in model container [2019-11-25 08:52:31,449 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:52:31" (3/3) ... [2019-11-25 08:52:31,450 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.03.i.cil.c [2019-11-25 08:52:31,461 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-25 08:52:31,469 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-25 08:52:31,479 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-25 08:52:31,501 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-25 08:52:31,501 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-25 08:52:31,502 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-25 08:52:31,502 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-25 08:52:31,502 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-25 08:52:31,502 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-25 08:52:31,502 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-25 08:52:31,502 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-25 08:52:31,525 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states. [2019-11-25 08:52:31,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-25 08:52:31,536 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:52:31,537 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-25 08:52:31,537 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:52:31,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:31,543 INFO L82 PathProgramCache]: Analyzing trace with hash 522837677, now seen corresponding path program 1 times [2019-11-25 08:52:31,551 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:52:31,552 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627958952] [2019-11-25 08:52:31,552 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:52:31,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:31,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:52:31,811 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627958952] [2019-11-25 08:52:31,812 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:52:31,812 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:52:31,812 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014137788] [2019-11-25 08:52:31,816 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:52:31,817 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:52:31,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:52:31,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:52:31,831 INFO L87 Difference]: Start difference. First operand 143 states. Second operand 4 states. [2019-11-25 08:52:32,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:52:32,332 INFO L93 Difference]: Finished difference Result 313 states and 527 transitions. [2019-11-25 08:52:32,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:52:32,333 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2019-11-25 08:52:32,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:52:32,356 INFO L225 Difference]: With dead ends: 313 [2019-11-25 08:52:32,356 INFO L226 Difference]: Without dead ends: 158 [2019-11-25 08:52:32,360 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:52:32,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-11-25 08:52:32,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 141. [2019-11-25 08:52:32,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-11-25 08:52:32,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 216 transitions. [2019-11-25 08:52:32,417 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 216 transitions. Word has length 45 [2019-11-25 08:52:32,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:52:32,418 INFO L462 AbstractCegarLoop]: Abstraction has 141 states and 216 transitions. [2019-11-25 08:52:32,418 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:52:32,418 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 216 transitions. [2019-11-25 08:52:32,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-11-25 08:52:32,421 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:52:32,421 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-25 08:52:32,422 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:52:32,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:32,422 INFO L82 PathProgramCache]: Analyzing trace with hash -428665669, now seen corresponding path program 1 times [2019-11-25 08:52:32,422 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:52:32,422 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950139114] [2019-11-25 08:52:32,423 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:52:32,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:32,615 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-25 08:52:32,616 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950139114] [2019-11-25 08:52:32,617 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:52:32,618 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:52:32,618 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483587624] [2019-11-25 08:52:32,620 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:52:32,620 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:52:32,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:52:32,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:52:32,622 INFO L87 Difference]: Start difference. First operand 141 states and 216 transitions. Second operand 4 states. [2019-11-25 08:52:32,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:52:32,972 INFO L93 Difference]: Finished difference Result 280 states and 423 transitions. [2019-11-25 08:52:32,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:52:32,973 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2019-11-25 08:52:32,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:52:32,975 INFO L225 Difference]: With dead ends: 280 [2019-11-25 08:52:32,975 INFO L226 Difference]: Without dead ends: 158 [2019-11-25 08:52:32,977 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:52:32,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-11-25 08:52:32,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 141. [2019-11-25 08:52:32,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-11-25 08:52:32,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 215 transitions. [2019-11-25 08:52:32,997 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 215 transitions. Word has length 58 [2019-11-25 08:52:32,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:52:32,998 INFO L462 AbstractCegarLoop]: Abstraction has 141 states and 215 transitions. [2019-11-25 08:52:32,998 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:52:32,998 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 215 transitions. [2019-11-25 08:52:33,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-11-25 08:52:33,005 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:52:33,005 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-25 08:52:33,005 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:52:33,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:33,006 INFO L82 PathProgramCache]: Analyzing trace with hash -1858029875, now seen corresponding path program 1 times [2019-11-25 08:52:33,006 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:52:33,007 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557046568] [2019-11-25 08:52:33,008 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:52:33,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:33,128 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-25 08:52:33,129 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557046568] [2019-11-25 08:52:33,129 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:52:33,129 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:52:33,129 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889401835] [2019-11-25 08:52:33,130 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:52:33,130 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:52:33,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:52:33,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:52:33,130 INFO L87 Difference]: Start difference. First operand 141 states and 215 transitions. Second operand 4 states. [2019-11-25 08:52:33,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:52:33,455 INFO L93 Difference]: Finished difference Result 279 states and 421 transitions. [2019-11-25 08:52:33,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:52:33,458 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2019-11-25 08:52:33,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:52:33,459 INFO L225 Difference]: With dead ends: 279 [2019-11-25 08:52:33,459 INFO L226 Difference]: Without dead ends: 157 [2019-11-25 08:52:33,460 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:52:33,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-11-25 08:52:33,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 141. [2019-11-25 08:52:33,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-11-25 08:52:33,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 214 transitions. [2019-11-25 08:52:33,473 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 214 transitions. Word has length 59 [2019-11-25 08:52:33,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:52:33,473 INFO L462 AbstractCegarLoop]: Abstraction has 141 states and 214 transitions. [2019-11-25 08:52:33,473 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:52:33,473 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 214 transitions. [2019-11-25 08:52:33,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-11-25 08:52:33,474 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:52:33,474 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-25 08:52:33,475 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:52:33,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:33,475 INFO L82 PathProgramCache]: Analyzing trace with hash -514836424, now seen corresponding path program 1 times [2019-11-25 08:52:33,475 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:52:33,476 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073095481] [2019-11-25 08:52:33,476 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:52:33,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:33,548 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-25 08:52:33,548 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073095481] [2019-11-25 08:52:33,549 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:52:33,549 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:52:33,549 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605043302] [2019-11-25 08:52:33,550 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:52:33,550 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:52:33,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:52:33,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:52:33,551 INFO L87 Difference]: Start difference. First operand 141 states and 214 transitions. Second operand 4 states. [2019-11-25 08:52:33,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:52:33,905 INFO L93 Difference]: Finished difference Result 277 states and 418 transitions. [2019-11-25 08:52:33,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:52:33,906 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2019-11-25 08:52:33,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:52:33,907 INFO L225 Difference]: With dead ends: 277 [2019-11-25 08:52:33,908 INFO L226 Difference]: Without dead ends: 155 [2019-11-25 08:52:33,909 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:52:33,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-11-25 08:52:33,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 141. [2019-11-25 08:52:33,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-11-25 08:52:33,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 213 transitions. [2019-11-25 08:52:33,928 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 213 transitions. Word has length 59 [2019-11-25 08:52:33,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:52:33,929 INFO L462 AbstractCegarLoop]: Abstraction has 141 states and 213 transitions. [2019-11-25 08:52:33,930 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:52:33,930 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 213 transitions. [2019-11-25 08:52:33,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-11-25 08:52:33,931 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:52:33,931 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-25 08:52:33,932 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:52:33,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:33,932 INFO L82 PathProgramCache]: Analyzing trace with hash 434511736, now seen corresponding path program 1 times [2019-11-25 08:52:33,932 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:52:33,933 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955026175] [2019-11-25 08:52:33,933 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:52:33,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:34,024 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-25 08:52:34,025 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955026175] [2019-11-25 08:52:34,026 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:52:34,026 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:52:34,026 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746850823] [2019-11-25 08:52:34,028 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:52:34,028 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:52:34,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:52:34,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:52:34,029 INFO L87 Difference]: Start difference. First operand 141 states and 213 transitions. Second operand 4 states. [2019-11-25 08:52:34,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:52:34,344 INFO L93 Difference]: Finished difference Result 276 states and 416 transitions. [2019-11-25 08:52:34,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:52:34,344 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2019-11-25 08:52:34,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:52:34,346 INFO L225 Difference]: With dead ends: 276 [2019-11-25 08:52:34,346 INFO L226 Difference]: Without dead ends: 154 [2019-11-25 08:52:34,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-25 08:52:34,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-11-25 08:52:34,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 141. [2019-11-25 08:52:34,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-11-25 08:52:34,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 212 transitions. [2019-11-25 08:52:34,355 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 212 transitions. Word has length 59 [2019-11-25 08:52:34,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:52:34,355 INFO L462 AbstractCegarLoop]: Abstraction has 141 states and 212 transitions. [2019-11-25 08:52:34,355 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:52:34,355 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 212 transitions. [2019-11-25 08:52:34,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-11-25 08:52:34,356 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:52:34,356 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-25 08:52:34,357 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:52:34,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:34,357 INFO L82 PathProgramCache]: Analyzing trace with hash -1020019103, now seen corresponding path program 1 times [2019-11-25 08:52:34,357 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:52:34,358 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184800955] [2019-11-25 08:52:34,358 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:52:34,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:34,406 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-25 08:52:34,406 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184800955] [2019-11-25 08:52:34,406 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:52:34,407 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:52:34,407 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844242057] [2019-11-25 08:52:34,407 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:52:34,408 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:52:34,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:52:34,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:52:34,408 INFO L87 Difference]: Start difference. First operand 141 states and 212 transitions. Second operand 4 states. [2019-11-25 08:52:34,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:52:34,723 INFO L93 Difference]: Finished difference Result 276 states and 415 transitions. [2019-11-25 08:52:34,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:52:34,724 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2019-11-25 08:52:34,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:52:34,725 INFO L225 Difference]: With dead ends: 276 [2019-11-25 08:52:34,725 INFO L226 Difference]: Without dead ends: 154 [2019-11-25 08:52:34,726 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:52:34,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-11-25 08:52:34,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 141. [2019-11-25 08:52:34,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-11-25 08:52:34,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 211 transitions. [2019-11-25 08:52:34,738 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 211 transitions. Word has length 59 [2019-11-25 08:52:34,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:52:34,741 INFO L462 AbstractCegarLoop]: Abstraction has 141 states and 211 transitions. [2019-11-25 08:52:34,741 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:52:34,742 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 211 transitions. [2019-11-25 08:52:34,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-11-25 08:52:34,743 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:52:34,743 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-25 08:52:34,743 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:52:34,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:34,744 INFO L82 PathProgramCache]: Analyzing trace with hash 321491268, now seen corresponding path program 1 times [2019-11-25 08:52:34,744 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:52:34,744 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615743917] [2019-11-25 08:52:34,749 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:52:34,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:34,846 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-25 08:52:34,848 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615743917] [2019-11-25 08:52:34,849 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:52:34,849 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:52:34,849 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48371077] [2019-11-25 08:52:34,850 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:52:34,850 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:52:34,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:52:34,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:52:34,854 INFO L87 Difference]: Start difference. First operand 141 states and 211 transitions. Second operand 4 states. [2019-11-25 08:52:35,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:52:35,108 INFO L93 Difference]: Finished difference Result 276 states and 414 transitions. [2019-11-25 08:52:35,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:52:35,108 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2019-11-25 08:52:35,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:52:35,109 INFO L225 Difference]: With dead ends: 276 [2019-11-25 08:52:35,109 INFO L226 Difference]: Without dead ends: 154 [2019-11-25 08:52:35,110 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:52:35,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-11-25 08:52:35,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 141. [2019-11-25 08:52:35,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-11-25 08:52:35,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 210 transitions. [2019-11-25 08:52:35,115 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 210 transitions. Word has length 60 [2019-11-25 08:52:35,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:52:35,115 INFO L462 AbstractCegarLoop]: Abstraction has 141 states and 210 transitions. [2019-11-25 08:52:35,115 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:52:35,116 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 210 transitions. [2019-11-25 08:52:35,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-11-25 08:52:35,116 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:52:35,117 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-25 08:52:35,117 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:52:35,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:35,117 INFO L82 PathProgramCache]: Analyzing trace with hash -1080156986, now seen corresponding path program 1 times [2019-11-25 08:52:35,118 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:52:35,118 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910022727] [2019-11-25 08:52:35,118 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:52:35,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:35,171 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-25 08:52:35,171 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910022727] [2019-11-25 08:52:35,172 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:52:35,172 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:52:35,172 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530575433] [2019-11-25 08:52:35,173 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:52:35,173 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:52:35,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:52:35,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:52:35,173 INFO L87 Difference]: Start difference. First operand 141 states and 210 transitions. Second operand 4 states. [2019-11-25 08:52:35,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:52:35,418 INFO L93 Difference]: Finished difference Result 276 states and 413 transitions. [2019-11-25 08:52:35,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:52:35,419 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2019-11-25 08:52:35,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:52:35,420 INFO L225 Difference]: With dead ends: 276 [2019-11-25 08:52:35,420 INFO L226 Difference]: Without dead ends: 154 [2019-11-25 08:52:35,421 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:52:35,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-11-25 08:52:35,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 141. [2019-11-25 08:52:35,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-11-25 08:52:35,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 209 transitions. [2019-11-25 08:52:35,427 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 209 transitions. Word has length 61 [2019-11-25 08:52:35,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:52:35,427 INFO L462 AbstractCegarLoop]: Abstraction has 141 states and 209 transitions. [2019-11-25 08:52:35,427 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:52:35,428 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 209 transitions. [2019-11-25 08:52:35,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-11-25 08:52:35,428 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:52:35,428 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-25 08:52:35,429 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:52:35,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:35,429 INFO L82 PathProgramCache]: Analyzing trace with hash -1620376695, now seen corresponding path program 1 times [2019-11-25 08:52:35,429 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:52:35,429 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32226029] [2019-11-25 08:52:35,430 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:52:35,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:35,503 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-25 08:52:35,503 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32226029] [2019-11-25 08:52:35,503 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:52:35,503 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:52:35,504 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046124609] [2019-11-25 08:52:35,504 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:52:35,504 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:52:35,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:52:35,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:52:35,505 INFO L87 Difference]: Start difference. First operand 141 states and 209 transitions. Second operand 4 states. [2019-11-25 08:52:35,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:52:35,729 INFO L93 Difference]: Finished difference Result 266 states and 399 transitions. [2019-11-25 08:52:35,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:52:35,729 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2019-11-25 08:52:35,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:52:35,730 INFO L225 Difference]: With dead ends: 266 [2019-11-25 08:52:35,730 INFO L226 Difference]: Without dead ends: 144 [2019-11-25 08:52:35,731 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:52:35,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2019-11-25 08:52:35,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 141. [2019-11-25 08:52:35,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-11-25 08:52:35,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 208 transitions. [2019-11-25 08:52:35,737 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 208 transitions. Word has length 62 [2019-11-25 08:52:35,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:52:35,738 INFO L462 AbstractCegarLoop]: Abstraction has 141 states and 208 transitions. [2019-11-25 08:52:35,739 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:52:35,739 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 208 transitions. [2019-11-25 08:52:35,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-11-25 08:52:35,744 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:52:35,744 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-25 08:52:35,744 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:52:35,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:35,744 INFO L82 PathProgramCache]: Analyzing trace with hash -1220225295, now seen corresponding path program 1 times [2019-11-25 08:52:35,745 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:52:35,745 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685867761] [2019-11-25 08:52:35,745 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:52:35,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:35,810 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-25 08:52:35,811 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685867761] [2019-11-25 08:52:35,811 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:52:35,813 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:52:35,813 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118234478] [2019-11-25 08:52:35,813 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:52:35,814 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:52:35,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:52:35,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:52:35,814 INFO L87 Difference]: Start difference. First operand 141 states and 208 transitions. Second operand 4 states. [2019-11-25 08:52:36,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:52:36,133 INFO L93 Difference]: Finished difference Result 306 states and 460 transitions. [2019-11-25 08:52:36,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:52:36,133 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2019-11-25 08:52:36,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:52:36,135 INFO L225 Difference]: With dead ends: 306 [2019-11-25 08:52:36,135 INFO L226 Difference]: Without dead ends: 184 [2019-11-25 08:52:36,135 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-25 08:52:36,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2019-11-25 08:52:36,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 163. [2019-11-25 08:52:36,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-11-25 08:52:36,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 246 transitions. [2019-11-25 08:52:36,141 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 246 transitions. Word has length 62 [2019-11-25 08:52:36,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:52:36,141 INFO L462 AbstractCegarLoop]: Abstraction has 163 states and 246 transitions. [2019-11-25 08:52:36,141 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:52:36,141 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 246 transitions. [2019-11-25 08:52:36,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-11-25 08:52:36,142 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:52:36,142 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-25 08:52:36,143 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:52:36,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:36,143 INFO L82 PathProgramCache]: Analyzing trace with hash -1563120905, now seen corresponding path program 1 times [2019-11-25 08:52:36,143 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:52:36,143 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572826589] [2019-11-25 08:52:36,143 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:52:36,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:36,187 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-25 08:52:36,188 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572826589] [2019-11-25 08:52:36,188 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:52:36,188 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:52:36,188 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126528945] [2019-11-25 08:52:36,189 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:52:36,189 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:52:36,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:52:36,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:52:36,189 INFO L87 Difference]: Start difference. First operand 163 states and 246 transitions. Second operand 4 states. [2019-11-25 08:52:36,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:52:36,489 INFO L93 Difference]: Finished difference Result 328 states and 497 transitions. [2019-11-25 08:52:36,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:52:36,489 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2019-11-25 08:52:36,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:52:36,490 INFO L225 Difference]: With dead ends: 328 [2019-11-25 08:52:36,490 INFO L226 Difference]: Without dead ends: 184 [2019-11-25 08:52:36,491 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-25 08:52:36,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2019-11-25 08:52:36,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 163. [2019-11-25 08:52:36,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-11-25 08:52:36,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 245 transitions. [2019-11-25 08:52:36,497 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 245 transitions. Word has length 75 [2019-11-25 08:52:36,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:52:36,497 INFO L462 AbstractCegarLoop]: Abstraction has 163 states and 245 transitions. [2019-11-25 08:52:36,497 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:52:36,497 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 245 transitions. [2019-11-25 08:52:36,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-11-25 08:52:36,498 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:52:36,498 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-25 08:52:36,498 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:52:36,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:36,499 INFO L82 PathProgramCache]: Analyzing trace with hash 1628563473, now seen corresponding path program 1 times [2019-11-25 08:52:36,499 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:52:36,499 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628631850] [2019-11-25 08:52:36,499 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:52:36,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:36,554 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-25 08:52:36,555 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628631850] [2019-11-25 08:52:36,555 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:52:36,555 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:52:36,556 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870776095] [2019-11-25 08:52:36,556 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:52:36,556 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:52:36,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:52:36,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:52:36,557 INFO L87 Difference]: Start difference. First operand 163 states and 245 transitions. Second operand 4 states. [2019-11-25 08:52:36,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:52:36,899 INFO L93 Difference]: Finished difference Result 327 states and 494 transitions. [2019-11-25 08:52:36,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:52:36,900 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2019-11-25 08:52:36,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:52:36,901 INFO L225 Difference]: With dead ends: 327 [2019-11-25 08:52:36,901 INFO L226 Difference]: Without dead ends: 183 [2019-11-25 08:52:36,901 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-25 08:52:36,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2019-11-25 08:52:36,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 163. [2019-11-25 08:52:36,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-11-25 08:52:36,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 244 transitions. [2019-11-25 08:52:36,906 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 244 transitions. Word has length 76 [2019-11-25 08:52:36,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:52:36,907 INFO L462 AbstractCegarLoop]: Abstraction has 163 states and 244 transitions. [2019-11-25 08:52:36,907 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:52:36,907 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 244 transitions. [2019-11-25 08:52:36,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-11-25 08:52:36,907 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:52:36,908 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-25 08:52:36,908 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:52:36,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:36,908 INFO L82 PathProgramCache]: Analyzing trace with hash -1323210372, now seen corresponding path program 1 times [2019-11-25 08:52:36,908 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:52:36,908 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085911091] [2019-11-25 08:52:36,908 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:52:36,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:36,951 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-25 08:52:36,952 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085911091] [2019-11-25 08:52:36,952 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:52:36,952 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:52:36,952 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940990801] [2019-11-25 08:52:36,952 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:52:36,953 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:52:36,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:52:36,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:52:36,953 INFO L87 Difference]: Start difference. First operand 163 states and 244 transitions. Second operand 4 states. [2019-11-25 08:52:37,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:52:37,284 INFO L93 Difference]: Finished difference Result 325 states and 490 transitions. [2019-11-25 08:52:37,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:52:37,285 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2019-11-25 08:52:37,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:52:37,286 INFO L225 Difference]: With dead ends: 325 [2019-11-25 08:52:37,286 INFO L226 Difference]: Without dead ends: 181 [2019-11-25 08:52:37,287 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-25 08:52:37,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2019-11-25 08:52:37,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 163. [2019-11-25 08:52:37,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-11-25 08:52:37,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 243 transitions. [2019-11-25 08:52:37,291 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 243 transitions. Word has length 76 [2019-11-25 08:52:37,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:52:37,292 INFO L462 AbstractCegarLoop]: Abstraction has 163 states and 243 transitions. [2019-11-25 08:52:37,292 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:52:37,292 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 243 transitions. [2019-11-25 08:52:37,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-11-25 08:52:37,293 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:52:37,293 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-25 08:52:37,293 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:52:37,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:37,294 INFO L82 PathProgramCache]: Analyzing trace with hash -373862212, now seen corresponding path program 1 times [2019-11-25 08:52:37,294 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:52:37,294 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241137275] [2019-11-25 08:52:37,294 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:52:37,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:37,335 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-25 08:52:37,335 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241137275] [2019-11-25 08:52:37,336 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:52:37,336 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:52:37,336 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887277285] [2019-11-25 08:52:37,336 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:52:37,336 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:52:37,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:52:37,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:52:37,337 INFO L87 Difference]: Start difference. First operand 163 states and 243 transitions. Second operand 4 states. [2019-11-25 08:52:37,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:52:37,656 INFO L93 Difference]: Finished difference Result 324 states and 487 transitions. [2019-11-25 08:52:37,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:52:37,657 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2019-11-25 08:52:37,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:52:37,658 INFO L225 Difference]: With dead ends: 324 [2019-11-25 08:52:37,658 INFO L226 Difference]: Without dead ends: 180 [2019-11-25 08:52:37,659 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-25 08:52:37,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-11-25 08:52:37,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 163. [2019-11-25 08:52:37,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-11-25 08:52:37,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 242 transitions. [2019-11-25 08:52:37,664 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 242 transitions. Word has length 76 [2019-11-25 08:52:37,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:52:37,664 INFO L462 AbstractCegarLoop]: Abstraction has 163 states and 242 transitions. [2019-11-25 08:52:37,664 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:52:37,664 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 242 transitions. [2019-11-25 08:52:37,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-11-25 08:52:37,665 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:52:37,665 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-25 08:52:37,668 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:52:37,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:37,668 INFO L82 PathProgramCache]: Analyzing trace with hash -1828393051, now seen corresponding path program 1 times [2019-11-25 08:52:37,668 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:52:37,668 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637690408] [2019-11-25 08:52:37,669 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:52:37,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:37,708 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-25 08:52:37,709 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637690408] [2019-11-25 08:52:37,709 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:52:37,709 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:52:37,709 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233204963] [2019-11-25 08:52:37,710 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:52:37,710 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:52:37,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:52:37,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:52:37,711 INFO L87 Difference]: Start difference. First operand 163 states and 242 transitions. Second operand 4 states. [2019-11-25 08:52:37,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:52:37,986 INFO L93 Difference]: Finished difference Result 324 states and 485 transitions. [2019-11-25 08:52:37,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:52:37,987 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2019-11-25 08:52:37,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:52:37,988 INFO L225 Difference]: With dead ends: 324 [2019-11-25 08:52:37,988 INFO L226 Difference]: Without dead ends: 180 [2019-11-25 08:52:37,989 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-25 08:52:37,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-11-25 08:52:37,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 163. [2019-11-25 08:52:37,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-11-25 08:52:37,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 241 transitions. [2019-11-25 08:52:37,994 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 241 transitions. Word has length 76 [2019-11-25 08:52:37,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:52:37,994 INFO L462 AbstractCegarLoop]: Abstraction has 163 states and 241 transitions. [2019-11-25 08:52:37,994 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:52:37,994 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 241 transitions. [2019-11-25 08:52:37,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-11-25 08:52:37,995 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:52:37,995 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-25 08:52:37,995 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:52:37,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:37,996 INFO L82 PathProgramCache]: Analyzing trace with hash 1031702656, now seen corresponding path program 1 times [2019-11-25 08:52:37,996 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:52:37,996 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572204003] [2019-11-25 08:52:37,996 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:52:38,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:38,056 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-25 08:52:38,056 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572204003] [2019-11-25 08:52:38,058 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:52:38,058 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:52:38,058 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322194010] [2019-11-25 08:52:38,059 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:52:38,059 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:52:38,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:52:38,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:52:38,059 INFO L87 Difference]: Start difference. First operand 163 states and 241 transitions. Second operand 4 states. [2019-11-25 08:52:38,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:52:38,371 INFO L93 Difference]: Finished difference Result 324 states and 483 transitions. [2019-11-25 08:52:38,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:52:38,372 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2019-11-25 08:52:38,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:52:38,373 INFO L225 Difference]: With dead ends: 324 [2019-11-25 08:52:38,373 INFO L226 Difference]: Without dead ends: 180 [2019-11-25 08:52:38,374 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-25 08:52:38,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-11-25 08:52:38,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 163. [2019-11-25 08:52:38,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-11-25 08:52:38,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 240 transitions. [2019-11-25 08:52:38,378 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 240 transitions. Word has length 77 [2019-11-25 08:52:38,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:52:38,379 INFO L462 AbstractCegarLoop]: Abstraction has 163 states and 240 transitions. [2019-11-25 08:52:38,379 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:52:38,379 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 240 transitions. [2019-11-25 08:52:38,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-11-25 08:52:38,384 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:52:38,384 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-25 08:52:38,384 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:52:38,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:38,384 INFO L82 PathProgramCache]: Analyzing trace with hash -538440438, now seen corresponding path program 1 times [2019-11-25 08:52:38,385 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:52:38,385 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805786760] [2019-11-25 08:52:38,385 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:52:38,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:38,426 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-25 08:52:38,426 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805786760] [2019-11-25 08:52:38,426 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:52:38,427 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:52:38,427 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610135926] [2019-11-25 08:52:38,427 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:52:38,427 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:52:38,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:52:38,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:52:38,428 INFO L87 Difference]: Start difference. First operand 163 states and 240 transitions. Second operand 4 states. [2019-11-25 08:52:38,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:52:38,745 INFO L93 Difference]: Finished difference Result 324 states and 481 transitions. [2019-11-25 08:52:38,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:52:38,746 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2019-11-25 08:52:38,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:52:38,747 INFO L225 Difference]: With dead ends: 324 [2019-11-25 08:52:38,747 INFO L226 Difference]: Without dead ends: 180 [2019-11-25 08:52:38,748 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-25 08:52:38,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-11-25 08:52:38,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 163. [2019-11-25 08:52:38,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-11-25 08:52:38,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 239 transitions. [2019-11-25 08:52:38,753 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 239 transitions. Word has length 78 [2019-11-25 08:52:38,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:52:38,753 INFO L462 AbstractCegarLoop]: Abstraction has 163 states and 239 transitions. [2019-11-25 08:52:38,753 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:52:38,753 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 239 transitions. [2019-11-25 08:52:38,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-11-25 08:52:38,755 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:52:38,755 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-25 08:52:38,755 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:52:38,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:38,756 INFO L82 PathProgramCache]: Analyzing trace with hash -2007032891, now seen corresponding path program 1 times [2019-11-25 08:52:38,761 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:52:38,761 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666534208] [2019-11-25 08:52:38,762 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:52:38,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:38,817 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-25 08:52:38,817 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666534208] [2019-11-25 08:52:38,818 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:52:38,818 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:52:38,818 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442596205] [2019-11-25 08:52:38,818 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:52:38,819 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:52:38,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:52:38,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:52:38,819 INFO L87 Difference]: Start difference. First operand 163 states and 239 transitions. Second operand 4 states. [2019-11-25 08:52:39,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:52:39,072 INFO L93 Difference]: Finished difference Result 314 states and 466 transitions. [2019-11-25 08:52:39,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:52:39,073 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2019-11-25 08:52:39,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:52:39,073 INFO L225 Difference]: With dead ends: 314 [2019-11-25 08:52:39,074 INFO L226 Difference]: Without dead ends: 170 [2019-11-25 08:52:39,074 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-25 08:52:39,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2019-11-25 08:52:39,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 163. [2019-11-25 08:52:39,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-11-25 08:52:39,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 238 transitions. [2019-11-25 08:52:39,077 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 238 transitions. Word has length 79 [2019-11-25 08:52:39,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:52:39,078 INFO L462 AbstractCegarLoop]: Abstraction has 163 states and 238 transitions. [2019-11-25 08:52:39,078 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:52:39,078 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 238 transitions. [2019-11-25 08:52:39,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-25 08:52:39,079 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:52:39,079 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-25 08:52:39,079 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:52:39,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:39,080 INFO L82 PathProgramCache]: Analyzing trace with hash -1409260885, now seen corresponding path program 1 times [2019-11-25 08:52:39,080 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:52:39,080 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320936486] [2019-11-25 08:52:39,080 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:52:39,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:39,151 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-25 08:52:39,152 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320936486] [2019-11-25 08:52:39,152 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:52:39,152 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:52:39,152 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205688362] [2019-11-25 08:52:39,153 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:52:39,153 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:52:39,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:52:39,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:52:39,153 INFO L87 Difference]: Start difference. First operand 163 states and 238 transitions. Second operand 4 states. [2019-11-25 08:52:39,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:52:39,575 INFO L93 Difference]: Finished difference Result 403 states and 603 transitions. [2019-11-25 08:52:39,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:52:39,575 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 84 [2019-11-25 08:52:39,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:52:39,577 INFO L225 Difference]: With dead ends: 403 [2019-11-25 08:52:39,577 INFO L226 Difference]: Without dead ends: 259 [2019-11-25 08:52:39,578 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:52:39,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2019-11-25 08:52:39,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 206. [2019-11-25 08:52:39,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2019-11-25 08:52:39,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 316 transitions. [2019-11-25 08:52:39,585 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 316 transitions. Word has length 84 [2019-11-25 08:52:39,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:52:39,586 INFO L462 AbstractCegarLoop]: Abstraction has 206 states and 316 transitions. [2019-11-25 08:52:39,586 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:52:39,586 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 316 transitions. [2019-11-25 08:52:39,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-25 08:52:39,587 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:52:39,587 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-25 08:52:39,587 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:52:39,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:39,587 INFO L82 PathProgramCache]: Analyzing trace with hash 1988313133, now seen corresponding path program 1 times [2019-11-25 08:52:39,588 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:52:39,588 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481641967] [2019-11-25 08:52:39,588 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:52:39,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:39,660 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-25 08:52:39,661 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481641967] [2019-11-25 08:52:39,661 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:52:39,661 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:52:39,661 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581199993] [2019-11-25 08:52:39,662 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:52:39,662 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:52:39,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:52:39,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:52:39,663 INFO L87 Difference]: Start difference. First operand 206 states and 316 transitions. Second operand 4 states. [2019-11-25 08:52:40,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:52:40,018 INFO L93 Difference]: Finished difference Result 442 states and 685 transitions. [2019-11-25 08:52:40,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:52:40,019 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 84 [2019-11-25 08:52:40,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:52:40,020 INFO L225 Difference]: With dead ends: 442 [2019-11-25 08:52:40,020 INFO L226 Difference]: Without dead ends: 255 [2019-11-25 08:52:40,021 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:52:40,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2019-11-25 08:52:40,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 230. [2019-11-25 08:52:40,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2019-11-25 08:52:40,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 358 transitions. [2019-11-25 08:52:40,028 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 358 transitions. Word has length 84 [2019-11-25 08:52:40,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:52:40,028 INFO L462 AbstractCegarLoop]: Abstraction has 230 states and 358 transitions. [2019-11-25 08:52:40,028 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:52:40,029 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 358 transitions. [2019-11-25 08:52:40,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-11-25 08:52:40,030 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:52:40,030 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-25 08:52:40,030 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:52:40,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:40,030 INFO L82 PathProgramCache]: Analyzing trace with hash -40403587, now seen corresponding path program 1 times [2019-11-25 08:52:40,031 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:52:40,031 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394211652] [2019-11-25 08:52:40,031 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:52:40,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:40,095 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-25 08:52:40,096 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394211652] [2019-11-25 08:52:40,096 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:52:40,096 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:52:40,096 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107359238] [2019-11-25 08:52:40,097 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:52:40,097 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:52:40,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:52:40,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:52:40,098 INFO L87 Difference]: Start difference. First operand 230 states and 358 transitions. Second operand 4 states. [2019-11-25 08:52:40,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:52:40,571 INFO L93 Difference]: Finished difference Result 494 states and 764 transitions. [2019-11-25 08:52:40,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:52:40,572 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-11-25 08:52:40,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:52:40,574 INFO L225 Difference]: With dead ends: 494 [2019-11-25 08:52:40,574 INFO L226 Difference]: Without dead ends: 283 [2019-11-25 08:52:40,574 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:52:40,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2019-11-25 08:52:40,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 230. [2019-11-25 08:52:40,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2019-11-25 08:52:40,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 357 transitions. [2019-11-25 08:52:40,582 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 357 transitions. Word has length 97 [2019-11-25 08:52:40,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:52:40,583 INFO L462 AbstractCegarLoop]: Abstraction has 230 states and 357 transitions. [2019-11-25 08:52:40,583 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:52:40,583 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 357 transitions. [2019-11-25 08:52:40,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-11-25 08:52:40,584 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:52:40,584 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-25 08:52:40,584 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:52:40,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:40,585 INFO L82 PathProgramCache]: Analyzing trace with hash 271163, now seen corresponding path program 1 times [2019-11-25 08:52:40,585 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:52:40,588 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486989335] [2019-11-25 08:52:40,588 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:52:40,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:40,656 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-25 08:52:40,657 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486989335] [2019-11-25 08:52:40,658 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:52:40,658 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:52:40,658 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503347526] [2019-11-25 08:52:40,659 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:52:40,659 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:52:40,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:52:40,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:52:40,659 INFO L87 Difference]: Start difference. First operand 230 states and 357 transitions. Second operand 4 states. [2019-11-25 08:52:41,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:52:41,049 INFO L93 Difference]: Finished difference Result 466 states and 724 transitions. [2019-11-25 08:52:41,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:52:41,049 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-11-25 08:52:41,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:52:41,051 INFO L225 Difference]: With dead ends: 466 [2019-11-25 08:52:41,051 INFO L226 Difference]: Without dead ends: 255 [2019-11-25 08:52:41,052 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:52:41,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2019-11-25 08:52:41,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 230. [2019-11-25 08:52:41,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2019-11-25 08:52:41,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 356 transitions. [2019-11-25 08:52:41,058 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 356 transitions. Word has length 97 [2019-11-25 08:52:41,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:52:41,058 INFO L462 AbstractCegarLoop]: Abstraction has 230 states and 356 transitions. [2019-11-25 08:52:41,058 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:52:41,059 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 356 transitions. [2019-11-25 08:52:41,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-25 08:52:41,060 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:52:41,060 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-25 08:52:41,060 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:52:41,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:41,061 INFO L82 PathProgramCache]: Analyzing trace with hash 1588160075, now seen corresponding path program 1 times [2019-11-25 08:52:41,061 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:52:41,061 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514741571] [2019-11-25 08:52:41,061 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:52:41,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:41,113 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-25 08:52:41,114 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514741571] [2019-11-25 08:52:41,114 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:52:41,114 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:52:41,115 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48666395] [2019-11-25 08:52:41,116 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:52:41,116 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:52:41,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:52:41,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:52:41,116 INFO L87 Difference]: Start difference. First operand 230 states and 356 transitions. Second operand 4 states. [2019-11-25 08:52:41,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:52:41,534 INFO L93 Difference]: Finished difference Result 493 states and 759 transitions. [2019-11-25 08:52:41,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:52:41,535 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-11-25 08:52:41,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:52:41,537 INFO L225 Difference]: With dead ends: 493 [2019-11-25 08:52:41,537 INFO L226 Difference]: Without dead ends: 282 [2019-11-25 08:52:41,538 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:52:41,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2019-11-25 08:52:41,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 230. [2019-11-25 08:52:41,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2019-11-25 08:52:41,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 355 transitions. [2019-11-25 08:52:41,544 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 355 transitions. Word has length 98 [2019-11-25 08:52:41,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:52:41,545 INFO L462 AbstractCegarLoop]: Abstraction has 230 states and 355 transitions. [2019-11-25 08:52:41,545 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:52:41,545 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 355 transitions. [2019-11-25 08:52:41,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-25 08:52:41,546 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:52:41,546 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-25 08:52:41,547 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:52:41,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:41,547 INFO L82 PathProgramCache]: Analyzing trace with hash -1363613770, now seen corresponding path program 1 times [2019-11-25 08:52:41,547 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:52:41,547 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465153316] [2019-11-25 08:52:41,548 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:52:41,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:41,608 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-25 08:52:41,609 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465153316] [2019-11-25 08:52:41,609 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:52:41,609 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:52:41,609 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552570508] [2019-11-25 08:52:41,610 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:52:41,610 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:52:41,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:52:41,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:52:41,611 INFO L87 Difference]: Start difference. First operand 230 states and 355 transitions. Second operand 4 states. [2019-11-25 08:52:42,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:52:42,034 INFO L93 Difference]: Finished difference Result 491 states and 755 transitions. [2019-11-25 08:52:42,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:52:42,035 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-11-25 08:52:42,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:52:42,037 INFO L225 Difference]: With dead ends: 491 [2019-11-25 08:52:42,037 INFO L226 Difference]: Without dead ends: 280 [2019-11-25 08:52:42,037 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:52:42,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2019-11-25 08:52:42,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 230. [2019-11-25 08:52:42,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2019-11-25 08:52:42,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 354 transitions. [2019-11-25 08:52:42,045 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 354 transitions. Word has length 98 [2019-11-25 08:52:42,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:52:42,046 INFO L462 AbstractCegarLoop]: Abstraction has 230 states and 354 transitions. [2019-11-25 08:52:42,046 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:52:42,046 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 354 transitions. [2019-11-25 08:52:42,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-25 08:52:42,047 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:52:42,047 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-25 08:52:42,047 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:52:42,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:42,048 INFO L82 PathProgramCache]: Analyzing trace with hash -414265610, now seen corresponding path program 1 times [2019-11-25 08:52:42,048 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:52:42,048 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360787144] [2019-11-25 08:52:42,048 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:52:42,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:42,109 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-25 08:52:42,110 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360787144] [2019-11-25 08:52:42,110 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:52:42,110 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:52:42,110 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844288729] [2019-11-25 08:52:42,111 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:52:42,111 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:52:42,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:52:42,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:52:42,112 INFO L87 Difference]: Start difference. First operand 230 states and 354 transitions. Second operand 4 states. [2019-11-25 08:52:42,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:52:42,551 INFO L93 Difference]: Finished difference Result 490 states and 752 transitions. [2019-11-25 08:52:42,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:52:42,552 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-11-25 08:52:42,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:52:42,554 INFO L225 Difference]: With dead ends: 490 [2019-11-25 08:52:42,554 INFO L226 Difference]: Without dead ends: 279 [2019-11-25 08:52:42,554 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:52:42,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2019-11-25 08:52:42,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 230. [2019-11-25 08:52:42,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2019-11-25 08:52:42,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 353 transitions. [2019-11-25 08:52:42,560 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 353 transitions. Word has length 98 [2019-11-25 08:52:42,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:52:42,561 INFO L462 AbstractCegarLoop]: Abstraction has 230 states and 353 transitions. [2019-11-25 08:52:42,561 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:52:42,561 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 353 transitions. [2019-11-25 08:52:42,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-25 08:52:42,562 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:52:42,562 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-25 08:52:42,563 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:52:42,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:42,563 INFO L82 PathProgramCache]: Analyzing trace with hash -1868796449, now seen corresponding path program 1 times [2019-11-25 08:52:42,563 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:52:42,563 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353114757] [2019-11-25 08:52:42,563 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:52:42,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:42,646 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-25 08:52:42,647 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353114757] [2019-11-25 08:52:42,647 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:52:42,647 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-25 08:52:42,647 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983174188] [2019-11-25 08:52:42,648 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-25 08:52:42,648 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:52:42,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-25 08:52:42,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:52:42,649 INFO L87 Difference]: Start difference. First operand 230 states and 353 transitions. Second operand 5 states. [2019-11-25 08:52:43,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:52:43,149 INFO L93 Difference]: Finished difference Result 462 states and 714 transitions. [2019-11-25 08:52:43,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-25 08:52:43,149 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 98 [2019-11-25 08:52:43,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:52:43,151 INFO L225 Difference]: With dead ends: 462 [2019-11-25 08:52:43,151 INFO L226 Difference]: Without dead ends: 251 [2019-11-25 08:52:43,151 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-25 08:52:43,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2019-11-25 08:52:43,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 250. [2019-11-25 08:52:43,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-11-25 08:52:43,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 379 transitions. [2019-11-25 08:52:43,159 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 379 transitions. Word has length 98 [2019-11-25 08:52:43,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:52:43,159 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 379 transitions. [2019-11-25 08:52:43,159 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-25 08:52:43,160 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 379 transitions. [2019-11-25 08:52:43,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-25 08:52:43,161 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:52:43,161 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-25 08:52:43,161 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:52:43,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:43,162 INFO L82 PathProgramCache]: Analyzing trace with hash -102696520, now seen corresponding path program 1 times [2019-11-25 08:52:43,162 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:52:43,162 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894351161] [2019-11-25 08:52:43,163 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:52:43,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:43,224 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-25 08:52:43,225 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894351161] [2019-11-25 08:52:43,225 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:52:43,225 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:52:43,225 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011153676] [2019-11-25 08:52:43,226 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:52:43,226 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:52:43,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:52:43,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:52:43,226 INFO L87 Difference]: Start difference. First operand 250 states and 379 transitions. Second operand 4 states. [2019-11-25 08:52:43,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:52:43,556 INFO L93 Difference]: Finished difference Result 503 states and 764 transitions. [2019-11-25 08:52:43,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:52:43,557 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-11-25 08:52:43,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:52:43,558 INFO L225 Difference]: With dead ends: 503 [2019-11-25 08:52:43,558 INFO L226 Difference]: Without dead ends: 272 [2019-11-25 08:52:43,559 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:52:43,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2019-11-25 08:52:43,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 250. [2019-11-25 08:52:43,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-11-25 08:52:43,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 378 transitions. [2019-11-25 08:52:43,569 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 378 transitions. Word has length 98 [2019-11-25 08:52:43,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:52:43,569 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 378 transitions. [2019-11-25 08:52:43,569 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:52:43,569 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 378 transitions. [2019-11-25 08:52:43,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-25 08:52:43,570 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:52:43,571 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-25 08:52:43,571 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:52:43,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:43,571 INFO L82 PathProgramCache]: Analyzing trace with hash 846651640, now seen corresponding path program 1 times [2019-11-25 08:52:43,571 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:52:43,572 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782286567] [2019-11-25 08:52:43,572 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:52:43,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:43,622 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-25 08:52:43,622 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782286567] [2019-11-25 08:52:43,622 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:52:43,623 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:52:43,623 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577245888] [2019-11-25 08:52:43,623 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:52:43,623 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:52:43,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:52:43,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:52:43,624 INFO L87 Difference]: Start difference. First operand 250 states and 378 transitions. Second operand 4 states. [2019-11-25 08:52:43,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:52:43,906 INFO L93 Difference]: Finished difference Result 502 states and 761 transitions. [2019-11-25 08:52:43,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:52:43,907 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-11-25 08:52:43,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:52:43,908 INFO L225 Difference]: With dead ends: 502 [2019-11-25 08:52:43,909 INFO L226 Difference]: Without dead ends: 271 [2019-11-25 08:52:43,909 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:52:43,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2019-11-25 08:52:43,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 250. [2019-11-25 08:52:43,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-11-25 08:52:43,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 377 transitions. [2019-11-25 08:52:43,916 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 377 transitions. Word has length 98 [2019-11-25 08:52:43,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:52:43,916 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 377 transitions. [2019-11-25 08:52:43,916 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:52:43,916 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 377 transitions. [2019-11-25 08:52:43,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-25 08:52:43,917 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:52:43,918 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-25 08:52:43,918 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:52:43,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:43,918 INFO L82 PathProgramCache]: Analyzing trace with hash 651492985, now seen corresponding path program 1 times [2019-11-25 08:52:43,918 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:52:43,918 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042741127] [2019-11-25 08:52:43,918 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:52:43,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:43,970 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-25 08:52:43,970 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042741127] [2019-11-25 08:52:43,970 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:52:43,970 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:52:43,971 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353002297] [2019-11-25 08:52:43,971 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:52:43,971 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:52:43,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:52:43,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:52:43,972 INFO L87 Difference]: Start difference. First operand 250 states and 377 transitions. Second operand 4 states. [2019-11-25 08:52:44,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:52:44,447 INFO L93 Difference]: Finished difference Result 530 states and 797 transitions. [2019-11-25 08:52:44,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:52:44,448 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 99 [2019-11-25 08:52:44,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:52:44,450 INFO L225 Difference]: With dead ends: 530 [2019-11-25 08:52:44,450 INFO L226 Difference]: Without dead ends: 299 [2019-11-25 08:52:44,451 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:52:44,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2019-11-25 08:52:44,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 250. [2019-11-25 08:52:44,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-11-25 08:52:44,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 376 transitions. [2019-11-25 08:52:44,463 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 376 transitions. Word has length 99 [2019-11-25 08:52:44,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:52:44,463 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 376 transitions. [2019-11-25 08:52:44,463 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:52:44,464 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 376 transitions. [2019-11-25 08:52:44,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-25 08:52:44,465 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:52:44,465 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-25 08:52:44,465 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:52:44,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:44,465 INFO L82 PathProgramCache]: Analyzing trace with hash 1085222071, now seen corresponding path program 1 times [2019-11-25 08:52:44,466 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:52:44,466 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438580880] [2019-11-25 08:52:44,466 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:52:44,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:44,525 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-25 08:52:44,526 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438580880] [2019-11-25 08:52:44,526 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:52:44,526 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:52:44,526 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583360756] [2019-11-25 08:52:44,527 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:52:44,527 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:52:44,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:52:44,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:52:44,527 INFO L87 Difference]: Start difference. First operand 250 states and 376 transitions. Second operand 4 states. [2019-11-25 08:52:44,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:52:44,818 INFO L93 Difference]: Finished difference Result 502 states and 757 transitions. [2019-11-25 08:52:44,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:52:44,818 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 99 [2019-11-25 08:52:44,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:52:44,820 INFO L225 Difference]: With dead ends: 502 [2019-11-25 08:52:44,820 INFO L226 Difference]: Without dead ends: 271 [2019-11-25 08:52:44,820 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:52:44,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2019-11-25 08:52:44,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 250. [2019-11-25 08:52:44,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-11-25 08:52:44,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 375 transitions. [2019-11-25 08:52:44,828 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 375 transitions. Word has length 99 [2019-11-25 08:52:44,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:52:44,828 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 375 transitions. [2019-11-25 08:52:44,828 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:52:44,828 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 375 transitions. [2019-11-25 08:52:44,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-11-25 08:52:44,829 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:52:44,830 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-25 08:52:44,830 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:52:44,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:44,830 INFO L82 PathProgramCache]: Analyzing trace with hash 199692210, now seen corresponding path program 1 times [2019-11-25 08:52:44,830 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:52:44,831 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163685638] [2019-11-25 08:52:44,831 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:52:44,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:44,879 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-25 08:52:44,879 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163685638] [2019-11-25 08:52:44,880 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:52:44,880 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:52:44,880 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517028153] [2019-11-25 08:52:44,880 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:52:44,880 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:52:44,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:52:44,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:52:44,881 INFO L87 Difference]: Start difference. First operand 250 states and 375 transitions. Second operand 4 states. [2019-11-25 08:52:45,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:52:45,310 INFO L93 Difference]: Finished difference Result 530 states and 793 transitions. [2019-11-25 08:52:45,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:52:45,311 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2019-11-25 08:52:45,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:52:45,313 INFO L225 Difference]: With dead ends: 530 [2019-11-25 08:52:45,313 INFO L226 Difference]: Without dead ends: 299 [2019-11-25 08:52:45,313 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:52:45,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2019-11-25 08:52:45,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 250. [2019-11-25 08:52:45,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-11-25 08:52:45,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 374 transitions. [2019-11-25 08:52:45,322 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 374 transitions. Word has length 100 [2019-11-25 08:52:45,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:52:45,322 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 374 transitions. [2019-11-25 08:52:45,322 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:52:45,322 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 374 transitions. [2019-11-25 08:52:45,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-11-25 08:52:45,323 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:52:45,324 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-25 08:52:45,324 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:52:45,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:45,325 INFO L82 PathProgramCache]: Analyzing trace with hash 760391988, now seen corresponding path program 1 times [2019-11-25 08:52:45,325 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:52:45,325 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689529813] [2019-11-25 08:52:45,325 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:52:45,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:45,377 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-25 08:52:45,377 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689529813] [2019-11-25 08:52:45,377 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:52:45,378 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:52:45,378 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870201364] [2019-11-25 08:52:45,378 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:52:45,378 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:52:45,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:52:45,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:52:45,379 INFO L87 Difference]: Start difference. First operand 250 states and 374 transitions. Second operand 4 states. [2019-11-25 08:52:45,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:52:45,698 INFO L93 Difference]: Finished difference Result 502 states and 753 transitions. [2019-11-25 08:52:45,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:52:45,698 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2019-11-25 08:52:45,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:52:45,700 INFO L225 Difference]: With dead ends: 502 [2019-11-25 08:52:45,700 INFO L226 Difference]: Without dead ends: 271 [2019-11-25 08:52:45,701 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:52:45,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2019-11-25 08:52:45,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 250. [2019-11-25 08:52:45,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-11-25 08:52:45,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 373 transitions. [2019-11-25 08:52:45,710 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 373 transitions. Word has length 100 [2019-11-25 08:52:45,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:52:45,710 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 373 transitions. [2019-11-25 08:52:45,710 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:52:45,710 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 373 transitions. [2019-11-25 08:52:45,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-11-25 08:52:45,712 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:52:45,712 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-25 08:52:45,712 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:52:45,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:45,712 INFO L82 PathProgramCache]: Analyzing trace with hash -2123930572, now seen corresponding path program 1 times [2019-11-25 08:52:45,713 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:52:45,713 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322085086] [2019-11-25 08:52:45,713 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:52:45,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:45,762 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-25 08:52:45,762 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322085086] [2019-11-25 08:52:45,762 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:52:45,763 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:52:45,763 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411197332] [2019-11-25 08:52:45,763 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:52:45,763 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:52:45,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:52:45,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:52:45,764 INFO L87 Difference]: Start difference. First operand 250 states and 373 transitions. Second operand 4 states. [2019-11-25 08:52:46,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:52:46,198 INFO L93 Difference]: Finished difference Result 530 states and 789 transitions. [2019-11-25 08:52:46,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:52:46,198 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2019-11-25 08:52:46,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:52:46,200 INFO L225 Difference]: With dead ends: 530 [2019-11-25 08:52:46,200 INFO L226 Difference]: Without dead ends: 299 [2019-11-25 08:52:46,201 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:52:46,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2019-11-25 08:52:46,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 250. [2019-11-25 08:52:46,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-11-25 08:52:46,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 372 transitions. [2019-11-25 08:52:46,210 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 372 transitions. Word has length 101 [2019-11-25 08:52:46,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:52:46,210 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 372 transitions. [2019-11-25 08:52:46,211 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:52:46,211 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 372 transitions. [2019-11-25 08:52:46,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-11-25 08:52:46,212 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:52:46,212 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-25 08:52:46,212 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:52:46,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:46,213 INFO L82 PathProgramCache]: Analyzing trace with hash -1922106638, now seen corresponding path program 1 times [2019-11-25 08:52:46,213 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:52:46,213 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710947160] [2019-11-25 08:52:46,213 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:52:46,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:46,262 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-25 08:52:46,262 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710947160] [2019-11-25 08:52:46,262 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:52:46,263 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:52:46,263 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390910119] [2019-11-25 08:52:46,263 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:52:46,263 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:52:46,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:52:46,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:52:46,264 INFO L87 Difference]: Start difference. First operand 250 states and 372 transitions. Second operand 4 states. [2019-11-25 08:52:46,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:52:46,563 INFO L93 Difference]: Finished difference Result 502 states and 749 transitions. [2019-11-25 08:52:46,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:52:46,564 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2019-11-25 08:52:46,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:52:46,566 INFO L225 Difference]: With dead ends: 502 [2019-11-25 08:52:46,566 INFO L226 Difference]: Without dead ends: 271 [2019-11-25 08:52:46,567 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:52:46,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2019-11-25 08:52:46,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 250. [2019-11-25 08:52:46,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-11-25 08:52:46,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 371 transitions. [2019-11-25 08:52:46,576 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 371 transitions. Word has length 101 [2019-11-25 08:52:46,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:52:46,576 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 371 transitions. [2019-11-25 08:52:46,576 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:52:46,577 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 371 transitions. [2019-11-25 08:52:46,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-11-25 08:52:46,578 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:52:46,578 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-25 08:52:46,579 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:52:46,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:46,579 INFO L82 PathProgramCache]: Analyzing trace with hash 1950473869, now seen corresponding path program 1 times [2019-11-25 08:52:46,579 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:52:46,579 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206252455] [2019-11-25 08:52:46,580 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:52:46,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:46,634 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-25 08:52:46,635 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206252455] [2019-11-25 08:52:46,635 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:52:46,635 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:52:46,635 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351368652] [2019-11-25 08:52:46,636 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:52:46,636 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:52:46,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:52:46,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:52:46,637 INFO L87 Difference]: Start difference. First operand 250 states and 371 transitions. Second operand 4 states. [2019-11-25 08:52:47,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:52:47,056 INFO L93 Difference]: Finished difference Result 520 states and 773 transitions. [2019-11-25 08:52:47,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:52:47,057 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-11-25 08:52:47,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:52:47,058 INFO L225 Difference]: With dead ends: 520 [2019-11-25 08:52:47,058 INFO L226 Difference]: Without dead ends: 289 [2019-11-25 08:52:47,059 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:52:47,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2019-11-25 08:52:47,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 250. [2019-11-25 08:52:47,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-11-25 08:52:47,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 370 transitions. [2019-11-25 08:52:47,067 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 370 transitions. Word has length 102 [2019-11-25 08:52:47,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:52:47,067 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 370 transitions. [2019-11-25 08:52:47,068 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:52:47,068 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 370 transitions. [2019-11-25 08:52:47,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-11-25 08:52:47,069 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:52:47,069 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-25 08:52:47,069 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:52:47,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:47,070 INFO L82 PathProgramCache]: Analyzing trace with hash -382918769, now seen corresponding path program 1 times [2019-11-25 08:52:47,070 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:52:47,070 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934704692] [2019-11-25 08:52:47,070 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:52:47,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:47,140 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-25 08:52:47,140 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934704692] [2019-11-25 08:52:47,140 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:52:47,141 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:52:47,141 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86958450] [2019-11-25 08:52:47,141 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:52:47,141 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:52:47,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:52:47,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:52:47,142 INFO L87 Difference]: Start difference. First operand 250 states and 370 transitions. Second operand 4 states. [2019-11-25 08:52:47,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:52:47,432 INFO L93 Difference]: Finished difference Result 492 states and 733 transitions. [2019-11-25 08:52:47,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:52:47,433 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-11-25 08:52:47,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:52:47,434 INFO L225 Difference]: With dead ends: 492 [2019-11-25 08:52:47,435 INFO L226 Difference]: Without dead ends: 261 [2019-11-25 08:52:47,435 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:52:47,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2019-11-25 08:52:47,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 250. [2019-11-25 08:52:47,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-11-25 08:52:47,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 369 transitions. [2019-11-25 08:52:47,442 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 369 transitions. Word has length 102 [2019-11-25 08:52:47,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:52:47,443 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 369 transitions. [2019-11-25 08:52:47,443 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:52:47,443 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 369 transitions. [2019-11-25 08:52:47,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-11-25 08:52:47,444 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:52:47,444 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-25 08:52:47,445 INFO L410 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:52:47,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:47,445 INFO L82 PathProgramCache]: Analyzing trace with hash -2022470311, now seen corresponding path program 1 times [2019-11-25 08:52:47,445 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:52:47,445 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561834094] [2019-11-25 08:52:47,446 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:52:47,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:47,506 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-25 08:52:47,506 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561834094] [2019-11-25 08:52:47,506 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:52:47,506 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:52:47,507 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74035400] [2019-11-25 08:52:47,508 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:52:47,508 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:52:47,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:52:47,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:52:47,508 INFO L87 Difference]: Start difference. First operand 250 states and 369 transitions. Second operand 4 states. [2019-11-25 08:52:47,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:52:47,843 INFO L93 Difference]: Finished difference Result 520 states and 769 transitions. [2019-11-25 08:52:47,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:52:47,844 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2019-11-25 08:52:47,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:52:47,845 INFO L225 Difference]: With dead ends: 520 [2019-11-25 08:52:47,845 INFO L226 Difference]: Without dead ends: 289 [2019-11-25 08:52:47,846 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:52:47,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2019-11-25 08:52:47,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 250. [2019-11-25 08:52:47,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-11-25 08:52:47,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 368 transitions. [2019-11-25 08:52:47,853 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 368 transitions. Word has length 106 [2019-11-25 08:52:47,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:52:47,854 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 368 transitions. [2019-11-25 08:52:47,854 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:52:47,854 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 368 transitions. [2019-11-25 08:52:47,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-11-25 08:52:47,855 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:52:47,855 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-25 08:52:47,855 INFO L410 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:52:47,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:47,855 INFO L82 PathProgramCache]: Analyzing trace with hash 586317147, now seen corresponding path program 1 times [2019-11-25 08:52:47,855 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:52:47,855 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537901998] [2019-11-25 08:52:47,855 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:52:47,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:47,912 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-25 08:52:47,912 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537901998] [2019-11-25 08:52:47,912 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:52:47,913 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:52:47,913 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474457208] [2019-11-25 08:52:47,913 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:52:47,913 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:52:47,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:52:47,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:52:47,914 INFO L87 Difference]: Start difference. First operand 250 states and 368 transitions. Second operand 3 states. [2019-11-25 08:52:47,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:52:47,945 INFO L93 Difference]: Finished difference Result 710 states and 1059 transitions. [2019-11-25 08:52:47,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:52:47,946 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2019-11-25 08:52:47,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:52:47,948 INFO L225 Difference]: With dead ends: 710 [2019-11-25 08:52:47,948 INFO L226 Difference]: Without dead ends: 479 [2019-11-25 08:52:47,949 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:52:47,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2019-11-25 08:52:47,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 479. [2019-11-25 08:52:47,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 479 states. [2019-11-25 08:52:47,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 711 transitions. [2019-11-25 08:52:47,962 INFO L78 Accepts]: Start accepts. Automaton has 479 states and 711 transitions. Word has length 106 [2019-11-25 08:52:47,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:52:47,962 INFO L462 AbstractCegarLoop]: Abstraction has 479 states and 711 transitions. [2019-11-25 08:52:47,962 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:52:47,963 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 711 transitions. [2019-11-25 08:52:47,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-11-25 08:52:47,964 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:52:47,964 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-25 08:52:47,964 INFO L410 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:52:47,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:47,965 INFO L82 PathProgramCache]: Analyzing trace with hash -536013004, now seen corresponding path program 1 times [2019-11-25 08:52:47,965 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:52:47,965 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610244233] [2019-11-25 08:52:47,965 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:52:48,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:52:48,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:52:48,247 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:52:48,247 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-25 08:52:48,368 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 08:52:48 BoogieIcfgContainer [2019-11-25 08:52:48,368 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-25 08:52:48,368 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-25 08:52:48,369 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-25 08:52:48,369 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-25 08:52:48,369 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:52:31" (3/4) ... [2019-11-25 08:52:48,372 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-25 08:52:48,372 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-25 08:52:48,374 INFO L168 Benchmark]: Toolchain (without parser) took 19062.89 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 413.1 MB). Free memory was 946.1 MB in the beginning and 1.1 GB in the end (delta: -184.0 MB). Peak memory consumption was 229.1 MB. Max. memory is 11.5 GB. [2019-11-25 08:52:48,374 INFO L168 Benchmark]: CDTParser took 0.66 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 08:52:48,375 INFO L168 Benchmark]: CACSL2BoogieTranslator took 739.67 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 155.7 MB). Free memory was 946.1 MB in the beginning and 1.1 GB in the end (delta: -178.5 MB). Peak memory consumption was 23.6 MB. Max. memory is 11.5 GB. [2019-11-25 08:52:48,375 INFO L168 Benchmark]: Boogie Procedure Inliner took 71.82 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 08:52:48,376 INFO L168 Benchmark]: Boogie Preprocessor took 83.97 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: 13.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. [2019-11-25 08:52:48,376 INFO L168 Benchmark]: RCFGBuilder took 1235.50 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: 89.8 MB). Peak memory consumption was 89.8 MB. Max. memory is 11.5 GB. [2019-11-25 08:52:48,376 INFO L168 Benchmark]: TraceAbstraction took 16923.53 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 257.4 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -109.0 MB). Peak memory consumption was 148.4 MB. Max. memory is 11.5 GB. [2019-11-25 08:52:48,377 INFO L168 Benchmark]: Witness Printer took 4.05 ms. Allocated memory is still 1.4 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 08:52:48,379 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.66 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 739.67 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 155.7 MB). Free memory was 946.1 MB in the beginning and 1.1 GB in the end (delta: -178.5 MB). Peak memory consumption was 23.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 71.82 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 83.97 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: 13.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1235.50 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: 89.8 MB). Peak memory consumption was 89.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 16923.53 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 257.4 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -109.0 MB). Peak memory consumption was 148.4 MB. Max. memory is 11.5 GB. * Witness Printer took 4.05 ms. Allocated memory is still 1.4 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 1703]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of bitwiseAnd at line 1121. Possible FailurePath: [L1042] static int init = 1; [L1043] static SSL_METHOD SSLv3_server_data ; VAL [init=1, SSLv3_server_data={9:0}] [L1065] SSL *s ; [L1066] int tmp ; [L1070] s = malloc(sizeof(SSL)) [L1071] s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1072] s->ctx = malloc(sizeof(SSL_CTX)) [L1073] s->session = malloc(sizeof(SSL_SESSION)) [L1074] s->state = 8464 [L1081] BUF_MEM *buf ; [L1082] unsigned long l ; [L1083] unsigned long Time ; [L1084] unsigned long tmp ; [L1085] void (*cb)() ; [L1086] long num1 ; [L1087] int ret ; [L1088] int new_state ; [L1089] int state ; [L1090] int skip ; [L1091] int got_new_session ; [L1092] int tmp___1 = __VERIFIER_nondet_int() ; [L1093] int tmp___2 = __VERIFIER_nondet_int() ; [L1094] int tmp___3 = __VERIFIER_nondet_int() ; [L1095] int tmp___4 = __VERIFIER_nondet_int() ; [L1096] int tmp___5 = __VERIFIER_nondet_int() ; [L1097] int tmp___6 = __VERIFIER_nondet_int() ; [L1098] int tmp___7 ; [L1099] long tmp___8 = __VERIFIER_nondet_long() ; [L1100] int tmp___9 = __VERIFIER_nondet_int() ; [L1101] int tmp___10 = __VERIFIER_nondet_int() ; [L1102] int blastFlag ; [L1106] blastFlag = 0 [L1107] s->hit=__VERIFIER_nondet_int () [L1108] s->state = 8464 [L1109] tmp = __VERIFIER_nondet_int() [L1110] Time = tmp [L1111] cb = (void (*)())((void *)0) [L1112] ret = -1 [L1113] skip = 0 [L1114] got_new_session = 0 [L1115] EXPR s->info_callback VAL [init=1, SSLv3_server_data={9:0}] [L1115] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1116] EXPR s->info_callback [L1116] cb = s->info_callback [L1120] EXPR s->in_handshake [L1120] s->in_handshake += 1 [L1121] COND FALSE !(tmp___1 & 12288) VAL [init=1, SSLv3_server_data={9:0}] [L1130] EXPR s->cert VAL [init=1, SSLv3_server_data={9:0}] [L1130] COND FALSE !((unsigned long )s->cert == (unsigned long )((void *)0)) [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={9:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1163] COND TRUE s->state == 8464 [L1323] s->shutdown = 0 [L1324] ret = __VERIFIER_nondet_int() [L1325] COND TRUE blastFlag == 0 [L1326] blastFlag = 1 VAL [init=1, SSLv3_server_data={9:0}] [L1330] COND FALSE !(ret <= 0) [L1335] got_new_session = 1 [L1336] s->state = 8496 [L1337] s->init_num = 0 VAL [init=1, SSLv3_server_data={9:0}] [L1662] EXPR s->s3 [L1662] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={9:0}] [L1662] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1691] skip = 0 VAL [init=1, SSLv3_server_data={9:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={9:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1172] COND TRUE s->state == 8496 [L1341] ret = __VERIFIER_nondet_int() [L1342] COND TRUE blastFlag == 1 [L1343] blastFlag = 2 VAL [init=1, SSLv3_server_data={9:0}] [L1347] COND FALSE !(ret <= 0) [L1352] s->hit VAL [init=1, SSLv3_server_data={9:0}] [L1352] COND TRUE s->hit [L1353] s->state = 8656 VAL [init=1, SSLv3_server_data={9:0}] [L1357] s->init_num = 0 VAL [init=1, SSLv3_server_data={9:0}] [L1662] EXPR s->s3 [L1662] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={9:0}] [L1662] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1691] skip = 0 VAL [init=1, SSLv3_server_data={9:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={9:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1202] COND FALSE !(s->state == 8448) [L1205] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1205] COND FALSE !(s->state == 8576) [L1208] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1208] COND FALSE !(s->state == 8577) [L1211] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1211] COND FALSE !(s->state == 8592) [L1214] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1214] COND FALSE !(s->state == 8593) [L1217] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1217] COND FALSE !(s->state == 8608) [L1220] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1220] COND FALSE !(s->state == 8609) [L1223] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1223] COND FALSE !(s->state == 8640) [L1226] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1226] COND FALSE !(s->state == 8641) [L1229] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1229] COND TRUE s->state == 8656 [L1555] EXPR s->session [L1555] EXPR s->s3 [L1555] EXPR (s->s3)->tmp.new_cipher [L1555] (s->session)->cipher = (s->s3)->tmp.new_cipher [L1556] COND FALSE !(! tmp___9) [L1562] ret = __VERIFIER_nondet_int() [L1563] COND TRUE blastFlag == 2 [L1564] blastFlag = 3 VAL [init=1, SSLv3_server_data={9:0}] [L1568] COND FALSE !(ret <= 0) [L1573] s->state = 8672 [L1574] s->init_num = 0 VAL [init=1, SSLv3_server_data={9:0}] [L1575] COND FALSE !(! tmp___10) VAL [init=1, SSLv3_server_data={9:0}] [L1662] EXPR s->s3 [L1662] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={9:0}] [L1662] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1691] skip = 0 VAL [init=1, SSLv3_server_data={9:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={9:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1202] COND FALSE !(s->state == 8448) [L1205] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1205] COND FALSE !(s->state == 8576) [L1208] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1208] COND FALSE !(s->state == 8577) [L1211] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1211] COND FALSE !(s->state == 8592) [L1214] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1214] COND FALSE !(s->state == 8593) [L1217] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1217] COND FALSE !(s->state == 8608) [L1220] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1220] COND FALSE !(s->state == 8609) [L1223] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1223] COND FALSE !(s->state == 8640) [L1226] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1226] COND FALSE !(s->state == 8641) [L1229] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1229] COND FALSE !(s->state == 8656) [L1232] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1232] COND FALSE !(s->state == 8657) [L1235] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1235] COND TRUE s->state == 8672 [L1584] ret = __VERIFIER_nondet_int() [L1585] COND TRUE blastFlag == 3 VAL [init=1, SSLv3_server_data={9:0}] [L1703] __VERIFIER_error() VAL [init=1, SSLv3_server_data={9:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 143 locations, 1 error locations. Result: UNSAFE, OverallTime: 16.8s, OverallIterations: 39, TraceHistogramMax: 4, AutomataDifference: 13.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 7073 SDtfs, 2105 SDslu, 10601 SDs, 0 SdLazy, 6863 SolverSat, 339 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 10.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 219 GetRequests, 76 SyntacticMatches, 29 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=479occurred in iteration=38, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 38 MinimizatonAttempts, 924 StatesRemovedByMinimization, 37 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 3288 NumberOfCodeBlocks, 3288 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 3125 ConstructedInterpolants, 0 QuantifiedInterpolants, 733119 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 38 InterpolantComputations, 38 PerfectInterpolantSequences, 1564/1564 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.24-6b5699a [2019-11-25 08:52:50,156 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-25 08:52:50,158 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-25 08:52:50,169 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-25 08:52:50,169 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-25 08:52:50,170 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-25 08:52:50,172 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-25 08:52:50,174 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-25 08:52:50,176 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-25 08:52:50,177 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-25 08:52:50,177 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-25 08:52:50,179 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-25 08:52:50,179 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-25 08:52:50,180 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-25 08:52:50,181 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-25 08:52:50,182 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-25 08:52:50,183 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-25 08:52:50,184 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-25 08:52:50,185 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-25 08:52:50,187 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-25 08:52:50,189 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-25 08:52:50,190 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-25 08:52:50,191 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-25 08:52:50,192 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-25 08:52:50,194 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-25 08:52:50,194 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-25 08:52:50,195 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-25 08:52:50,196 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-25 08:52:50,196 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-25 08:52:50,197 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-25 08:52:50,197 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-25 08:52:50,198 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-25 08:52:50,198 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-25 08:52:50,199 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-25 08:52:50,200 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-25 08:52:50,200 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-25 08:52:50,201 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-25 08:52:50,201 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-25 08:52:50,201 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-25 08:52:50,202 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-25 08:52:50,203 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-25 08:52:50,203 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_4bc5bd24-d1cf-4158-a58b-64f57e1b7a3e/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-11-25 08:52:50,217 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-25 08:52:50,217 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-25 08:52:50,218 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-25 08:52:50,219 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-25 08:52:50,219 INFO L138 SettingsManager]: * Use SBE=true [2019-11-25 08:52:50,219 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-25 08:52:50,219 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-25 08:52:50,220 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-25 08:52:50,220 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-25 08:52:50,220 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-25 08:52:50,220 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-25 08:52:50,221 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-25 08:52:50,221 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-25 08:52:50,221 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-25 08:52:50,221 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-25 08:52:50,222 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-25 08:52:50,222 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-25 08:52:50,222 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-25 08:52:50,222 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-25 08:52:50,223 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-25 08:52:50,223 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-25 08:52:50,223 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-25 08:52:50,223 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-25 08:52:50,224 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-25 08:52:50,224 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-25 08:52:50,224 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-25 08:52:50,224 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-25 08:52:50,225 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-25 08:52:50,225 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-25 08:52:50,225 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-25 08:52:50,225 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-25 08:52:50,226 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_4bc5bd24-d1cf-4158-a58b-64f57e1b7a3e/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 09d651c8899349531493fefbd169797d0022b4a3 [2019-11-25 08:52:50,486 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-25 08:52:50,496 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-25 08:52:50,499 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-25 08:52:50,501 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-25 08:52:50,501 INFO L275 PluginConnector]: CDTParser initialized [2019-11-25 08:52:50,502 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_4bc5bd24-d1cf-4158-a58b-64f57e1b7a3e/bin/uautomizer/../../sv-benchmarks/c/ssh/s3_srvr.blast.03.i.cil.c [2019-11-25 08:52:50,550 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_4bc5bd24-d1cf-4158-a58b-64f57e1b7a3e/bin/uautomizer/data/046618135/ad1ddbf0755c4ba7a24cd26481f180f9/FLAG07da4b2a8 [2019-11-25 08:52:51,108 INFO L306 CDTParser]: Found 1 translation units. [2019-11-25 08:52:51,112 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_4bc5bd24-d1cf-4158-a58b-64f57e1b7a3e/sv-benchmarks/c/ssh/s3_srvr.blast.03.i.cil.c [2019-11-25 08:52:51,141 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_4bc5bd24-d1cf-4158-a58b-64f57e1b7a3e/bin/uautomizer/data/046618135/ad1ddbf0755c4ba7a24cd26481f180f9/FLAG07da4b2a8 [2019-11-25 08:52:51,570 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_4bc5bd24-d1cf-4158-a58b-64f57e1b7a3e/bin/uautomizer/data/046618135/ad1ddbf0755c4ba7a24cd26481f180f9 [2019-11-25 08:52:51,573 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-25 08:52:51,574 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-25 08:52:51,575 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-25 08:52:51,575 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-25 08:52:51,578 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-25 08:52:51,579 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:52:51" (1/1) ... [2019-11-25 08:52:51,581 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e8fc8d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:52:51, skipping insertion in model container [2019-11-25 08:52:51,582 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:52:51" (1/1) ... [2019-11-25 08:52:51,588 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-25 08:52:51,640 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-25 08:52:52,022 INFO L965 CHandler]: Found a cast between two array/pointer types where the value type is smaller than the cast-to type, and where that value type is smaller than our current memory model resolution [2019-11-25 08:52:52,023 INFO L968 CHandler]: at location: C: (SSL_METHOD *)((void *)0) [1038] [2019-11-25 08:52:52,023 INFO L969 CHandler]: current memory model: HoenickeLindenmann_4ByteResolution [2019-11-25 08:52:52,048 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator has thrown an exception: java.lang.UnsupportedOperationException: Unsupported type(() : VOID) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.TypeSizeAndOffsetComputer.computeSize(TypeSizeAndOffsetComputer.java:205) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.TypeSizeAndOffsetComputer.constructBytesizeExpression(TypeSizeAndOffsetComputer.java:121) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:955) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:279) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:700) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:282) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1300) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:220) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:993) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:232) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:993) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:232) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.FunctionHandler.handleFunctionDefinition(FunctionHandler.java:372) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1371) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:155) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.processTUchild(CHandler.java:3448) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:2263) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:573) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:134) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.translate(MainTranslator.java:193) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.run(MainTranslator.java:115) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.(MainTranslator.java:93) at de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver.finish(CACSL2BoogieTranslatorObserver.java:125) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-11-25 08:52:52,059 INFO L168 Benchmark]: Toolchain (without parser) took 484.26 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 161.5 MB). Free memory was 951.0 MB in the beginning and 1.2 GB in the end (delta: -199.1 MB). Peak memory consumption was 28.4 MB. Max. memory is 11.5 GB. [2019-11-25 08:52:52,060 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 08:52:52,061 INFO L168 Benchmark]: CACSL2BoogieTranslator took 482.09 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 161.5 MB). Free memory was 951.0 MB in the beginning and 1.2 GB in the end (delta: -199.1 MB). Peak memory consumption was 28.4 MB. Max. memory is 11.5 GB. [2019-11-25 08:52:52,062 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 482.09 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 161.5 MB). Free memory was 951.0 MB in the beginning and 1.2 GB in the end (delta: -199.1 MB). Peak memory consumption was 28.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - ExceptionOrErrorResult: UnsupportedOperationException: Unsupported type(() : VOID) de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: UnsupportedOperationException: Unsupported type(() : VOID): de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.TypeSizeAndOffsetComputer.computeSize(TypeSizeAndOffsetComputer.java:205) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...