./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 678e0110 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_720df207-2908-4742-acdb-a7518bfe149b/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_720df207-2908-4742-acdb-a7518bfe149b/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_720df207-2908-4742-acdb-a7518bfe149b/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_720df207-2908-4742-acdb-a7518bfe149b/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_720df207-2908-4742-acdb-a7518bfe149b/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_720df207-2908-4742-acdb-a7518bfe149b/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_720df207-2908-4742-acdb-a7518bfe149b/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_720df207-2908-4742-acdb-a7518bfe149b/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_720df207-2908-4742-acdb-a7518bfe149b/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_720df207-2908-4742-acdb-a7518bfe149b/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_720df207-2908-4742-acdb-a7518bfe149b/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_720df207-2908-4742-acdb-a7518bfe149b/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 Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-678e011 [2019-11-20 10:37:40,475 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 10:37:40,476 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 10:37:40,487 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 10:37:40,487 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 10:37:40,488 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 10:37:40,489 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 10:37:40,491 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 10:37:40,493 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 10:37:40,494 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 10:37:40,495 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 10:37:40,496 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 10:37:40,496 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 10:37:40,497 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 10:37:40,498 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 10:37:40,499 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 10:37:40,500 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 10:37:40,501 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 10:37:40,503 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 10:37:40,504 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 10:37:40,506 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 10:37:40,507 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 10:37:40,508 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 10:37:40,509 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 10:37:40,511 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 10:37:40,511 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 10:37:40,512 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 10:37:40,512 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 10:37:40,513 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 10:37:40,514 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 10:37:40,514 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 10:37:40,514 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 10:37:40,515 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 10:37:40,516 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 10:37:40,517 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 10:37:40,517 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 10:37:40,517 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 10:37:40,517 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 10:37:40,518 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 10:37:40,518 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 10:37:40,519 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 10:37:40,520 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_720df207-2908-4742-acdb-a7518bfe149b/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-20 10:37:40,532 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 10:37:40,532 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 10:37:40,533 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 10:37:40,533 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 10:37:40,533 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 10:37:40,533 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 10:37:40,534 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 10:37:40,534 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 10:37:40,534 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 10:37:40,534 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 10:37:40,534 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-20 10:37:40,534 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 10:37:40,535 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-20 10:37:40,535 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 10:37:40,535 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 10:37:40,535 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 10:37:40,535 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-20 10:37:40,536 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 10:37:40,536 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 10:37:40,536 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 10:37:40,536 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 10:37:40,536 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 10:37:40,536 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 10:37:40,537 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 10:37:40,537 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-20 10:37:40,537 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-20 10:37:40,537 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-20 10:37:40,537 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-20 10:37:40,538 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_720df207-2908-4742-acdb-a7518bfe149b/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-20 10:37:40,678 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 10:37:40,689 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 10:37:40,692 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 10:37:40,693 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 10:37:40,693 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 10:37:40,694 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_720df207-2908-4742-acdb-a7518bfe149b/bin/uautomizer/../../sv-benchmarks/c/ssh/s3_srvr.blast.11.i.cil-1.c [2019-11-20 10:37:40,755 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_720df207-2908-4742-acdb-a7518bfe149b/bin/uautomizer/data/cd781b7b8/95bc10d4c7cb4c84b14c526d76005fdd/FLAGe01c85f01 [2019-11-20 10:37:41,235 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 10:37:41,236 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_720df207-2908-4742-acdb-a7518bfe149b/sv-benchmarks/c/ssh/s3_srvr.blast.11.i.cil-1.c [2019-11-20 10:37:41,261 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_720df207-2908-4742-acdb-a7518bfe149b/bin/uautomizer/data/cd781b7b8/95bc10d4c7cb4c84b14c526d76005fdd/FLAGe01c85f01 [2019-11-20 10:37:41,485 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_720df207-2908-4742-acdb-a7518bfe149b/bin/uautomizer/data/cd781b7b8/95bc10d4c7cb4c84b14c526d76005fdd [2019-11-20 10:37:41,488 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 10:37:41,489 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 10:37:41,490 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 10:37:41,490 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 10:37:41,493 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 10:37:41,494 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 10:37:41" (1/1) ... [2019-11-20 10:37:41,496 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67a25d1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:37:41, skipping insertion in model container [2019-11-20 10:37:41,497 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 10:37:41" (1/1) ... [2019-11-20 10:37:41,503 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 10:37:41,556 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 10:37:41,997 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 10:37:42,012 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 10:37:42,144 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 10:37:42,174 INFO L192 MainTranslator]: Completed translation [2019-11-20 10:37:42,174 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:37:42 WrapperNode [2019-11-20 10:37:42,175 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 10:37:42,175 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 10:37:42,176 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 10:37:42,176 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 10:37:42,184 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:37:42" (1/1) ... [2019-11-20 10:37:42,222 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:37:42" (1/1) ... [2019-11-20 10:37:42,299 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 10:37:42,301 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 10:37:42,301 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 10:37:42,301 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 10:37:42,310 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:37:42" (1/1) ... [2019-11-20 10:37:42,310 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:37:42" (1/1) ... [2019-11-20 10:37:42,330 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:37:42" (1/1) ... [2019-11-20 10:37:42,335 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:37:42" (1/1) ... [2019-11-20 10:37:42,427 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:37:42" (1/1) ... [2019-11-20 10:37:42,449 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:37:42" (1/1) ... [2019-11-20 10:37:42,459 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:37:42" (1/1) ... [2019-11-20 10:37:42,470 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 10:37:42,472 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 10:37:42,472 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 10:37:42,472 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 10:37:42,473 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:37:42" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_720df207-2908-4742-acdb-a7518bfe149b/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 10:37:42,545 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-20 10:37:42,545 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-20 10:37:42,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-20 10:37:42,546 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-20 10:37:42,547 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-20 10:37:42,547 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-20 10:37:42,547 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 10:37:42,547 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 10:37:42,825 WARN L736 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-20 10:37:43,832 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2019-11-20 10:37:43,833 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2019-11-20 10:37:43,834 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 10:37:43,834 INFO L285 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-20 10:37:43,835 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:37:43 BoogieIcfgContainer [2019-11-20 10:37:43,835 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 10:37:43,836 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-20 10:37:43,836 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-20 10:37:43,839 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-20 10:37:43,839 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 10:37:41" (1/3) ... [2019-11-20 10:37:43,840 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18a2a82a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 10:37:43, skipping insertion in model container [2019-11-20 10:37:43,840 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:37:42" (2/3) ... [2019-11-20 10:37:43,840 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18a2a82a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 10:37:43, skipping insertion in model container [2019-11-20 10:37:43,840 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:37:43" (3/3) ... [2019-11-20 10:37:43,842 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.11.i.cil-1.c [2019-11-20 10:37:43,851 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-20 10:37:43,857 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-20 10:37:43,867 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-20 10:37:43,889 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-20 10:37:43,889 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-20 10:37:43,889 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-20 10:37:43,889 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 10:37:43,889 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 10:37:43,890 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-20 10:37:43,890 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 10:37:43,890 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-20 10:37:43,907 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states. [2019-11-20 10:37:43,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-20 10:37:43,915 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:37:43,915 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-20 10:37:43,916 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:37:43,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:37:43,921 INFO L82 PathProgramCache]: Analyzing trace with hash -2031756972, now seen corresponding path program 1 times [2019-11-20 10:37:43,929 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:37:43,929 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737779651] [2019-11-20 10:37:43,930 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:37:44,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:37:44,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:37:44,195 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737779651] [2019-11-20 10:37:44,195 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:37:44,196 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:37:44,196 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056345323] [2019-11-20 10:37:44,200 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:37:44,200 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:37:44,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:37:44,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:37:44,215 INFO L87 Difference]: Start difference. First operand 148 states. Second operand 4 states. [2019-11-20 10:37:44,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:37:44,716 INFO L93 Difference]: Finished difference Result 323 states and 547 transitions. [2019-11-20 10:37:44,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:37:44,718 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2019-11-20 10:37:44,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:37:44,737 INFO L225 Difference]: With dead ends: 323 [2019-11-20 10:37:44,737 INFO L226 Difference]: Without dead ends: 163 [2019-11-20 10:37:44,741 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:37:44,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-11-20 10:37:44,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 146. [2019-11-20 10:37:44,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-11-20 10:37:44,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 226 transitions. [2019-11-20 10:37:44,802 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 226 transitions. Word has length 35 [2019-11-20 10:37:44,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:37:44,802 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 226 transitions. [2019-11-20 10:37:44,802 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:37:44,802 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 226 transitions. [2019-11-20 10:37:44,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-11-20 10:37:44,804 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:37:44,804 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-20 10:37:44,805 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:37:44,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:37:44,805 INFO L82 PathProgramCache]: Analyzing trace with hash 2027967358, now seen corresponding path program 1 times [2019-11-20 10:37:44,805 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:37:44,805 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772258844] [2019-11-20 10:37:44,806 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:37:44,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:37:44,992 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:37:44,993 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772258844] [2019-11-20 10:37:44,993 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:37:44,993 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:37:44,994 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550929833] [2019-11-20 10:37:44,995 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:37:44,995 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:37:44,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:37:44,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:37:44,996 INFO L87 Difference]: Start difference. First operand 146 states and 226 transitions. Second operand 4 states. [2019-11-20 10:37:45,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:37:45,443 INFO L93 Difference]: Finished difference Result 290 states and 443 transitions. [2019-11-20 10:37:45,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:37:45,444 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 48 [2019-11-20 10:37:45,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:37:45,446 INFO L225 Difference]: With dead ends: 290 [2019-11-20 10:37:45,446 INFO L226 Difference]: Without dead ends: 163 [2019-11-20 10:37:45,447 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:37:45,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-11-20 10:37:45,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 146. [2019-11-20 10:37:45,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-11-20 10:37:45,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 225 transitions. [2019-11-20 10:37:45,459 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 225 transitions. Word has length 48 [2019-11-20 10:37:45,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:37:45,460 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 225 transitions. [2019-11-20 10:37:45,460 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:37:45,460 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 225 transitions. [2019-11-20 10:37:45,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-20 10:37:45,462 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:37:45,462 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-20 10:37:45,463 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:37:45,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:37:45,463 INFO L82 PathProgramCache]: Analyzing trace with hash -1944321008, now seen corresponding path program 1 times [2019-11-20 10:37:45,463 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:37:45,464 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656954738] [2019-11-20 10:37:45,464 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:37:45,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:37:45,616 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:37:45,617 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656954738] [2019-11-20 10:37:45,617 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:37:45,617 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:37:45,617 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559446463] [2019-11-20 10:37:45,618 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:37:45,618 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:37:45,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:37:45,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:37:45,618 INFO L87 Difference]: Start difference. First operand 146 states and 225 transitions. Second operand 4 states. [2019-11-20 10:37:46,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:37:46,006 INFO L93 Difference]: Finished difference Result 289 states and 441 transitions. [2019-11-20 10:37:46,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:37:46,006 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2019-11-20 10:37:46,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:37:46,008 INFO L225 Difference]: With dead ends: 289 [2019-11-20 10:37:46,008 INFO L226 Difference]: Without dead ends: 162 [2019-11-20 10:37:46,009 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:37:46,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-11-20 10:37:46,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 146. [2019-11-20 10:37:46,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-11-20 10:37:46,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 224 transitions. [2019-11-20 10:37:46,018 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 224 transitions. Word has length 49 [2019-11-20 10:37:46,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:37:46,018 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 224 transitions. [2019-11-20 10:37:46,019 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:37:46,019 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 224 transitions. [2019-11-20 10:37:46,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-20 10:37:46,020 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:37:46,020 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-20 10:37:46,021 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:37:46,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:37:46,021 INFO L82 PathProgramCache]: Analyzing trace with hash -2008072389, now seen corresponding path program 1 times [2019-11-20 10:37:46,021 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:37:46,021 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674580992] [2019-11-20 10:37:46,021 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:37:46,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:37:46,110 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:37:46,111 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674580992] [2019-11-20 10:37:46,111 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:37:46,112 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:37:46,112 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102752972] [2019-11-20 10:37:46,113 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:37:46,114 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:37:46,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:37:46,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:37:46,114 INFO L87 Difference]: Start difference. First operand 146 states and 224 transitions. Second operand 4 states. [2019-11-20 10:37:46,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:37:46,432 INFO L93 Difference]: Finished difference Result 287 states and 438 transitions. [2019-11-20 10:37:46,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:37:46,433 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2019-11-20 10:37:46,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:37:46,434 INFO L225 Difference]: With dead ends: 287 [2019-11-20 10:37:46,434 INFO L226 Difference]: Without dead ends: 160 [2019-11-20 10:37:46,435 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:37:46,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-11-20 10:37:46,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 146. [2019-11-20 10:37:46,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-11-20 10:37:46,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 223 transitions. [2019-11-20 10:37:46,447 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 223 transitions. Word has length 49 [2019-11-20 10:37:46,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:37:46,448 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 223 transitions. [2019-11-20 10:37:46,448 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:37:46,448 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 223 transitions. [2019-11-20 10:37:46,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-20 10:37:46,449 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:37:46,449 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-20 10:37:46,450 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:37:46,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:37:46,450 INFO L82 PathProgramCache]: Analyzing trace with hash -1467926917, now seen corresponding path program 1 times [2019-11-20 10:37:46,450 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:37:46,450 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470702508] [2019-11-20 10:37:46,451 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:37:46,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:37:46,521 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:37:46,521 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470702508] [2019-11-20 10:37:46,521 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:37:46,522 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:37:46,522 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481302618] [2019-11-20 10:37:46,522 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:37:46,522 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:37:46,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:37:46,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:37:46,523 INFO L87 Difference]: Start difference. First operand 146 states and 223 transitions. Second operand 4 states. [2019-11-20 10:37:46,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:37:46,840 INFO L93 Difference]: Finished difference Result 286 states and 436 transitions. [2019-11-20 10:37:46,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:37:46,841 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2019-11-20 10:37:46,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:37:46,842 INFO L225 Difference]: With dead ends: 286 [2019-11-20 10:37:46,842 INFO L226 Difference]: Without dead ends: 159 [2019-11-20 10:37:46,843 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:37:46,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-11-20 10:37:46,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 146. [2019-11-20 10:37:46,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-11-20 10:37:46,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 222 transitions. [2019-11-20 10:37:46,850 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 222 transitions. Word has length 49 [2019-11-20 10:37:46,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:37:46,850 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 222 transitions. [2019-11-20 10:37:46,851 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:37:46,851 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 222 transitions. [2019-11-20 10:37:46,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-20 10:37:46,852 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:37:46,852 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-20 10:37:46,852 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:37:46,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:37:46,853 INFO L82 PathProgramCache]: Analyzing trace with hash -1078741852, now seen corresponding path program 1 times [2019-11-20 10:37:46,853 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:37:46,853 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881843758] [2019-11-20 10:37:46,854 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:37:46,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:37:46,913 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:37:46,913 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881843758] [2019-11-20 10:37:46,913 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:37:46,913 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:37:46,914 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16230422] [2019-11-20 10:37:46,914 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:37:46,914 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:37:46,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:37:46,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:37:46,915 INFO L87 Difference]: Start difference. First operand 146 states and 222 transitions. Second operand 4 states. [2019-11-20 10:37:47,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:37:47,192 INFO L93 Difference]: Finished difference Result 286 states and 435 transitions. [2019-11-20 10:37:47,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:37:47,196 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2019-11-20 10:37:47,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:37:47,197 INFO L225 Difference]: With dead ends: 286 [2019-11-20 10:37:47,197 INFO L226 Difference]: Without dead ends: 159 [2019-11-20 10:37:47,198 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:37:47,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-11-20 10:37:47,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 146. [2019-11-20 10:37:47,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-11-20 10:37:47,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 221 transitions. [2019-11-20 10:37:47,203 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 221 transitions. Word has length 49 [2019-11-20 10:37:47,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:37:47,204 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 221 transitions. [2019-11-20 10:37:47,204 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:37:47,204 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 221 transitions. [2019-11-20 10:37:47,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-20 10:37:47,205 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:37:47,205 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-20 10:37:47,205 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:37:47,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:37:47,206 INFO L82 PathProgramCache]: Analyzing trace with hash 231094087, now seen corresponding path program 1 times [2019-11-20 10:37:47,206 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:37:47,206 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416607598] [2019-11-20 10:37:47,207 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:37:47,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:37:47,257 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:37:47,257 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416607598] [2019-11-20 10:37:47,257 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:37:47,257 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:37:47,258 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195297847] [2019-11-20 10:37:47,258 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:37:47,258 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:37:47,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:37:47,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:37:47,259 INFO L87 Difference]: Start difference. First operand 146 states and 221 transitions. Second operand 4 states. [2019-11-20 10:37:47,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:37:47,552 INFO L93 Difference]: Finished difference Result 286 states and 434 transitions. [2019-11-20 10:37:47,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:37:47,552 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2019-11-20 10:37:47,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:37:47,553 INFO L225 Difference]: With dead ends: 286 [2019-11-20 10:37:47,553 INFO L226 Difference]: Without dead ends: 159 [2019-11-20 10:37:47,554 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:37:47,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-11-20 10:37:47,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 146. [2019-11-20 10:37:47,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-11-20 10:37:47,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 220 transitions. [2019-11-20 10:37:47,558 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 220 transitions. Word has length 50 [2019-11-20 10:37:47,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:37:47,559 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 220 transitions. [2019-11-20 10:37:47,559 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:37:47,559 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 220 transitions. [2019-11-20 10:37:47,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-20 10:37:47,559 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:37:47,560 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-20 10:37:47,560 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:37:47,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:37:47,560 INFO L82 PathProgramCache]: Analyzing trace with hash 1862851913, now seen corresponding path program 1 times [2019-11-20 10:37:47,560 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:37:47,560 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649663269] [2019-11-20 10:37:47,561 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:37:47,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:37:47,607 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:37:47,608 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649663269] [2019-11-20 10:37:47,608 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:37:47,608 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:37:47,608 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993821576] [2019-11-20 10:37:47,609 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:37:47,609 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:37:47,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:37:47,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:37:47,610 INFO L87 Difference]: Start difference. First operand 146 states and 220 transitions. Second operand 4 states. [2019-11-20 10:37:47,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:37:47,945 INFO L93 Difference]: Finished difference Result 286 states and 433 transitions. [2019-11-20 10:37:47,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:37:47,946 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 51 [2019-11-20 10:37:47,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:37:47,947 INFO L225 Difference]: With dead ends: 286 [2019-11-20 10:37:47,947 INFO L226 Difference]: Without dead ends: 159 [2019-11-20 10:37:47,948 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:37:47,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-11-20 10:37:47,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 146. [2019-11-20 10:37:47,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-11-20 10:37:47,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 219 transitions. [2019-11-20 10:37:47,953 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 219 transitions. Word has length 51 [2019-11-20 10:37:47,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:37:47,953 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 219 transitions. [2019-11-20 10:37:47,953 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:37:47,954 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 219 transitions. [2019-11-20 10:37:47,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-20 10:37:47,954 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:37:47,955 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-20 10:37:47,955 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:37:47,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:37:47,955 INFO L82 PathProgramCache]: Analyzing trace with hash 589286348, now seen corresponding path program 1 times [2019-11-20 10:37:47,955 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:37:47,956 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644752259] [2019-11-20 10:37:47,956 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:37:47,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:37:48,009 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:37:48,010 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644752259] [2019-11-20 10:37:48,010 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:37:48,010 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:37:48,011 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054552305] [2019-11-20 10:37:48,012 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:37:48,013 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:37:48,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:37:48,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:37:48,013 INFO L87 Difference]: Start difference. First operand 146 states and 219 transitions. Second operand 4 states. [2019-11-20 10:37:48,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:37:48,246 INFO L93 Difference]: Finished difference Result 276 states and 419 transitions. [2019-11-20 10:37:48,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:37:48,247 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2019-11-20 10:37:48,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:37:48,248 INFO L225 Difference]: With dead ends: 276 [2019-11-20 10:37:48,248 INFO L226 Difference]: Without dead ends: 149 [2019-11-20 10:37:48,248 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:37:48,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-11-20 10:37:48,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 146. [2019-11-20 10:37:48,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-11-20 10:37:48,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 218 transitions. [2019-11-20 10:37:48,253 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 218 transitions. Word has length 52 [2019-11-20 10:37:48,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:37:48,253 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 218 transitions. [2019-11-20 10:37:48,253 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:37:48,253 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 218 transitions. [2019-11-20 10:37:48,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-20 10:37:48,254 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:37:48,254 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-20 10:37:48,254 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:37:48,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:37:48,255 INFO L82 PathProgramCache]: Analyzing trace with hash -350273228, now seen corresponding path program 1 times [2019-11-20 10:37:48,255 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:37:48,255 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037722495] [2019-11-20 10:37:48,255 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:37:48,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:37:48,325 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:37:48,325 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037722495] [2019-11-20 10:37:48,325 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:37:48,326 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:37:48,326 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922727675] [2019-11-20 10:37:48,326 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:37:48,326 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:37:48,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:37:48,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:37:48,327 INFO L87 Difference]: Start difference. First operand 146 states and 218 transitions. Second operand 4 states. [2019-11-20 10:37:48,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:37:48,588 INFO L93 Difference]: Finished difference Result 316 states and 480 transitions. [2019-11-20 10:37:48,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:37:48,588 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2019-11-20 10:37:48,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:37:48,590 INFO L225 Difference]: With dead ends: 316 [2019-11-20 10:37:48,590 INFO L226 Difference]: Without dead ends: 189 [2019-11-20 10:37:48,591 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:37:48,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-11-20 10:37:48,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 168. [2019-11-20 10:37:48,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-11-20 10:37:48,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 256 transitions. [2019-11-20 10:37:48,596 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 256 transitions. Word has length 52 [2019-11-20 10:37:48,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:37:48,597 INFO L462 AbstractCegarLoop]: Abstraction has 168 states and 256 transitions. [2019-11-20 10:37:48,597 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:37:48,597 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 256 transitions. [2019-11-20 10:37:48,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-20 10:37:48,598 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:37:48,598 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-20 10:37:48,598 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:37:48,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:37:48,598 INFO L82 PathProgramCache]: Analyzing trace with hash 1467398046, now seen corresponding path program 1 times [2019-11-20 10:37:48,598 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:37:48,599 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294803627] [2019-11-20 10:37:48,599 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:37:48,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:37:48,668 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:37:48,669 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294803627] [2019-11-20 10:37:48,669 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:37:48,669 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:37:48,669 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387863476] [2019-11-20 10:37:48,670 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:37:48,670 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:37:48,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:37:48,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:37:48,671 INFO L87 Difference]: Start difference. First operand 168 states and 256 transitions. Second operand 4 states. [2019-11-20 10:37:49,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:37:49,014 INFO L93 Difference]: Finished difference Result 338 states and 517 transitions. [2019-11-20 10:37:49,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:37:49,015 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-11-20 10:37:49,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:37:49,016 INFO L225 Difference]: With dead ends: 338 [2019-11-20 10:37:49,016 INFO L226 Difference]: Without dead ends: 189 [2019-11-20 10:37:49,017 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:37:49,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-11-20 10:37:49,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 168. [2019-11-20 10:37:49,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-11-20 10:37:49,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 255 transitions. [2019-11-20 10:37:49,022 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 255 transitions. Word has length 65 [2019-11-20 10:37:49,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:37:49,022 INFO L462 AbstractCegarLoop]: Abstraction has 168 states and 255 transitions. [2019-11-20 10:37:49,022 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:37:49,023 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 255 transitions. [2019-11-20 10:37:49,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-20 10:37:49,024 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:37:49,025 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-20 10:37:49,025 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:37:49,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:37:49,025 INFO L82 PathProgramCache]: Analyzing trace with hash -2142100496, now seen corresponding path program 1 times [2019-11-20 10:37:49,025 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:37:49,026 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279527249] [2019-11-20 10:37:49,026 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:37:49,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:37:49,089 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:37:49,089 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279527249] [2019-11-20 10:37:49,089 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:37:49,090 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:37:49,090 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295816147] [2019-11-20 10:37:49,090 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:37:49,090 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:37:49,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:37:49,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:37:49,091 INFO L87 Difference]: Start difference. First operand 168 states and 255 transitions. Second operand 4 states. [2019-11-20 10:37:49,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:37:49,406 INFO L93 Difference]: Finished difference Result 337 states and 514 transitions. [2019-11-20 10:37:49,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:37:49,406 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-11-20 10:37:49,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:37:49,408 INFO L225 Difference]: With dead ends: 337 [2019-11-20 10:37:49,408 INFO L226 Difference]: Without dead ends: 188 [2019-11-20 10:37:49,408 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:37:49,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2019-11-20 10:37:49,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 168. [2019-11-20 10:37:49,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-11-20 10:37:49,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 254 transitions. [2019-11-20 10:37:49,413 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 254 transitions. Word has length 66 [2019-11-20 10:37:49,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:37:49,414 INFO L462 AbstractCegarLoop]: Abstraction has 168 states and 254 transitions. [2019-11-20 10:37:49,414 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:37:49,414 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 254 transitions. [2019-11-20 10:37:49,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-20 10:37:49,415 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:37:49,415 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-20 10:37:49,415 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:37:49,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:37:49,420 INFO L82 PathProgramCache]: Analyzing trace with hash 2089115419, now seen corresponding path program 1 times [2019-11-20 10:37:49,420 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:37:49,420 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092758459] [2019-11-20 10:37:49,420 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:37:49,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:37:49,472 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:37:49,473 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092758459] [2019-11-20 10:37:49,473 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:37:49,473 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:37:49,474 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500496336] [2019-11-20 10:37:49,474 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:37:49,474 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:37:49,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:37:49,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:37:49,475 INFO L87 Difference]: Start difference. First operand 168 states and 254 transitions. Second operand 4 states. [2019-11-20 10:37:49,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:37:49,831 INFO L93 Difference]: Finished difference Result 335 states and 510 transitions. [2019-11-20 10:37:49,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:37:49,832 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-11-20 10:37:49,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:37:49,833 INFO L225 Difference]: With dead ends: 335 [2019-11-20 10:37:49,833 INFO L226 Difference]: Without dead ends: 186 [2019-11-20 10:37:49,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-20 10:37:49,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-11-20 10:37:49,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 168. [2019-11-20 10:37:49,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-11-20 10:37:49,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 253 transitions. [2019-11-20 10:37:49,839 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 253 transitions. Word has length 66 [2019-11-20 10:37:49,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:37:49,839 INFO L462 AbstractCegarLoop]: Abstraction has 168 states and 253 transitions. [2019-11-20 10:37:49,839 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:37:49,840 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 253 transitions. [2019-11-20 10:37:49,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-20 10:37:49,840 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:37:49,840 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-20 10:37:49,841 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:37:49,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:37:49,841 INFO L82 PathProgramCache]: Analyzing trace with hash -1665706405, now seen corresponding path program 1 times [2019-11-20 10:37:49,841 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:37:49,841 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99778400] [2019-11-20 10:37:49,841 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:37:49,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:37:49,895 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:37:49,895 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99778400] [2019-11-20 10:37:49,895 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:37:49,896 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:37:49,896 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500681205] [2019-11-20 10:37:49,896 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:37:49,896 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:37:49,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:37:49,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:37:49,897 INFO L87 Difference]: Start difference. First operand 168 states and 253 transitions. Second operand 4 states. [2019-11-20 10:37:50,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:37:50,235 INFO L93 Difference]: Finished difference Result 334 states and 507 transitions. [2019-11-20 10:37:50,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:37:50,235 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-11-20 10:37:50,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:37:50,236 INFO L225 Difference]: With dead ends: 334 [2019-11-20 10:37:50,236 INFO L226 Difference]: Without dead ends: 185 [2019-11-20 10:37:50,237 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:37:50,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-11-20 10:37:50,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 168. [2019-11-20 10:37:50,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-11-20 10:37:50,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 252 transitions. [2019-11-20 10:37:50,242 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 252 transitions. Word has length 66 [2019-11-20 10:37:50,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:37:50,242 INFO L462 AbstractCegarLoop]: Abstraction has 168 states and 252 transitions. [2019-11-20 10:37:50,242 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:37:50,242 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 252 transitions. [2019-11-20 10:37:50,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-20 10:37:50,243 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:37:50,243 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-20 10:37:50,243 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:37:50,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:37:50,243 INFO L82 PathProgramCache]: Analyzing trace with hash -1276521340, now seen corresponding path program 1 times [2019-11-20 10:37:50,244 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:37:50,244 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099323418] [2019-11-20 10:37:50,244 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:37:50,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:37:50,315 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:37:50,315 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099323418] [2019-11-20 10:37:50,315 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:37:50,315 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:37:50,316 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340196465] [2019-11-20 10:37:50,316 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:37:50,316 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:37:50,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:37:50,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:37:50,316 INFO L87 Difference]: Start difference. First operand 168 states and 252 transitions. Second operand 4 states. [2019-11-20 10:37:50,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:37:50,685 INFO L93 Difference]: Finished difference Result 334 states and 505 transitions. [2019-11-20 10:37:50,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:37:50,686 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-11-20 10:37:50,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:37:50,687 INFO L225 Difference]: With dead ends: 334 [2019-11-20 10:37:50,687 INFO L226 Difference]: Without dead ends: 185 [2019-11-20 10:37:50,688 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:37:50,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-11-20 10:37:50,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 168. [2019-11-20 10:37:50,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-11-20 10:37:50,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 251 transitions. [2019-11-20 10:37:50,693 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 251 transitions. Word has length 66 [2019-11-20 10:37:50,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:37:50,693 INFO L462 AbstractCegarLoop]: Abstraction has 168 states and 251 transitions. [2019-11-20 10:37:50,693 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:37:50,693 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 251 transitions. [2019-11-20 10:37:50,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-20 10:37:50,694 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:37:50,694 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-20 10:37:50,694 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:37:50,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:37:50,695 INFO L82 PathProgramCache]: Analyzing trace with hash -1605102745, now seen corresponding path program 1 times [2019-11-20 10:37:50,695 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:37:50,695 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401406804] [2019-11-20 10:37:50,695 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:37:50,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:37:50,738 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:37:50,738 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401406804] [2019-11-20 10:37:50,738 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:37:50,738 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:37:50,739 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150544132] [2019-11-20 10:37:50,739 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:37:50,739 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:37:50,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:37:50,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:37:50,740 INFO L87 Difference]: Start difference. First operand 168 states and 251 transitions. Second operand 4 states. [2019-11-20 10:37:51,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:37:51,074 INFO L93 Difference]: Finished difference Result 334 states and 503 transitions. [2019-11-20 10:37:51,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:37:51,075 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2019-11-20 10:37:51,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:37:51,076 INFO L225 Difference]: With dead ends: 334 [2019-11-20 10:37:51,076 INFO L226 Difference]: Without dead ends: 185 [2019-11-20 10:37:51,077 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:37:51,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-11-20 10:37:51,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 168. [2019-11-20 10:37:51,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-11-20 10:37:51,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 250 transitions. [2019-11-20 10:37:51,081 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 250 transitions. Word has length 67 [2019-11-20 10:37:51,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:37:51,082 INFO L462 AbstractCegarLoop]: Abstraction has 168 states and 250 transitions. [2019-11-20 10:37:51,082 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:37:51,082 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 250 transitions. [2019-11-20 10:37:51,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-11-20 10:37:51,083 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:37:51,083 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-20 10:37:51,083 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:37:51,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:37:51,087 INFO L82 PathProgramCache]: Analyzing trace with hash 775324969, now seen corresponding path program 1 times [2019-11-20 10:37:51,087 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:37:51,087 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574026592] [2019-11-20 10:37:51,087 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:37:51,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:37:51,140 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:37:51,141 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574026592] [2019-11-20 10:37:51,143 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:37:51,144 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:37:51,144 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867131149] [2019-11-20 10:37:51,144 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:37:51,144 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:37:51,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:37:51,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:37:51,145 INFO L87 Difference]: Start difference. First operand 168 states and 250 transitions. Second operand 4 states. [2019-11-20 10:37:51,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:37:51,472 INFO L93 Difference]: Finished difference Result 334 states and 501 transitions. [2019-11-20 10:37:51,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:37:51,475 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2019-11-20 10:37:51,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:37:51,476 INFO L225 Difference]: With dead ends: 334 [2019-11-20 10:37:51,476 INFO L226 Difference]: Without dead ends: 185 [2019-11-20 10:37:51,477 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:37:51,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-11-20 10:37:51,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 168. [2019-11-20 10:37:51,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-11-20 10:37:51,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 249 transitions. [2019-11-20 10:37:51,482 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 249 transitions. Word has length 68 [2019-11-20 10:37:51,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:37:51,482 INFO L462 AbstractCegarLoop]: Abstraction has 168 states and 249 transitions. [2019-11-20 10:37:51,482 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:37:51,482 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 249 transitions. [2019-11-20 10:37:51,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-11-20 10:37:51,483 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:37:51,483 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-20 10:37:51,485 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:37:51,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:37:51,485 INFO L82 PathProgramCache]: Analyzing trace with hash 1235689452, now seen corresponding path program 1 times [2019-11-20 10:37:51,485 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:37:51,485 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436313066] [2019-11-20 10:37:51,485 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:37:51,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:37:51,536 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:37:51,536 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436313066] [2019-11-20 10:37:51,537 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:37:51,537 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:37:51,537 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467155724] [2019-11-20 10:37:51,537 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:37:51,537 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:37:51,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:37:51,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:37:51,538 INFO L87 Difference]: Start difference. First operand 168 states and 249 transitions. Second operand 4 states. [2019-11-20 10:37:51,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:37:51,834 INFO L93 Difference]: Finished difference Result 324 states and 486 transitions. [2019-11-20 10:37:51,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:37:51,834 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 69 [2019-11-20 10:37:51,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:37:51,836 INFO L225 Difference]: With dead ends: 324 [2019-11-20 10:37:51,836 INFO L226 Difference]: Without dead ends: 175 [2019-11-20 10:37:51,836 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:37:51,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2019-11-20 10:37:51,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 168. [2019-11-20 10:37:51,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-11-20 10:37:51,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 248 transitions. [2019-11-20 10:37:51,841 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 248 transitions. Word has length 69 [2019-11-20 10:37:51,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:37:51,842 INFO L462 AbstractCegarLoop]: Abstraction has 168 states and 248 transitions. [2019-11-20 10:37:51,842 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:37:51,842 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 248 transitions. [2019-11-20 10:37:51,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-11-20 10:37:51,843 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:37:51,844 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-20 10:37:51,844 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:37:51,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:37:51,844 INFO L82 PathProgramCache]: Analyzing trace with hash -1988306166, now seen corresponding path program 1 times [2019-11-20 10:37:51,844 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:37:51,844 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023216638] [2019-11-20 10:37:51,845 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:37:51,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:37:51,922 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 10:37:51,922 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023216638] [2019-11-20 10:37:51,922 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:37:51,922 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:37:51,923 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468482161] [2019-11-20 10:37:51,924 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:37:51,924 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:37:51,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:37:51,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:37:51,925 INFO L87 Difference]: Start difference. First operand 168 states and 248 transitions. Second operand 4 states. [2019-11-20 10:37:52,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:37:52,425 INFO L93 Difference]: Finished difference Result 424 states and 639 transitions. [2019-11-20 10:37:52,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:37:52,425 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 74 [2019-11-20 10:37:52,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:37:52,427 INFO L225 Difference]: With dead ends: 424 [2019-11-20 10:37:52,427 INFO L226 Difference]: Without dead ends: 275 [2019-11-20 10:37:52,428 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:37:52,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2019-11-20 10:37:52,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 198. [2019-11-20 10:37:52,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2019-11-20 10:37:52,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 300 transitions. [2019-11-20 10:37:52,434 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 300 transitions. Word has length 74 [2019-11-20 10:37:52,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:37:52,434 INFO L462 AbstractCegarLoop]: Abstraction has 198 states and 300 transitions. [2019-11-20 10:37:52,434 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:37:52,435 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 300 transitions. [2019-11-20 10:37:52,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-11-20 10:37:52,435 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:37:52,436 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-20 10:37:52,436 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:37:52,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:37:52,436 INFO L82 PathProgramCache]: Analyzing trace with hash -2060692724, now seen corresponding path program 1 times [2019-11-20 10:37:52,436 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:37:52,437 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880813466] [2019-11-20 10:37:52,437 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:37:52,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:37:52,497 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 10:37:52,497 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880813466] [2019-11-20 10:37:52,497 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:37:52,497 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:37:52,498 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88699274] [2019-11-20 10:37:52,498 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:37:52,498 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:37:52,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:37:52,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:37:52,499 INFO L87 Difference]: Start difference. First operand 198 states and 300 transitions. Second operand 4 states. [2019-11-20 10:37:52,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:37:52,922 INFO L93 Difference]: Finished difference Result 427 states and 655 transitions. [2019-11-20 10:37:52,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:37:52,923 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 74 [2019-11-20 10:37:52,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:37:52,925 INFO L225 Difference]: With dead ends: 427 [2019-11-20 10:37:52,925 INFO L226 Difference]: Without dead ends: 248 [2019-11-20 10:37:52,926 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:37:52,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2019-11-20 10:37:52,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 222. [2019-11-20 10:37:52,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2019-11-20 10:37:52,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 342 transitions. [2019-11-20 10:37:52,932 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 342 transitions. Word has length 74 [2019-11-20 10:37:52,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:37:52,933 INFO L462 AbstractCegarLoop]: Abstraction has 222 states and 342 transitions. [2019-11-20 10:37:52,933 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:37:52,933 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 342 transitions. [2019-11-20 10:37:52,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-11-20 10:37:52,934 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:37:52,934 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-20 10:37:52,934 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:37:52,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:37:52,935 INFO L82 PathProgramCache]: Analyzing trace with hash 880688961, now seen corresponding path program 1 times [2019-11-20 10:37:52,935 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:37:52,935 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484046399] [2019-11-20 10:37:52,935 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:37:52,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:37:52,994 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 10:37:52,994 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484046399] [2019-11-20 10:37:52,994 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:37:52,995 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:37:52,995 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176999487] [2019-11-20 10:37:52,995 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:37:52,995 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:37:52,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:37:52,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:37:52,996 INFO L87 Difference]: Start difference. First operand 222 states and 342 transitions. Second operand 4 states. [2019-11-20 10:37:53,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:37:53,475 INFO L93 Difference]: Finished difference Result 494 states and 761 transitions. [2019-11-20 10:37:53,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:37:53,476 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2019-11-20 10:37:53,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:37:53,478 INFO L225 Difference]: With dead ends: 494 [2019-11-20 10:37:53,478 INFO L226 Difference]: Without dead ends: 291 [2019-11-20 10:37:53,478 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:37:53,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2019-11-20 10:37:53,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 223. [2019-11-20 10:37:53,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2019-11-20 10:37:53,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 343 transitions. [2019-11-20 10:37:53,485 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 343 transitions. Word has length 75 [2019-11-20 10:37:53,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:37:53,486 INFO L462 AbstractCegarLoop]: Abstraction has 223 states and 343 transitions. [2019-11-20 10:37:53,486 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:37:53,486 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 343 transitions. [2019-11-20 10:37:53,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-11-20 10:37:53,487 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:37:53,487 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-20 10:37:53,487 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:37:53,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:37:53,488 INFO L82 PathProgramCache]: Analyzing trace with hash 301633263, now seen corresponding path program 1 times [2019-11-20 10:37:53,488 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:37:53,488 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660138794] [2019-11-20 10:37:53,488 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:37:53,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:37:53,562 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 10:37:53,563 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660138794] [2019-11-20 10:37:53,563 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:37:53,563 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:37:53,564 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253372060] [2019-11-20 10:37:53,564 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:37:53,564 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:37:53,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:37:53,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:37:53,565 INFO L87 Difference]: Start difference. First operand 223 states and 343 transitions. Second operand 4 states. [2019-11-20 10:37:54,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:37:54,076 INFO L93 Difference]: Finished difference Result 495 states and 761 transitions. [2019-11-20 10:37:54,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:37:54,077 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2019-11-20 10:37:54,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:37:54,079 INFO L225 Difference]: With dead ends: 495 [2019-11-20 10:37:54,079 INFO L226 Difference]: Without dead ends: 291 [2019-11-20 10:37:54,080 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:37:54,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2019-11-20 10:37:54,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 233. [2019-11-20 10:37:54,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2019-11-20 10:37:54,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 362 transitions. [2019-11-20 10:37:54,087 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 362 transitions. Word has length 81 [2019-11-20 10:37:54,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:37:54,087 INFO L462 AbstractCegarLoop]: Abstraction has 233 states and 362 transitions. [2019-11-20 10:37:54,088 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:37:54,088 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 362 transitions. [2019-11-20 10:37:54,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-11-20 10:37:54,088 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:37:54,089 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-20 10:37:54,089 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:37:54,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:37:54,089 INFO L82 PathProgramCache]: Analyzing trace with hash 542590269, now seen corresponding path program 1 times [2019-11-20 10:37:54,089 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:37:54,090 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117899421] [2019-11-20 10:37:54,090 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:37:54,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:37:54,160 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 10:37:54,160 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117899421] [2019-11-20 10:37:54,161 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:37:54,161 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:37:54,163 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344571494] [2019-11-20 10:37:54,163 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:37:54,163 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:37:54,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:37:54,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:37:54,164 INFO L87 Difference]: Start difference. First operand 233 states and 362 transitions. Second operand 4 states. [2019-11-20 10:37:54,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:37:54,510 INFO L93 Difference]: Finished difference Result 497 states and 768 transitions. [2019-11-20 10:37:54,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:37:54,512 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 82 [2019-11-20 10:37:54,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:37:54,513 INFO L225 Difference]: With dead ends: 497 [2019-11-20 10:37:54,513 INFO L226 Difference]: Without dead ends: 283 [2019-11-20 10:37:54,514 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:37:54,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2019-11-20 10:37:54,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 234. [2019-11-20 10:37:54,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2019-11-20 10:37:54,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 363 transitions. [2019-11-20 10:37:54,520 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 363 transitions. Word has length 82 [2019-11-20 10:37:54,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:37:54,521 INFO L462 AbstractCegarLoop]: Abstraction has 234 states and 363 transitions. [2019-11-20 10:37:54,521 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:37:54,521 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 363 transitions. [2019-11-20 10:37:54,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-11-20 10:37:54,522 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:37:54,522 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-20 10:37:54,522 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:37:54,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:37:54,522 INFO L82 PathProgramCache]: Analyzing trace with hash 354437512, now seen corresponding path program 1 times [2019-11-20 10:37:54,522 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:37:54,523 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301313500] [2019-11-20 10:37:54,523 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:37:54,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:37:54,575 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 10:37:54,576 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301313500] [2019-11-20 10:37:54,576 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:37:54,576 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:37:54,576 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743719693] [2019-11-20 10:37:54,577 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:37:54,577 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:37:54,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:37:54,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:37:54,577 INFO L87 Difference]: Start difference. First operand 234 states and 363 transitions. Second operand 4 states. [2019-11-20 10:37:55,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:37:55,013 INFO L93 Difference]: Finished difference Result 498 states and 768 transitions. [2019-11-20 10:37:55,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:37:55,014 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2019-11-20 10:37:55,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:37:55,015 INFO L225 Difference]: With dead ends: 498 [2019-11-20 10:37:55,015 INFO L226 Difference]: Without dead ends: 283 [2019-11-20 10:37:55,016 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:37:55,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2019-11-20 10:37:55,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 234. [2019-11-20 10:37:55,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2019-11-20 10:37:55,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 362 transitions. [2019-11-20 10:37:55,021 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 362 transitions. Word has length 87 [2019-11-20 10:37:55,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:37:55,021 INFO L462 AbstractCegarLoop]: Abstraction has 234 states and 362 transitions. [2019-11-20 10:37:55,021 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:37:55,022 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 362 transitions. [2019-11-20 10:37:55,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-11-20 10:37:55,022 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:37:55,023 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-20 10:37:55,023 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:37:55,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:37:55,023 INFO L82 PathProgramCache]: Analyzing trace with hash -2012257082, now seen corresponding path program 1 times [2019-11-20 10:37:55,024 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:37:55,024 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518286612] [2019-11-20 10:37:55,024 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:37:55,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:37:55,079 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 10:37:55,080 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518286612] [2019-11-20 10:37:55,080 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:37:55,080 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:37:55,081 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880088980] [2019-11-20 10:37:55,081 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:37:55,081 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:37:55,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:37:55,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:37:55,082 INFO L87 Difference]: Start difference. First operand 234 states and 362 transitions. Second operand 4 states. [2019-11-20 10:37:55,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:37:55,511 INFO L93 Difference]: Finished difference Result 475 states and 736 transitions. [2019-11-20 10:37:55,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:37:55,512 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2019-11-20 10:37:55,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:37:55,513 INFO L225 Difference]: With dead ends: 475 [2019-11-20 10:37:55,513 INFO L226 Difference]: Without dead ends: 260 [2019-11-20 10:37:55,514 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:37:55,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2019-11-20 10:37:55,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 234. [2019-11-20 10:37:55,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2019-11-20 10:37:55,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 361 transitions. [2019-11-20 10:37:55,520 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 361 transitions. Word has length 87 [2019-11-20 10:37:55,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:37:55,520 INFO L462 AbstractCegarLoop]: Abstraction has 234 states and 361 transitions. [2019-11-20 10:37:55,520 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:37:55,520 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 361 transitions. [2019-11-20 10:37:55,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-20 10:37:55,521 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:37:55,521 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-20 10:37:55,521 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:37:55,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:37:55,522 INFO L82 PathProgramCache]: Analyzing trace with hash 2010828614, now seen corresponding path program 1 times [2019-11-20 10:37:55,522 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:37:55,522 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166438741] [2019-11-20 10:37:55,522 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:37:55,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:37:55,602 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 10:37:55,602 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166438741] [2019-11-20 10:37:55,602 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:37:55,602 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:37:55,602 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328628303] [2019-11-20 10:37:55,603 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:37:55,603 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:37:55,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:37:55,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:37:55,603 INFO L87 Difference]: Start difference. First operand 234 states and 361 transitions. Second operand 4 states. [2019-11-20 10:37:56,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:37:56,103 INFO L93 Difference]: Finished difference Result 497 states and 763 transitions. [2019-11-20 10:37:56,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:37:56,104 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-11-20 10:37:56,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:37:56,106 INFO L225 Difference]: With dead ends: 497 [2019-11-20 10:37:56,106 INFO L226 Difference]: Without dead ends: 282 [2019-11-20 10:37:56,106 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:37:56,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2019-11-20 10:37:56,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 234. [2019-11-20 10:37:56,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2019-11-20 10:37:56,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 360 transitions. [2019-11-20 10:37:56,112 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 360 transitions. Word has length 88 [2019-11-20 10:37:56,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:37:56,113 INFO L462 AbstractCegarLoop]: Abstraction has 234 states and 360 transitions. [2019-11-20 10:37:56,113 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:37:56,113 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 360 transitions. [2019-11-20 10:37:56,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-20 10:37:56,114 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:37:56,114 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-20 10:37:56,114 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:37:56,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:37:56,114 INFO L82 PathProgramCache]: Analyzing trace with hash 1947077233, now seen corresponding path program 1 times [2019-11-20 10:37:56,114 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:37:56,115 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547629038] [2019-11-20 10:37:56,115 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:37:56,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:37:56,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-20 10:37:56,168 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547629038] [2019-11-20 10:37:56,169 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:37:56,169 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:37:56,169 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183928979] [2019-11-20 10:37:56,169 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:37:56,170 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:37:56,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:37:56,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:37:56,170 INFO L87 Difference]: Start difference. First operand 234 states and 360 transitions. Second operand 4 states. [2019-11-20 10:37:56,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:37:56,545 INFO L93 Difference]: Finished difference Result 495 states and 759 transitions. [2019-11-20 10:37:56,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:37:56,546 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-11-20 10:37:56,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:37:56,548 INFO L225 Difference]: With dead ends: 495 [2019-11-20 10:37:56,548 INFO L226 Difference]: Without dead ends: 280 [2019-11-20 10:37:56,549 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:37:56,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2019-11-20 10:37:56,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 234. [2019-11-20 10:37:56,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2019-11-20 10:37:56,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 359 transitions. [2019-11-20 10:37:56,555 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 359 transitions. Word has length 88 [2019-11-20 10:37:56,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:37:56,555 INFO L462 AbstractCegarLoop]: Abstraction has 234 states and 359 transitions. [2019-11-20 10:37:56,555 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:37:56,555 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 359 transitions. [2019-11-20 10:37:56,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-20 10:37:56,556 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:37:56,556 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-20 10:37:56,557 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:37:56,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:37:56,557 INFO L82 PathProgramCache]: Analyzing trace with hash -1807744591, now seen corresponding path program 1 times [2019-11-20 10:37:56,557 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:37:56,557 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949006960] [2019-11-20 10:37:56,558 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:37:56,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:37:56,617 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 10:37:56,617 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949006960] [2019-11-20 10:37:56,618 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:37:56,618 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:37:56,618 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408698120] [2019-11-20 10:37:56,618 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:37:56,619 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:37:56,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:37:56,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:37:56,619 INFO L87 Difference]: Start difference. First operand 234 states and 359 transitions. Second operand 4 states. [2019-11-20 10:37:57,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:37:57,064 INFO L93 Difference]: Finished difference Result 494 states and 756 transitions. [2019-11-20 10:37:57,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:37:57,064 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-11-20 10:37:57,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:37:57,066 INFO L225 Difference]: With dead ends: 494 [2019-11-20 10:37:57,066 INFO L226 Difference]: Without dead ends: 279 [2019-11-20 10:37:57,067 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:37:57,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2019-11-20 10:37:57,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 234. [2019-11-20 10:37:57,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2019-11-20 10:37:57,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 358 transitions. [2019-11-20 10:37:57,072 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 358 transitions. Word has length 88 [2019-11-20 10:37:57,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:37:57,072 INFO L462 AbstractCegarLoop]: Abstraction has 234 states and 358 transitions. [2019-11-20 10:37:57,073 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:37:57,073 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 358 transitions. [2019-11-20 10:37:57,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-20 10:37:57,073 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:37:57,074 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-20 10:37:57,074 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:37:57,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:37:57,074 INFO L82 PathProgramCache]: Analyzing trace with hash -1418559526, now seen corresponding path program 1 times [2019-11-20 10:37:57,074 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:37:57,074 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935074819] [2019-11-20 10:37:57,074 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:37:57,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:37:57,155 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-11-20 10:37:57,155 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935074819] [2019-11-20 10:37:57,157 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:37:57,158 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-20 10:37:57,158 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780118742] [2019-11-20 10:37:57,158 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 10:37:57,158 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:37:57,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 10:37:57,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:37:57,159 INFO L87 Difference]: Start difference. First operand 234 states and 358 transitions. Second operand 5 states. [2019-11-20 10:37:57,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:37:57,786 INFO L93 Difference]: Finished difference Result 470 states and 724 transitions. [2019-11-20 10:37:57,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 10:37:57,787 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 88 [2019-11-20 10:37:57,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:37:57,788 INFO L225 Difference]: With dead ends: 470 [2019-11-20 10:37:57,788 INFO L226 Difference]: Without dead ends: 255 [2019-11-20 10:37:57,789 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-20 10:37:57,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2019-11-20 10:37:57,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 254. [2019-11-20 10:37:57,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-11-20 10:37:57,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 384 transitions. [2019-11-20 10:37:57,798 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 384 transitions. Word has length 88 [2019-11-20 10:37:57,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:37:57,799 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 384 transitions. [2019-11-20 10:37:57,799 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 10:37:57,799 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 384 transitions. [2019-11-20 10:37:57,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-20 10:37:57,800 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:37:57,800 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-20 10:37:57,800 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:37:57,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:37:57,801 INFO L82 PathProgramCache]: Analyzing trace with hash 1593988851, now seen corresponding path program 1 times [2019-11-20 10:37:57,801 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:37:57,801 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268636388] [2019-11-20 10:37:57,801 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:37:57,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:37:57,858 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 10:37:57,858 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268636388] [2019-11-20 10:37:57,858 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:37:57,859 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:37:57,859 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077884929] [2019-11-20 10:37:57,859 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:37:57,860 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:37:57,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:37:57,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:37:57,860 INFO L87 Difference]: Start difference. First operand 254 states and 384 transitions. Second operand 4 states. [2019-11-20 10:37:58,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:37:58,271 INFO L93 Difference]: Finished difference Result 512 states and 776 transitions. [2019-11-20 10:37:58,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:37:58,272 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-11-20 10:37:58,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:37:58,274 INFO L225 Difference]: With dead ends: 512 [2019-11-20 10:37:58,274 INFO L226 Difference]: Without dead ends: 277 [2019-11-20 10:37:58,274 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:37:58,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2019-11-20 10:37:58,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 254. [2019-11-20 10:37:58,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-11-20 10:37:58,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 383 transitions. [2019-11-20 10:37:58,282 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 383 transitions. Word has length 88 [2019-11-20 10:37:58,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:37:58,282 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 383 transitions. [2019-11-20 10:37:58,282 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:37:58,282 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 383 transitions. [2019-11-20 10:37:58,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-20 10:37:58,283 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:37:58,283 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-20 10:37:58,284 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:37:58,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:37:58,284 INFO L82 PathProgramCache]: Analyzing trace with hash 2134134323, now seen corresponding path program 1 times [2019-11-20 10:37:58,284 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:37:58,284 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724601920] [2019-11-20 10:37:58,284 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:37:58,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:37:58,345 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 10:37:58,346 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724601920] [2019-11-20 10:37:58,347 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:37:58,347 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:37:58,347 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235874545] [2019-11-20 10:37:58,348 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:37:58,348 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:37:58,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:37:58,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:37:58,348 INFO L87 Difference]: Start difference. First operand 254 states and 383 transitions. Second operand 4 states. [2019-11-20 10:37:58,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:37:58,755 INFO L93 Difference]: Finished difference Result 511 states and 773 transitions. [2019-11-20 10:37:58,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:37:58,755 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-11-20 10:37:58,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:37:58,757 INFO L225 Difference]: With dead ends: 511 [2019-11-20 10:37:58,757 INFO L226 Difference]: Without dead ends: 276 [2019-11-20 10:37:58,758 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:37:58,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2019-11-20 10:37:58,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 254. [2019-11-20 10:37:58,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-11-20 10:37:58,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 382 transitions. [2019-11-20 10:37:58,764 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 382 transitions. Word has length 88 [2019-11-20 10:37:58,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:37:58,765 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 382 transitions. [2019-11-20 10:37:58,765 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:37:58,765 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 382 transitions. [2019-11-20 10:37:58,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-11-20 10:37:58,766 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:37:58,766 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-20 10:37:58,767 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:37:58,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:37:58,768 INFO L82 PathProgramCache]: Analyzing trace with hash -1582169212, now seen corresponding path program 1 times [2019-11-20 10:37:58,768 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:37:58,768 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91688028] [2019-11-20 10:37:58,768 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:37:58,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:37:58,861 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 10:37:58,862 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91688028] [2019-11-20 10:37:58,862 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:37:58,862 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:37:58,863 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41338601] [2019-11-20 10:37:58,863 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:37:58,863 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:37:58,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:37:58,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:37:58,865 INFO L87 Difference]: Start difference. First operand 254 states and 382 transitions. Second operand 4 states. [2019-11-20 10:37:59,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:37:59,330 INFO L93 Difference]: Finished difference Result 534 states and 801 transitions. [2019-11-20 10:37:59,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:37:59,330 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 89 [2019-11-20 10:37:59,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:37:59,332 INFO L225 Difference]: With dead ends: 534 [2019-11-20 10:37:59,332 INFO L226 Difference]: Without dead ends: 299 [2019-11-20 10:37:59,333 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:37:59,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2019-11-20 10:37:59,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 254. [2019-11-20 10:37:59,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-11-20 10:37:59,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 381 transitions. [2019-11-20 10:37:59,342 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 381 transitions. Word has length 89 [2019-11-20 10:37:59,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:37:59,342 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 381 transitions. [2019-11-20 10:37:59,342 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:37:59,343 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 381 transitions. [2019-11-20 10:37:59,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-11-20 10:37:59,343 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:37:59,344 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-20 10:37:59,344 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:37:59,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:37:59,344 INFO L82 PathProgramCache]: Analyzing trace with hash 356992834, now seen corresponding path program 1 times [2019-11-20 10:37:59,344 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:37:59,345 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565610114] [2019-11-20 10:37:59,345 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:37:59,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:37:59,394 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 10:37:59,395 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565610114] [2019-11-20 10:37:59,395 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:37:59,395 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:37:59,395 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645432349] [2019-11-20 10:37:59,396 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:37:59,396 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:37:59,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:37:59,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:37:59,396 INFO L87 Difference]: Start difference. First operand 254 states and 381 transitions. Second operand 4 states. [2019-11-20 10:37:59,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:37:59,813 INFO L93 Difference]: Finished difference Result 511 states and 769 transitions. [2019-11-20 10:37:59,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:37:59,814 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 89 [2019-11-20 10:37:59,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:37:59,815 INFO L225 Difference]: With dead ends: 511 [2019-11-20 10:37:59,816 INFO L226 Difference]: Without dead ends: 276 [2019-11-20 10:37:59,816 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:37:59,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2019-11-20 10:37:59,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 254. [2019-11-20 10:37:59,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-11-20 10:37:59,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 380 transitions. [2019-11-20 10:37:59,827 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 380 transitions. Word has length 89 [2019-11-20 10:37:59,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:37:59,827 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 380 transitions. [2019-11-20 10:37:59,827 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:37:59,828 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 380 transitions. [2019-11-20 10:37:59,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-11-20 10:37:59,828 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:37:59,829 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-20 10:37:59,829 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:37:59,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:37:59,829 INFO L82 PathProgramCache]: Analyzing trace with hash -2129784979, now seen corresponding path program 1 times [2019-11-20 10:37:59,830 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:37:59,830 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382465485] [2019-11-20 10:37:59,830 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:37:59,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:37:59,884 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 10:37:59,885 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382465485] [2019-11-20 10:37:59,885 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:37:59,885 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:37:59,885 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660551908] [2019-11-20 10:37:59,886 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:37:59,886 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:37:59,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:37:59,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:37:59,886 INFO L87 Difference]: Start difference. First operand 254 states and 380 transitions. Second operand 4 states. [2019-11-20 10:38:00,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:38:00,406 INFO L93 Difference]: Finished difference Result 534 states and 797 transitions. [2019-11-20 10:38:00,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:38:00,407 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 90 [2019-11-20 10:38:00,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:38:00,409 INFO L225 Difference]: With dead ends: 534 [2019-11-20 10:38:00,409 INFO L226 Difference]: Without dead ends: 299 [2019-11-20 10:38:00,409 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:38:00,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2019-11-20 10:38:00,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 254. [2019-11-20 10:38:00,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-11-20 10:38:00,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 379 transitions. [2019-11-20 10:38:00,417 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 379 transitions. Word has length 90 [2019-11-20 10:38:00,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:38:00,417 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 379 transitions. [2019-11-20 10:38:00,417 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:38:00,417 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 379 transitions. [2019-11-20 10:38:00,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-11-20 10:38:00,418 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:38:00,418 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-20 10:38:00,419 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:38:00,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:38:00,419 INFO L82 PathProgramCache]: Analyzing trace with hash -2145303697, now seen corresponding path program 1 times [2019-11-20 10:38:00,419 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:38:00,419 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017323892] [2019-11-20 10:38:00,420 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:38:00,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:38:00,470 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 10:38:00,470 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017323892] [2019-11-20 10:38:00,471 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:38:00,471 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:38:00,471 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268677257] [2019-11-20 10:38:00,471 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:38:00,472 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:38:00,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:38:00,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:38:00,472 INFO L87 Difference]: Start difference. First operand 254 states and 379 transitions. Second operand 4 states. [2019-11-20 10:38:00,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:38:00,827 INFO L93 Difference]: Finished difference Result 511 states and 765 transitions. [2019-11-20 10:38:00,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:38:00,827 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 90 [2019-11-20 10:38:00,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:38:00,829 INFO L225 Difference]: With dead ends: 511 [2019-11-20 10:38:00,829 INFO L226 Difference]: Without dead ends: 276 [2019-11-20 10:38:00,829 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:38:00,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2019-11-20 10:38:00,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 254. [2019-11-20 10:38:00,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-11-20 10:38:00,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 378 transitions. [2019-11-20 10:38:00,836 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 378 transitions. Word has length 90 [2019-11-20 10:38:00,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:38:00,836 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 378 transitions. [2019-11-20 10:38:00,836 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:38:00,836 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 378 transitions. [2019-11-20 10:38:00,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-11-20 10:38:00,837 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:38:00,838 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-20 10:38:00,838 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:38:00,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:38:00,838 INFO L82 PathProgramCache]: Analyzing trace with hash 1086928127, now seen corresponding path program 1 times [2019-11-20 10:38:00,838 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:38:00,839 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320240743] [2019-11-20 10:38:00,839 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:38:00,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:38:00,896 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 10:38:00,896 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320240743] [2019-11-20 10:38:00,896 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:38:00,896 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:38:00,897 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835669368] [2019-11-20 10:38:00,897 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:38:00,897 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:38:00,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:38:00,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:38:00,898 INFO L87 Difference]: Start difference. First operand 254 states and 378 transitions. Second operand 4 states. [2019-11-20 10:38:01,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:38:01,341 INFO L93 Difference]: Finished difference Result 534 states and 793 transitions. [2019-11-20 10:38:01,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:38:01,342 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2019-11-20 10:38:01,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:38:01,343 INFO L225 Difference]: With dead ends: 534 [2019-11-20 10:38:01,344 INFO L226 Difference]: Without dead ends: 299 [2019-11-20 10:38:01,344 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:38:01,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2019-11-20 10:38:01,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 254. [2019-11-20 10:38:01,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-11-20 10:38:01,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 377 transitions. [2019-11-20 10:38:01,352 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 377 transitions. Word has length 91 [2019-11-20 10:38:01,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:38:01,352 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 377 transitions. [2019-11-20 10:38:01,352 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:38:01,352 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 377 transitions. [2019-11-20 10:38:01,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-11-20 10:38:01,353 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:38:01,353 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-20 10:38:01,354 INFO L410 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:38:01,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:38:01,354 INFO L82 PathProgramCache]: Analyzing trace with hash 605847869, now seen corresponding path program 1 times [2019-11-20 10:38:01,354 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:38:01,354 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049925103] [2019-11-20 10:38:01,355 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:38:01,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:38:01,407 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 10:38:01,407 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049925103] [2019-11-20 10:38:01,407 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:38:01,407 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:38:01,408 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754797085] [2019-11-20 10:38:01,409 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:38:01,409 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:38:01,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:38:01,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:38:01,410 INFO L87 Difference]: Start difference. First operand 254 states and 377 transitions. Second operand 4 states. [2019-11-20 10:38:01,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:38:01,784 INFO L93 Difference]: Finished difference Result 511 states and 761 transitions. [2019-11-20 10:38:01,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:38:01,784 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2019-11-20 10:38:01,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:38:01,786 INFO L225 Difference]: With dead ends: 511 [2019-11-20 10:38:01,786 INFO L226 Difference]: Without dead ends: 276 [2019-11-20 10:38:01,787 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:38:01,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2019-11-20 10:38:01,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 254. [2019-11-20 10:38:01,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-11-20 10:38:01,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 376 transitions. [2019-11-20 10:38:01,795 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 376 transitions. Word has length 91 [2019-11-20 10:38:01,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:38:01,795 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 376 transitions. [2019-11-20 10:38:01,796 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:38:01,796 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 376 transitions. [2019-11-20 10:38:01,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-11-20 10:38:01,797 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:38:01,797 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-20 10:38:01,797 INFO L410 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:38:01,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:38:01,797 INFO L82 PathProgramCache]: Analyzing trace with hash 738752008, now seen corresponding path program 1 times [2019-11-20 10:38:01,798 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:38:01,798 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551725654] [2019-11-20 10:38:01,798 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:38:01,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:38:01,859 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 10:38:01,860 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551725654] [2019-11-20 10:38:01,860 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:38:01,860 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:38:01,860 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15451638] [2019-11-20 10:38:01,861 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:38:01,861 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:38:01,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:38:01,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:38:01,861 INFO L87 Difference]: Start difference. First operand 254 states and 376 transitions. Second operand 4 states. [2019-11-20 10:38:02,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:38:02,360 INFO L93 Difference]: Finished difference Result 524 states and 777 transitions. [2019-11-20 10:38:02,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:38:02,360 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2019-11-20 10:38:02,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:38:02,362 INFO L225 Difference]: With dead ends: 524 [2019-11-20 10:38:02,362 INFO L226 Difference]: Without dead ends: 289 [2019-11-20 10:38:02,363 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:38:02,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2019-11-20 10:38:02,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 254. [2019-11-20 10:38:02,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-11-20 10:38:02,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 375 transitions. [2019-11-20 10:38:02,373 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 375 transitions. Word has length 92 [2019-11-20 10:38:02,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:38:02,373 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 375 transitions. [2019-11-20 10:38:02,373 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:38:02,373 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 375 transitions. [2019-11-20 10:38:02,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-11-20 10:38:02,375 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:38:02,375 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-20 10:38:02,375 INFO L410 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:38:02,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:38:02,375 INFO L82 PathProgramCache]: Analyzing trace with hash -1289834102, now seen corresponding path program 1 times [2019-11-20 10:38:02,376 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:38:02,376 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476104612] [2019-11-20 10:38:02,376 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:38:02,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:38:02,470 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 10:38:02,471 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476104612] [2019-11-20 10:38:02,471 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:38:02,471 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:38:02,471 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823880108] [2019-11-20 10:38:02,472 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:38:02,472 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:38:02,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:38:02,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:38:02,472 INFO L87 Difference]: Start difference. First operand 254 states and 375 transitions. Second operand 4 states. [2019-11-20 10:38:02,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:38:02,823 INFO L93 Difference]: Finished difference Result 501 states and 745 transitions. [2019-11-20 10:38:02,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:38:02,824 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2019-11-20 10:38:02,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:38:02,826 INFO L225 Difference]: With dead ends: 501 [2019-11-20 10:38:02,826 INFO L226 Difference]: Without dead ends: 266 [2019-11-20 10:38:02,826 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:38:02,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2019-11-20 10:38:02,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 254. [2019-11-20 10:38:02,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-11-20 10:38:02,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 374 transitions. [2019-11-20 10:38:02,834 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 374 transitions. Word has length 92 [2019-11-20 10:38:02,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:38:02,834 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 374 transitions. [2019-11-20 10:38:02,835 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:38:02,835 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 374 transitions. [2019-11-20 10:38:02,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-11-20 10:38:02,836 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:38:02,836 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-20 10:38:02,836 INFO L410 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:38:02,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:38:02,836 INFO L82 PathProgramCache]: Analyzing trace with hash -1110599922, now seen corresponding path program 1 times [2019-11-20 10:38:02,837 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:38:02,837 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79314547] [2019-11-20 10:38:02,837 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:38:02,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:38:02,888 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 10:38:02,888 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79314547] [2019-11-20 10:38:02,888 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:38:02,889 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:38:02,889 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560525377] [2019-11-20 10:38:02,890 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:38:02,890 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:38:02,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:38:02,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:38:02,891 INFO L87 Difference]: Start difference. First operand 254 states and 374 transitions. Second operand 4 states. [2019-11-20 10:38:03,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:38:03,329 INFO L93 Difference]: Finished difference Result 524 states and 773 transitions. [2019-11-20 10:38:03,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:38:03,330 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2019-11-20 10:38:03,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:38:03,332 INFO L225 Difference]: With dead ends: 524 [2019-11-20 10:38:03,332 INFO L226 Difference]: Without dead ends: 289 [2019-11-20 10:38:03,333 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:38:03,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2019-11-20 10:38:03,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 254. [2019-11-20 10:38:03,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-11-20 10:38:03,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 373 transitions. [2019-11-20 10:38:03,341 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 373 transitions. Word has length 96 [2019-11-20 10:38:03,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:38:03,342 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 373 transitions. [2019-11-20 10:38:03,342 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:38:03,342 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 373 transitions. [2019-11-20 10:38:03,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-11-20 10:38:03,343 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:38:03,343 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-20 10:38:03,343 INFO L410 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:38:03,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:38:03,344 INFO L82 PathProgramCache]: Analyzing trace with hash 276185488, now seen corresponding path program 1 times [2019-11-20 10:38:03,344 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:38:03,344 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190544195] [2019-11-20 10:38:03,344 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:38:03,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:38:03,399 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-11-20 10:38:03,399 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190544195] [2019-11-20 10:38:03,400 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:38:03,400 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 10:38:03,400 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561410158] [2019-11-20 10:38:03,401 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 10:38:03,401 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:38:03,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 10:38:03,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 10:38:03,402 INFO L87 Difference]: Start difference. First operand 254 states and 373 transitions. Second operand 3 states. [2019-11-20 10:38:03,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:38:03,460 INFO L93 Difference]: Finished difference Result 722 states and 1074 transitions. [2019-11-20 10:38:03,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 10:38:03,461 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 96 [2019-11-20 10:38:03,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:38:03,464 INFO L225 Difference]: With dead ends: 722 [2019-11-20 10:38:03,464 INFO L226 Difference]: Without dead ends: 487 [2019-11-20 10:38:03,464 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 10:38:03,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states. [2019-11-20 10:38:03,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 487. [2019-11-20 10:38:03,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 487 states. [2019-11-20 10:38:03,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 717 transitions. [2019-11-20 10:38:03,484 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 717 transitions. Word has length 96 [2019-11-20 10:38:03,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:38:03,485 INFO L462 AbstractCegarLoop]: Abstraction has 487 states and 717 transitions. [2019-11-20 10:38:03,485 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 10:38:03,485 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 717 transitions. [2019-11-20 10:38:03,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-20 10:38:03,486 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:38:03,486 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-20 10:38:03,487 INFO L410 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:38:03,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:38:03,487 INFO L82 PathProgramCache]: Analyzing trace with hash -1173556134, now seen corresponding path program 1 times [2019-11-20 10:38:03,487 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:38:03,487 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998825663] [2019-11-20 10:38:03,488 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:38:03,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:38:03,541 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-20 10:38:03,541 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998825663] [2019-11-20 10:38:03,541 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:38:03,541 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 10:38:03,542 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414363113] [2019-11-20 10:38:03,542 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 10:38:03,542 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:38:03,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 10:38:03,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 10:38:03,543 INFO L87 Difference]: Start difference. First operand 487 states and 717 transitions. Second operand 3 states. [2019-11-20 10:38:03,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:38:03,613 INFO L93 Difference]: Finished difference Result 1190 states and 1763 transitions. [2019-11-20 10:38:03,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 10:38:03,614 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-11-20 10:38:03,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:38:03,618 INFO L225 Difference]: With dead ends: 1190 [2019-11-20 10:38:03,618 INFO L226 Difference]: Without dead ends: 722 [2019-11-20 10:38:03,619 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 10:38:03,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 722 states. [2019-11-20 10:38:03,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 722 to 720. [2019-11-20 10:38:03,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 720 states. [2019-11-20 10:38:03,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 720 states to 720 states and 1065 transitions. [2019-11-20 10:38:03,640 INFO L78 Accepts]: Start accepts. Automaton has 720 states and 1065 transitions. Word has length 98 [2019-11-20 10:38:03,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:38:03,640 INFO L462 AbstractCegarLoop]: Abstraction has 720 states and 1065 transitions. [2019-11-20 10:38:03,640 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 10:38:03,640 INFO L276 IsEmpty]: Start isEmpty. Operand 720 states and 1065 transitions. [2019-11-20 10:38:03,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-11-20 10:38:03,642 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:38:03,642 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-20 10:38:03,642 INFO L410 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:38:03,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:38:03,643 INFO L82 PathProgramCache]: Analyzing trace with hash -1825940577, now seen corresponding path program 1 times [2019-11-20 10:38:03,643 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:38:03,643 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284849703] [2019-11-20 10:38:03,643 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:38:03,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:38:03,697 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-20 10:38:03,698 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284849703] [2019-11-20 10:38:03,699 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:38:03,699 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 10:38:03,699 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065809311] [2019-11-20 10:38:03,700 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 10:38:03,701 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:38:03,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 10:38:03,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 10:38:03,701 INFO L87 Difference]: Start difference. First operand 720 states and 1065 transitions. Second operand 3 states. [2019-11-20 10:38:03,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:38:03,794 INFO L93 Difference]: Finished difference Result 1656 states and 2457 transitions. [2019-11-20 10:38:03,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 10:38:03,795 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2019-11-20 10:38:03,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:38:03,800 INFO L225 Difference]: With dead ends: 1656 [2019-11-20 10:38:03,801 INFO L226 Difference]: Without dead ends: 955 [2019-11-20 10:38:03,802 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 10:38:03,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 955 states. [2019-11-20 10:38:03,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 955 to 953. [2019-11-20 10:38:03,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 953 states. [2019-11-20 10:38:03,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 953 states to 953 states and 1399 transitions. [2019-11-20 10:38:03,832 INFO L78 Accepts]: Start accepts. Automaton has 953 states and 1399 transitions. Word has length 105 [2019-11-20 10:38:03,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:38:03,834 INFO L462 AbstractCegarLoop]: Abstraction has 953 states and 1399 transitions. [2019-11-20 10:38:03,834 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 10:38:03,834 INFO L276 IsEmpty]: Start isEmpty. Operand 953 states and 1399 transitions. [2019-11-20 10:38:03,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-11-20 10:38:03,836 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:38:03,836 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-20 10:38:03,837 INFO L410 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:38:03,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:38:03,837 INFO L82 PathProgramCache]: Analyzing trace with hash 315775349, now seen corresponding path program 1 times [2019-11-20 10:38:03,837 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:38:03,837 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765972364] [2019-11-20 10:38:03,837 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:38:03,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:38:03,892 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-20 10:38:03,892 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765972364] [2019-11-20 10:38:03,892 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:38:03,893 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 10:38:03,893 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6651056] [2019-11-20 10:38:03,894 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 10:38:03,894 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:38:03,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 10:38:03,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 10:38:03,894 INFO L87 Difference]: Start difference. First operand 953 states and 1399 transitions. Second operand 3 states. [2019-11-20 10:38:03,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:38:03,962 INFO L93 Difference]: Finished difference Result 2120 states and 3124 transitions. [2019-11-20 10:38:03,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 10:38:03,962 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 122 [2019-11-20 10:38:03,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:38:03,969 INFO L225 Difference]: With dead ends: 2120 [2019-11-20 10:38:03,969 INFO L226 Difference]: Without dead ends: 1186 [2019-11-20 10:38:03,970 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 10:38:03,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1186 states. [2019-11-20 10:38:04,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1186 to 1186. [2019-11-20 10:38:04,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1186 states. [2019-11-20 10:38:04,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1186 states to 1186 states and 1744 transitions. [2019-11-20 10:38:04,005 INFO L78 Accepts]: Start accepts. Automaton has 1186 states and 1744 transitions. Word has length 122 [2019-11-20 10:38:04,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:38:04,006 INFO L462 AbstractCegarLoop]: Abstraction has 1186 states and 1744 transitions. [2019-11-20 10:38:04,006 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 10:38:04,006 INFO L276 IsEmpty]: Start isEmpty. Operand 1186 states and 1744 transitions. [2019-11-20 10:38:04,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-11-20 10:38:04,008 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:38:04,009 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-20 10:38:04,009 INFO L410 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:38:04,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:38:04,009 INFO L82 PathProgramCache]: Analyzing trace with hash -799556719, now seen corresponding path program 1 times [2019-11-20 10:38:04,010 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:38:04,010 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725643219] [2019-11-20 10:38:04,010 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:38:04,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 10:38:04,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 10:38:04,413 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 10:38:04,413 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-20 10:38:04,558 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 10:38:04 BoogieIcfgContainer [2019-11-20 10:38:04,558 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-20 10:38:04,558 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-20 10:38:04,558 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-20 10:38:04,559 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-20 10:38:04,559 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:37:43" (3/4) ... [2019-11-20 10:38:04,570 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-20 10:38:04,577 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-20 10:38:04,579 INFO L168 Benchmark]: Toolchain (without parser) took 23090.08 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 338.7 MB). Free memory was 946.0 MB in the beginning and 918.0 MB in the end (delta: 28.0 MB). Peak memory consumption was 366.7 MB. Max. memory is 11.5 GB. [2019-11-20 10:38:04,580 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 10:38:04,580 INFO L168 Benchmark]: CACSL2BoogieTranslator took 685.08 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.1 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -167.3 MB). Peak memory consumption was 24.2 MB. Max. memory is 11.5 GB. [2019-11-20 10:38:04,581 INFO L168 Benchmark]: Boogie Procedure Inliner took 124.85 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 10:38:04,582 INFO L168 Benchmark]: Boogie Preprocessor took 171.03 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: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-20 10:38:04,582 INFO L168 Benchmark]: RCFGBuilder took 1363.52 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: 97.6 MB). Peak memory consumption was 97.6 MB. Max. memory is 11.5 GB. [2019-11-20 10:38:04,582 INFO L168 Benchmark]: TraceAbstraction took 20721.72 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 195.6 MB). Free memory was 1.0 GB in the beginning and 927.6 MB in the end (delta: 77.3 MB). Peak memory consumption was 272.9 MB. Max. memory is 11.5 GB. [2019-11-20 10:38:04,583 INFO L168 Benchmark]: Witness Printer took 19.09 ms. Allocated memory is still 1.4 GB. Free memory was 927.6 MB in the beginning and 918.0 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 11.5 GB. [2019-11-20 10:38:04,585 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 685.08 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.1 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -167.3 MB). Peak memory consumption was 24.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 124.85 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 171.03 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: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1363.52 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: 97.6 MB). Peak memory consumption was 97.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 20721.72 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 195.6 MB). Free memory was 1.0 GB in the beginning and 927.6 MB in the end (delta: 77.3 MB). Peak memory consumption was 272.9 MB. Max. memory is 11.5 GB. * Witness Printer took 19.09 ms. Allocated memory is still 1.4 GB. Free memory was 927.6 MB in the beginning and 918.0 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. 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: 20.6s, OverallIterations: 45, TraceHistogramMax: 5, AutomataDifference: 16.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 8837 SDtfs, 2842 SDslu, 12828 SDs, 0 SdLazy, 7576 SolverSat, 404 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 13.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 246 GetRequests, 88 SyntacticMatches, 32 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.9s 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.7s 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-678e011 [2019-11-20 10:38:06,541 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 10:38:06,543 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 10:38:06,554 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 10:38:06,554 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 10:38:06,555 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 10:38:06,556 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 10:38:06,558 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 10:38:06,560 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 10:38:06,561 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 10:38:06,562 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 10:38:06,564 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 10:38:06,564 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 10:38:06,565 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 10:38:06,566 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 10:38:06,568 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 10:38:06,568 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 10:38:06,570 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 10:38:06,572 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 10:38:06,574 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 10:38:06,576 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 10:38:06,577 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 10:38:06,578 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 10:38:06,579 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 10:38:06,582 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 10:38:06,583 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 10:38:06,583 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 10:38:06,584 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 10:38:06,585 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 10:38:06,586 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 10:38:06,586 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 10:38:06,587 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 10:38:06,588 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 10:38:06,589 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 10:38:06,590 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 10:38:06,590 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 10:38:06,591 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 10:38:06,592 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 10:38:06,592 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 10:38:06,593 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 10:38:06,594 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 10:38:06,599 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_720df207-2908-4742-acdb-a7518bfe149b/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-11-20 10:38:06,624 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 10:38:06,624 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 10:38:06,625 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 10:38:06,626 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 10:38:06,626 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 10:38:06,626 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 10:38:06,627 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 10:38:06,627 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 10:38:06,627 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 10:38:06,627 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-20 10:38:06,628 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 10:38:06,628 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-20 10:38:06,628 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-20 10:38:06,628 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-20 10:38:06,629 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 10:38:06,629 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 10:38:06,629 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 10:38:06,629 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-20 10:38:06,630 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 10:38:06,630 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 10:38:06,630 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 10:38:06,630 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 10:38:06,631 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 10:38:06,631 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 10:38:06,631 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 10:38:06,632 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-20 10:38:06,632 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-20 10:38:06,632 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-20 10:38:06,632 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-20 10:38:06,633 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-20 10:38:06,633 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_720df207-2908-4742-acdb-a7518bfe149b/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-20 10:38:06,938 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 10:38:06,948 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 10:38:06,952 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 10:38:06,953 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 10:38:06,954 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 10:38:06,954 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_720df207-2908-4742-acdb-a7518bfe149b/bin/uautomizer/../../sv-benchmarks/c/ssh/s3_srvr.blast.11.i.cil-1.c [2019-11-20 10:38:07,021 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_720df207-2908-4742-acdb-a7518bfe149b/bin/uautomizer/data/492a4dbf0/c4e9812a0bcd405b802142a6a0336d14/FLAGd0788a2a1 [2019-11-20 10:38:07,572 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 10:38:07,573 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_720df207-2908-4742-acdb-a7518bfe149b/sv-benchmarks/c/ssh/s3_srvr.blast.11.i.cil-1.c [2019-11-20 10:38:07,594 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_720df207-2908-4742-acdb-a7518bfe149b/bin/uautomizer/data/492a4dbf0/c4e9812a0bcd405b802142a6a0336d14/FLAGd0788a2a1 [2019-11-20 10:38:07,873 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_720df207-2908-4742-acdb-a7518bfe149b/bin/uautomizer/data/492a4dbf0/c4e9812a0bcd405b802142a6a0336d14 [2019-11-20 10:38:07,876 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 10:38:07,877 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 10:38:07,878 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 10:38:07,878 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 10:38:07,881 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 10:38:07,882 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 10:38:07" (1/1) ... [2019-11-20 10:38:07,885 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77dfb335 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:38:07, skipping insertion in model container [2019-11-20 10:38:07,885 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 10:38:07" (1/1) ... [2019-11-20 10:38:07,891 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 10:38:07,962 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 10:38:08,468 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 10:38:08,490 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 10:38:08,626 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 10:38:08,663 INFO L192 MainTranslator]: Completed translation [2019-11-20 10:38:08,664 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:38:08 WrapperNode [2019-11-20 10:38:08,664 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 10:38:08,665 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 10:38:08,665 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 10:38:08,665 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 10:38:08,675 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:38:08" (1/1) ... [2019-11-20 10:38:08,718 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:38:08" (1/1) ... [2019-11-20 10:38:08,773 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 10:38:08,780 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 10:38:08,780 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 10:38:08,781 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 10:38:08,790 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:38:08" (1/1) ... [2019-11-20 10:38:08,790 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:38:08" (1/1) ... [2019-11-20 10:38:08,811 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:38:08" (1/1) ... [2019-11-20 10:38:08,816 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:38:08" (1/1) ... [2019-11-20 10:38:08,852 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:38:08" (1/1) ... [2019-11-20 10:38:08,866 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:38:08" (1/1) ... [2019-11-20 10:38:08,883 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:38:08" (1/1) ... [2019-11-20 10:38:08,889 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 10:38:08,889 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 10:38:08,890 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 10:38:08,890 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 10:38:08,891 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:38:08" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_720df207-2908-4742-acdb-a7518bfe149b/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 10:38:08,956 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-20 10:38:08,956 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-20 10:38:08,957 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-20 10:38:08,957 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-20 10:38:08,958 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-20 10:38:08,958 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 10:38:08,958 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 10:38:08,958 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-20 10:38:09,255 WARN L736 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-20 10:38:13,839 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2019-11-20 10:38:13,839 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2019-11-20 10:38:13,840 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 10:38:13,841 INFO L285 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-20 10:38:13,842 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:38:13 BoogieIcfgContainer [2019-11-20 10:38:13,842 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 10:38:13,843 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-20 10:38:13,843 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-20 10:38:13,846 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-20 10:38:13,846 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 10:38:07" (1/3) ... [2019-11-20 10:38:13,847 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b3996d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 10:38:13, skipping insertion in model container [2019-11-20 10:38:13,848 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:38:08" (2/3) ... [2019-11-20 10:38:13,848 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b3996d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 10:38:13, skipping insertion in model container [2019-11-20 10:38:13,848 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:38:13" (3/3) ... [2019-11-20 10:38:13,850 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.11.i.cil-1.c [2019-11-20 10:38:13,860 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-20 10:38:13,866 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-20 10:38:13,876 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-20 10:38:13,898 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-20 10:38:13,899 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-20 10:38:13,899 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-20 10:38:13,899 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 10:38:13,899 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 10:38:13,899 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-20 10:38:13,900 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 10:38:13,900 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-20 10:38:13,918 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states. [2019-11-20 10:38:13,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-20 10:38:13,927 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:38:13,928 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-20 10:38:13,928 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:38:13,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:38:13,935 INFO L82 PathProgramCache]: Analyzing trace with hash -2031756972, now seen corresponding path program 1 times [2019-11-20 10:38:13,946 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 10:38:13,947 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [975417057] [2019-11-20 10:38:13,947 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_720df207-2908-4742-acdb-a7518bfe149b/bin/uautomizer/cvc4 Starting monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:38:14,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:38:14,149 INFO L255 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 10:38:14,156 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:38:14,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:38:14,207 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 10:38:14,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:38:14,236 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [975417057] [2019-11-20 10:38:14,236 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:38:14,237 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-20 10:38:14,238 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048330071] [2019-11-20 10:38:14,245 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:38:14,245 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 10:38:14,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:38:14,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:38:14,260 INFO L87 Difference]: Start difference. First operand 148 states. Second operand 4 states. [2019-11-20 10:38:14,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:38:14,525 INFO L93 Difference]: Finished difference Result 561 states and 957 transitions. [2019-11-20 10:38:14,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:38:14,527 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2019-11-20 10:38:14,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:38:14,551 INFO L225 Difference]: With dead ends: 561 [2019-11-20 10:38:14,551 INFO L226 Difference]: Without dead ends: 382 [2019-11-20 10:38:14,555 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:38:14,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2019-11-20 10:38:14,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 380. [2019-11-20 10:38:14,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2019-11-20 10:38:14,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 579 transitions. [2019-11-20 10:38:14,621 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 579 transitions. Word has length 35 [2019-11-20 10:38:14,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:38:14,622 INFO L462 AbstractCegarLoop]: Abstraction has 380 states and 579 transitions. [2019-11-20 10:38:14,622 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:38:14,622 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 579 transitions. [2019-11-20 10:38:14,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-11-20 10:38:14,625 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:38:14,626 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:38:14,828 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:38:14,829 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:38:14,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:38:14,829 INFO L82 PathProgramCache]: Analyzing trace with hash -1192573563, now seen corresponding path program 1 times [2019-11-20 10:38:14,830 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 10:38:14,830 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [2006908119] [2019-11-20 10:38:14,830 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_720df207-2908-4742-acdb-a7518bfe149b/bin/uautomizer/cvc4 Starting monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:38:15,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:38:15,031 INFO L255 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 10:38:15,035 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:38:15,059 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:38:15,059 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 10:38:15,085 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:38:15,086 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2006908119] [2019-11-20 10:38:15,086 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:38:15,086 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-20 10:38:15,087 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28900414] [2019-11-20 10:38:15,089 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:38:15,090 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 10:38:15,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:38:15,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:38:15,091 INFO L87 Difference]: Start difference. First operand 380 states and 579 transitions. Second operand 4 states. [2019-11-20 10:38:16,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:38:16,459 INFO L93 Difference]: Finished difference Result 876 states and 1345 transitions. [2019-11-20 10:38:16,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:38:16,460 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2019-11-20 10:38:16,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:38:16,464 INFO L225 Difference]: With dead ends: 876 [2019-11-20 10:38:16,464 INFO L226 Difference]: Without dead ends: 628 [2019-11-20 10:38:16,467 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:38:16,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 628 states. [2019-11-20 10:38:16,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 628 to 626. [2019-11-20 10:38:16,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2019-11-20 10:38:16,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 950 transitions. [2019-11-20 10:38:16,547 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 950 transitions. Word has length 59 [2019-11-20 10:38:16,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:38:16,549 INFO L462 AbstractCegarLoop]: Abstraction has 626 states and 950 transitions. [2019-11-20 10:38:16,549 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:38:16,552 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 950 transitions. [2019-11-20 10:38:16,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-11-20 10:38:16,563 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:38:16,564 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:38:16,776 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:38:16,776 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:38:16,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:38:16,777 INFO L82 PathProgramCache]: Analyzing trace with hash 1680839393, now seen corresponding path program 1 times [2019-11-20 10:38:16,777 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 10:38:16,777 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1917419109] [2019-11-20 10:38:16,778 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_720df207-2908-4742-acdb-a7518bfe149b/bin/uautomizer/cvc4 Starting monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:38:17,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:38:17,017 INFO L255 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 10:38:17,022 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:38:17,092 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 10:38:17,092 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 10:38:17,125 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 10:38:17,126 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1917419109] [2019-11-20 10:38:17,135 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:38:17,135 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-20 10:38:17,135 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40125803] [2019-11-20 10:38:17,137 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:38:17,138 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 10:38:17,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:38:17,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:38:17,139 INFO L87 Difference]: Start difference. First operand 626 states and 950 transitions. Second operand 4 states. [2019-11-20 10:38:18,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:38:18,198 INFO L93 Difference]: Finished difference Result 1366 states and 2085 transitions. [2019-11-20 10:38:18,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:38:18,199 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2019-11-20 10:38:18,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:38:18,204 INFO L225 Difference]: With dead ends: 1366 [2019-11-20 10:38:18,205 INFO L226 Difference]: Without dead ends: 872 [2019-11-20 10:38:18,207 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:38:18,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 872 states. [2019-11-20 10:38:18,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 872 to 872. [2019-11-20 10:38:18,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 872 states. [2019-11-20 10:38:18,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 1320 transitions. [2019-11-20 10:38:18,253 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 1320 transitions. Word has length 103 [2019-11-20 10:38:18,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:38:18,255 INFO L462 AbstractCegarLoop]: Abstraction has 872 states and 1320 transitions. [2019-11-20 10:38:18,255 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:38:18,255 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1320 transitions. [2019-11-20 10:38:18,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-11-20 10:38:18,258 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:38:18,259 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-20 10:38:18,461 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:38:18,461 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:38:18,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:38:18,461 INFO L82 PathProgramCache]: Analyzing trace with hash 1159018067, now seen corresponding path program 1 times [2019-11-20 10:38:18,462 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 10:38:18,463 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [2052795503] [2019-11-20 10:38:18,463 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_720df207-2908-4742-acdb-a7518bfe149b/bin/uautomizer/cvc4 Starting monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:38:22,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:38:22,051 INFO L255 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-20 10:38:22,057 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:38:22,136 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-20 10:38:22,136 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:38:22,149 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:38:22,149 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:38:22,149 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2019-11-20 10:38:22,179 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:38:22,180 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2019-11-20 10:38:22,181 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:38:22,196 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:38:22,196 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:38:22,197 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2019-11-20 10:38:22,236 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:38:22,236 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2019-11-20 10:38:22,237 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:38:22,242 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:38:22,242 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:38:22,242 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2019-11-20 10:38:22,283 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-11-20 10:38:22,283 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 10:38:22,346 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-11-20 10:38:22,347 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2052795503] [2019-11-20 10:38:22,347 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:38:22,347 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 4] imperfect sequences [] total 8 [2019-11-20 10:38:22,347 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858889107] [2019-11-20 10:38:22,348 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-20 10:38:22,348 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 10:38:22,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-20 10:38:22,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-20 10:38:22,349 INFO L87 Difference]: Start difference. First operand 872 states and 1320 transitions. Second operand 8 states. [2019-11-20 10:38:37,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:38:37,449 INFO L93 Difference]: Finished difference Result 3288 states and 4998 transitions. [2019-11-20 10:38:37,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-20 10:38:37,450 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 127 [2019-11-20 10:38:37,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:38:37,466 INFO L225 Difference]: With dead ends: 3288 [2019-11-20 10:38:37,466 INFO L226 Difference]: Without dead ends: 2424 [2019-11-20 10:38:37,469 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 246 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-11-20 10:38:37,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2424 states. [2019-11-20 10:38:37,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2424 to 1046. [2019-11-20 10:38:37,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1046 states. [2019-11-20 10:38:37,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1046 states to 1046 states and 1620 transitions. [2019-11-20 10:38:37,537 INFO L78 Accepts]: Start accepts. Automaton has 1046 states and 1620 transitions. Word has length 127 [2019-11-20 10:38:37,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:38:37,538 INFO L462 AbstractCegarLoop]: Abstraction has 1046 states and 1620 transitions. [2019-11-20 10:38:37,538 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-20 10:38:37,538 INFO L276 IsEmpty]: Start isEmpty. Operand 1046 states and 1620 transitions. [2019-11-20 10:38:37,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-11-20 10:38:37,546 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:38:37,546 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-20 10:38:37,760 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:38:37,760 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:38:37,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:38:37,761 INFO L82 PathProgramCache]: Analyzing trace with hash -799556719, now seen corresponding path program 1 times [2019-11-20 10:38:37,762 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 10:38:37,763 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1666764552] [2019-11-20 10:38:37,763 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_720df207-2908-4742-acdb-a7518bfe149b/bin/uautomizer/cvc4 Starting monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:38:41,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 10:38:45,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 10:38:45,973 INFO L174 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2019-11-20 10:38:45,973 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-20 10:38:46,196 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:38:46,395 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 10:38:46 BoogieIcfgContainer [2019-11-20 10:38:46,395 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-20 10:38:46,396 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-20 10:38:46,396 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-20 10:38:46,396 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-20 10:38:46,397 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:38:13" (3/4) ... [2019-11-20 10:38:46,399 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-20 10:38:46,517 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_720df207-2908-4742-acdb-a7518bfe149b/bin/uautomizer/witness.graphml [2019-11-20 10:38:46,517 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-20 10:38:46,519 INFO L168 Benchmark]: Toolchain (without parser) took 38641.68 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 282.6 MB). Free memory was 951.0 MB in the beginning and 1.2 GB in the end (delta: -267.0 MB). Peak memory consumption was 15.6 MB. Max. memory is 11.5 GB. [2019-11-20 10:38:46,519 INFO L168 Benchmark]: CDTParser took 0.30 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 10:38:46,519 INFO L168 Benchmark]: CACSL2BoogieTranslator took 786.44 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.3 MB). Free memory was 951.0 MB in the beginning and 1.1 GB in the end (delta: -169.5 MB). Peak memory consumption was 28.4 MB. Max. memory is 11.5 GB. [2019-11-20 10:38:46,520 INFO L168 Benchmark]: Boogie Procedure Inliner took 115.25 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.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-20 10:38:46,520 INFO L168 Benchmark]: Boogie Preprocessor took 108.83 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.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-20 10:38:46,520 INFO L168 Benchmark]: RCFGBuilder took 4953.09 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: 97.1 MB). Peak memory consumption was 97.1 MB. Max. memory is 11.5 GB. [2019-11-20 10:38:46,521 INFO L168 Benchmark]: TraceAbstraction took 32552.03 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 135.3 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -225.3 MB). Peak memory consumption was 271.2 MB. Max. memory is 11.5 GB. [2019-11-20 10:38:46,521 INFO L168 Benchmark]: Witness Printer took 121.91 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 17.5 MB). Peak memory consumption was 17.5 MB. Max. memory is 11.5 GB. [2019-11-20 10:38:46,523 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.30 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 786.44 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.3 MB). Free memory was 951.0 MB in the beginning and 1.1 GB in the end (delta: -169.5 MB). Peak memory consumption was 28.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 115.25 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.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 108.83 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.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 4953.09 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: 97.1 MB). Peak memory consumption was 97.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 32552.03 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 135.3 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -225.3 MB). Peak memory consumption was 271.2 MB. Max. memory is 11.5 GB. * Witness Printer took 121.91 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 17.5 MB). Peak memory consumption was 17.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1726]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L1042] static int init = 1; [L1043] static SSL_METHOD SSLv3_server_data ; VAL [init=1, SSLv3_server_data={2147483645:0}] [L1065] SSL *s ; [L1066] int tmp ; [L1070] s = malloc(sizeof(SSL)) [L1071] s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1072] s->ctx = malloc(sizeof(SSL_CTX)) [L1073] s->session = malloc(sizeof(SSL_SESSION)) [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={2147483645:0}] [L1115] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1116] EXPR s->info_callback [L1116] cb = s->info_callback [L1120] EXPR s->in_handshake [L1120] s->in_handshake += 1 [L1121] COND FALSE !(tmp___1 & 12288) VAL [init=1, SSLv3_server_data={2147483645:0}] [L1130] EXPR s->cert VAL [init=1, SSLv3_server_data={2147483645:0}] [L1130] COND FALSE !((unsigned long )s->cert == (unsigned long )((void *)0)) [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={2147483645:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1163] COND TRUE s->state == 8464 [L1323] s->shutdown = 0 [L1324] ret = __VERIFIER_nondet_int() [L1325] COND TRUE blastFlag == 0 [L1326] blastFlag = 1 VAL [init=1, SSLv3_server_data={2147483645:0}] [L1330] COND FALSE !(ret <= 0) [L1335] got_new_session = 1 [L1336] s->state = 8496 [L1337] s->init_num = 0 VAL [init=1, SSLv3_server_data={2147483645:0}] [L1685] EXPR s->s3 [L1685] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={2147483645:0}] [L1685] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1714] skip = 0 VAL [init=1, SSLv3_server_data={2147483645:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={2147483645:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1172] COND TRUE s->state == 8496 [L1341] ret = __VERIFIER_nondet_int() [L1342] COND TRUE blastFlag == 1 [L1343] blastFlag = 2 VAL [init=1, SSLv3_server_data={2147483645:0}] [L1347] COND FALSE !(ret <= 0) [L1352] s->hit VAL [init=1, SSLv3_server_data={2147483645:0}] [L1352] COND FALSE !(s->hit) [L1355] s->state = 8512 VAL [init=1, SSLv3_server_data={2147483645:0}] [L1357] s->init_num = 0 VAL [init=1, SSLv3_server_data={2147483645:0}] [L1685] EXPR s->s3 [L1685] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={2147483645:0}] [L1685] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1714] skip = 0 VAL [init=1, SSLv3_server_data={2147483645:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={2147483645:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1178] COND 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={2147483645: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={2147483645:0}] [L1370] COND FALSE !(ret <= 0) VAL [init=1, SSLv3_server_data={2147483645:0}] [L1376] s->state = 8528 [L1377] s->init_num = 0 VAL [init=1, SSLv3_server_data={2147483645:0}] [L1685] EXPR s->s3 [L1685] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={2147483645:0}] [L1685] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1714] skip = 0 VAL [init=1, SSLv3_server_data={2147483645:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={2147483645:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1184] COND 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={2147483645: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={2147483645: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={2147483645:0}] [L1411] COND FALSE !(ret <= 0) VAL [init=1, SSLv3_server_data={2147483645:0}] [L1428] s->state = 8544 [L1429] s->init_num = 0 VAL [init=1, SSLv3_server_data={2147483645:0}] [L1685] EXPR s->s3 [L1685] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={2147483645:0}] [L1685] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1714] skip = 0 VAL [init=1, SSLv3_server_data={2147483645:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={2147483645:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1190] COND TRUE s->state == 8544 [L1433] EXPR s->verify_mode VAL [init=1, SSLv3_server_data={2147483645:0}] [L1433] COND TRUE s->verify_mode & 1 [L1434] EXPR s->session [L1434] EXPR (s->session)->peer VAL [init=1, SSLv3_server_data={2147483645: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={2147483645: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={2147483645:0}] [L1726] __VERIFIER_error() VAL [init=1, SSLv3_server_data={2147483645:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 148 locations, 1 error locations. Result: UNSAFE, OverallTime: 32.4s, OverallIterations: 5, TraceHistogramMax: 5, AutomataDifference: 17.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1142 SDtfs, 1897 SDslu, 1743 SDs, 0 SdLazy, 896 SolverSat, 188 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 16.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 644 GetRequests, 628 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1046occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 4 MinimizatonAttempts, 1382 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 7.4s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 451 NumberOfCodeBlocks, 451 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 640 ConstructedInterpolants, 0 QuantifiedInterpolants, 197988 SizeOfPredicates, 8 NumberOfNonLiveVariables, 873 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 506/506 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...