./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ssh/s3_srvr.blast.11.i.cil-1.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_87130acf-f6be-404f-89bd-c26b22a5f005/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_87130acf-f6be-404f-89bd-c26b22a5f005/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_87130acf-f6be-404f-89bd-c26b22a5f005/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_87130acf-f6be-404f-89bd-c26b22a5f005/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh/s3_srvr.blast.11.i.cil-1.c -s /tmp/vcloud-vcloud-master/worker/run_dir_87130acf-f6be-404f-89bd-c26b22a5f005/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_87130acf-f6be-404f-89bd-c26b22a5f005/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 ca7b987059c829f244238d9119096032ac44debc .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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_87130acf-f6be-404f-89bd-c26b22a5f005/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_87130acf-f6be-404f-89bd-c26b22a5f005/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_87130acf-f6be-404f-89bd-c26b22a5f005/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_87130acf-f6be-404f-89bd-c26b22a5f005/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh/s3_srvr.blast.11.i.cil-1.c -s /tmp/vcloud-vcloud-master/worker/run_dir_87130acf-f6be-404f-89bd-c26b22a5f005/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_87130acf-f6be-404f-89bd-c26b22a5f005/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 ca7b987059c829f244238d9119096032ac44debc .............................................................................................................................................................. 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:20,211 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-25 08:52:20,213 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-25 08:52:20,225 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-25 08:52:20,226 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-25 08:52:20,226 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-25 08:52:20,228 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-25 08:52:20,230 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-25 08:52:20,232 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-25 08:52:20,233 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-25 08:52:20,234 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-25 08:52:20,235 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-25 08:52:20,236 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-25 08:52:20,237 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-25 08:52:20,238 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-25 08:52:20,242 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-25 08:52:20,243 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-25 08:52:20,247 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-25 08:52:20,255 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-25 08:52:20,259 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-25 08:52:20,260 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-25 08:52:20,262 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-25 08:52:20,263 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-25 08:52:20,263 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-25 08:52:20,266 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-25 08:52:20,266 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-25 08:52:20,266 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-25 08:52:20,267 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-25 08:52:20,267 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-25 08:52:20,268 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-25 08:52:20,268 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-25 08:52:20,269 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-25 08:52:20,269 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-25 08:52:20,270 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-25 08:52:20,271 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-25 08:52:20,271 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-25 08:52:20,272 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-25 08:52:20,272 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-25 08:52:20,272 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-25 08:52:20,273 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-25 08:52:20,273 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-25 08:52:20,274 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_87130acf-f6be-404f-89bd-c26b22a5f005/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-25 08:52:20,285 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-25 08:52:20,286 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-25 08:52:20,287 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-25 08:52:20,287 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-25 08:52:20,287 INFO L138 SettingsManager]: * Use SBE=true [2019-11-25 08:52:20,287 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-25 08:52:20,288 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-25 08:52:20,288 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-25 08:52:20,288 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-25 08:52:20,288 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-25 08:52:20,288 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-25 08:52:20,288 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-25 08:52:20,289 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-25 08:52:20,289 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-25 08:52:20,289 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-25 08:52:20,289 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-25 08:52:20,289 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-25 08:52:20,289 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-25 08:52:20,290 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-25 08:52:20,290 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-25 08:52:20,290 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-25 08:52:20,290 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-25 08:52:20,290 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-25 08:52:20,291 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-25 08:52:20,291 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-25 08:52:20,291 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-25 08:52:20,291 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-25 08:52:20,291 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-25 08:52:20,291 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_87130acf-f6be-404f-89bd-c26b22a5f005/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 -> ca7b987059c829f244238d9119096032ac44debc [2019-11-25 08:52:20,460 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-25 08:52:20,477 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-25 08:52:20,480 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-25 08:52:20,482 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-25 08:52:20,482 INFO L275 PluginConnector]: CDTParser initialized [2019-11-25 08:52:20,483 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_87130acf-f6be-404f-89bd-c26b22a5f005/bin/uautomizer/../../sv-benchmarks/c/ssh/s3_srvr.blast.11.i.cil-1.c [2019-11-25 08:52:20,540 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_87130acf-f6be-404f-89bd-c26b22a5f005/bin/uautomizer/data/85e50a0b2/1b2317c7156644efbd21fa6b2e9c58c8/FLAG93ca58a10 [2019-11-25 08:52:21,078 INFO L306 CDTParser]: Found 1 translation units. [2019-11-25 08:52:21,079 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_87130acf-f6be-404f-89bd-c26b22a5f005/sv-benchmarks/c/ssh/s3_srvr.blast.11.i.cil-1.c [2019-11-25 08:52:21,097 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_87130acf-f6be-404f-89bd-c26b22a5f005/bin/uautomizer/data/85e50a0b2/1b2317c7156644efbd21fa6b2e9c58c8/FLAG93ca58a10 [2019-11-25 08:52:21,551 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_87130acf-f6be-404f-89bd-c26b22a5f005/bin/uautomizer/data/85e50a0b2/1b2317c7156644efbd21fa6b2e9c58c8 [2019-11-25 08:52:21,554 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-25 08:52:21,555 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-25 08:52:21,556 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-25 08:52:21,556 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-25 08:52:21,559 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-25 08:52:21,564 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:52:21" (1/1) ... [2019-11-25 08:52:21,566 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b873474 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:52:21, skipping insertion in model container [2019-11-25 08:52:21,566 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:52:21" (1/1) ... [2019-11-25 08:52:21,572 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-25 08:52:21,646 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-25 08:52:22,141 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 08:52:22,159 INFO L201 MainTranslator]: Completed pre-run [2019-11-25 08:52:22,290 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 08:52:22,318 INFO L205 MainTranslator]: Completed translation [2019-11-25 08:52:22,319 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:52:22 WrapperNode [2019-11-25 08:52:22,319 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-25 08:52:22,320 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-25 08:52:22,320 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-25 08:52:22,320 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-25 08:52:22,328 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:22" (1/1) ... [2019-11-25 08:52:22,364 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:22" (1/1) ... [2019-11-25 08:52:22,421 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-25 08:52:22,422 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-25 08:52:22,422 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-25 08:52:22,422 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-25 08:52:22,437 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:22" (1/1) ... [2019-11-25 08:52:22,437 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:22" (1/1) ... [2019-11-25 08:52:22,455 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:22" (1/1) ... [2019-11-25 08:52:22,456 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:22" (1/1) ... [2019-11-25 08:52:22,508 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:22" (1/1) ... [2019-11-25 08:52:22,515 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:22" (1/1) ... [2019-11-25 08:52:22,524 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:22" (1/1) ... [2019-11-25 08:52:22,536 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-25 08:52:22,536 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-25 08:52:22,536 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-25 08:52:22,537 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-25 08:52:22,537 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:52:22" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_87130acf-f6be-404f-89bd-c26b22a5f005/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:22,608 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-25 08:52:22,609 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-25 08:52:22,610 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-25 08:52:22,610 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-25 08:52:22,610 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-25 08:52:22,611 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-25 08:52:22,611 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-25 08:52:22,611 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-25 08:52:22,917 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-25 08:52:23,887 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2019-11-25 08:52:23,888 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2019-11-25 08:52:23,889 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-25 08:52:23,889 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-25 08:52:23,890 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:52:23 BoogieIcfgContainer [2019-11-25 08:52:23,890 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-25 08:52:23,895 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-25 08:52:23,895 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-25 08:52:23,898 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-25 08:52:23,898 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 08:52:21" (1/3) ... [2019-11-25 08:52:23,899 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d6d9ae7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 08:52:23, skipping insertion in model container [2019-11-25 08:52:23,899 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:52:22" (2/3) ... [2019-11-25 08:52:23,899 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d6d9ae7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 08:52:23, skipping insertion in model container [2019-11-25 08:52:23,899 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:52:23" (3/3) ... [2019-11-25 08:52:23,901 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.11.i.cil-1.c [2019-11-25 08:52:23,917 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-25 08:52:23,924 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-25 08:52:23,935 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-25 08:52:23,960 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-25 08:52:23,961 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-25 08:52:23,961 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-25 08:52:23,961 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-25 08:52:23,961 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-25 08:52:23,961 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-25 08:52:23,961 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-25 08:52:23,961 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-25 08:52:23,979 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states. [2019-11-25 08:52:23,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-25 08:52:23,987 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:52:23,987 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] [2019-11-25 08:52:23,988 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:52:23,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:23,993 INFO L82 PathProgramCache]: Analyzing trace with hash -2031756972, now seen corresponding path program 1 times [2019-11-25 08:52:24,001 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:52:24,002 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610082608] [2019-11-25 08:52:24,002 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:52:24,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:24,276 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:24,276 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610082608] [2019-11-25 08:52:24,277 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:52:24,277 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:52:24,278 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127397560] [2019-11-25 08:52:24,282 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:52:24,283 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:52:24,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:52:24,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:52:24,297 INFO L87 Difference]: Start difference. First operand 148 states. Second operand 4 states. [2019-11-25 08:52:24,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:52:24,830 INFO L93 Difference]: Finished difference Result 323 states and 547 transitions. [2019-11-25 08:52:24,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:52:24,832 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2019-11-25 08:52:24,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:52:24,845 INFO L225 Difference]: With dead ends: 323 [2019-11-25 08:52:24,845 INFO L226 Difference]: Without dead ends: 163 [2019-11-25 08:52:24,851 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:24,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-11-25 08:52:24,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 146. [2019-11-25 08:52:24,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-11-25 08:52:24,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 226 transitions. [2019-11-25 08:52:24,924 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 226 transitions. Word has length 35 [2019-11-25 08:52:24,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:52:24,924 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 226 transitions. [2019-11-25 08:52:24,924 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:52:24,925 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 226 transitions. [2019-11-25 08:52:24,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-11-25 08:52:24,928 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:52:24,929 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] [2019-11-25 08:52:24,929 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:52:24,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:24,929 INFO L82 PathProgramCache]: Analyzing trace with hash 2027967358, now seen corresponding path program 1 times [2019-11-25 08:52:24,930 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:52:24,930 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204945328] [2019-11-25 08:52:24,930 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:52:25,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:25,099 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:25,099 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204945328] [2019-11-25 08:52:25,099 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:52:25,100 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:52:25,100 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769451998] [2019-11-25 08:52:25,101 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:52:25,101 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:52:25,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:52:25,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:52:25,102 INFO L87 Difference]: Start difference. First operand 146 states and 226 transitions. Second operand 4 states. [2019-11-25 08:52:25,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:52:25,503 INFO L93 Difference]: Finished difference Result 290 states and 443 transitions. [2019-11-25 08:52:25,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:52:25,503 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 48 [2019-11-25 08:52:25,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:52:25,505 INFO L225 Difference]: With dead ends: 290 [2019-11-25 08:52:25,506 INFO L226 Difference]: Without dead ends: 163 [2019-11-25 08:52:25,507 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:25,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-11-25 08:52:25,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 146. [2019-11-25 08:52:25,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-11-25 08:52:25,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 225 transitions. [2019-11-25 08:52:25,519 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 225 transitions. Word has length 48 [2019-11-25 08:52:25,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:52:25,519 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 225 transitions. [2019-11-25 08:52:25,519 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:52:25,520 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 225 transitions. [2019-11-25 08:52:25,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-25 08:52:25,522 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:52:25,522 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] [2019-11-25 08:52:25,522 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:52:25,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:25,523 INFO L82 PathProgramCache]: Analyzing trace with hash -1944321008, now seen corresponding path program 1 times [2019-11-25 08:52:25,523 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:52:25,523 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767655171] [2019-11-25 08:52:25,523 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:52:25,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:25,596 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:25,596 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767655171] [2019-11-25 08:52:25,596 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:52:25,597 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:52:25,597 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985143754] [2019-11-25 08:52:25,597 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:52:25,597 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:52:25,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:52:25,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:52:25,598 INFO L87 Difference]: Start difference. First operand 146 states and 225 transitions. Second operand 4 states. [2019-11-25 08:52:25,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:52:25,972 INFO L93 Difference]: Finished difference Result 289 states and 441 transitions. [2019-11-25 08:52:25,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:52:25,974 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2019-11-25 08:52:25,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:52:25,975 INFO L225 Difference]: With dead ends: 289 [2019-11-25 08:52:25,975 INFO L226 Difference]: Without dead ends: 162 [2019-11-25 08:52:25,976 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:25,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-11-25 08:52:25,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 146. [2019-11-25 08:52:25,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-11-25 08:52:25,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 224 transitions. [2019-11-25 08:52:25,987 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 224 transitions. Word has length 49 [2019-11-25 08:52:25,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:52:25,988 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 224 transitions. [2019-11-25 08:52:25,988 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:52:25,988 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 224 transitions. [2019-11-25 08:52:25,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-25 08:52:25,990 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:52:25,990 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] [2019-11-25 08:52:25,991 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:52:25,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:25,991 INFO L82 PathProgramCache]: Analyzing trace with hash -2008072389, now seen corresponding path program 1 times [2019-11-25 08:52:25,992 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:52:25,992 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034993851] [2019-11-25 08:52:25,992 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:52:26,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:26,093 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:26,093 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034993851] [2019-11-25 08:52:26,094 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:52:26,094 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:52:26,094 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589033514] [2019-11-25 08:52:26,095 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:52:26,095 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:52:26,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:52:26,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:52:26,096 INFO L87 Difference]: Start difference. First operand 146 states and 224 transitions. Second operand 4 states. [2019-11-25 08:52:26,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:52:26,474 INFO L93 Difference]: Finished difference Result 287 states and 438 transitions. [2019-11-25 08:52:26,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:52:26,475 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2019-11-25 08:52:26,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:52:26,476 INFO L225 Difference]: With dead ends: 287 [2019-11-25 08:52:26,476 INFO L226 Difference]: Without dead ends: 160 [2019-11-25 08:52:26,477 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:26,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-11-25 08:52:26,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 146. [2019-11-25 08:52:26,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-11-25 08:52:26,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 223 transitions. [2019-11-25 08:52:26,493 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 223 transitions. Word has length 49 [2019-11-25 08:52:26,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:52:26,493 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 223 transitions. [2019-11-25 08:52:26,493 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:52:26,493 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 223 transitions. [2019-11-25 08:52:26,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-25 08:52:26,495 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:52:26,495 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] [2019-11-25 08:52:26,496 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:52:26,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:26,496 INFO L82 PathProgramCache]: Analyzing trace with hash -1467926917, now seen corresponding path program 1 times [2019-11-25 08:52:26,496 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:52:26,496 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738541596] [2019-11-25 08:52:26,497 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:52:26,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:26,594 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:26,594 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738541596] [2019-11-25 08:52:26,594 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:52:26,594 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:52:26,595 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824100350] [2019-11-25 08:52:26,595 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:52:26,596 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:52:26,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:52:26,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:52:26,597 INFO L87 Difference]: Start difference. First operand 146 states and 223 transitions. Second operand 4 states. [2019-11-25 08:52:26,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:52:26,913 INFO L93 Difference]: Finished difference Result 286 states and 436 transitions. [2019-11-25 08:52:26,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:52:26,913 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2019-11-25 08:52:26,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:52:26,915 INFO L225 Difference]: With dead ends: 286 [2019-11-25 08:52:26,915 INFO L226 Difference]: Without dead ends: 159 [2019-11-25 08:52:26,916 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:26,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-11-25 08:52:26,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 146. [2019-11-25 08:52:26,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-11-25 08:52:26,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 222 transitions. [2019-11-25 08:52:26,928 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 222 transitions. Word has length 49 [2019-11-25 08:52:26,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:52:26,928 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 222 transitions. [2019-11-25 08:52:26,928 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:52:26,928 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 222 transitions. [2019-11-25 08:52:26,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-25 08:52:26,930 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:52:26,930 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] [2019-11-25 08:52:26,930 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:52:26,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:26,939 INFO L82 PathProgramCache]: Analyzing trace with hash -1078741852, now seen corresponding path program 1 times [2019-11-25 08:52:26,939 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:52:26,939 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201315209] [2019-11-25 08:52:26,940 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:52:26,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:27,021 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:27,021 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201315209] [2019-11-25 08:52:27,021 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:52:27,022 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:52:27,022 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170534969] [2019-11-25 08:52:27,022 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:52:27,022 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:52:27,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:52:27,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:52:27,025 INFO L87 Difference]: Start difference. First operand 146 states and 222 transitions. Second operand 4 states. [2019-11-25 08:52:27,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:52:27,355 INFO L93 Difference]: Finished difference Result 286 states and 435 transitions. [2019-11-25 08:52:27,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:52:27,356 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2019-11-25 08:52:27,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:52:27,358 INFO L225 Difference]: With dead ends: 286 [2019-11-25 08:52:27,358 INFO L226 Difference]: Without dead ends: 159 [2019-11-25 08:52:27,358 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:27,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-11-25 08:52:27,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 146. [2019-11-25 08:52:27,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-11-25 08:52:27,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 221 transitions. [2019-11-25 08:52:27,369 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 221 transitions. Word has length 49 [2019-11-25 08:52:27,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:52:27,372 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 221 transitions. [2019-11-25 08:52:27,373 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:52:27,373 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 221 transitions. [2019-11-25 08:52:27,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-25 08:52:27,379 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:52:27,379 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] [2019-11-25 08:52:27,380 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:52:27,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:27,380 INFO L82 PathProgramCache]: Analyzing trace with hash 231094087, now seen corresponding path program 1 times [2019-11-25 08:52:27,381 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:52:27,381 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809435295] [2019-11-25 08:52:27,386 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:52:27,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:27,449 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:27,449 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809435295] [2019-11-25 08:52:27,449 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:52:27,449 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:52:27,450 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345271093] [2019-11-25 08:52:27,450 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:52:27,450 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:52:27,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:52:27,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:52:27,451 INFO L87 Difference]: Start difference. First operand 146 states and 221 transitions. Second operand 4 states. [2019-11-25 08:52:27,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:52:27,752 INFO L93 Difference]: Finished difference Result 286 states and 434 transitions. [2019-11-25 08:52:27,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:52:27,752 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2019-11-25 08:52:27,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:52:27,753 INFO L225 Difference]: With dead ends: 286 [2019-11-25 08:52:27,753 INFO L226 Difference]: Without dead ends: 159 [2019-11-25 08:52:27,753 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:27,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-11-25 08:52:27,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 146. [2019-11-25 08:52:27,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-11-25 08:52:27,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 220 transitions. [2019-11-25 08:52:27,759 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 220 transitions. Word has length 50 [2019-11-25 08:52:27,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:52:27,759 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 220 transitions. [2019-11-25 08:52:27,759 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:52:27,760 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 220 transitions. [2019-11-25 08:52:27,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-25 08:52:27,761 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:52:27,761 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] [2019-11-25 08:52:27,762 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:52:27,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:27,762 INFO L82 PathProgramCache]: Analyzing trace with hash 1862851913, now seen corresponding path program 1 times [2019-11-25 08:52:27,762 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:52:27,762 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776631793] [2019-11-25 08:52:27,763 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:52:27,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:27,813 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:27,813 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776631793] [2019-11-25 08:52:27,813 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:52:27,813 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:52:27,814 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886450427] [2019-11-25 08:52:27,814 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:52:27,814 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:52:27,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:52:27,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:52:27,815 INFO L87 Difference]: Start difference. First operand 146 states and 220 transitions. Second operand 4 states. [2019-11-25 08:52:28,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:52:28,092 INFO L93 Difference]: Finished difference Result 286 states and 433 transitions. [2019-11-25 08:52:28,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:52:28,092 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 51 [2019-11-25 08:52:28,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:52:28,093 INFO L225 Difference]: With dead ends: 286 [2019-11-25 08:52:28,093 INFO L226 Difference]: Without dead ends: 159 [2019-11-25 08:52:28,094 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:52:28,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-11-25 08:52:28,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 146. [2019-11-25 08:52:28,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-11-25 08:52:28,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 219 transitions. [2019-11-25 08:52:28,099 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 219 transitions. Word has length 51 [2019-11-25 08:52:28,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:52:28,100 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 219 transitions. [2019-11-25 08:52:28,100 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:52:28,100 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 219 transitions. [2019-11-25 08:52:28,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-25 08:52:28,100 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:52:28,101 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] [2019-11-25 08:52:28,101 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:52:28,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:28,101 INFO L82 PathProgramCache]: Analyzing trace with hash 589286348, now seen corresponding path program 1 times [2019-11-25 08:52:28,101 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:52:28,101 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271077223] [2019-11-25 08:52:28,101 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:52:28,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:28,155 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:28,155 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271077223] [2019-11-25 08:52:28,155 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:52:28,155 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:52:28,156 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915442234] [2019-11-25 08:52:28,156 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:52:28,156 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:52:28,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:52:28,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:52:28,157 INFO L87 Difference]: Start difference. First operand 146 states and 219 transitions. Second operand 4 states. [2019-11-25 08:52:28,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:52:28,397 INFO L93 Difference]: Finished difference Result 276 states and 419 transitions. [2019-11-25 08:52:28,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:52:28,398 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2019-11-25 08:52:28,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:52:28,399 INFO L225 Difference]: With dead ends: 276 [2019-11-25 08:52:28,399 INFO L226 Difference]: Without dead ends: 149 [2019-11-25 08:52:28,399 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:28,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-11-25 08:52:28,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 146. [2019-11-25 08:52:28,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-11-25 08:52:28,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 218 transitions. [2019-11-25 08:52:28,404 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 218 transitions. Word has length 52 [2019-11-25 08:52:28,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:52:28,404 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 218 transitions. [2019-11-25 08:52:28,404 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:52:28,404 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 218 transitions. [2019-11-25 08:52:28,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-25 08:52:28,405 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:52:28,405 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] [2019-11-25 08:52:28,405 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:52:28,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:28,406 INFO L82 PathProgramCache]: Analyzing trace with hash -350273228, now seen corresponding path program 1 times [2019-11-25 08:52:28,406 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:52:28,406 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209380880] [2019-11-25 08:52:28,406 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:52:28,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:28,463 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:28,463 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209380880] [2019-11-25 08:52:28,463 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:52:28,463 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:52:28,464 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974813788] [2019-11-25 08:52:28,464 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:52:28,464 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:52:28,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:52:28,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:52:28,465 INFO L87 Difference]: Start difference. First operand 146 states and 218 transitions. Second operand 4 states. [2019-11-25 08:52:28,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:52:28,832 INFO L93 Difference]: Finished difference Result 316 states and 480 transitions. [2019-11-25 08:52:28,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:52:28,832 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2019-11-25 08:52:28,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:52:28,834 INFO L225 Difference]: With dead ends: 316 [2019-11-25 08:52:28,834 INFO L226 Difference]: Without dead ends: 189 [2019-11-25 08:52:28,834 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:28,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-11-25 08:52:28,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 168. [2019-11-25 08:52:28,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-11-25 08:52:28,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 256 transitions. [2019-11-25 08:52:28,847 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 256 transitions. Word has length 52 [2019-11-25 08:52:28,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:52:28,850 INFO L462 AbstractCegarLoop]: Abstraction has 168 states and 256 transitions. [2019-11-25 08:52:28,850 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:52:28,850 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 256 transitions. [2019-11-25 08:52:28,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-25 08:52:28,852 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:52:28,852 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] [2019-11-25 08:52:28,853 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:52:28,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:28,853 INFO L82 PathProgramCache]: Analyzing trace with hash 1467398046, now seen corresponding path program 1 times [2019-11-25 08:52:28,853 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:52:28,853 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792124671] [2019-11-25 08:52:28,854 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:52:28,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:28,925 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:28,926 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792124671] [2019-11-25 08:52:28,926 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:52:28,926 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:52:28,926 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146336574] [2019-11-25 08:52:28,927 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:52:28,927 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:52:28,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:52:28,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:52:28,928 INFO L87 Difference]: Start difference. First operand 168 states and 256 transitions. Second operand 4 states. [2019-11-25 08:52:29,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:52:29,311 INFO L93 Difference]: Finished difference Result 338 states and 517 transitions. [2019-11-25 08:52:29,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:52:29,312 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-11-25 08:52:29,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:52:29,313 INFO L225 Difference]: With dead ends: 338 [2019-11-25 08:52:29,313 INFO L226 Difference]: Without dead ends: 189 [2019-11-25 08:52:29,314 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:29,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-11-25 08:52:29,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 168. [2019-11-25 08:52:29,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-11-25 08:52:29,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 255 transitions. [2019-11-25 08:52:29,320 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 255 transitions. Word has length 65 [2019-11-25 08:52:29,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:52:29,320 INFO L462 AbstractCegarLoop]: Abstraction has 168 states and 255 transitions. [2019-11-25 08:52:29,320 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:52:29,320 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 255 transitions. [2019-11-25 08:52:29,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-25 08:52:29,321 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:52:29,321 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] [2019-11-25 08:52:29,322 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:52:29,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:29,322 INFO L82 PathProgramCache]: Analyzing trace with hash -2142100496, now seen corresponding path program 1 times [2019-11-25 08:52:29,322 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:52:29,322 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61813277] [2019-11-25 08:52:29,322 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:52:29,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:29,388 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:29,391 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61813277] [2019-11-25 08:52:29,391 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:52:29,391 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:52:29,391 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306817586] [2019-11-25 08:52:29,392 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:52:29,392 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:52:29,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:52:29,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:52:29,392 INFO L87 Difference]: Start difference. First operand 168 states and 255 transitions. Second operand 4 states. [2019-11-25 08:52:29,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:52:29,787 INFO L93 Difference]: Finished difference Result 337 states and 514 transitions. [2019-11-25 08:52:29,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:52:29,788 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-11-25 08:52:29,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:52:29,789 INFO L225 Difference]: With dead ends: 337 [2019-11-25 08:52:29,789 INFO L226 Difference]: Without dead ends: 188 [2019-11-25 08:52:29,790 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:29,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2019-11-25 08:52:29,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 168. [2019-11-25 08:52:29,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-11-25 08:52:29,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 254 transitions. [2019-11-25 08:52:29,795 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 254 transitions. Word has length 66 [2019-11-25 08:52:29,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:52:29,796 INFO L462 AbstractCegarLoop]: Abstraction has 168 states and 254 transitions. [2019-11-25 08:52:29,796 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:52:29,796 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 254 transitions. [2019-11-25 08:52:29,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-25 08:52:29,797 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:52:29,797 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] [2019-11-25 08:52:29,797 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:52:29,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:29,797 INFO L82 PathProgramCache]: Analyzing trace with hash 2089115419, now seen corresponding path program 1 times [2019-11-25 08:52:29,798 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:52:29,798 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716634456] [2019-11-25 08:52:29,798 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:52:29,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:29,842 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:29,843 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716634456] [2019-11-25 08:52:29,843 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:52:29,843 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:52:29,843 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155300940] [2019-11-25 08:52:29,844 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:52:29,844 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:52:29,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:52:29,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:52:29,844 INFO L87 Difference]: Start difference. First operand 168 states and 254 transitions. Second operand 4 states. [2019-11-25 08:52:30,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:52:30,195 INFO L93 Difference]: Finished difference Result 335 states and 510 transitions. [2019-11-25 08:52:30,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:52:30,195 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-11-25 08:52:30,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:52:30,197 INFO L225 Difference]: With dead ends: 335 [2019-11-25 08:52:30,197 INFO L226 Difference]: Without dead ends: 186 [2019-11-25 08:52:30,197 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:30,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-11-25 08:52:30,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 168. [2019-11-25 08:52:30,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-11-25 08:52:30,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 253 transitions. [2019-11-25 08:52:30,203 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 253 transitions. Word has length 66 [2019-11-25 08:52:30,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:52:30,203 INFO L462 AbstractCegarLoop]: Abstraction has 168 states and 253 transitions. [2019-11-25 08:52:30,203 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:52:30,203 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 253 transitions. [2019-11-25 08:52:30,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-25 08:52:30,204 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:52:30,204 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] [2019-11-25 08:52:30,204 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:52:30,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:30,204 INFO L82 PathProgramCache]: Analyzing trace with hash -1665706405, now seen corresponding path program 1 times [2019-11-25 08:52:30,205 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:52:30,205 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950957217] [2019-11-25 08:52:30,205 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:52:30,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:30,247 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:30,247 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950957217] [2019-11-25 08:52:30,247 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:52:30,247 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:52:30,248 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717263894] [2019-11-25 08:52:30,248 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:52:30,248 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:52:30,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:52:30,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:52:30,249 INFO L87 Difference]: Start difference. First operand 168 states and 253 transitions. Second operand 4 states. [2019-11-25 08:52:30,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:52:30,592 INFO L93 Difference]: Finished difference Result 334 states and 507 transitions. [2019-11-25 08:52:30,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:52:30,592 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-11-25 08:52:30,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:52:30,593 INFO L225 Difference]: With dead ends: 334 [2019-11-25 08:52:30,594 INFO L226 Difference]: Without dead ends: 185 [2019-11-25 08:52:30,594 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:30,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-11-25 08:52:30,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 168. [2019-11-25 08:52:30,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-11-25 08:52:30,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 252 transitions. [2019-11-25 08:52:30,599 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 252 transitions. Word has length 66 [2019-11-25 08:52:30,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:52:30,600 INFO L462 AbstractCegarLoop]: Abstraction has 168 states and 252 transitions. [2019-11-25 08:52:30,600 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:52:30,600 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 252 transitions. [2019-11-25 08:52:30,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-25 08:52:30,601 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:52:30,601 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] [2019-11-25 08:52:30,601 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:52:30,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:30,602 INFO L82 PathProgramCache]: Analyzing trace with hash -1276521340, now seen corresponding path program 1 times [2019-11-25 08:52:30,602 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:52:30,602 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193090833] [2019-11-25 08:52:30,602 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:52:30,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:30,640 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:30,641 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193090833] [2019-11-25 08:52:30,641 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:52:30,641 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:52:30,641 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496168903] [2019-11-25 08:52:30,641 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:52:30,641 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:52:30,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:52:30,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:52:30,642 INFO L87 Difference]: Start difference. First operand 168 states and 252 transitions. Second operand 4 states. [2019-11-25 08:52:30,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:52:30,960 INFO L93 Difference]: Finished difference Result 334 states and 505 transitions. [2019-11-25 08:52:30,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:52:30,960 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-11-25 08:52:30,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:52:30,961 INFO L225 Difference]: With dead ends: 334 [2019-11-25 08:52:30,961 INFO L226 Difference]: Without dead ends: 185 [2019-11-25 08:52:30,962 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:30,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-11-25 08:52:30,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 168. [2019-11-25 08:52:30,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-11-25 08:52:30,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 251 transitions. [2019-11-25 08:52:30,966 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 251 transitions. Word has length 66 [2019-11-25 08:52:30,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:52:30,967 INFO L462 AbstractCegarLoop]: Abstraction has 168 states and 251 transitions. [2019-11-25 08:52:30,967 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:52:30,967 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 251 transitions. [2019-11-25 08:52:30,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-25 08:52:30,967 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:52:30,967 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] [2019-11-25 08:52:30,967 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:52:30,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:30,968 INFO L82 PathProgramCache]: Analyzing trace with hash -1605102745, now seen corresponding path program 1 times [2019-11-25 08:52:30,968 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:52:30,968 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927398826] [2019-11-25 08:52:30,968 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:52:30,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:31,011 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:31,012 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927398826] [2019-11-25 08:52:31,013 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:52:31,014 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:52:31,014 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506821762] [2019-11-25 08:52:31,014 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:52:31,014 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:52:31,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:52:31,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:52:31,015 INFO L87 Difference]: Start difference. First operand 168 states and 251 transitions. Second operand 4 states. [2019-11-25 08:52:31,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:52:31,371 INFO L93 Difference]: Finished difference Result 334 states and 503 transitions. [2019-11-25 08:52:31,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:52:31,372 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2019-11-25 08:52:31,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:52:31,373 INFO L225 Difference]: With dead ends: 334 [2019-11-25 08:52:31,373 INFO L226 Difference]: Without dead ends: 185 [2019-11-25 08:52:31,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:31,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-11-25 08:52:31,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 168. [2019-11-25 08:52:31,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-11-25 08:52:31,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 250 transitions. [2019-11-25 08:52:31,379 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 250 transitions. Word has length 67 [2019-11-25 08:52:31,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:52:31,382 INFO L462 AbstractCegarLoop]: Abstraction has 168 states and 250 transitions. [2019-11-25 08:52:31,382 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:52:31,382 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 250 transitions. [2019-11-25 08:52:31,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-11-25 08:52:31,383 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:52:31,383 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] [2019-11-25 08:52:31,383 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:52:31,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:31,383 INFO L82 PathProgramCache]: Analyzing trace with hash 775324969, now seen corresponding path program 1 times [2019-11-25 08:52:31,384 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:52:31,384 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116117206] [2019-11-25 08:52:31,384 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:52:31,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:31,431 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:31,431 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116117206] [2019-11-25 08:52:31,431 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:52:31,431 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:52:31,432 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882811955] [2019-11-25 08:52:31,432 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:52:31,432 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:52:31,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:52:31,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:52:31,433 INFO L87 Difference]: Start difference. First operand 168 states and 250 transitions. Second operand 4 states. [2019-11-25 08:52:31,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:52:31,776 INFO L93 Difference]: Finished difference Result 334 states and 501 transitions. [2019-11-25 08:52:31,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:52:31,776 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2019-11-25 08:52:31,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:52:31,777 INFO L225 Difference]: With dead ends: 334 [2019-11-25 08:52:31,778 INFO L226 Difference]: Without dead ends: 185 [2019-11-25 08:52:31,778 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:31,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-11-25 08:52:31,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 168. [2019-11-25 08:52:31,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-11-25 08:52:31,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 249 transitions. [2019-11-25 08:52:31,783 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 249 transitions. Word has length 68 [2019-11-25 08:52:31,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:52:31,783 INFO L462 AbstractCegarLoop]: Abstraction has 168 states and 249 transitions. [2019-11-25 08:52:31,784 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:52:31,784 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 249 transitions. [2019-11-25 08:52:31,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-11-25 08:52:31,784 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:52:31,785 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] [2019-11-25 08:52:31,785 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:52:31,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:31,785 INFO L82 PathProgramCache]: Analyzing trace with hash 1235689452, now seen corresponding path program 1 times [2019-11-25 08:52:31,785 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:52:31,785 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960167428] [2019-11-25 08:52:31,786 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:52:31,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:31,832 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:31,832 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960167428] [2019-11-25 08:52:31,833 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:52:31,833 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:52:31,833 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339792278] [2019-11-25 08:52:31,833 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:52:31,833 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:52:31,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:52:31,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:52:31,834 INFO L87 Difference]: Start difference. First operand 168 states and 249 transitions. Second operand 4 states. [2019-11-25 08:52:32,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:52:32,137 INFO L93 Difference]: Finished difference Result 324 states and 486 transitions. [2019-11-25 08:52:32,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:52:32,138 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 69 [2019-11-25 08:52:32,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:52:32,139 INFO L225 Difference]: With dead ends: 324 [2019-11-25 08:52:32,139 INFO L226 Difference]: Without dead ends: 175 [2019-11-25 08:52:32,140 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:32,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2019-11-25 08:52:32,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 168. [2019-11-25 08:52:32,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-11-25 08:52:32,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 248 transitions. [2019-11-25 08:52:32,145 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 248 transitions. Word has length 69 [2019-11-25 08:52:32,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:52:32,145 INFO L462 AbstractCegarLoop]: Abstraction has 168 states and 248 transitions. [2019-11-25 08:52:32,145 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:52:32,145 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 248 transitions. [2019-11-25 08:52:32,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-11-25 08:52:32,146 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:52:32,146 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] [2019-11-25 08:52:32,146 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:52:32,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:32,146 INFO L82 PathProgramCache]: Analyzing trace with hash -1988306166, now seen corresponding path program 1 times [2019-11-25 08:52:32,146 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:52:32,147 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815948912] [2019-11-25 08:52:32,147 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:52:32,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:32,218 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:32,218 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815948912] [2019-11-25 08:52:32,218 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:52:32,218 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:52:32,219 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877572283] [2019-11-25 08:52:32,220 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:52:32,220 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:52:32,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:52:32,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:52:32,220 INFO L87 Difference]: Start difference. First operand 168 states and 248 transitions. Second operand 4 states. [2019-11-25 08:52:32,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:52:32,680 INFO L93 Difference]: Finished difference Result 424 states and 639 transitions. [2019-11-25 08:52:32,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:52:32,680 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 74 [2019-11-25 08:52:32,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:52:32,684 INFO L225 Difference]: With dead ends: 424 [2019-11-25 08:52:32,684 INFO L226 Difference]: Without dead ends: 275 [2019-11-25 08:52:32,685 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,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2019-11-25 08:52:32,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 198. [2019-11-25 08:52:32,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2019-11-25 08:52:32,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 300 transitions. [2019-11-25 08:52:32,694 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 300 transitions. Word has length 74 [2019-11-25 08:52:32,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:52:32,694 INFO L462 AbstractCegarLoop]: Abstraction has 198 states and 300 transitions. [2019-11-25 08:52:32,694 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:52:32,695 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 300 transitions. [2019-11-25 08:52:32,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-11-25 08:52:32,696 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:52:32,696 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] [2019-11-25 08:52:32,696 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:52:32,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:32,697 INFO L82 PathProgramCache]: Analyzing trace with hash -2060692724, now seen corresponding path program 1 times [2019-11-25 08:52:32,697 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:52:32,697 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3194242] [2019-11-25 08:52:32,698 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:52:32,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:32,768 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:32,768 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3194242] [2019-11-25 08:52:32,769 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:52:32,769 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:52:32,769 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870388947] [2019-11-25 08:52:32,770 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:52:32,770 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:52:32,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:52:32,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:52:32,770 INFO L87 Difference]: Start difference. First operand 198 states and 300 transitions. Second operand 4 states. [2019-11-25 08:52:33,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:52:33,159 INFO L93 Difference]: Finished difference Result 427 states and 655 transitions. [2019-11-25 08:52:33,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:52:33,160 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 74 [2019-11-25 08:52:33,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:52:33,162 INFO L225 Difference]: With dead ends: 427 [2019-11-25 08:52:33,162 INFO L226 Difference]: Without dead ends: 248 [2019-11-25 08:52:33,163 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,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2019-11-25 08:52:33,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 222. [2019-11-25 08:52:33,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2019-11-25 08:52:33,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 342 transitions. [2019-11-25 08:52:33,169 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 342 transitions. Word has length 74 [2019-11-25 08:52:33,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:52:33,170 INFO L462 AbstractCegarLoop]: Abstraction has 222 states and 342 transitions. [2019-11-25 08:52:33,170 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:52:33,170 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 342 transitions. [2019-11-25 08:52:33,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-11-25 08:52:33,171 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:52:33,171 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] [2019-11-25 08:52:33,171 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:52:33,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:33,172 INFO L82 PathProgramCache]: Analyzing trace with hash 880688961, now seen corresponding path program 1 times [2019-11-25 08:52:33,172 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:52:33,172 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117808743] [2019-11-25 08:52:33,172 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:52:33,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:33,265 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:33,265 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117808743] [2019-11-25 08:52:33,265 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:52:33,265 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:52:33,266 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133613461] [2019-11-25 08:52:33,266 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:52:33,266 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:52:33,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:52:33,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:52:33,267 INFO L87 Difference]: Start difference. First operand 222 states and 342 transitions. Second operand 4 states. [2019-11-25 08:52:33,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:52:33,629 INFO L93 Difference]: Finished difference Result 494 states and 761 transitions. [2019-11-25 08:52:33,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:52:33,630 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2019-11-25 08:52:33,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:52:33,632 INFO L225 Difference]: With dead ends: 494 [2019-11-25 08:52:33,632 INFO L226 Difference]: Without dead ends: 291 [2019-11-25 08:52:33,632 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,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2019-11-25 08:52:33,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 223. [2019-11-25 08:52:33,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2019-11-25 08:52:33,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 343 transitions. [2019-11-25 08:52:33,639 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 343 transitions. Word has length 75 [2019-11-25 08:52:33,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:52:33,639 INFO L462 AbstractCegarLoop]: Abstraction has 223 states and 343 transitions. [2019-11-25 08:52:33,639 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:52:33,639 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 343 transitions. [2019-11-25 08:52:33,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-11-25 08:52:33,640 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:52:33,640 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] [2019-11-25 08:52:33,640 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:52:33,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:33,641 INFO L82 PathProgramCache]: Analyzing trace with hash 301633263, now seen corresponding path program 1 times [2019-11-25 08:52:33,641 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:52:33,641 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486020464] [2019-11-25 08:52:33,641 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:52:33,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:33,715 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:33,716 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486020464] [2019-11-25 08:52:33,716 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:52:33,716 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:52:33,717 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790527710] [2019-11-25 08:52:33,717 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:52:33,717 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:52:33,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:52:33,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:52:33,718 INFO L87 Difference]: Start difference. First operand 223 states and 343 transitions. Second operand 4 states. [2019-11-25 08:52:34,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:52:34,182 INFO L93 Difference]: Finished difference Result 495 states and 761 transitions. [2019-11-25 08:52:34,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:52:34,182 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2019-11-25 08:52:34,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:52:34,184 INFO L225 Difference]: With dead ends: 495 [2019-11-25 08:52:34,184 INFO L226 Difference]: Without dead ends: 291 [2019-11-25 08:52:34,185 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,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2019-11-25 08:52:34,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 233. [2019-11-25 08:52:34,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2019-11-25 08:52:34,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 362 transitions. [2019-11-25 08:52:34,191 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 362 transitions. Word has length 81 [2019-11-25 08:52:34,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:52:34,192 INFO L462 AbstractCegarLoop]: Abstraction has 233 states and 362 transitions. [2019-11-25 08:52:34,192 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:52:34,192 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 362 transitions. [2019-11-25 08:52:34,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-11-25 08:52:34,193 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:52:34,193 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] [2019-11-25 08:52:34,193 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:52:34,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:34,194 INFO L82 PathProgramCache]: Analyzing trace with hash 542590269, now seen corresponding path program 1 times [2019-11-25 08:52:34,194 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:52:34,194 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852919623] [2019-11-25 08:52:34,194 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:52:34,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:34,261 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:34,261 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852919623] [2019-11-25 08:52:34,261 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:52:34,261 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:52:34,262 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358463509] [2019-11-25 08:52:34,262 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:52:34,262 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:52:34,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:52:34,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:52:34,263 INFO L87 Difference]: Start difference. First operand 233 states and 362 transitions. Second operand 4 states. [2019-11-25 08:52:34,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:52:34,671 INFO L93 Difference]: Finished difference Result 497 states and 768 transitions. [2019-11-25 08:52:34,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:52:34,673 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 82 [2019-11-25 08:52:34,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:52:34,674 INFO L225 Difference]: With dead ends: 497 [2019-11-25 08:52:34,674 INFO L226 Difference]: Without dead ends: 283 [2019-11-25 08:52:34,675 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,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2019-11-25 08:52:34,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 234. [2019-11-25 08:52:34,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2019-11-25 08:52:34,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 363 transitions. [2019-11-25 08:52:34,681 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 363 transitions. Word has length 82 [2019-11-25 08:52:34,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:52:34,681 INFO L462 AbstractCegarLoop]: Abstraction has 234 states and 363 transitions. [2019-11-25 08:52:34,682 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:52:34,682 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 363 transitions. [2019-11-25 08:52:34,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-11-25 08:52:34,683 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:52:34,683 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] [2019-11-25 08:52:34,683 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:52:34,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:34,683 INFO L82 PathProgramCache]: Analyzing trace with hash 354437512, now seen corresponding path program 1 times [2019-11-25 08:52:34,683 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:52:34,683 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370509454] [2019-11-25 08:52:34,684 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:52:34,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:34,739 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:34,739 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370509454] [2019-11-25 08:52:34,739 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:52:34,740 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:52:34,740 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704943030] [2019-11-25 08:52:34,740 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:52:34,740 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:52:34,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:52:34,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:52:34,741 INFO L87 Difference]: Start difference. First operand 234 states and 363 transitions. Second operand 4 states. [2019-11-25 08:52:35,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:52:35,197 INFO L93 Difference]: Finished difference Result 498 states and 768 transitions. [2019-11-25 08:52:35,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:52:35,198 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2019-11-25 08:52:35,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:52:35,199 INFO L225 Difference]: With dead ends: 498 [2019-11-25 08:52:35,199 INFO L226 Difference]: Without dead ends: 283 [2019-11-25 08:52:35,200 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,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2019-11-25 08:52:35,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 234. [2019-11-25 08:52:35,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2019-11-25 08:52:35,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 362 transitions. [2019-11-25 08:52:35,206 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 362 transitions. Word has length 87 [2019-11-25 08:52:35,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:52:35,207 INFO L462 AbstractCegarLoop]: Abstraction has 234 states and 362 transitions. [2019-11-25 08:52:35,207 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:52:35,207 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 362 transitions. [2019-11-25 08:52:35,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-11-25 08:52:35,208 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:52:35,208 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] [2019-11-25 08:52:35,208 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:52:35,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:35,209 INFO L82 PathProgramCache]: Analyzing trace with hash -2012257082, now seen corresponding path program 1 times [2019-11-25 08:52:35,209 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:52:35,209 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202047762] [2019-11-25 08:52:35,209 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:52:35,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:35,269 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:35,270 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202047762] [2019-11-25 08:52:35,270 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:52:35,270 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:52:35,270 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691760381] [2019-11-25 08:52:35,271 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:52:35,271 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:52:35,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:52:35,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:52:35,272 INFO L87 Difference]: Start difference. First operand 234 states and 362 transitions. Second operand 4 states. [2019-11-25 08:52:35,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:52:35,587 INFO L93 Difference]: Finished difference Result 475 states and 736 transitions. [2019-11-25 08:52:35,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:52:35,588 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2019-11-25 08:52:35,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:52:35,589 INFO L225 Difference]: With dead ends: 475 [2019-11-25 08:52:35,589 INFO L226 Difference]: Without dead ends: 260 [2019-11-25 08:52:35,590 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,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2019-11-25 08:52:35,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 234. [2019-11-25 08:52:35,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2019-11-25 08:52:35,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 361 transitions. [2019-11-25 08:52:35,595 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 361 transitions. Word has length 87 [2019-11-25 08:52:35,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:52:35,596 INFO L462 AbstractCegarLoop]: Abstraction has 234 states and 361 transitions. [2019-11-25 08:52:35,596 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:52:35,596 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 361 transitions. [2019-11-25 08:52:35,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-25 08:52:35,597 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:52:35,597 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] [2019-11-25 08:52:35,597 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:52:35,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:35,598 INFO L82 PathProgramCache]: Analyzing trace with hash 2010828614, now seen corresponding path program 1 times [2019-11-25 08:52:35,598 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:52:35,598 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974678284] [2019-11-25 08:52:35,598 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:52:35,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:35,653 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:35,653 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974678284] [2019-11-25 08:52:35,653 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:52:35,654 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:52:35,654 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458791181] [2019-11-25 08:52:35,654 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:52:35,654 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:52:35,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:52:35,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:52:35,655 INFO L87 Difference]: Start difference. First operand 234 states and 361 transitions. Second operand 4 states. [2019-11-25 08:52:36,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:52:36,107 INFO L93 Difference]: Finished difference Result 497 states and 763 transitions. [2019-11-25 08:52:36,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:52:36,108 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-11-25 08:52:36,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:52:36,110 INFO L225 Difference]: With dead ends: 497 [2019-11-25 08:52:36,110 INFO L226 Difference]: Without dead ends: 282 [2019-11-25 08:52:36,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:36,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2019-11-25 08:52:36,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 234. [2019-11-25 08:52:36,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2019-11-25 08:52:36,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 360 transitions. [2019-11-25 08:52:36,116 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 360 transitions. Word has length 88 [2019-11-25 08:52:36,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:52:36,117 INFO L462 AbstractCegarLoop]: Abstraction has 234 states and 360 transitions. [2019-11-25 08:52:36,117 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:52:36,117 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 360 transitions. [2019-11-25 08:52:36,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-25 08:52:36,118 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:52:36,118 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] [2019-11-25 08:52:36,118 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:52:36,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:36,119 INFO L82 PathProgramCache]: Analyzing trace with hash 1947077233, now seen corresponding path program 1 times [2019-11-25 08:52:36,119 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:52:36,119 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873855324] [2019-11-25 08:52:36,119 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:52:36,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:36,168 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:36,169 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873855324] [2019-11-25 08:52:36,169 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:52:36,169 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:52:36,169 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661410196] [2019-11-25 08:52:36,170 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:52:36,170 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:52:36,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:52:36,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:52:36,170 INFO L87 Difference]: Start difference. First operand 234 states and 360 transitions. Second operand 4 states. [2019-11-25 08:52:36,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:52:36,638 INFO L93 Difference]: Finished difference Result 495 states and 759 transitions. [2019-11-25 08:52:36,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:52:36,639 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-11-25 08:52:36,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:52:36,640 INFO L225 Difference]: With dead ends: 495 [2019-11-25 08:52:36,641 INFO L226 Difference]: Without dead ends: 280 [2019-11-25 08:52:36,641 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:36,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2019-11-25 08:52:36,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 234. [2019-11-25 08:52:36,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2019-11-25 08:52:36,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 359 transitions. [2019-11-25 08:52:36,648 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 359 transitions. Word has length 88 [2019-11-25 08:52:36,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:52:36,648 INFO L462 AbstractCegarLoop]: Abstraction has 234 states and 359 transitions. [2019-11-25 08:52:36,648 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:52:36,648 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 359 transitions. [2019-11-25 08:52:36,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-25 08:52:36,649 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:52:36,649 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] [2019-11-25 08:52:36,649 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:52:36,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:36,650 INFO L82 PathProgramCache]: Analyzing trace with hash -1807744591, now seen corresponding path program 1 times [2019-11-25 08:52:36,650 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:52:36,650 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806963457] [2019-11-25 08:52:36,650 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:52:36,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:36,720 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:36,721 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806963457] [2019-11-25 08:52:36,721 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:52:36,721 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:52:36,721 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250048456] [2019-11-25 08:52:36,722 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:52:36,722 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:52:36,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:52:36,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:52:36,722 INFO L87 Difference]: Start difference. First operand 234 states and 359 transitions. Second operand 4 states. [2019-11-25 08:52:37,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:52:37,170 INFO L93 Difference]: Finished difference Result 494 states and 756 transitions. [2019-11-25 08:52:37,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:52:37,171 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-11-25 08:52:37,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:52:37,172 INFO L225 Difference]: With dead ends: 494 [2019-11-25 08:52:37,172 INFO L226 Difference]: Without dead ends: 279 [2019-11-25 08:52:37,173 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:37,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2019-11-25 08:52:37,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 234. [2019-11-25 08:52:37,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2019-11-25 08:52:37,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 358 transitions. [2019-11-25 08:52:37,179 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 358 transitions. Word has length 88 [2019-11-25 08:52:37,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:52:37,180 INFO L462 AbstractCegarLoop]: Abstraction has 234 states and 358 transitions. [2019-11-25 08:52:37,180 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:52:37,180 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 358 transitions. [2019-11-25 08:52:37,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-25 08:52:37,181 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:52:37,181 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] [2019-11-25 08:52:37,181 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:52:37,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:37,182 INFO L82 PathProgramCache]: Analyzing trace with hash -1418559526, now seen corresponding path program 1 times [2019-11-25 08:52:37,182 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:52:37,182 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498361855] [2019-11-25 08:52:37,182 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:52:37,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:37,257 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:37,258 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498361855] [2019-11-25 08:52:37,258 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:52:37,258 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-25 08:52:37,258 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578370548] [2019-11-25 08:52:37,259 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-25 08:52:37,259 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:52:37,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-25 08:52:37,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:52:37,260 INFO L87 Difference]: Start difference. First operand 234 states and 358 transitions. Second operand 5 states. [2019-11-25 08:52:37,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:52:37,814 INFO L93 Difference]: Finished difference Result 470 states and 724 transitions. [2019-11-25 08:52:37,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-25 08:52:37,814 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 88 [2019-11-25 08:52:37,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:52:37,816 INFO L225 Difference]: With dead ends: 470 [2019-11-25 08:52:37,816 INFO L226 Difference]: Without dead ends: 255 [2019-11-25 08:52:37,817 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:37,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2019-11-25 08:52:37,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 254. [2019-11-25 08:52:37,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-11-25 08:52:37,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 384 transitions. [2019-11-25 08:52:37,824 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 384 transitions. Word has length 88 [2019-11-25 08:52:37,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:52:37,825 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 384 transitions. [2019-11-25 08:52:37,825 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-25 08:52:37,825 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 384 transitions. [2019-11-25 08:52:37,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-25 08:52:37,826 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:52:37,826 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] [2019-11-25 08:52:37,826 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:52:37,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:37,827 INFO L82 PathProgramCache]: Analyzing trace with hash 1593988851, now seen corresponding path program 1 times [2019-11-25 08:52:37,827 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:52:37,827 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034948604] [2019-11-25 08:52:37,827 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:52:37,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:37,879 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:37,880 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034948604] [2019-11-25 08:52:37,880 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:52:37,880 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:52:37,880 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429320075] [2019-11-25 08:52:37,881 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:52:37,881 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:52:37,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:52:37,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:52:37,881 INFO L87 Difference]: Start difference. First operand 254 states and 384 transitions. Second operand 4 states. [2019-11-25 08:52:38,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:52:38,217 INFO L93 Difference]: Finished difference Result 512 states and 776 transitions. [2019-11-25 08:52:38,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:52:38,218 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-11-25 08:52:38,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:52:38,219 INFO L225 Difference]: With dead ends: 512 [2019-11-25 08:52:38,220 INFO L226 Difference]: Without dead ends: 277 [2019-11-25 08:52:38,220 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:38,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2019-11-25 08:52:38,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 254. [2019-11-25 08:52:38,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-11-25 08:52:38,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 383 transitions. [2019-11-25 08:52:38,226 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 383 transitions. Word has length 88 [2019-11-25 08:52:38,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:52:38,227 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 383 transitions. [2019-11-25 08:52:38,227 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:52:38,227 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 383 transitions. [2019-11-25 08:52:38,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-25 08:52:38,228 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:52:38,228 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] [2019-11-25 08:52:38,228 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:52:38,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:38,229 INFO L82 PathProgramCache]: Analyzing trace with hash 2134134323, now seen corresponding path program 1 times [2019-11-25 08:52:38,229 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:52:38,229 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68831495] [2019-11-25 08:52:38,229 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:52:38,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:38,277 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:38,277 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68831495] [2019-11-25 08:52:38,278 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:52:38,278 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:52:38,278 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339112372] [2019-11-25 08:52:38,278 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:52:38,279 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:52:38,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:52:38,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:52:38,279 INFO L87 Difference]: Start difference. First operand 254 states and 383 transitions. Second operand 4 states. [2019-11-25 08:52:38,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:52:38,556 INFO L93 Difference]: Finished difference Result 511 states and 773 transitions. [2019-11-25 08:52:38,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:52:38,557 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-11-25 08:52:38,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:52:38,558 INFO L225 Difference]: With dead ends: 511 [2019-11-25 08:52:38,558 INFO L226 Difference]: Without dead ends: 276 [2019-11-25 08:52:38,558 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:38,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2019-11-25 08:52:38,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 254. [2019-11-25 08:52:38,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-11-25 08:52:38,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 382 transitions. [2019-11-25 08:52:38,565 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 382 transitions. Word has length 88 [2019-11-25 08:52:38,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:52:38,565 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 382 transitions. [2019-11-25 08:52:38,565 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:52:38,565 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 382 transitions. [2019-11-25 08:52:38,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-11-25 08:52:38,566 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:52:38,566 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] [2019-11-25 08:52:38,566 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:52:38,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:38,566 INFO L82 PathProgramCache]: Analyzing trace with hash -1582169212, now seen corresponding path program 1 times [2019-11-25 08:52:38,566 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:52:38,566 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499383066] [2019-11-25 08:52:38,567 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:52:38,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:38,630 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:38,630 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499383066] [2019-11-25 08:52:38,630 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:52:38,631 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:52:38,631 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673741756] [2019-11-25 08:52:38,631 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:52:38,631 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:52:38,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:52:38,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:52:38,632 INFO L87 Difference]: Start difference. First operand 254 states and 382 transitions. Second operand 4 states. [2019-11-25 08:52:38,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:52:38,970 INFO L93 Difference]: Finished difference Result 534 states and 801 transitions. [2019-11-25 08:52:38,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:52:38,971 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 89 [2019-11-25 08:52:38,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:52:38,972 INFO L225 Difference]: With dead ends: 534 [2019-11-25 08:52:38,972 INFO L226 Difference]: Without dead ends: 299 [2019-11-25 08:52:38,973 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:38,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2019-11-25 08:52:38,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 254. [2019-11-25 08:52:38,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-11-25 08:52:38,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 381 transitions. [2019-11-25 08:52:38,980 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 381 transitions. Word has length 89 [2019-11-25 08:52:38,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:52:38,980 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 381 transitions. [2019-11-25 08:52:38,980 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:52:38,980 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 381 transitions. [2019-11-25 08:52:38,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-11-25 08:52:38,981 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:52:38,981 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] [2019-11-25 08:52:38,981 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:52:38,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:38,982 INFO L82 PathProgramCache]: Analyzing trace with hash 356992834, now seen corresponding path program 1 times [2019-11-25 08:52:38,982 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:52:38,982 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122385254] [2019-11-25 08:52:38,983 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:52:38,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:39,038 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:39,038 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122385254] [2019-11-25 08:52:39,039 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:52:39,039 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:52:39,039 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973247333] [2019-11-25 08:52:39,039 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:52:39,040 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:52:39,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:52:39,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:52:39,040 INFO L87 Difference]: Start difference. First operand 254 states and 381 transitions. Second operand 4 states. [2019-11-25 08:52:39,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:52:39,349 INFO L93 Difference]: Finished difference Result 511 states and 769 transitions. [2019-11-25 08:52:39,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:52:39,350 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 89 [2019-11-25 08:52:39,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:52:39,351 INFO L225 Difference]: With dead ends: 511 [2019-11-25 08:52:39,351 INFO L226 Difference]: Without dead ends: 276 [2019-11-25 08:52:39,352 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,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2019-11-25 08:52:39,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 254. [2019-11-25 08:52:39,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-11-25 08:52:39,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 380 transitions. [2019-11-25 08:52:39,362 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 380 transitions. Word has length 89 [2019-11-25 08:52:39,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:52:39,362 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 380 transitions. [2019-11-25 08:52:39,362 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:52:39,362 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 380 transitions. [2019-11-25 08:52:39,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-11-25 08:52:39,363 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:52:39,363 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] [2019-11-25 08:52:39,364 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:52:39,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:39,364 INFO L82 PathProgramCache]: Analyzing trace with hash -2129784979, now seen corresponding path program 1 times [2019-11-25 08:52:39,364 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:52:39,364 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922361066] [2019-11-25 08:52:39,365 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:52:39,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:39,421 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:39,422 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922361066] [2019-11-25 08:52:39,422 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:52:39,422 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:52:39,422 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782963684] [2019-11-25 08:52:39,423 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:52:39,423 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:52:39,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:52:39,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:52:39,423 INFO L87 Difference]: Start difference. First operand 254 states and 380 transitions. Second operand 4 states. [2019-11-25 08:52:39,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:52:39,852 INFO L93 Difference]: Finished difference Result 534 states and 797 transitions. [2019-11-25 08:52:39,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:52:39,853 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 90 [2019-11-25 08:52:39,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:52:39,855 INFO L225 Difference]: With dead ends: 534 [2019-11-25 08:52:39,855 INFO L226 Difference]: Without dead ends: 299 [2019-11-25 08:52:39,856 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,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2019-11-25 08:52:39,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 254. [2019-11-25 08:52:39,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-11-25 08:52:39,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 379 transitions. [2019-11-25 08:52:39,864 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 379 transitions. Word has length 90 [2019-11-25 08:52:39,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:52:39,864 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 379 transitions. [2019-11-25 08:52:39,864 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:52:39,864 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 379 transitions. [2019-11-25 08:52:39,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-11-25 08:52:39,865 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:52:39,865 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] [2019-11-25 08:52:39,866 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:52:39,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:39,866 INFO L82 PathProgramCache]: Analyzing trace with hash -2145303697, now seen corresponding path program 1 times [2019-11-25 08:52:39,866 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:52:39,867 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313941348] [2019-11-25 08:52:39,867 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:52:39,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:39,923 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:39,923 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313941348] [2019-11-25 08:52:39,923 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:52:39,923 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:52:39,924 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878051797] [2019-11-25 08:52:39,924 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:52:39,924 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:52:39,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:52:39,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:52:39,925 INFO L87 Difference]: Start difference. First operand 254 states and 379 transitions. Second operand 4 states. [2019-11-25 08:52:40,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:52:40,253 INFO L93 Difference]: Finished difference Result 511 states and 765 transitions. [2019-11-25 08:52:40,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:52:40,254 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 90 [2019-11-25 08:52:40,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:52:40,256 INFO L225 Difference]: With dead ends: 511 [2019-11-25 08:52:40,256 INFO L226 Difference]: Without dead ends: 276 [2019-11-25 08:52:40,257 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:52:40,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2019-11-25 08:52:40,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 254. [2019-11-25 08:52:40,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-11-25 08:52:40,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 378 transitions. [2019-11-25 08:52:40,297 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 378 transitions. Word has length 90 [2019-11-25 08:52:40,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:52:40,297 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 378 transitions. [2019-11-25 08:52:40,297 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:52:40,298 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 378 transitions. [2019-11-25 08:52:40,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-11-25 08:52:40,298 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:52:40,299 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] [2019-11-25 08:52:40,299 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:52:40,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:40,300 INFO L82 PathProgramCache]: Analyzing trace with hash 1086928127, now seen corresponding path program 1 times [2019-11-25 08:52:40,300 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:52:40,300 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950040851] [2019-11-25 08:52:40,300 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:52:40,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:40,357 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:40,357 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950040851] [2019-11-25 08:52:40,358 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:52:40,358 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:52:40,358 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118606395] [2019-11-25 08:52:40,358 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:52:40,359 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:52:40,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:52:40,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:52:40,359 INFO L87 Difference]: Start difference. First operand 254 states and 378 transitions. Second operand 4 states. [2019-11-25 08:52:40,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:52:40,694 INFO L93 Difference]: Finished difference Result 534 states and 793 transitions. [2019-11-25 08:52:40,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:52:40,695 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2019-11-25 08:52:40,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:52:40,696 INFO L225 Difference]: With dead ends: 534 [2019-11-25 08:52:40,696 INFO L226 Difference]: Without dead ends: 299 [2019-11-25 08:52:40,697 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:52:40,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2019-11-25 08:52:40,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 254. [2019-11-25 08:52:40,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-11-25 08:52:40,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 377 transitions. [2019-11-25 08:52:40,704 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 377 transitions. Word has length 91 [2019-11-25 08:52:40,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:52:40,704 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 377 transitions. [2019-11-25 08:52:40,704 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:52:40,704 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 377 transitions. [2019-11-25 08:52:40,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-11-25 08:52:40,705 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:52:40,705 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] [2019-11-25 08:52:40,706 INFO L410 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:52:40,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:40,706 INFO L82 PathProgramCache]: Analyzing trace with hash 605847869, now seen corresponding path program 1 times [2019-11-25 08:52:40,706 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:52:40,706 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128536821] [2019-11-25 08:52:40,706 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:52:40,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:40,754 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:40,754 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128536821] [2019-11-25 08:52:40,755 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:52:40,755 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:52:40,756 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584696879] [2019-11-25 08:52:40,756 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:52:40,756 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:52:40,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:52:40,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:52:40,758 INFO L87 Difference]: Start difference. First operand 254 states and 377 transitions. Second operand 4 states. [2019-11-25 08:52:41,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:52:41,094 INFO L93 Difference]: Finished difference Result 511 states and 761 transitions. [2019-11-25 08:52:41,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:52:41,094 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2019-11-25 08:52:41,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:52:41,095 INFO L225 Difference]: With dead ends: 511 [2019-11-25 08:52:41,095 INFO L226 Difference]: Without dead ends: 276 [2019-11-25 08:52:41,096 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,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2019-11-25 08:52:41,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 254. [2019-11-25 08:52:41,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-11-25 08:52:41,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 376 transitions. [2019-11-25 08:52:41,103 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 376 transitions. Word has length 91 [2019-11-25 08:52:41,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:52:41,103 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 376 transitions. [2019-11-25 08:52:41,103 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:52:41,104 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 376 transitions. [2019-11-25 08:52:41,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-11-25 08:52:41,104 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:52:41,105 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] [2019-11-25 08:52:41,105 INFO L410 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:52:41,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:41,105 INFO L82 PathProgramCache]: Analyzing trace with hash 738752008, now seen corresponding path program 1 times [2019-11-25 08:52:41,105 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:52:41,106 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135116835] [2019-11-25 08:52:41,106 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:52:41,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:41,162 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:41,162 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135116835] [2019-11-25 08:52:41,162 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:52:41,163 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:52:41,163 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741641072] [2019-11-25 08:52:41,163 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:52:41,163 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:52:41,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:52:41,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:52:41,164 INFO L87 Difference]: Start difference. First operand 254 states and 376 transitions. Second operand 4 states. [2019-11-25 08:52:41,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:52:41,477 INFO L93 Difference]: Finished difference Result 524 states and 777 transitions. [2019-11-25 08:52:41,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:52:41,477 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2019-11-25 08:52:41,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:52:41,479 INFO L225 Difference]: With dead ends: 524 [2019-11-25 08:52:41,479 INFO L226 Difference]: Without dead ends: 289 [2019-11-25 08:52:41,480 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,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2019-11-25 08:52:41,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 254. [2019-11-25 08:52:41,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-11-25 08:52:41,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 375 transitions. [2019-11-25 08:52:41,486 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 375 transitions. Word has length 92 [2019-11-25 08:52:41,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:52:41,486 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 375 transitions. [2019-11-25 08:52:41,487 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:52:41,487 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 375 transitions. [2019-11-25 08:52:41,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-11-25 08:52:41,488 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:52:41,488 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] [2019-11-25 08:52:41,488 INFO L410 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:52:41,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:41,489 INFO L82 PathProgramCache]: Analyzing trace with hash -1289834102, now seen corresponding path program 1 times [2019-11-25 08:52:41,489 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:52:41,489 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397385395] [2019-11-25 08:52:41,489 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:52:41,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:41,538 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:41,538 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397385395] [2019-11-25 08:52:41,539 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:52:41,539 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:52:41,539 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691120795] [2019-11-25 08:52:41,539 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:52:41,539 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:52:41,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:52:41,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:52:41,540 INFO L87 Difference]: Start difference. First operand 254 states and 375 transitions. Second operand 4 states. [2019-11-25 08:52:41,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:52:41,867 INFO L93 Difference]: Finished difference Result 501 states and 745 transitions. [2019-11-25 08:52:41,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:52:41,867 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2019-11-25 08:52:41,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:52:41,869 INFO L225 Difference]: With dead ends: 501 [2019-11-25 08:52:41,869 INFO L226 Difference]: Without dead ends: 266 [2019-11-25 08:52:41,870 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,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2019-11-25 08:52:41,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 254. [2019-11-25 08:52:41,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-11-25 08:52:41,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 374 transitions. [2019-11-25 08:52:41,876 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 374 transitions. Word has length 92 [2019-11-25 08:52:41,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:52:41,876 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 374 transitions. [2019-11-25 08:52:41,876 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:52:41,876 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 374 transitions. [2019-11-25 08:52:41,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-11-25 08:52:41,877 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:52:41,877 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] [2019-11-25 08:52:41,877 INFO L410 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:52:41,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:41,878 INFO L82 PathProgramCache]: Analyzing trace with hash -1110599922, now seen corresponding path program 1 times [2019-11-25 08:52:41,878 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:52:41,878 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120301413] [2019-11-25 08:52:41,878 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:52:41,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:41,926 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:41,926 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120301413] [2019-11-25 08:52:41,926 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:52:41,927 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:52:41,927 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480728271] [2019-11-25 08:52:41,927 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:52:41,927 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:52:41,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:52:41,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:52:41,928 INFO L87 Difference]: Start difference. First operand 254 states and 374 transitions. Second operand 4 states. [2019-11-25 08:52:42,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:52:42,339 INFO L93 Difference]: Finished difference Result 524 states and 773 transitions. [2019-11-25 08:52:42,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:52:42,340 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2019-11-25 08:52:42,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:52:42,342 INFO L225 Difference]: With dead ends: 524 [2019-11-25 08:52:42,342 INFO L226 Difference]: Without dead ends: 289 [2019-11-25 08:52:42,342 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,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2019-11-25 08:52:42,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 254. [2019-11-25 08:52:42,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-11-25 08:52:42,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 373 transitions. [2019-11-25 08:52:42,349 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 373 transitions. Word has length 96 [2019-11-25 08:52:42,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:52:42,349 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 373 transitions. [2019-11-25 08:52:42,349 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:52:42,349 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 373 transitions. [2019-11-25 08:52:42,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-11-25 08:52:42,350 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:52:42,350 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] [2019-11-25 08:52:42,350 INFO L410 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:52:42,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:42,350 INFO L82 PathProgramCache]: Analyzing trace with hash 276185488, now seen corresponding path program 1 times [2019-11-25 08:52:42,351 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:52:42,351 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061618392] [2019-11-25 08:52:42,351 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:52:42,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:42,402 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:42,403 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061618392] [2019-11-25 08:52:42,403 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:52:42,403 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:52:42,403 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762032715] [2019-11-25 08:52:42,404 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:52:42,404 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:52:42,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:52:42,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:52:42,405 INFO L87 Difference]: Start difference. First operand 254 states and 373 transitions. Second operand 3 states. [2019-11-25 08:52:42,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:52:42,454 INFO L93 Difference]: Finished difference Result 722 states and 1074 transitions. [2019-11-25 08:52:42,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:52:42,455 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 96 [2019-11-25 08:52:42,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:52:42,457 INFO L225 Difference]: With dead ends: 722 [2019-11-25 08:52:42,458 INFO L226 Difference]: Without dead ends: 487 [2019-11-25 08:52:42,458 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:42,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states. [2019-11-25 08:52:42,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 487. [2019-11-25 08:52:42,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 487 states. [2019-11-25 08:52:42,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 717 transitions. [2019-11-25 08:52:42,474 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 717 transitions. Word has length 96 [2019-11-25 08:52:42,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:52:42,475 INFO L462 AbstractCegarLoop]: Abstraction has 487 states and 717 transitions. [2019-11-25 08:52:42,475 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:52:42,475 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 717 transitions. [2019-11-25 08:52:42,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-25 08:52:42,476 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:52:42,476 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] [2019-11-25 08:52:42,476 INFO L410 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:52:42,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:42,477 INFO L82 PathProgramCache]: Analyzing trace with hash -1173556134, now seen corresponding path program 1 times [2019-11-25 08:52:42,477 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:52:42,477 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616340855] [2019-11-25 08:52:42,477 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:52:42,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:42,523 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-25 08:52:42,524 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616340855] [2019-11-25 08:52:42,524 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:52:42,524 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:52:42,524 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876512113] [2019-11-25 08:52:42,525 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:52:42,525 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:52:42,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:52:42,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:52:42,525 INFO L87 Difference]: Start difference. First operand 487 states and 717 transitions. Second operand 3 states. [2019-11-25 08:52:42,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:52:42,581 INFO L93 Difference]: Finished difference Result 1190 states and 1763 transitions. [2019-11-25 08:52:42,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:52:42,582 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-11-25 08:52:42,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:52:42,585 INFO L225 Difference]: With dead ends: 1190 [2019-11-25 08:52:42,586 INFO L226 Difference]: Without dead ends: 722 [2019-11-25 08:52:42,586 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:42,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 722 states. [2019-11-25 08:52:42,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 722 to 720. [2019-11-25 08:52:42,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 720 states. [2019-11-25 08:52:42,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 720 states to 720 states and 1065 transitions. [2019-11-25 08:52:42,606 INFO L78 Accepts]: Start accepts. Automaton has 720 states and 1065 transitions. Word has length 98 [2019-11-25 08:52:42,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:52:42,606 INFO L462 AbstractCegarLoop]: Abstraction has 720 states and 1065 transitions. [2019-11-25 08:52:42,606 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:52:42,606 INFO L276 IsEmpty]: Start isEmpty. Operand 720 states and 1065 transitions. [2019-11-25 08:52:42,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-11-25 08:52:42,608 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:52:42,608 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] [2019-11-25 08:52:42,608 INFO L410 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:52:42,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:42,608 INFO L82 PathProgramCache]: Analyzing trace with hash -1825940577, now seen corresponding path program 1 times [2019-11-25 08:52:42,609 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:52:42,609 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403476224] [2019-11-25 08:52:42,609 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:52:42,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:42,662 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-25 08:52:42,662 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403476224] [2019-11-25 08:52:42,663 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:52:42,664 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:52:42,664 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876706065] [2019-11-25 08:52:42,665 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:52:42,665 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:52:42,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:52:42,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:52:42,666 INFO L87 Difference]: Start difference. First operand 720 states and 1065 transitions. Second operand 3 states. [2019-11-25 08:52:42,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:52:42,755 INFO L93 Difference]: Finished difference Result 1656 states and 2457 transitions. [2019-11-25 08:52:42,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:52:42,756 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2019-11-25 08:52:42,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:52:42,761 INFO L225 Difference]: With dead ends: 1656 [2019-11-25 08:52:42,761 INFO L226 Difference]: Without dead ends: 955 [2019-11-25 08:52:42,762 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:42,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 955 states. [2019-11-25 08:52:42,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 955 to 953. [2019-11-25 08:52:42,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 953 states. [2019-11-25 08:52:42,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 953 states to 953 states and 1399 transitions. [2019-11-25 08:52:42,789 INFO L78 Accepts]: Start accepts. Automaton has 953 states and 1399 transitions. Word has length 105 [2019-11-25 08:52:42,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:52:42,791 INFO L462 AbstractCegarLoop]: Abstraction has 953 states and 1399 transitions. [2019-11-25 08:52:42,791 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:52:42,791 INFO L276 IsEmpty]: Start isEmpty. Operand 953 states and 1399 transitions. [2019-11-25 08:52:42,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-11-25 08:52:42,794 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:52:42,794 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, 1, 1, 1, 1, 1, 1, 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,795 INFO L410 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:52:42,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:42,795 INFO L82 PathProgramCache]: Analyzing trace with hash 315775349, now seen corresponding path program 1 times [2019-11-25 08:52:42,795 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:52:42,795 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501259113] [2019-11-25 08:52:42,795 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:52:42,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:42,850 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-25 08:52:42,851 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501259113] [2019-11-25 08:52:42,851 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:52:42,851 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:52:42,851 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554774397] [2019-11-25 08:52:42,852 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:52:42,853 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:52:42,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:52:42,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:52:42,853 INFO L87 Difference]: Start difference. First operand 953 states and 1399 transitions. Second operand 3 states. [2019-11-25 08:52:42,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:52:42,920 INFO L93 Difference]: Finished difference Result 2120 states and 3124 transitions. [2019-11-25 08:52:42,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:52:42,920 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 122 [2019-11-25 08:52:42,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:52:42,926 INFO L225 Difference]: With dead ends: 2120 [2019-11-25 08:52:42,926 INFO L226 Difference]: Without dead ends: 1186 [2019-11-25 08:52:42,928 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:42,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1186 states. [2019-11-25 08:52:42,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1186 to 1186. [2019-11-25 08:52:42,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1186 states. [2019-11-25 08:52:42,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1186 states to 1186 states and 1744 transitions. [2019-11-25 08:52:42,958 INFO L78 Accepts]: Start accepts. Automaton has 1186 states and 1744 transitions. Word has length 122 [2019-11-25 08:52:42,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:52:42,959 INFO L462 AbstractCegarLoop]: Abstraction has 1186 states and 1744 transitions. [2019-11-25 08:52:42,959 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:52:42,959 INFO L276 IsEmpty]: Start isEmpty. Operand 1186 states and 1744 transitions. [2019-11-25 08:52:42,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-11-25 08:52:42,961 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:52:42,962 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:52:42,962 INFO L410 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:52:42,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:42,962 INFO L82 PathProgramCache]: Analyzing trace with hash -799556719, now seen corresponding path program 1 times [2019-11-25 08:52:42,962 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:52:42,962 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766661937] [2019-11-25 08:52:42,963 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:52:43,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:52:43,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:52:43,328 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:52:43,329 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-25 08:52:43,484 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 08:52:43 BoogieIcfgContainer [2019-11-25 08:52:43,487 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-25 08:52:43,487 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-25 08:52:43,487 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-25 08:52:43,487 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-25 08:52:43,488 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:23" (3/4) ... [2019-11-25 08:52:43,495 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-25 08:52:43,501 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-25 08:52:43,503 INFO L168 Benchmark]: Toolchain (without parser) took 21947.61 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 511.7 MB). Free memory was 938.0 MB in the beginning and 1.4 GB in the end (delta: -496.0 MB). Peak memory consumption was 15.7 MB. Max. memory is 11.5 GB. [2019-11-25 08:52:43,503 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 08:52:43,504 INFO L168 Benchmark]: CACSL2BoogieTranslator took 763.77 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.9 MB). Free memory was 938.0 MB in the beginning and 1.1 GB in the end (delta: -182.2 MB). Peak memory consumption was 23.9 MB. Max. memory is 11.5 GB. [2019-11-25 08:52:43,504 INFO L168 Benchmark]: Boogie Procedure Inliner took 101.71 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. [2019-11-25 08:52:43,504 INFO L168 Benchmark]: Boogie Preprocessor took 114.23 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. [2019-11-25 08:52:43,505 INFO L168 Benchmark]: RCFGBuilder took 1353.98 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: 98.5 MB). Peak memory consumption was 98.5 MB. Max. memory is 11.5 GB. [2019-11-25 08:52:43,505 INFO L168 Benchmark]: TraceAbstraction took 19591.73 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 361.8 MB). Free memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: -425.4 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 08:52:43,505 INFO L168 Benchmark]: Witness Printer took 14.14 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 08:52:43,507 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.27 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 763.77 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.9 MB). Free memory was 938.0 MB in the beginning and 1.1 GB in the end (delta: -182.2 MB). Peak memory consumption was 23.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 101.71 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 114.23 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1353.98 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: 98.5 MB). Peak memory consumption was 98.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 19591.73 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 361.8 MB). Free memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: -425.4 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 14.14 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 1726]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of bitwiseAnd at line 1444. Possible FailurePath: [L1042] static int init = 1; [L1043] static SSL_METHOD SSLv3_server_data ; VAL [init=1, SSLv3_server_data={6: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)) [L1080] BUF_MEM *buf ; [L1081] unsigned long l ; [L1082] unsigned long Time ; [L1083] unsigned long tmp ; [L1084] void (*cb)() ; [L1085] long num1 ; [L1086] int ret ; [L1087] int new_state ; [L1088] int state ; [L1089] int skip ; [L1090] int got_new_session ; [L1091] int tmp___1 = __VERIFIER_nondet_int() ; [L1092] int tmp___2 = __VERIFIER_nondet_int() ; [L1093] int tmp___3 = __VERIFIER_nondet_int() ; [L1094] int tmp___4 = __VERIFIER_nondet_int() ; [L1095] int tmp___5 = __VERIFIER_nondet_int() ; [L1096] int tmp___6 = __VERIFIER_nondet_int() ; [L1097] int tmp___7 ; [L1098] long tmp___8 = __VERIFIER_nondet_long() ; [L1099] int tmp___9 = __VERIFIER_nondet_int() ; [L1100] int tmp___10 = __VERIFIER_nondet_int() ; [L1101] int blastFlag ; [L1105] s->state = 8464 [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={6: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={6:0}] [L1130] EXPR s->cert VAL [init=1, SSLv3_server_data={6:0}] [L1130] COND FALSE !((unsigned long )s->cert == (unsigned long )((void *)0)) [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={6:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={6: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={6: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={6:0}] [L1685] EXPR s->s3 [L1685] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={6:0}] [L1685] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1714] skip = 0 VAL [init=1, SSLv3_server_data={6:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={6:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [init=1, SSLv3_server_data={6: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={6:0}] [L1347] COND FALSE !(ret <= 0) [L1352] s->hit VAL [init=1, SSLv3_server_data={6:0}] [L1352] COND FALSE !(s->hit) [L1355] s->state = 8512 VAL [init=1, SSLv3_server_data={6:0}] [L1357] s->init_num = 0 VAL [init=1, SSLv3_server_data={6:0}] [L1685] EXPR s->s3 [L1685] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={6:0}] [L1685] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1714] skip = 0 VAL [init=1, SSLv3_server_data={6:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={6:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1178] COND TRUE s->state == 8512 [L1361] EXPR s->s3 [L1361] EXPR (s->s3)->tmp.new_cipher [L1361] EXPR ((s->s3)->tmp.new_cipher)->algorithms VAL [init=1, SSLv3_server_data={6:0}] [L1361] COND FALSE !(((s->s3)->tmp.new_cipher)->algorithms & 256UL) [L1364] ret = __VERIFIER_nondet_int() [L1365] COND TRUE blastFlag == 2 [L1366] blastFlag = 6 VAL [init=1, SSLv3_server_data={6:0}] [L1370] COND FALSE !(ret <= 0) VAL [init=1, SSLv3_server_data={6:0}] [L1376] s->state = 8528 [L1377] s->init_num = 0 VAL [init=1, SSLv3_server_data={6:0}] [L1685] EXPR s->s3 [L1685] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={6:0}] [L1685] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1714] skip = 0 VAL [init=1, SSLv3_server_data={6:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={6:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1184] COND TRUE s->state == 8528 [L1381] EXPR s->s3 [L1381] EXPR (s->s3)->tmp.new_cipher [L1381] EXPR ((s->s3)->tmp.new_cipher)->algorithms [L1381] l = ((s->s3)->tmp.new_cipher)->algorithms [L1382] EXPR s->options VAL [init=1, SSLv3_server_data={6:0}] [L1382] COND TRUE s->options & 2097152UL [L1383] EXPR s->s3 [L1383] (s->s3)->tmp.use_rsa_tmp = 1 [L1387] EXPR s->s3 [L1387] (s->s3)->tmp.use_rsa_tmp VAL [init=1, SSLv3_server_data={6:0}] [L1387] COND TRUE (s->s3)->tmp.use_rsa_tmp [L1405] ret = __VERIFIER_nondet_int() [L1406] COND TRUE blastFlag == 6 [L1407] blastFlag = 7 VAL [init=1, SSLv3_server_data={6:0}] [L1411] COND FALSE !(ret <= 0) VAL [init=1, SSLv3_server_data={6:0}] [L1428] s->state = 8544 [L1429] s->init_num = 0 VAL [init=1, SSLv3_server_data={6:0}] [L1685] EXPR s->s3 [L1685] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={6:0}] [L1685] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1714] skip = 0 VAL [init=1, SSLv3_server_data={6:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={6:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1190] COND TRUE s->state == 8544 [L1433] EXPR s->verify_mode VAL [init=1, SSLv3_server_data={6:0}] [L1433] COND TRUE s->verify_mode & 1 [L1434] EXPR s->session [L1434] EXPR (s->session)->peer VAL [init=1, SSLv3_server_data={6:0}] [L1434] COND FALSE !((unsigned long )(s->session)->peer != (unsigned long )((void *)0)) [L1444] EXPR s->s3 [L1444] EXPR (s->s3)->tmp.new_cipher [L1444] EXPR ((s->s3)->tmp.new_cipher)->algorithms VAL [init=1, SSLv3_server_data={6:0}] [L1444] COND FALSE !(((s->s3)->tmp.new_cipher)->algorithms & 256UL) [L1454] EXPR s->s3 [L1454] (s->s3)->tmp.cert_request = 1 [L1455] ret = __VERIFIER_nondet_int() [L1456] COND TRUE blastFlag == 7 VAL [init=1, SSLv3_server_data={6:0}] [L1726] __VERIFIER_error() VAL [init=1, SSLv3_server_data={6:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 148 locations, 1 error locations. Result: UNSAFE, OverallTime: 19.5s, OverallIterations: 45, TraceHistogramMax: 5, AutomataDifference: 15.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 8837 SDtfs, 2842 SDslu, 12828 SDs, 0 SdLazy, 7576 SolverSat, 404 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 12.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 246 GetRequests, 88 SyntacticMatches, 32 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1186occurred in iteration=44, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 44 MinimizatonAttempts, 1099 StatesRemovedByMinimization, 42 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 3473 NumberOfCodeBlocks, 3473 NumberOfCodeBlocksAsserted, 45 NumberOfCheckSat, 3302 ConstructedInterpolants, 0 QuantifiedInterpolants, 774146 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 44 InterpolantComputations, 44 PerfectInterpolantSequences, 1954/1954 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:45,377 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-25 08:52:45,379 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-25 08:52:45,390 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-25 08:52:45,391 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-25 08:52:45,392 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-25 08:52:45,393 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-25 08:52:45,395 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-25 08:52:45,397 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-25 08:52:45,398 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-25 08:52:45,399 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-25 08:52:45,400 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-25 08:52:45,400 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-25 08:52:45,402 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-25 08:52:45,402 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-25 08:52:45,404 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-25 08:52:45,405 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-25 08:52:45,406 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-25 08:52:45,408 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-25 08:52:45,415 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-25 08:52:45,417 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-25 08:52:45,420 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-25 08:52:45,423 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-25 08:52:45,424 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-25 08:52:45,428 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-25 08:52:45,430 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-25 08:52:45,431 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-25 08:52:45,432 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-25 08:52:45,433 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-25 08:52:45,434 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-25 08:52:45,435 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-25 08:52:45,436 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-25 08:52:45,436 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-25 08:52:45,437 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-25 08:52:45,438 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-25 08:52:45,439 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-25 08:52:45,440 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-25 08:52:45,440 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-25 08:52:45,441 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-25 08:52:45,443 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-25 08:52:45,444 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-25 08:52:45,445 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_87130acf-f6be-404f-89bd-c26b22a5f005/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-11-25 08:52:45,469 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-25 08:52:45,470 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-25 08:52:45,471 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-25 08:52:45,472 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-25 08:52:45,472 INFO L138 SettingsManager]: * Use SBE=true [2019-11-25 08:52:45,472 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-25 08:52:45,473 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-25 08:52:45,473 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-25 08:52:45,473 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-25 08:52:45,473 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-25 08:52:45,474 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-25 08:52:45,475 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-25 08:52:45,475 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-25 08:52:45,475 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-25 08:52:45,476 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-25 08:52:45,476 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-25 08:52:45,476 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-25 08:52:45,476 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-25 08:52:45,477 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-25 08:52:45,477 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-25 08:52:45,477 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-25 08:52:45,477 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-25 08:52:45,478 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-25 08:52:45,478 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-25 08:52:45,478 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-25 08:52:45,479 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-25 08:52:45,479 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-25 08:52:45,479 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-25 08:52:45,479 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-25 08:52:45,480 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-25 08:52:45,480 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-25 08:52:45,480 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_87130acf-f6be-404f-89bd-c26b22a5f005/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 -> ca7b987059c829f244238d9119096032ac44debc [2019-11-25 08:52:45,782 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-25 08:52:45,792 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-25 08:52:45,796 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-25 08:52:45,798 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-25 08:52:45,798 INFO L275 PluginConnector]: CDTParser initialized [2019-11-25 08:52:45,799 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_87130acf-f6be-404f-89bd-c26b22a5f005/bin/uautomizer/../../sv-benchmarks/c/ssh/s3_srvr.blast.11.i.cil-1.c [2019-11-25 08:52:45,855 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_87130acf-f6be-404f-89bd-c26b22a5f005/bin/uautomizer/data/31f5fe752/bb97efc4bd7e47cebba16e00cd09e7a6/FLAG0244f382a [2019-11-25 08:52:46,365 INFO L306 CDTParser]: Found 1 translation units. [2019-11-25 08:52:46,366 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_87130acf-f6be-404f-89bd-c26b22a5f005/sv-benchmarks/c/ssh/s3_srvr.blast.11.i.cil-1.c [2019-11-25 08:52:46,387 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_87130acf-f6be-404f-89bd-c26b22a5f005/bin/uautomizer/data/31f5fe752/bb97efc4bd7e47cebba16e00cd09e7a6/FLAG0244f382a [2019-11-25 08:52:46,684 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_87130acf-f6be-404f-89bd-c26b22a5f005/bin/uautomizer/data/31f5fe752/bb97efc4bd7e47cebba16e00cd09e7a6 [2019-11-25 08:52:46,686 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-25 08:52:46,687 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-25 08:52:46,688 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-25 08:52:46,688 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-25 08:52:46,692 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-25 08:52:46,692 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:52:46" (1/1) ... [2019-11-25 08:52:46,695 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@246d7800 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:52:46, skipping insertion in model container [2019-11-25 08:52:46,695 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:52:46" (1/1) ... [2019-11-25 08:52:46,700 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-25 08:52:46,768 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-25 08:52:47,131 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:47,132 INFO L968 CHandler]: at location: C: (SSL_METHOD *)((void *)0) [1038] [2019-11-25 08:52:47,132 INFO L969 CHandler]: current memory model: HoenickeLindenmann_4ByteResolution [2019-11-25 08:52:47,183 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:47,191 INFO L168 Benchmark]: Toolchain (without parser) took 502.81 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 172.5 MB). Free memory was 957.8 MB in the beginning and 1.2 GB in the end (delta: -203.5 MB). Peak memory consumption was 28.4 MB. Max. memory is 11.5 GB. [2019-11-25 08:52:47,192 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 987.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 08:52:47,193 INFO L168 Benchmark]: CACSL2BoogieTranslator took 500.81 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 172.5 MB). Free memory was 957.8 MB in the beginning and 1.2 GB in the end (delta: -203.5 MB). Peak memory consumption was 28.4 MB. Max. memory is 11.5 GB. [2019-11-25 08:52:47,194 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.26 ms. Allocated memory is still 1.0 GB. Free memory is still 987.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 500.81 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 172.5 MB). Free memory was 957.8 MB in the beginning and 1.2 GB in the end (delta: -203.5 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...