./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ssh/s3_srvr.blast.01.i.cil-2.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_b1f27260-aeaf-4802-85b9-95fe0a263f77/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_b1f27260-aeaf-4802-85b9-95fe0a263f77/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_b1f27260-aeaf-4802-85b9-95fe0a263f77/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_b1f27260-aeaf-4802-85b9-95fe0a263f77/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh/s3_srvr.blast.01.i.cil-2.c -s /tmp/vcloud-vcloud-master/worker/run_dir_b1f27260-aeaf-4802-85b9-95fe0a263f77/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_b1f27260-aeaf-4802-85b9-95fe0a263f77/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 9eb992f5fc2d1a4c635ca3f801d15ea699dd32d7 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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_b1f27260-aeaf-4802-85b9-95fe0a263f77/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_b1f27260-aeaf-4802-85b9-95fe0a263f77/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_b1f27260-aeaf-4802-85b9-95fe0a263f77/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_b1f27260-aeaf-4802-85b9-95fe0a263f77/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh/s3_srvr.blast.01.i.cil-2.c -s /tmp/vcloud-vcloud-master/worker/run_dir_b1f27260-aeaf-4802-85b9-95fe0a263f77/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_b1f27260-aeaf-4802-85b9-95fe0a263f77/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 9eb992f5fc2d1a4c635ca3f801d15ea699dd32d7 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-678e011 [2019-11-19 21:58:11,456 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-19 21:58:11,458 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-19 21:58:11,491 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-19 21:58:11,491 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-19 21:58:11,493 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-19 21:58:11,495 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-19 21:58:11,504 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-19 21:58:11,509 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-19 21:58:11,513 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-19 21:58:11,515 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-19 21:58:11,517 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-19 21:58:11,517 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-19 21:58:11,519 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-19 21:58:11,520 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-19 21:58:11,522 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-19 21:58:11,523 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-19 21:58:11,524 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-19 21:58:11,527 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-19 21:58:11,531 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-19 21:58:11,535 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-19 21:58:11,537 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-19 21:58:11,540 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-19 21:58:11,541 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-19 21:58:11,543 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-19 21:58:11,544 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-19 21:58:11,544 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-19 21:58:11,545 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-19 21:58:11,546 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-19 21:58:11,547 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-19 21:58:11,547 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-19 21:58:11,548 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-19 21:58:11,549 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-19 21:58:11,550 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-19 21:58:11,551 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-19 21:58:11,551 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-19 21:58:11,552 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-19 21:58:11,552 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-19 21:58:11,552 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-19 21:58:11,553 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-19 21:58:11,554 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-19 21:58:11,555 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_b1f27260-aeaf-4802-85b9-95fe0a263f77/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-19 21:58:11,581 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-19 21:58:11,591 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-19 21:58:11,592 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-19 21:58:11,592 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-19 21:58:11,593 INFO L138 SettingsManager]: * Use SBE=true [2019-11-19 21:58:11,593 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-19 21:58:11,593 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-19 21:58:11,593 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-19 21:58:11,594 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-19 21:58:11,594 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-19 21:58:11,594 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-19 21:58:11,594 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-19 21:58:11,595 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-19 21:58:11,595 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-19 21:58:11,595 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-19 21:58:11,595 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-19 21:58:11,595 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-19 21:58:11,596 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-19 21:58:11,596 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-19 21:58:11,596 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-19 21:58:11,596 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-19 21:58:11,596 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-19 21:58:11,597 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-19 21:58:11,597 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-19 21:58:11,597 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-19 21:58:11,598 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-19 21:58:11,598 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-19 21:58:11,599 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-19 21:58:11,599 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_b1f27260-aeaf-4802-85b9-95fe0a263f77/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 -> 9eb992f5fc2d1a4c635ca3f801d15ea699dd32d7 [2019-11-19 21:58:11,772 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-19 21:58:11,785 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-19 21:58:11,788 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-19 21:58:11,790 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-19 21:58:11,790 INFO L275 PluginConnector]: CDTParser initialized [2019-11-19 21:58:11,791 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_b1f27260-aeaf-4802-85b9-95fe0a263f77/bin/uautomizer/../../sv-benchmarks/c/ssh/s3_srvr.blast.01.i.cil-2.c [2019-11-19 21:58:11,849 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_b1f27260-aeaf-4802-85b9-95fe0a263f77/bin/uautomizer/data/080c1b46e/16a731d68ec246839e6cafdf91980f18/FLAG91c53e814 [2019-11-19 21:58:12,425 INFO L306 CDTParser]: Found 1 translation units. [2019-11-19 21:58:12,426 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_b1f27260-aeaf-4802-85b9-95fe0a263f77/sv-benchmarks/c/ssh/s3_srvr.blast.01.i.cil-2.c [2019-11-19 21:58:12,460 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_b1f27260-aeaf-4802-85b9-95fe0a263f77/bin/uautomizer/data/080c1b46e/16a731d68ec246839e6cafdf91980f18/FLAG91c53e814 [2019-11-19 21:58:12,661 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_b1f27260-aeaf-4802-85b9-95fe0a263f77/bin/uautomizer/data/080c1b46e/16a731d68ec246839e6cafdf91980f18 [2019-11-19 21:58:12,664 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-19 21:58:12,665 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-19 21:58:12,666 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-19 21:58:12,667 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-19 21:58:12,670 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-19 21:58:12,671 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:58:12" (1/1) ... [2019-11-19 21:58:12,673 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@416f8652 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:58:12, skipping insertion in model container [2019-11-19 21:58:12,673 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:58:12" (1/1) ... [2019-11-19 21:58:12,683 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-19 21:58:12,737 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-19 21:58:13,322 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 21:58:13,344 INFO L188 MainTranslator]: Completed pre-run [2019-11-19 21:58:13,466 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 21:58:13,486 INFO L192 MainTranslator]: Completed translation [2019-11-19 21:58:13,486 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:58:13 WrapperNode [2019-11-19 21:58:13,487 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-19 21:58:13,487 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-19 21:58:13,488 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-19 21:58:13,488 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-19 21:58:13,496 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:58:13" (1/1) ... [2019-11-19 21:58:13,519 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:58:13" (1/1) ... [2019-11-19 21:58:13,576 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-19 21:58:13,582 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-19 21:58:13,582 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-19 21:58:13,582 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-19 21:58:13,592 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:58:13" (1/1) ... [2019-11-19 21:58:13,592 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:58:13" (1/1) ... [2019-11-19 21:58:13,614 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:58:13" (1/1) ... [2019-11-19 21:58:13,619 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:58:13" (1/1) ... [2019-11-19 21:58:13,670 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:58:13" (1/1) ... [2019-11-19 21:58:13,685 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:58:13" (1/1) ... [2019-11-19 21:58:13,702 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:58:13" (1/1) ... [2019-11-19 21:58:13,707 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-19 21:58:13,708 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-19 21:58:13,708 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-19 21:58:13,708 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-19 21:58:13,709 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:58:13" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b1f27260-aeaf-4802-85b9-95fe0a263f77/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-19 21:58:13,794 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-19 21:58:13,794 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-19 21:58:13,795 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-19 21:58:13,795 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-19 21:58:13,796 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-19 21:58:13,796 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-19 21:58:13,796 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-19 21:58:13,796 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-19 21:58:14,040 WARN L736 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-19 21:58:14,892 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2019-11-19 21:58:14,893 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2019-11-19 21:58:14,894 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-19 21:58:14,894 INFO L285 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-19 21:58:14,895 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:58:14 BoogieIcfgContainer [2019-11-19 21:58:14,895 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-19 21:58:14,896 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-19 21:58:14,896 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-19 21:58:14,902 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-19 21:58:14,903 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 09:58:12" (1/3) ... [2019-11-19 21:58:14,905 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ab44af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:58:14, skipping insertion in model container [2019-11-19 21:58:14,906 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:58:13" (2/3) ... [2019-11-19 21:58:14,906 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ab44af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:58:14, skipping insertion in model container [2019-11-19 21:58:14,906 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:58:14" (3/3) ... [2019-11-19 21:58:14,909 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.01.i.cil-2.c [2019-11-19 21:58:14,920 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-19 21:58:14,928 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-19 21:58:14,939 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-19 21:58:14,965 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-19 21:58:14,966 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-19 21:58:14,966 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-19 21:58:14,966 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-19 21:58:14,966 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-19 21:58:14,966 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-19 21:58:14,966 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-19 21:58:14,966 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-19 21:58:14,985 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states. [2019-11-19 21:58:14,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-19 21:58:14,997 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:58:14,998 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:58:14,999 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:58:15,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:58:15,004 INFO L82 PathProgramCache]: Analyzing trace with hash 522834703, now seen corresponding path program 1 times [2019-11-19 21:58:15,013 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:58:15,013 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453713421] [2019-11-19 21:58:15,014 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:58:15,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:58:15,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 21:58:15,369 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453713421] [2019-11-19 21:58:15,370 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:58:15,370 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 21:58:15,371 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100339598] [2019-11-19 21:58:15,375 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 21:58:15,375 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:58:15,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 21:58:15,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 21:58:15,391 INFO L87 Difference]: Start difference. First operand 145 states. Second operand 4 states. [2019-11-19 21:58:15,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:58:15,925 INFO L93 Difference]: Finished difference Result 317 states and 530 transitions. [2019-11-19 21:58:15,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 21:58:15,927 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2019-11-19 21:58:15,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:58:15,953 INFO L225 Difference]: With dead ends: 317 [2019-11-19 21:58:15,953 INFO L226 Difference]: Without dead ends: 160 [2019-11-19 21:58:15,957 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-19 21:58:15,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-11-19 21:58:16,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 143. [2019-11-19 21:58:16,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-11-19 21:58:16,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 219 transitions. [2019-11-19 21:58:16,038 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 219 transitions. Word has length 45 [2019-11-19 21:58:16,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:58:16,038 INFO L462 AbstractCegarLoop]: Abstraction has 143 states and 219 transitions. [2019-11-19 21:58:16,039 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 21:58:16,039 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 219 transitions. [2019-11-19 21:58:16,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-11-19 21:58:16,048 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:58:16,048 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:58:16,048 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:58:16,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:58:16,049 INFO L82 PathProgramCache]: Analyzing trace with hash -1923702817, now seen corresponding path program 1 times [2019-11-19 21:58:16,049 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:58:16,049 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006820085] [2019-11-19 21:58:16,050 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:58:16,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:58:16,239 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 21:58:16,239 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006820085] [2019-11-19 21:58:16,239 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:58:16,240 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 21:58:16,240 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34127108] [2019-11-19 21:58:16,242 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 21:58:16,242 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:58:16,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 21:58:16,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 21:58:16,243 INFO L87 Difference]: Start difference. First operand 143 states and 219 transitions. Second operand 4 states. [2019-11-19 21:58:16,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:58:16,619 INFO L93 Difference]: Finished difference Result 284 states and 429 transitions. [2019-11-19 21:58:16,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 21:58:16,620 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2019-11-19 21:58:16,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:58:16,622 INFO L225 Difference]: With dead ends: 284 [2019-11-19 21:58:16,622 INFO L226 Difference]: Without dead ends: 160 [2019-11-19 21:58:16,624 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-19 21:58:16,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-11-19 21:58:16,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 143. [2019-11-19 21:58:16,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-11-19 21:58:16,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 218 transitions. [2019-11-19 21:58:16,636 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 218 transitions. Word has length 58 [2019-11-19 21:58:16,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:58:16,636 INFO L462 AbstractCegarLoop]: Abstraction has 143 states and 218 transitions. [2019-11-19 21:58:16,636 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 21:58:16,636 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 218 transitions. [2019-11-19 21:58:16,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-11-19 21:58:16,639 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:58:16,639 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:58:16,639 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:58:16,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:58:16,640 INFO L82 PathProgramCache]: Analyzing trace with hash -2009873572, now seen corresponding path program 1 times [2019-11-19 21:58:16,640 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:58:16,640 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577912666] [2019-11-19 21:58:16,641 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:58:16,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:58:16,784 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 21:58:16,784 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577912666] [2019-11-19 21:58:16,784 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:58:16,785 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 21:58:16,785 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264321866] [2019-11-19 21:58:16,786 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 21:58:16,788 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:58:16,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 21:58:16,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 21:58:16,789 INFO L87 Difference]: Start difference. First operand 143 states and 218 transitions. Second operand 4 states. [2019-11-19 21:58:17,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:58:17,125 INFO L93 Difference]: Finished difference Result 282 states and 426 transitions. [2019-11-19 21:58:17,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 21:58:17,126 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2019-11-19 21:58:17,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:58:17,127 INFO L225 Difference]: With dead ends: 282 [2019-11-19 21:58:17,127 INFO L226 Difference]: Without dead ends: 158 [2019-11-19 21:58:17,128 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-19 21:58:17,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-11-19 21:58:17,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 143. [2019-11-19 21:58:17,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-11-19 21:58:17,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 217 transitions. [2019-11-19 21:58:17,139 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 217 transitions. Word has length 59 [2019-11-19 21:58:17,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:58:17,139 INFO L462 AbstractCegarLoop]: Abstraction has 143 states and 217 transitions. [2019-11-19 21:58:17,139 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 21:58:17,140 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 217 transitions. [2019-11-19 21:58:17,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-11-19 21:58:17,141 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:58:17,142 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:58:17,142 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:58:17,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:58:17,142 INFO L82 PathProgramCache]: Analyzing trace with hash 1439655328, now seen corresponding path program 1 times [2019-11-19 21:58:17,143 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:58:17,143 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812374308] [2019-11-19 21:58:17,143 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:58:17,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:58:17,252 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 21:58:17,253 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812374308] [2019-11-19 21:58:17,253 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:58:17,253 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 21:58:17,253 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576296153] [2019-11-19 21:58:17,254 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 21:58:17,254 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:58:17,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 21:58:17,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 21:58:17,254 INFO L87 Difference]: Start difference. First operand 143 states and 217 transitions. Second operand 4 states. [2019-11-19 21:58:17,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:58:17,589 INFO L93 Difference]: Finished difference Result 281 states and 424 transitions. [2019-11-19 21:58:17,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 21:58:17,590 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2019-11-19 21:58:17,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:58:17,591 INFO L225 Difference]: With dead ends: 281 [2019-11-19 21:58:17,592 INFO L226 Difference]: Without dead ends: 157 [2019-11-19 21:58:17,592 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-19 21:58:17,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-11-19 21:58:17,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 143. [2019-11-19 21:58:17,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-11-19 21:58:17,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 216 transitions. [2019-11-19 21:58:17,611 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 216 transitions. Word has length 59 [2019-11-19 21:58:17,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:58:17,613 INFO L462 AbstractCegarLoop]: Abstraction has 143 states and 216 transitions. [2019-11-19 21:58:17,614 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 21:58:17,614 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 216 transitions. [2019-11-19 21:58:17,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-11-19 21:58:17,619 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:58:17,620 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:58:17,620 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:58:17,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:58:17,620 INFO L82 PathProgramCache]: Analyzing trace with hash 1630534542, now seen corresponding path program 1 times [2019-11-19 21:58:17,621 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:58:17,621 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48677837] [2019-11-19 21:58:17,621 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:58:17,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:58:17,729 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 21:58:17,730 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48677837] [2019-11-19 21:58:17,730 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:58:17,730 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 21:58:17,731 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812989865] [2019-11-19 21:58:17,732 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 21:58:17,733 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:58:17,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 21:58:17,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 21:58:17,735 INFO L87 Difference]: Start difference. First operand 143 states and 216 transitions. Second operand 4 states. [2019-11-19 21:58:18,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:58:18,041 INFO L93 Difference]: Finished difference Result 280 states and 422 transitions. [2019-11-19 21:58:18,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 21:58:18,042 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2019-11-19 21:58:18,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:58:18,043 INFO L225 Difference]: With dead ends: 280 [2019-11-19 21:58:18,043 INFO L226 Difference]: Without dead ends: 156 [2019-11-19 21:58:18,044 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-19 21:58:18,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2019-11-19 21:58:18,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 143. [2019-11-19 21:58:18,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-11-19 21:58:18,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 215 transitions. [2019-11-19 21:58:18,051 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 215 transitions. Word has length 60 [2019-11-19 21:58:18,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:58:18,052 INFO L462 AbstractCegarLoop]: Abstraction has 143 states and 215 transitions. [2019-11-19 21:58:18,052 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 21:58:18,052 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 215 transitions. [2019-11-19 21:58:18,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-11-19 21:58:18,053 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:58:18,053 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:58:18,053 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:58:18,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:58:18,054 INFO L82 PathProgramCache]: Analyzing trace with hash 1839064698, now seen corresponding path program 1 times [2019-11-19 21:58:18,054 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:58:18,054 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804942468] [2019-11-19 21:58:18,054 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:58:18,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:58:18,110 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 21:58:18,111 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804942468] [2019-11-19 21:58:18,111 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:58:18,111 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 21:58:18,111 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715459616] [2019-11-19 21:58:18,111 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 21:58:18,112 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:58:18,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 21:58:18,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 21:58:18,112 INFO L87 Difference]: Start difference. First operand 143 states and 215 transitions. Second operand 4 states. [2019-11-19 21:58:18,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:58:18,394 INFO L93 Difference]: Finished difference Result 280 states and 421 transitions. [2019-11-19 21:58:18,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 21:58:18,395 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2019-11-19 21:58:18,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:58:18,396 INFO L225 Difference]: With dead ends: 280 [2019-11-19 21:58:18,396 INFO L226 Difference]: Without dead ends: 156 [2019-11-19 21:58:18,397 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-19 21:58:18,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2019-11-19 21:58:18,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 143. [2019-11-19 21:58:18,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-11-19 21:58:18,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 214 transitions. [2019-11-19 21:58:18,403 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 214 transitions. Word has length 60 [2019-11-19 21:58:18,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:58:18,404 INFO L462 AbstractCegarLoop]: Abstraction has 143 states and 214 transitions. [2019-11-19 21:58:18,404 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 21:58:18,404 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 214 transitions. [2019-11-19 21:58:18,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-11-19 21:58:18,405 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:58:18,405 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:58:18,406 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:58:18,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:58:18,406 INFO L82 PathProgramCache]: Analyzing trace with hash 476213239, now seen corresponding path program 1 times [2019-11-19 21:58:18,406 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:58:18,406 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609862536] [2019-11-19 21:58:18,407 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:58:18,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:58:18,459 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 21:58:18,460 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609862536] [2019-11-19 21:58:18,460 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:58:18,460 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 21:58:18,461 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559021259] [2019-11-19 21:58:18,461 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 21:58:18,461 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:58:18,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 21:58:18,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 21:58:18,462 INFO L87 Difference]: Start difference. First operand 143 states and 214 transitions. Second operand 4 states. [2019-11-19 21:58:18,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:58:18,750 INFO L93 Difference]: Finished difference Result 280 states and 420 transitions. [2019-11-19 21:58:18,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 21:58:18,751 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2019-11-19 21:58:18,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:58:18,752 INFO L225 Difference]: With dead ends: 280 [2019-11-19 21:58:18,752 INFO L226 Difference]: Without dead ends: 156 [2019-11-19 21:58:18,753 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-19 21:58:18,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2019-11-19 21:58:18,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 143. [2019-11-19 21:58:18,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-11-19 21:58:18,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 213 transitions. [2019-11-19 21:58:18,758 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 213 transitions. Word has length 61 [2019-11-19 21:58:18,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:58:18,758 INFO L462 AbstractCegarLoop]: Abstraction has 143 states and 213 transitions. [2019-11-19 21:58:18,758 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 21:58:18,758 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 213 transitions. [2019-11-19 21:58:18,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-11-19 21:58:18,759 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:58:18,759 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:58:18,760 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:58:18,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:58:18,760 INFO L82 PathProgramCache]: Analyzing trace with hash -25209675, now seen corresponding path program 1 times [2019-11-19 21:58:18,760 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:58:18,760 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817608053] [2019-11-19 21:58:18,760 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:58:18,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:58:18,815 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 21:58:18,816 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817608053] [2019-11-19 21:58:18,816 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:58:18,816 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 21:58:18,816 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258420408] [2019-11-19 21:58:18,817 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 21:58:18,817 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:58:18,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 21:58:18,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 21:58:18,817 INFO L87 Difference]: Start difference. First operand 143 states and 213 transitions. Second operand 4 states. [2019-11-19 21:58:19,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:58:19,101 INFO L93 Difference]: Finished difference Result 280 states and 419 transitions. [2019-11-19 21:58:19,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 21:58:19,102 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2019-11-19 21:58:19,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:58:19,103 INFO L225 Difference]: With dead ends: 280 [2019-11-19 21:58:19,103 INFO L226 Difference]: Without dead ends: 156 [2019-11-19 21:58:19,104 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-19 21:58:19,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2019-11-19 21:58:19,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 143. [2019-11-19 21:58:19,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-11-19 21:58:19,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 212 transitions. [2019-11-19 21:58:19,109 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 212 transitions. Word has length 62 [2019-11-19 21:58:19,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:58:19,109 INFO L462 AbstractCegarLoop]: Abstraction has 143 states and 212 transitions. [2019-11-19 21:58:19,109 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 21:58:19,109 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 212 transitions. [2019-11-19 21:58:19,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-11-19 21:58:19,110 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:58:19,110 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:58:19,110 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:58:19,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:58:19,111 INFO L82 PathProgramCache]: Analyzing trace with hash 1383513241, now seen corresponding path program 1 times [2019-11-19 21:58:19,111 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:58:19,111 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784938567] [2019-11-19 21:58:19,111 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:58:19,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:58:19,160 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 21:58:19,161 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784938567] [2019-11-19 21:58:19,161 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:58:19,161 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 21:58:19,161 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444174195] [2019-11-19 21:58:19,162 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 21:58:19,162 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:58:19,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 21:58:19,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 21:58:19,162 INFO L87 Difference]: Start difference. First operand 143 states and 212 transitions. Second operand 4 states. [2019-11-19 21:58:19,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:58:19,459 INFO L93 Difference]: Finished difference Result 310 states and 467 transitions. [2019-11-19 21:58:19,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 21:58:19,460 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2019-11-19 21:58:19,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:58:19,461 INFO L225 Difference]: With dead ends: 310 [2019-11-19 21:58:19,461 INFO L226 Difference]: Without dead ends: 186 [2019-11-19 21:58:19,462 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-19 21:58:19,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-11-19 21:58:19,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 165. [2019-11-19 21:58:19,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-11-19 21:58:19,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 250 transitions. [2019-11-19 21:58:19,467 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 250 transitions. Word has length 62 [2019-11-19 21:58:19,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:58:19,468 INFO L462 AbstractCegarLoop]: Abstraction has 165 states and 250 transitions. [2019-11-19 21:58:19,468 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 21:58:19,468 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 250 transitions. [2019-11-19 21:58:19,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-11-19 21:58:19,469 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:58:19,469 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:58:19,469 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:58:19,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:58:19,472 INFO L82 PathProgramCache]: Analyzing trace with hash 407848530, now seen corresponding path program 1 times [2019-11-19 21:58:19,472 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:58:19,473 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120564455] [2019-11-19 21:58:19,473 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:58:19,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:58:19,538 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 21:58:19,538 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120564455] [2019-11-19 21:58:19,539 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:58:19,539 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 21:58:19,539 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959627774] [2019-11-19 21:58:19,539 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 21:58:19,539 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:58:19,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 21:58:19,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 21:58:19,540 INFO L87 Difference]: Start difference. First operand 165 states and 250 transitions. Second operand 4 states. [2019-11-19 21:58:19,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:58:19,810 INFO L93 Difference]: Finished difference Result 314 states and 481 transitions. [2019-11-19 21:58:19,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 21:58:19,810 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2019-11-19 21:58:19,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:58:19,812 INFO L225 Difference]: With dead ends: 314 [2019-11-19 21:58:19,812 INFO L226 Difference]: Without dead ends: 168 [2019-11-19 21:58:19,813 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-19 21:58:19,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2019-11-19 21:58:19,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 165. [2019-11-19 21:58:19,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-11-19 21:58:19,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 249 transitions. [2019-11-19 21:58:19,819 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 249 transitions. Word has length 63 [2019-11-19 21:58:19,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:58:19,819 INFO L462 AbstractCegarLoop]: Abstraction has 165 states and 249 transitions. [2019-11-19 21:58:19,819 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 21:58:19,820 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 249 transitions. [2019-11-19 21:58:19,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-11-19 21:58:19,821 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:58:19,821 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:58:19,821 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:58:19,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:58:19,823 INFO L82 PathProgramCache]: Analyzing trace with hash -1281685867, now seen corresponding path program 1 times [2019-11-19 21:58:19,823 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:58:19,823 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261962535] [2019-11-19 21:58:19,823 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:58:19,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:58:19,889 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 21:58:19,890 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261962535] [2019-11-19 21:58:19,890 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:58:19,890 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 21:58:19,890 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83282842] [2019-11-19 21:58:19,891 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 21:58:19,891 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:58:19,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 21:58:19,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 21:58:19,891 INFO L87 Difference]: Start difference. First operand 165 states and 249 transitions. Second operand 4 states. [2019-11-19 21:58:20,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:58:20,228 INFO L93 Difference]: Finished difference Result 332 states and 503 transitions. [2019-11-19 21:58:20,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 21:58:20,229 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2019-11-19 21:58:20,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:58:20,230 INFO L225 Difference]: With dead ends: 332 [2019-11-19 21:58:20,231 INFO L226 Difference]: Without dead ends: 186 [2019-11-19 21:58:20,231 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-19 21:58:20,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-11-19 21:58:20,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 165. [2019-11-19 21:58:20,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-11-19 21:58:20,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 248 transitions. [2019-11-19 21:58:20,262 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 248 transitions. Word has length 75 [2019-11-19 21:58:20,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:58:20,262 INFO L462 AbstractCegarLoop]: Abstraction has 165 states and 248 transitions. [2019-11-19 21:58:20,262 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 21:58:20,262 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 248 transitions. [2019-11-19 21:58:20,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-11-19 21:58:20,263 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:58:20,263 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:58:20,264 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:58:20,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:58:20,264 INFO L82 PathProgramCache]: Analyzing trace with hash 712782694, now seen corresponding path program 1 times [2019-11-19 21:58:20,264 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:58:20,264 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546075311] [2019-11-19 21:58:20,264 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:58:20,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:58:20,311 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 21:58:20,312 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546075311] [2019-11-19 21:58:20,312 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:58:20,312 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 21:58:20,312 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712235207] [2019-11-19 21:58:20,313 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 21:58:20,313 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:58:20,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 21:58:20,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 21:58:20,313 INFO L87 Difference]: Start difference. First operand 165 states and 248 transitions. Second operand 4 states. [2019-11-19 21:58:20,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:58:20,631 INFO L93 Difference]: Finished difference Result 330 states and 499 transitions. [2019-11-19 21:58:20,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 21:58:20,632 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2019-11-19 21:58:20,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:58:20,633 INFO L225 Difference]: With dead ends: 330 [2019-11-19 21:58:20,633 INFO L226 Difference]: Without dead ends: 184 [2019-11-19 21:58:20,634 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-19 21:58:20,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2019-11-19 21:58:20,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 165. [2019-11-19 21:58:20,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-11-19 21:58:20,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 247 transitions. [2019-11-19 21:58:20,643 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 247 transitions. Word has length 76 [2019-11-19 21:58:20,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:58:20,644 INFO L462 AbstractCegarLoop]: Abstraction has 165 states and 247 transitions. [2019-11-19 21:58:20,644 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 21:58:20,644 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 247 transitions. [2019-11-19 21:58:20,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-11-19 21:58:20,645 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:58:20,645 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:58:20,645 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:58:20,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:58:20,646 INFO L82 PathProgramCache]: Analyzing trace with hash -132655702, now seen corresponding path program 1 times [2019-11-19 21:58:20,646 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:58:20,646 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070108642] [2019-11-19 21:58:20,646 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:58:20,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:58:20,701 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 21:58:20,702 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070108642] [2019-11-19 21:58:20,702 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:58:20,702 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 21:58:20,702 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36935549] [2019-11-19 21:58:20,703 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 21:58:20,703 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:58:20,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 21:58:20,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 21:58:20,704 INFO L87 Difference]: Start difference. First operand 165 states and 247 transitions. Second operand 4 states. [2019-11-19 21:58:21,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:58:21,021 INFO L93 Difference]: Finished difference Result 329 states and 496 transitions. [2019-11-19 21:58:21,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 21:58:21,021 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2019-11-19 21:58:21,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:58:21,023 INFO L225 Difference]: With dead ends: 329 [2019-11-19 21:58:21,023 INFO L226 Difference]: Without dead ends: 183 [2019-11-19 21:58:21,023 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-19 21:58:21,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2019-11-19 21:58:21,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 165. [2019-11-19 21:58:21,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-11-19 21:58:21,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 246 transitions. [2019-11-19 21:58:21,029 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 246 transitions. Word has length 76 [2019-11-19 21:58:21,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:58:21,029 INFO L462 AbstractCegarLoop]: Abstraction has 165 states and 246 transitions. [2019-11-19 21:58:21,029 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 21:58:21,029 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 246 transitions. [2019-11-19 21:58:21,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-11-19 21:58:21,031 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:58:21,031 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:58:21,032 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:58:21,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:58:21,034 INFO L82 PathProgramCache]: Analyzing trace with hash 133532868, now seen corresponding path program 1 times [2019-11-19 21:58:21,034 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:58:21,034 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501525396] [2019-11-19 21:58:21,035 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:58:21,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:58:21,083 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 21:58:21,083 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501525396] [2019-11-19 21:58:21,084 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:58:21,084 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 21:58:21,084 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39142865] [2019-11-19 21:58:21,084 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 21:58:21,085 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:58:21,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 21:58:21,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 21:58:21,085 INFO L87 Difference]: Start difference. First operand 165 states and 246 transitions. Second operand 4 states. [2019-11-19 21:58:21,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:58:21,405 INFO L93 Difference]: Finished difference Result 328 states and 493 transitions. [2019-11-19 21:58:21,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 21:58:21,406 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2019-11-19 21:58:21,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:58:21,407 INFO L225 Difference]: With dead ends: 328 [2019-11-19 21:58:21,407 INFO L226 Difference]: Without dead ends: 182 [2019-11-19 21:58:21,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-19 21:58:21,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2019-11-19 21:58:21,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 165. [2019-11-19 21:58:21,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-11-19 21:58:21,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 245 transitions. [2019-11-19 21:58:21,413 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 245 transitions. Word has length 77 [2019-11-19 21:58:21,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:58:21,414 INFO L462 AbstractCegarLoop]: Abstraction has 165 states and 245 transitions. [2019-11-19 21:58:21,414 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 21:58:21,414 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 245 transitions. [2019-11-19 21:58:21,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-11-19 21:58:21,415 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:58:21,415 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:58:21,416 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:58:21,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:58:21,416 INFO L82 PathProgramCache]: Analyzing trace with hash 342063024, now seen corresponding path program 1 times [2019-11-19 21:58:21,416 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:58:21,416 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137212887] [2019-11-19 21:58:21,417 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:58:21,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:58:21,458 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 21:58:21,458 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137212887] [2019-11-19 21:58:21,458 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:58:21,459 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 21:58:21,459 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749332167] [2019-11-19 21:58:21,459 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 21:58:21,459 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:58:21,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 21:58:21,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 21:58:21,460 INFO L87 Difference]: Start difference. First operand 165 states and 245 transitions. Second operand 4 states. [2019-11-19 21:58:21,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:58:21,758 INFO L93 Difference]: Finished difference Result 328 states and 491 transitions. [2019-11-19 21:58:21,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 21:58:21,758 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2019-11-19 21:58:21,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:58:21,760 INFO L225 Difference]: With dead ends: 328 [2019-11-19 21:58:21,760 INFO L226 Difference]: Without dead ends: 182 [2019-11-19 21:58:21,760 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-19 21:58:21,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2019-11-19 21:58:21,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 165. [2019-11-19 21:58:21,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-11-19 21:58:21,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 244 transitions. [2019-11-19 21:58:21,766 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 244 transitions. Word has length 77 [2019-11-19 21:58:21,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:58:21,766 INFO L462 AbstractCegarLoop]: Abstraction has 165 states and 244 transitions. [2019-11-19 21:58:21,766 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 21:58:21,766 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 244 transitions. [2019-11-19 21:58:21,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-11-19 21:58:21,767 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:58:21,767 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:58:21,767 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:58:21,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:58:21,768 INFO L82 PathProgramCache]: Analyzing trace with hash 1313801601, now seen corresponding path program 1 times [2019-11-19 21:58:21,768 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:58:21,768 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437551166] [2019-11-19 21:58:21,768 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:58:21,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:58:21,822 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 21:58:21,822 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437551166] [2019-11-19 21:58:21,824 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:58:21,825 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 21:58:21,825 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625335778] [2019-11-19 21:58:21,825 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 21:58:21,825 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:58:21,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 21:58:21,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 21:58:21,826 INFO L87 Difference]: Start difference. First operand 165 states and 244 transitions. Second operand 4 states. [2019-11-19 21:58:22,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:58:22,136 INFO L93 Difference]: Finished difference Result 328 states and 489 transitions. [2019-11-19 21:58:22,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 21:58:22,136 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2019-11-19 21:58:22,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:58:22,138 INFO L225 Difference]: With dead ends: 328 [2019-11-19 21:58:22,138 INFO L226 Difference]: Without dead ends: 182 [2019-11-19 21:58:22,139 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-19 21:58:22,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2019-11-19 21:58:22,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 165. [2019-11-19 21:58:22,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-11-19 21:58:22,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 243 transitions. [2019-11-19 21:58:22,143 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 243 transitions. Word has length 78 [2019-11-19 21:58:22,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:58:22,144 INFO L462 AbstractCegarLoop]: Abstraction has 165 states and 243 transitions. [2019-11-19 21:58:22,144 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 21:58:22,144 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 243 transitions. [2019-11-19 21:58:22,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-11-19 21:58:22,145 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:58:22,145 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:58:22,145 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:58:22,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:58:22,149 INFO L82 PathProgramCache]: Analyzing trace with hash 170225771, now seen corresponding path program 1 times [2019-11-19 21:58:22,149 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:58:22,151 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671026458] [2019-11-19 21:58:22,151 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:58:22,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:58:22,201 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 21:58:22,202 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671026458] [2019-11-19 21:58:22,202 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:58:22,202 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 21:58:22,202 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632400975] [2019-11-19 21:58:22,203 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 21:58:22,203 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:58:22,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 21:58:22,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 21:58:22,203 INFO L87 Difference]: Start difference. First operand 165 states and 243 transitions. Second operand 4 states. [2019-11-19 21:58:22,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:58:22,512 INFO L93 Difference]: Finished difference Result 328 states and 487 transitions. [2019-11-19 21:58:22,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 21:58:22,513 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2019-11-19 21:58:22,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:58:22,514 INFO L225 Difference]: With dead ends: 328 [2019-11-19 21:58:22,515 INFO L226 Difference]: Without dead ends: 182 [2019-11-19 21:58:22,515 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-19 21:58:22,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2019-11-19 21:58:22,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 165. [2019-11-19 21:58:22,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-11-19 21:58:22,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 242 transitions. [2019-11-19 21:58:22,520 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 242 transitions. Word has length 79 [2019-11-19 21:58:22,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:58:22,520 INFO L462 AbstractCegarLoop]: Abstraction has 165 states and 242 transitions. [2019-11-19 21:58:22,520 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 21:58:22,520 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 242 transitions. [2019-11-19 21:58:22,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-11-19 21:58:22,521 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:58:22,523 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:58:22,523 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:58:22,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:58:22,523 INFO L82 PathProgramCache]: Analyzing trace with hash -2123587236, now seen corresponding path program 1 times [2019-11-19 21:58:22,524 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:58:22,524 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258779417] [2019-11-19 21:58:22,524 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:58:22,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:58:22,575 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 21:58:22,575 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258779417] [2019-11-19 21:58:22,575 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:58:22,576 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 21:58:22,576 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436996942] [2019-11-19 21:58:22,576 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 21:58:22,576 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:58:22,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 21:58:22,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 21:58:22,577 INFO L87 Difference]: Start difference. First operand 165 states and 242 transitions. Second operand 4 states. [2019-11-19 21:58:22,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:58:22,876 INFO L93 Difference]: Finished difference Result 318 states and 472 transitions. [2019-11-19 21:58:22,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 21:58:22,877 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2019-11-19 21:58:22,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:58:22,878 INFO L225 Difference]: With dead ends: 318 [2019-11-19 21:58:22,878 INFO L226 Difference]: Without dead ends: 172 [2019-11-19 21:58:22,879 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-19 21:58:22,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2019-11-19 21:58:22,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 165. [2019-11-19 21:58:22,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-11-19 21:58:22,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 241 transitions. [2019-11-19 21:58:22,883 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 241 transitions. Word has length 80 [2019-11-19 21:58:22,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:58:22,884 INFO L462 AbstractCegarLoop]: Abstraction has 165 states and 241 transitions. [2019-11-19 21:58:22,884 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 21:58:22,884 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 241 transitions. [2019-11-19 21:58:22,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-19 21:58:22,885 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:58:22,885 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:58:22,885 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:58:22,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:58:22,888 INFO L82 PathProgramCache]: Analyzing trace with hash -1575477095, now seen corresponding path program 1 times [2019-11-19 21:58:22,888 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:58:22,888 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614714424] [2019-11-19 21:58:22,889 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:58:22,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:58:22,989 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-19 21:58:22,990 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614714424] [2019-11-19 21:58:22,990 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:58:22,990 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 21:58:22,990 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115445146] [2019-11-19 21:58:22,991 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 21:58:22,992 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:58:22,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 21:58:22,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 21:58:22,992 INFO L87 Difference]: Start difference. First operand 165 states and 241 transitions. Second operand 4 states. [2019-11-19 21:58:23,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:58:23,459 INFO L93 Difference]: Finished difference Result 408 states and 610 transitions. [2019-11-19 21:58:23,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 21:58:23,459 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 84 [2019-11-19 21:58:23,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:58:23,461 INFO L225 Difference]: With dead ends: 408 [2019-11-19 21:58:23,462 INFO L226 Difference]: Without dead ends: 262 [2019-11-19 21:58:23,462 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-19 21:58:23,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2019-11-19 21:58:23,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 208. [2019-11-19 21:58:23,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2019-11-19 21:58:23,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 319 transitions. [2019-11-19 21:58:23,472 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 319 transitions. Word has length 84 [2019-11-19 21:58:23,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:58:23,472 INFO L462 AbstractCegarLoop]: Abstraction has 208 states and 319 transitions. [2019-11-19 21:58:23,472 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 21:58:23,472 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 319 transitions. [2019-11-19 21:58:23,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-19 21:58:23,474 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:58:23,474 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:58:23,474 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:58:23,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:58:23,475 INFO L82 PathProgramCache]: Analyzing trace with hash 1822096923, now seen corresponding path program 1 times [2019-11-19 21:58:23,475 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:58:23,476 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30632968] [2019-11-19 21:58:23,476 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:58:23,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:58:23,571 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-19 21:58:23,572 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30632968] [2019-11-19 21:58:23,572 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:58:23,573 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 21:58:23,573 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748707250] [2019-11-19 21:58:23,573 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 21:58:23,573 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:58:23,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 21:58:23,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 21:58:23,574 INFO L87 Difference]: Start difference. First operand 208 states and 319 transitions. Second operand 4 states. [2019-11-19 21:58:23,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:58:23,887 INFO L93 Difference]: Finished difference Result 446 states and 691 transitions. [2019-11-19 21:58:23,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 21:58:23,888 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 84 [2019-11-19 21:58:23,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:58:23,889 INFO L225 Difference]: With dead ends: 446 [2019-11-19 21:58:23,889 INFO L226 Difference]: Without dead ends: 257 [2019-11-19 21:58:23,890 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-19 21:58:23,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2019-11-19 21:58:23,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 232. [2019-11-19 21:58:23,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-11-19 21:58:23,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 361 transitions. [2019-11-19 21:58:23,897 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 361 transitions. Word has length 84 [2019-11-19 21:58:23,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:58:23,897 INFO L462 AbstractCegarLoop]: Abstraction has 232 states and 361 transitions. [2019-11-19 21:58:23,897 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 21:58:23,897 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 361 transitions. [2019-11-19 21:58:23,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-11-19 21:58:23,899 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:58:23,899 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:58:23,899 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:58:23,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:58:23,899 INFO L82 PathProgramCache]: Analyzing trace with hash 878453397, now seen corresponding path program 1 times [2019-11-19 21:58:23,900 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:58:23,900 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513823244] [2019-11-19 21:58:23,900 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:58:23,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:58:23,958 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-19 21:58:23,958 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513823244] [2019-11-19 21:58:23,959 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:58:23,959 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 21:58:23,959 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144138938] [2019-11-19 21:58:23,960 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 21:58:23,960 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:58:23,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 21:58:23,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 21:58:23,961 INFO L87 Difference]: Start difference. First operand 232 states and 361 transitions. Second operand 4 states. [2019-11-19 21:58:24,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:58:24,429 INFO L93 Difference]: Finished difference Result 499 states and 771 transitions. [2019-11-19 21:58:24,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 21:58:24,430 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-11-19 21:58:24,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:58:24,432 INFO L225 Difference]: With dead ends: 499 [2019-11-19 21:58:24,432 INFO L226 Difference]: Without dead ends: 286 [2019-11-19 21:58:24,433 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-19 21:58:24,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2019-11-19 21:58:24,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 232. [2019-11-19 21:58:24,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-11-19 21:58:24,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 360 transitions. [2019-11-19 21:58:24,439 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 360 transitions. Word has length 97 [2019-11-19 21:58:24,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:58:24,440 INFO L462 AbstractCegarLoop]: Abstraction has 232 states and 360 transitions. [2019-11-19 21:58:24,440 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 21:58:24,440 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 360 transitions. [2019-11-19 21:58:24,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-11-19 21:58:24,441 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:58:24,441 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:58:24,441 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:58:24,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:58:24,442 INFO L82 PathProgramCache]: Analyzing trace with hash 919128147, now seen corresponding path program 1 times [2019-11-19 21:58:24,442 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:58:24,442 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864679105] [2019-11-19 21:58:24,442 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:58:24,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:58:24,494 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-19 21:58:24,495 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864679105] [2019-11-19 21:58:24,495 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:58:24,495 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 21:58:24,495 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913088784] [2019-11-19 21:58:24,496 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 21:58:24,496 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:58:24,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 21:58:24,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 21:58:24,496 INFO L87 Difference]: Start difference. First operand 232 states and 360 transitions. Second operand 4 states. [2019-11-19 21:58:24,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:58:24,858 INFO L93 Difference]: Finished difference Result 470 states and 730 transitions. [2019-11-19 21:58:24,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 21:58:24,858 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-11-19 21:58:24,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:58:24,860 INFO L225 Difference]: With dead ends: 470 [2019-11-19 21:58:24,860 INFO L226 Difference]: Without dead ends: 257 [2019-11-19 21:58:24,861 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-19 21:58:24,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2019-11-19 21:58:24,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 232. [2019-11-19 21:58:24,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-11-19 21:58:24,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 359 transitions. [2019-11-19 21:58:24,867 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 359 transitions. Word has length 97 [2019-11-19 21:58:24,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:58:24,867 INFO L462 AbstractCegarLoop]: Abstraction has 232 states and 359 transitions. [2019-11-19 21:58:24,867 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 21:58:24,867 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 359 transitions. [2019-11-19 21:58:24,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-19 21:58:24,868 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:58:24,868 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:58:24,868 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:58:24,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:58:24,869 INFO L82 PathProgramCache]: Analyzing trace with hash -1042376858, now seen corresponding path program 1 times [2019-11-19 21:58:24,869 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:58:24,869 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576939350] [2019-11-19 21:58:24,869 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:58:24,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:58:24,925 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-19 21:58:24,925 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576939350] [2019-11-19 21:58:24,926 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:58:24,926 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 21:58:24,928 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668494838] [2019-11-19 21:58:24,928 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 21:58:24,928 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:58:24,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 21:58:24,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 21:58:24,929 INFO L87 Difference]: Start difference. First operand 232 states and 359 transitions. Second operand 4 states. [2019-11-19 21:58:25,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:58:25,364 INFO L93 Difference]: Finished difference Result 497 states and 765 transitions. [2019-11-19 21:58:25,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 21:58:25,365 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-11-19 21:58:25,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:58:25,366 INFO L225 Difference]: With dead ends: 497 [2019-11-19 21:58:25,366 INFO L226 Difference]: Without dead ends: 284 [2019-11-19 21:58:25,367 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-19 21:58:25,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2019-11-19 21:58:25,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 232. [2019-11-19 21:58:25,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-11-19 21:58:25,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 358 transitions. [2019-11-19 21:58:25,373 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 358 transitions. Word has length 98 [2019-11-19 21:58:25,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:58:25,374 INFO L462 AbstractCegarLoop]: Abstraction has 232 states and 358 transitions. [2019-11-19 21:58:25,374 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 21:58:25,374 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 358 transitions. [2019-11-19 21:58:25,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-19 21:58:25,375 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:58:25,375 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:58:25,375 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:58:25,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:58:25,376 INFO L82 PathProgramCache]: Analyzing trace with hash -1887815254, now seen corresponding path program 1 times [2019-11-19 21:58:25,376 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:58:25,376 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430324858] [2019-11-19 21:58:25,376 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:58:25,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:58:25,435 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-19 21:58:25,435 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430324858] [2019-11-19 21:58:25,435 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:58:25,435 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 21:58:25,436 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876300098] [2019-11-19 21:58:25,436 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 21:58:25,436 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:58:25,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 21:58:25,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 21:58:25,437 INFO L87 Difference]: Start difference. First operand 232 states and 358 transitions. Second operand 4 states. [2019-11-19 21:58:25,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:58:25,872 INFO L93 Difference]: Finished difference Result 496 states and 762 transitions. [2019-11-19 21:58:25,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 21:58:25,873 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-11-19 21:58:25,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:58:25,875 INFO L225 Difference]: With dead ends: 496 [2019-11-19 21:58:25,875 INFO L226 Difference]: Without dead ends: 283 [2019-11-19 21:58:25,875 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-19 21:58:25,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2019-11-19 21:58:25,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 232. [2019-11-19 21:58:25,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-11-19 21:58:25,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 357 transitions. [2019-11-19 21:58:25,883 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 357 transitions. Word has length 98 [2019-11-19 21:58:25,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:58:25,884 INFO L462 AbstractCegarLoop]: Abstraction has 232 states and 357 transitions. [2019-11-19 21:58:25,884 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 21:58:25,884 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 357 transitions. [2019-11-19 21:58:25,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-19 21:58:25,885 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:58:25,885 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:58:25,886 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:58:25,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:58:25,887 INFO L82 PathProgramCache]: Analyzing trace with hash 218540392, now seen corresponding path program 1 times [2019-11-19 21:58:25,887 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:58:25,887 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419580304] [2019-11-19 21:58:25,887 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:58:25,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:58:25,963 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-19 21:58:25,963 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419580304] [2019-11-19 21:58:25,963 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:58:25,963 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 21:58:25,964 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884494685] [2019-11-19 21:58:25,964 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 21:58:25,964 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:58:25,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 21:58:25,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 21:58:25,965 INFO L87 Difference]: Start difference. First operand 232 states and 357 transitions. Second operand 4 states. [2019-11-19 21:58:26,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:58:26,280 INFO L93 Difference]: Finished difference Result 468 states and 722 transitions. [2019-11-19 21:58:26,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 21:58:26,281 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-11-19 21:58:26,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:58:26,282 INFO L225 Difference]: With dead ends: 468 [2019-11-19 21:58:26,282 INFO L226 Difference]: Without dead ends: 255 [2019-11-19 21:58:26,283 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-19 21:58:26,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2019-11-19 21:58:26,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 232. [2019-11-19 21:58:26,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-11-19 21:58:26,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 356 transitions. [2019-11-19 21:58:26,289 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 356 transitions. Word has length 98 [2019-11-19 21:58:26,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:58:26,290 INFO L462 AbstractCegarLoop]: Abstraction has 232 states and 356 transitions. [2019-11-19 21:58:26,290 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 21:58:26,290 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 356 transitions. [2019-11-19 21:58:26,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-19 21:58:26,291 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:58:26,291 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:58:26,292 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:58:26,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:58:26,292 INFO L82 PathProgramCache]: Analyzing trace with hash -626898004, now seen corresponding path program 1 times [2019-11-19 21:58:26,292 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:58:26,292 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78326416] [2019-11-19 21:58:26,292 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:58:26,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:58:26,360 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-19 21:58:26,360 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78326416] [2019-11-19 21:58:26,360 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:58:26,361 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 21:58:26,361 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827964125] [2019-11-19 21:58:26,361 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 21:58:26,362 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:58:26,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 21:58:26,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 21:58:26,362 INFO L87 Difference]: Start difference. First operand 232 states and 356 transitions. Second operand 4 states. [2019-11-19 21:58:26,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:58:26,733 INFO L93 Difference]: Finished difference Result 467 states and 719 transitions. [2019-11-19 21:58:26,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 21:58:26,733 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-11-19 21:58:26,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:58:26,735 INFO L225 Difference]: With dead ends: 467 [2019-11-19 21:58:26,735 INFO L226 Difference]: Without dead ends: 254 [2019-11-19 21:58:26,736 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-19 21:58:26,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2019-11-19 21:58:26,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 232. [2019-11-19 21:58:26,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-11-19 21:58:26,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 355 transitions. [2019-11-19 21:58:26,742 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 355 transitions. Word has length 98 [2019-11-19 21:58:26,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:58:26,743 INFO L462 AbstractCegarLoop]: Abstraction has 232 states and 355 transitions. [2019-11-19 21:58:26,743 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 21:58:26,743 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 355 transitions. [2019-11-19 21:58:26,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-19 21:58:26,744 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:58:26,744 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:58:26,744 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:58:26,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:58:26,745 INFO L82 PathProgramCache]: Analyzing trace with hash 1558161604, now seen corresponding path program 1 times [2019-11-19 21:58:26,745 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:58:26,745 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569657130] [2019-11-19 21:58:26,745 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:58:26,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:58:26,797 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-19 21:58:26,798 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569657130] [2019-11-19 21:58:26,798 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:58:26,798 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 21:58:26,798 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755424745] [2019-11-19 21:58:26,799 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 21:58:26,799 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:58:26,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 21:58:26,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 21:58:26,799 INFO L87 Difference]: Start difference. First operand 232 states and 355 transitions. Second operand 4 states. [2019-11-19 21:58:27,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:58:27,220 INFO L93 Difference]: Finished difference Result 495 states and 755 transitions. [2019-11-19 21:58:27,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 21:58:27,220 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 99 [2019-11-19 21:58:27,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:58:27,222 INFO L225 Difference]: With dead ends: 495 [2019-11-19 21:58:27,222 INFO L226 Difference]: Without dead ends: 282 [2019-11-19 21:58:27,223 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-19 21:58:27,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2019-11-19 21:58:27,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 232. [2019-11-19 21:58:27,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-11-19 21:58:27,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 354 transitions. [2019-11-19 21:58:27,229 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 354 transitions. Word has length 99 [2019-11-19 21:58:27,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:58:27,229 INFO L462 AbstractCegarLoop]: Abstraction has 232 states and 354 transitions. [2019-11-19 21:58:27,229 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 21:58:27,229 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 354 transitions. [2019-11-19 21:58:27,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-19 21:58:27,231 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:58:27,231 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:58:27,232 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:58:27,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:58:27,232 INFO L82 PathProgramCache]: Analyzing trace with hash 1766691760, now seen corresponding path program 1 times [2019-11-19 21:58:27,232 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:58:27,232 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358325174] [2019-11-19 21:58:27,232 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:58:27,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:58:27,302 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-11-19 21:58:27,303 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358325174] [2019-11-19 21:58:27,303 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:58:27,303 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-19 21:58:27,303 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910686801] [2019-11-19 21:58:27,304 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-19 21:58:27,304 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:58:27,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-19 21:58:27,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-19 21:58:27,304 INFO L87 Difference]: Start difference. First operand 232 states and 354 transitions. Second operand 5 states. [2019-11-19 21:58:27,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:58:27,802 INFO L93 Difference]: Finished difference Result 466 states and 716 transitions. [2019-11-19 21:58:27,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-19 21:58:27,803 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 99 [2019-11-19 21:58:27,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:58:27,804 INFO L225 Difference]: With dead ends: 466 [2019-11-19 21:58:27,805 INFO L226 Difference]: Without dead ends: 253 [2019-11-19 21:58:27,805 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-19 21:58:27,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2019-11-19 21:58:27,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 252. [2019-11-19 21:58:27,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2019-11-19 21:58:27,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 380 transitions. [2019-11-19 21:58:27,812 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 380 transitions. Word has length 99 [2019-11-19 21:58:27,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:58:27,812 INFO L462 AbstractCegarLoop]: Abstraction has 252 states and 380 transitions. [2019-11-19 21:58:27,812 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-19 21:58:27,812 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 380 transitions. [2019-11-19 21:58:27,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-11-19 21:58:27,813 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:58:27,814 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:58:27,814 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:58:27,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:58:27,815 INFO L82 PathProgramCache]: Analyzing trace with hash -907239660, now seen corresponding path program 1 times [2019-11-19 21:58:27,815 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:58:27,815 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350030496] [2019-11-19 21:58:27,815 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:58:27,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:58:27,874 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-19 21:58:27,874 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350030496] [2019-11-19 21:58:27,875 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:58:27,875 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 21:58:27,875 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413599411] [2019-11-19 21:58:27,875 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 21:58:27,875 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:58:27,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 21:58:27,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 21:58:27,876 INFO L87 Difference]: Start difference. First operand 252 states and 380 transitions. Second operand 4 states. [2019-11-19 21:58:28,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:58:28,304 INFO L93 Difference]: Finished difference Result 535 states and 804 transitions. [2019-11-19 21:58:28,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 21:58:28,305 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2019-11-19 21:58:28,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:58:28,307 INFO L225 Difference]: With dead ends: 535 [2019-11-19 21:58:28,307 INFO L226 Difference]: Without dead ends: 302 [2019-11-19 21:58:28,308 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-19 21:58:28,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2019-11-19 21:58:28,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 252. [2019-11-19 21:58:28,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2019-11-19 21:58:28,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 379 transitions. [2019-11-19 21:58:28,317 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 379 transitions. Word has length 100 [2019-11-19 21:58:28,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:58:28,318 INFO L462 AbstractCegarLoop]: Abstraction has 252 states and 379 transitions. [2019-11-19 21:58:28,318 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 21:58:28,318 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 379 transitions. [2019-11-19 21:58:28,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-11-19 21:58:28,319 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:58:28,320 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:58:28,320 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:58:28,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:58:28,320 INFO L82 PathProgramCache]: Analyzing trace with hash -346539882, now seen corresponding path program 1 times [2019-11-19 21:58:28,321 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:58:28,321 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998779187] [2019-11-19 21:58:28,321 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:58:28,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:58:28,381 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-19 21:58:28,381 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998779187] [2019-11-19 21:58:28,381 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:58:28,382 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 21:58:28,382 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432449314] [2019-11-19 21:58:28,382 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 21:58:28,382 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:58:28,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 21:58:28,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 21:58:28,383 INFO L87 Difference]: Start difference. First operand 252 states and 379 transitions. Second operand 4 states. [2019-11-19 21:58:28,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:58:28,687 INFO L93 Difference]: Finished difference Result 506 states and 763 transitions. [2019-11-19 21:58:28,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 21:58:28,687 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2019-11-19 21:58:28,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:58:28,689 INFO L225 Difference]: With dead ends: 506 [2019-11-19 21:58:28,689 INFO L226 Difference]: Without dead ends: 273 [2019-11-19 21:58:28,689 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-19 21:58:28,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2019-11-19 21:58:28,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 252. [2019-11-19 21:58:28,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2019-11-19 21:58:28,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 378 transitions. [2019-11-19 21:58:28,697 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 378 transitions. Word has length 100 [2019-11-19 21:58:28,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:58:28,697 INFO L462 AbstractCegarLoop]: Abstraction has 252 states and 378 transitions. [2019-11-19 21:58:28,697 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 21:58:28,697 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 378 transitions. [2019-11-19 21:58:28,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-11-19 21:58:28,699 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:58:28,699 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:58:28,699 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:58:28,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:58:28,699 INFO L82 PathProgramCache]: Analyzing trace with hash 1206682467, now seen corresponding path program 1 times [2019-11-19 21:58:28,699 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:58:28,700 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370939763] [2019-11-19 21:58:28,700 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:58:28,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:58:28,762 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-19 21:58:28,762 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370939763] [2019-11-19 21:58:28,762 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:58:28,763 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 21:58:28,763 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675393462] [2019-11-19 21:58:28,763 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 21:58:28,763 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:58:28,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 21:58:28,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 21:58:28,764 INFO L87 Difference]: Start difference. First operand 252 states and 378 transitions. Second operand 4 states. [2019-11-19 21:58:29,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:58:29,190 INFO L93 Difference]: Finished difference Result 535 states and 800 transitions. [2019-11-19 21:58:29,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 21:58:29,190 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2019-11-19 21:58:29,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:58:29,192 INFO L225 Difference]: With dead ends: 535 [2019-11-19 21:58:29,192 INFO L226 Difference]: Without dead ends: 302 [2019-11-19 21:58:29,193 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-19 21:58:29,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2019-11-19 21:58:29,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 252. [2019-11-19 21:58:29,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2019-11-19 21:58:29,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 377 transitions. [2019-11-19 21:58:29,201 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 377 transitions. Word has length 101 [2019-11-19 21:58:29,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:58:29,201 INFO L462 AbstractCegarLoop]: Abstraction has 252 states and 377 transitions. [2019-11-19 21:58:29,201 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 21:58:29,201 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 377 transitions. [2019-11-19 21:58:29,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-11-19 21:58:29,203 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:58:29,203 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:58:29,203 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:58:29,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:58:29,203 INFO L82 PathProgramCache]: Analyzing trace with hash 1408506401, now seen corresponding path program 1 times [2019-11-19 21:58:29,204 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:58:29,204 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740322753] [2019-11-19 21:58:29,204 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:58:29,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:58:29,259 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-19 21:58:29,259 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740322753] [2019-11-19 21:58:29,259 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:58:29,259 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 21:58:29,260 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706595187] [2019-11-19 21:58:29,260 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 21:58:29,260 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:58:29,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 21:58:29,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 21:58:29,261 INFO L87 Difference]: Start difference. First operand 252 states and 377 transitions. Second operand 4 states. [2019-11-19 21:58:29,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:58:29,584 INFO L93 Difference]: Finished difference Result 506 states and 759 transitions. [2019-11-19 21:58:29,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 21:58:29,585 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2019-11-19 21:58:29,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:58:29,587 INFO L225 Difference]: With dead ends: 506 [2019-11-19 21:58:29,587 INFO L226 Difference]: Without dead ends: 273 [2019-11-19 21:58:29,587 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-19 21:58:29,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2019-11-19 21:58:29,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 252. [2019-11-19 21:58:29,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2019-11-19 21:58:29,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 376 transitions. [2019-11-19 21:58:29,597 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 376 transitions. Word has length 101 [2019-11-19 21:58:29,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:58:29,597 INFO L462 AbstractCegarLoop]: Abstraction has 252 states and 376 transitions. [2019-11-19 21:58:29,597 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 21:58:29,597 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 376 transitions. [2019-11-19 21:58:29,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-11-19 21:58:29,599 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:58:29,599 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:58:29,599 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:58:29,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:58:29,599 INFO L82 PathProgramCache]: Analyzing trace with hash -610222663, now seen corresponding path program 1 times [2019-11-19 21:58:29,600 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:58:29,600 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27127178] [2019-11-19 21:58:29,600 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:58:29,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:58:29,660 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-19 21:58:29,660 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27127178] [2019-11-19 21:58:29,661 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:58:29,661 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 21:58:29,661 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556324857] [2019-11-19 21:58:29,661 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 21:58:29,662 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:58:29,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 21:58:29,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 21:58:29,662 INFO L87 Difference]: Start difference. First operand 252 states and 376 transitions. Second operand 4 states. [2019-11-19 21:58:30,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:58:30,067 INFO L93 Difference]: Finished difference Result 535 states and 796 transitions. [2019-11-19 21:58:30,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 21:58:30,067 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-11-19 21:58:30,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:58:30,069 INFO L225 Difference]: With dead ends: 535 [2019-11-19 21:58:30,069 INFO L226 Difference]: Without dead ends: 302 [2019-11-19 21:58:30,070 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-19 21:58:30,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2019-11-19 21:58:30,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 252. [2019-11-19 21:58:30,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2019-11-19 21:58:30,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 375 transitions. [2019-11-19 21:58:30,078 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 375 transitions. Word has length 102 [2019-11-19 21:58:30,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:58:30,079 INFO L462 AbstractCegarLoop]: Abstraction has 252 states and 375 transitions. [2019-11-19 21:58:30,079 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 21:58:30,079 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 375 transitions. [2019-11-19 21:58:30,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-11-19 21:58:30,080 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:58:30,081 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:58:30,081 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:58:30,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:58:30,081 INFO L82 PathProgramCache]: Analyzing trace with hash 1351351995, now seen corresponding path program 1 times [2019-11-19 21:58:30,083 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:58:30,083 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924280290] [2019-11-19 21:58:30,084 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:58:30,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:58:30,171 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-19 21:58:30,171 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924280290] [2019-11-19 21:58:30,171 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:58:30,172 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 21:58:30,172 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767186937] [2019-11-19 21:58:30,172 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 21:58:30,172 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:58:30,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 21:58:30,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 21:58:30,172 INFO L87 Difference]: Start difference. First operand 252 states and 375 transitions. Second operand 4 states. [2019-11-19 21:58:30,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:58:30,487 INFO L93 Difference]: Finished difference Result 506 states and 755 transitions. [2019-11-19 21:58:30,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 21:58:30,488 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-11-19 21:58:30,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:58:30,490 INFO L225 Difference]: With dead ends: 506 [2019-11-19 21:58:30,490 INFO L226 Difference]: Without dead ends: 273 [2019-11-19 21:58:30,490 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-19 21:58:30,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2019-11-19 21:58:30,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 252. [2019-11-19 21:58:30,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2019-11-19 21:58:30,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 374 transitions. [2019-11-19 21:58:30,498 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 374 transitions. Word has length 102 [2019-11-19 21:58:30,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:58:30,498 INFO L462 AbstractCegarLoop]: Abstraction has 252 states and 374 transitions. [2019-11-19 21:58:30,498 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 21:58:30,498 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 374 transitions. [2019-11-19 21:58:30,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-11-19 21:58:30,499 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:58:30,500 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:58:30,500 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:58:30,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:58:30,500 INFO L82 PathProgramCache]: Analyzing trace with hash 271278824, now seen corresponding path program 1 times [2019-11-19 21:58:30,500 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:58:30,501 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819685829] [2019-11-19 21:58:30,501 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:58:30,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:58:30,555 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-19 21:58:30,556 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819685829] [2019-11-19 21:58:30,556 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:58:30,556 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 21:58:30,556 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375468407] [2019-11-19 21:58:30,556 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 21:58:30,557 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:58:30,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 21:58:30,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 21:58:30,557 INFO L87 Difference]: Start difference. First operand 252 states and 374 transitions. Second operand 4 states. [2019-11-19 21:58:30,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:58:30,963 INFO L93 Difference]: Finished difference Result 525 states and 780 transitions. [2019-11-19 21:58:30,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 21:58:30,963 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2019-11-19 21:58:30,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:58:30,965 INFO L225 Difference]: With dead ends: 525 [2019-11-19 21:58:30,965 INFO L226 Difference]: Without dead ends: 292 [2019-11-19 21:58:30,965 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-19 21:58:30,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2019-11-19 21:58:30,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 252. [2019-11-19 21:58:30,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2019-11-19 21:58:30,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 373 transitions. [2019-11-19 21:58:30,971 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 373 transitions. Word has length 103 [2019-11-19 21:58:30,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:58:30,972 INFO L462 AbstractCegarLoop]: Abstraction has 252 states and 373 transitions. [2019-11-19 21:58:30,972 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 21:58:30,972 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 373 transitions. [2019-11-19 21:58:30,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-11-19 21:58:30,973 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:58:30,973 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:58:30,974 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:58:30,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:58:30,974 INFO L82 PathProgramCache]: Analyzing trace with hash 950551078, now seen corresponding path program 1 times [2019-11-19 21:58:30,974 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:58:30,974 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749026375] [2019-11-19 21:58:30,975 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:58:30,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:58:31,035 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-19 21:58:31,035 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749026375] [2019-11-19 21:58:31,036 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:58:31,036 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 21:58:31,036 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907936253] [2019-11-19 21:58:31,036 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 21:58:31,037 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:58:31,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 21:58:31,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 21:58:31,037 INFO L87 Difference]: Start difference. First operand 252 states and 373 transitions. Second operand 4 states. [2019-11-19 21:58:31,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:58:31,350 INFO L93 Difference]: Finished difference Result 496 states and 739 transitions. [2019-11-19 21:58:31,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 21:58:31,351 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2019-11-19 21:58:31,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:58:31,352 INFO L225 Difference]: With dead ends: 496 [2019-11-19 21:58:31,352 INFO L226 Difference]: Without dead ends: 263 [2019-11-19 21:58:31,353 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-19 21:58:31,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2019-11-19 21:58:31,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 252. [2019-11-19 21:58:31,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2019-11-19 21:58:31,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 372 transitions. [2019-11-19 21:58:31,361 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 372 transitions. Word has length 103 [2019-11-19 21:58:31,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:58:31,361 INFO L462 AbstractCegarLoop]: Abstraction has 252 states and 372 transitions. [2019-11-19 21:58:31,361 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 21:58:31,361 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 372 transitions. [2019-11-19 21:58:31,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-11-19 21:58:31,362 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:58:31,362 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:58:31,363 INFO L410 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:58:31,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:58:31,363 INFO L82 PathProgramCache]: Analyzing trace with hash -504345715, now seen corresponding path program 1 times [2019-11-19 21:58:31,363 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:58:31,363 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341213660] [2019-11-19 21:58:31,363 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:58:31,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:58:31,416 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-19 21:58:31,416 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341213660] [2019-11-19 21:58:31,417 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:58:31,417 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 21:58:31,417 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639759312] [2019-11-19 21:58:31,417 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 21:58:31,417 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:58:31,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 21:58:31,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 21:58:31,418 INFO L87 Difference]: Start difference. First operand 252 states and 372 transitions. Second operand 4 states. [2019-11-19 21:58:31,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:58:31,833 INFO L93 Difference]: Finished difference Result 525 states and 776 transitions. [2019-11-19 21:58:31,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 21:58:31,834 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2019-11-19 21:58:31,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:58:31,836 INFO L225 Difference]: With dead ends: 525 [2019-11-19 21:58:31,836 INFO L226 Difference]: Without dead ends: 292 [2019-11-19 21:58:31,836 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-19 21:58:31,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2019-11-19 21:58:31,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 252. [2019-11-19 21:58:31,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2019-11-19 21:58:31,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 371 transitions. [2019-11-19 21:58:31,844 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 371 transitions. Word has length 106 [2019-11-19 21:58:31,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:58:31,844 INFO L462 AbstractCegarLoop]: Abstraction has 252 states and 371 transitions. [2019-11-19 21:58:31,845 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 21:58:31,845 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 371 transitions. [2019-11-19 21:58:31,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-11-19 21:58:31,846 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:58:31,846 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:58:31,846 INFO L410 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:58:31,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:58:31,847 INFO L82 PathProgramCache]: Analyzing trace with hash 2104441743, now seen corresponding path program 1 times [2019-11-19 21:58:31,847 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:58:31,847 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321110612] [2019-11-19 21:58:31,847 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:58:31,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:58:31,900 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-11-19 21:58:31,900 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321110612] [2019-11-19 21:58:31,900 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:58:31,901 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 21:58:31,901 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046168378] [2019-11-19 21:58:31,901 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 21:58:31,901 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:58:31,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 21:58:31,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 21:58:31,902 INFO L87 Difference]: Start difference. First operand 252 states and 371 transitions. Second operand 3 states. [2019-11-19 21:58:31,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:58:31,941 INFO L93 Difference]: Finished difference Result 716 states and 1068 transitions. [2019-11-19 21:58:31,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 21:58:31,941 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2019-11-19 21:58:31,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:58:31,944 INFO L225 Difference]: With dead ends: 716 [2019-11-19 21:58:31,944 INFO L226 Difference]: Without dead ends: 483 [2019-11-19 21:58:31,945 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 21:58:31,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2019-11-19 21:58:31,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 483. [2019-11-19 21:58:31,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 483 states. [2019-11-19 21:58:31,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 483 states and 716 transitions. [2019-11-19 21:58:31,960 INFO L78 Accepts]: Start accepts. Automaton has 483 states and 716 transitions. Word has length 106 [2019-11-19 21:58:31,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:58:31,961 INFO L462 AbstractCegarLoop]: Abstraction has 483 states and 716 transitions. [2019-11-19 21:58:31,961 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 21:58:31,961 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 716 transitions. [2019-11-19 21:58:31,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-11-19 21:58:31,963 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:58:31,963 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:58:31,963 INFO L410 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:58:31,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:58:31,964 INFO L82 PathProgramCache]: Analyzing trace with hash 1080065455, now seen corresponding path program 1 times [2019-11-19 21:58:31,964 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:58:31,964 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827422050] [2019-11-19 21:58:31,964 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:58:31,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:58:32,029 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-19 21:58:32,030 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827422050] [2019-11-19 21:58:32,030 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:58:32,030 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 21:58:32,030 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724227132] [2019-11-19 21:58:32,031 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 21:58:32,031 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:58:32,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 21:58:32,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 21:58:32,031 INFO L87 Difference]: Start difference. First operand 483 states and 716 transitions. Second operand 3 states. [2019-11-19 21:58:32,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:58:32,087 INFO L93 Difference]: Finished difference Result 947 states and 1410 transitions. [2019-11-19 21:58:32,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 21:58:32,088 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 125 [2019-11-19 21:58:32,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:58:32,091 INFO L225 Difference]: With dead ends: 947 [2019-11-19 21:58:32,091 INFO L226 Difference]: Without dead ends: 483 [2019-11-19 21:58:32,091 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 21:58:32,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2019-11-19 21:58:32,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 483. [2019-11-19 21:58:32,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 483 states. [2019-11-19 21:58:32,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 483 states and 711 transitions. [2019-11-19 21:58:32,108 INFO L78 Accepts]: Start accepts. Automaton has 483 states and 711 transitions. Word has length 125 [2019-11-19 21:58:32,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:58:32,109 INFO L462 AbstractCegarLoop]: Abstraction has 483 states and 711 transitions. [2019-11-19 21:58:32,109 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 21:58:32,109 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 711 transitions. [2019-11-19 21:58:32,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-11-19 21:58:32,111 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:58:32,111 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:58:32,111 INFO L410 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:58:32,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:58:32,112 INFO L82 PathProgramCache]: Analyzing trace with hash -877709346, now seen corresponding path program 1 times [2019-11-19 21:58:32,112 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:58:32,112 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81082859] [2019-11-19 21:58:32,112 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:58:32,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 21:58:32,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 21:58:32,414 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 21:58:32,415 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-19 21:58:32,568 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 09:58:32 BoogieIcfgContainer [2019-11-19 21:58:32,569 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-19 21:58:32,570 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-19 21:58:32,570 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-19 21:58:32,571 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-19 21:58:32,571 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:58:14" (3/4) ... [2019-11-19 21:58:32,577 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-19 21:58:32,580 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-19 21:58:32,582 INFO L168 Benchmark]: Toolchain (without parser) took 19915.88 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 405.3 MB). Free memory was 943.4 MB in the beginning and 991.2 MB in the end (delta: -47.8 MB). Peak memory consumption was 357.5 MB. Max. memory is 11.5 GB. [2019-11-19 21:58:32,582 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 21:58:32,583 INFO L168 Benchmark]: CACSL2BoogieTranslator took 820.56 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 169.9 MB). Free memory was 943.4 MB in the beginning and 1.1 GB in the end (delta: -196.3 MB). Peak memory consumption was 24.0 MB. Max. memory is 11.5 GB. [2019-11-19 21:58:32,584 INFO L168 Benchmark]: Boogie Procedure Inliner took 94.49 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-19 21:58:32,584 INFO L168 Benchmark]: Boogie Preprocessor took 125.50 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-19 21:58:32,584 INFO L168 Benchmark]: RCFGBuilder took 1187.46 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: 100.3 MB). Peak memory consumption was 100.3 MB. Max. memory is 11.5 GB. [2019-11-19 21:58:32,585 INFO L168 Benchmark]: TraceAbstraction took 17672.94 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 235.4 MB). Free memory was 1.0 GB in the beginning and 991.2 MB in the end (delta: 35.0 MB). Peak memory consumption was 270.4 MB. Max. memory is 11.5 GB. [2019-11-19 21:58:32,585 INFO L168 Benchmark]: Witness Printer took 9.63 ms. Allocated memory is still 1.4 GB. Free memory is still 991.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 21:58:32,588 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.25 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 820.56 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 169.9 MB). Free memory was 943.4 MB in the beginning and 1.1 GB in the end (delta: -196.3 MB). Peak memory consumption was 24.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 94.49 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 125.50 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 1187.46 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: 100.3 MB). Peak memory consumption was 100.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 17672.94 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 235.4 MB). Free memory was 1.0 GB in the beginning and 991.2 MB in the end (delta: 35.0 MB). Peak memory consumption was 270.4 MB. Max. memory is 11.5 GB. * Witness Printer took 9.63 ms. Allocated memory is still 1.4 GB. Free memory is still 991.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 1706]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of bitwiseAnd at line 1120. Possible FailurePath: [L1042] static int init = 1; [L1043] static SSL_METHOD SSLv3_server_data ; VAL [init=1, SSLv3_server_data={7:0}] [L1065] SSL *s ; [L1066] int tmp ; [L1070] s = malloc(sizeof(SSL)) [L1071] s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1072] s->ctx = malloc(sizeof(SSL_CTX)) [L1073] s->session = malloc(sizeof(SSL_SESSION)) [L1074] s->state = 8464 [L1081] BUF_MEM *buf = (BUF_MEM *)__VERIFIER_nondet_ulong(); [L1082] unsigned long l ; [L1083] unsigned long Time ; [L1084] unsigned long tmp = __VERIFIER_nondet_long() ; [L1085] void (*cb)() ; [L1086] long num1 ; [L1087] int ret ; [L1088] int new_state ; [L1089] int state ; [L1090] int skip ; [L1091] int got_new_session ; [L1092] int tmp___1 = __VERIFIER_nondet_int() ; [L1093] int tmp___2 = __VERIFIER_nondet_int() ; [L1094] int tmp___3 ; [L1095] int tmp___4 ; [L1096] int tmp___5 ; [L1097] int tmp___6 ; [L1098] int tmp___7 ; [L1099] long tmp___8 = __VERIFIER_nondet_long() ; [L1100] int tmp___9 ; [L1101] int tmp___10 ; [L1102] int blastFlag ; [L1106] blastFlag = 0 [L1107] s->hit=__VERIFIER_nondet_int () [L1108] s->state = 8464 [L1109] Time = tmp [L1110] cb = (void (*)())((void *)0) [L1111] ret = -1 [L1112] skip = 0 [L1113] got_new_session = 0 [L1114] EXPR s->info_callback VAL [init=1, SSLv3_server_data={7:0}] [L1114] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1115] EXPR s->info_callback [L1115] cb = s->info_callback [L1119] EXPR s->in_handshake [L1119] s->in_handshake += 1 [L1120] COND FALSE !(tmp___1 & 12288) VAL [init=1, SSLv3_server_data={7:0}] [L1129] EXPR s->cert VAL [init=1, SSLv3_server_data={7:0}] [L1129] COND FALSE !((unsigned long )s->cert == (unsigned long )((void *)0)) [L1135] COND TRUE 1 VAL [init=1, SSLv3_server_data={7:0}] [L1137] EXPR s->state [L1137] state = s->state [L1138] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1138] COND FALSE !(s->state == 12292) [L1141] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1141] COND FALSE !(s->state == 16384) [L1144] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1144] COND FALSE !(s->state == 8192) [L1147] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1147] COND FALSE !(s->state == 24576) [L1150] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1150] COND FALSE !(s->state == 8195) [L1153] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1153] COND FALSE !(s->state == 8480) [L1156] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1156] COND FALSE !(s->state == 8481) [L1159] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1159] COND FALSE !(s->state == 8482) [L1162] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1162] COND TRUE s->state == 8464 [L1318] s->shutdown = 0 [L1319] ret = __VERIFIER_nondet_int() [L1320] COND TRUE blastFlag == 0 [L1321] blastFlag = 1 VAL [init=1, SSLv3_server_data={7:0}] [L1325] COND FALSE !(ret <= 0) [L1330] got_new_session = 1 [L1331] s->state = 8496 [L1332] s->init_num = 0 VAL [init=1, SSLv3_server_data={7:0}] [L1665] EXPR s->s3 [L1665] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={7:0}] [L1665] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1694] skip = 0 VAL [init=1, SSLv3_server_data={7:0}] [L1135] COND TRUE 1 VAL [init=1, SSLv3_server_data={7:0}] [L1137] EXPR s->state [L1137] state = s->state [L1138] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1138] COND FALSE !(s->state == 12292) [L1141] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1141] COND FALSE !(s->state == 16384) [L1144] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1144] COND FALSE !(s->state == 8192) [L1147] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1147] COND FALSE !(s->state == 24576) [L1150] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1150] COND FALSE !(s->state == 8195) [L1153] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1153] COND FALSE !(s->state == 8480) [L1156] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1156] COND FALSE !(s->state == 8481) [L1159] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1159] COND FALSE !(s->state == 8482) [L1162] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1162] COND FALSE !(s->state == 8464) [L1165] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1165] COND FALSE !(s->state == 8465) [L1168] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1168] COND FALSE !(s->state == 8466) [L1171] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1171] COND TRUE s->state == 8496 [L1336] ret = __VERIFIER_nondet_int() [L1337] COND TRUE blastFlag == 1 [L1338] blastFlag = 2 VAL [init=1, SSLv3_server_data={7:0}] [L1342] COND FALSE !(ret <= 0) [L1347] s->hit VAL [init=1, SSLv3_server_data={7:0}] [L1347] COND TRUE s->hit [L1348] s->state = 8656 VAL [init=1, SSLv3_server_data={7:0}] [L1352] s->init_num = 0 VAL [init=1, SSLv3_server_data={7:0}] [L1665] EXPR s->s3 [L1665] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={7:0}] [L1665] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1694] skip = 0 VAL [init=1, SSLv3_server_data={7:0}] [L1135] COND TRUE 1 VAL [init=1, SSLv3_server_data={7:0}] [L1137] EXPR s->state [L1137] state = s->state [L1138] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1138] COND FALSE !(s->state == 12292) [L1141] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1141] COND FALSE !(s->state == 16384) [L1144] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1144] COND FALSE !(s->state == 8192) [L1147] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1147] COND FALSE !(s->state == 24576) [L1150] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1150] COND FALSE !(s->state == 8195) [L1153] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1153] COND FALSE !(s->state == 8480) [L1156] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1156] COND FALSE !(s->state == 8481) [L1159] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1159] COND FALSE !(s->state == 8482) [L1162] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1162] COND FALSE !(s->state == 8464) [L1165] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1165] COND FALSE !(s->state == 8465) [L1168] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1168] COND FALSE !(s->state == 8466) [L1171] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1171] COND FALSE !(s->state == 8496) [L1174] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1174] COND FALSE !(s->state == 8497) [L1177] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1177] COND FALSE !(s->state == 8512) [L1180] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1180] COND FALSE !(s->state == 8513) [L1183] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1183] COND FALSE !(s->state == 8528) [L1186] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1186] COND FALSE !(s->state == 8529) [L1189] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1189] COND FALSE !(s->state == 8544) [L1192] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1192] COND FALSE !(s->state == 8545) [L1195] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1195] COND FALSE !(s->state == 8560) [L1198] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1198] COND FALSE !(s->state == 8561) [L1201] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1201] COND FALSE !(s->state == 8448) [L1204] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1204] COND FALSE !(s->state == 8576) [L1207] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1207] COND FALSE !(s->state == 8577) [L1210] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1210] COND FALSE !(s->state == 8592) [L1213] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1213] COND FALSE !(s->state == 8593) [L1216] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1216] COND FALSE !(s->state == 8608) [L1219] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1219] COND FALSE !(s->state == 8609) [L1222] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1222] COND FALSE !(s->state == 8640) [L1225] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1225] COND FALSE !(s->state == 8641) [L1228] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1228] COND TRUE s->state == 8656 [L1552] EXPR s->session [L1552] EXPR s->s3 [L1552] EXPR (s->s3)->tmp.new_cipher [L1552] (s->session)->cipher = (s->s3)->tmp.new_cipher [L1553] tmp___9 = __VERIFIER_nondet_int() [L1554] COND FALSE !(! tmp___9) [L1560] ret = __VERIFIER_nondet_int() [L1561] COND TRUE blastFlag == 2 [L1562] blastFlag = 5 VAL [init=1, SSLv3_server_data={7:0}] [L1566] COND FALSE !(ret <= 0) [L1571] s->state = 8672 [L1572] s->init_num = 0 [L1573] tmp___10 = __VERIFIER_nondet_int() [L1574] COND FALSE !(! tmp___10) VAL [init=1, SSLv3_server_data={7:0}] [L1665] EXPR s->s3 [L1665] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={7:0}] [L1665] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1694] skip = 0 VAL [init=1, SSLv3_server_data={7:0}] [L1135] COND TRUE 1 VAL [init=1, SSLv3_server_data={7:0}] [L1137] EXPR s->state [L1137] state = s->state [L1138] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1138] COND FALSE !(s->state == 12292) [L1141] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1141] COND FALSE !(s->state == 16384) [L1144] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1144] COND FALSE !(s->state == 8192) [L1147] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1147] COND FALSE !(s->state == 24576) [L1150] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1150] COND FALSE !(s->state == 8195) [L1153] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1153] COND FALSE !(s->state == 8480) [L1156] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1156] COND FALSE !(s->state == 8481) [L1159] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1159] COND FALSE !(s->state == 8482) [L1162] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1162] COND FALSE !(s->state == 8464) [L1165] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1165] COND FALSE !(s->state == 8465) [L1168] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1168] COND FALSE !(s->state == 8466) [L1171] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1171] COND FALSE !(s->state == 8496) [L1174] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1174] COND FALSE !(s->state == 8497) [L1177] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1177] COND FALSE !(s->state == 8512) [L1180] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1180] COND FALSE !(s->state == 8513) [L1183] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1183] COND FALSE !(s->state == 8528) [L1186] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1186] COND FALSE !(s->state == 8529) [L1189] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1189] COND FALSE !(s->state == 8544) [L1192] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1192] COND FALSE !(s->state == 8545) [L1195] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1195] COND FALSE !(s->state == 8560) [L1198] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1198] COND FALSE !(s->state == 8561) [L1201] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1201] COND FALSE !(s->state == 8448) [L1204] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1204] COND FALSE !(s->state == 8576) [L1207] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1207] COND FALSE !(s->state == 8577) [L1210] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1210] COND FALSE !(s->state == 8592) [L1213] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1213] COND FALSE !(s->state == 8593) [L1216] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1216] COND FALSE !(s->state == 8608) [L1219] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1219] COND FALSE !(s->state == 8609) [L1222] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1222] COND FALSE !(s->state == 8640) [L1225] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1225] COND FALSE !(s->state == 8641) [L1228] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1228] COND FALSE !(s->state == 8656) [L1231] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1231] COND FALSE !(s->state == 8657) [L1234] EXPR s->state VAL [init=1, SSLv3_server_data={7:0}] [L1234] COND TRUE s->state == 8672 [L1583] ret = __VERIFIER_nondet_int() [L1584] COND FALSE !(blastFlag == 4) VAL [init=1, SSLv3_server_data={7:0}] [L1587] COND TRUE blastFlag == 5 VAL [init=1, SSLv3_server_data={7:0}] [L1706] __VERIFIER_error() VAL [init=1, SSLv3_server_data={7:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 145 locations, 1 error locations. Result: UNSAFE, OverallTime: 17.5s, OverallIterations: 40, TraceHistogramMax: 4, AutomataDifference: 13.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 7567 SDtfs, 2263 SDslu, 11017 SDs, 0 SdLazy, 6888 SolverSat, 349 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 10.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 222 GetRequests, 78 SyntacticMatches, 29 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=483occurred in iteration=38, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 39 MinimizatonAttempts, 933 StatesRemovedByMinimization, 37 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 3434 NumberOfCodeBlocks, 3434 NumberOfCodeBlocksAsserted, 40 NumberOfCheckSat, 3269 ConstructedInterpolants, 0 QuantifiedInterpolants, 765446 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 39 InterpolantComputations, 39 PerfectInterpolantSequences, 1667/1667 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.24-678e011 [2019-11-19 21:58:34,485 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-19 21:58:34,487 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-19 21:58:34,504 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-19 21:58:34,504 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-19 21:58:34,505 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-19 21:58:34,507 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-19 21:58:34,517 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-19 21:58:34,522 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-19 21:58:34,525 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-19 21:58:34,526 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-19 21:58:34,528 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-19 21:58:34,528 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-19 21:58:34,530 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-19 21:58:34,532 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-19 21:58:34,533 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-19 21:58:34,535 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-19 21:58:34,536 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-19 21:58:34,538 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-19 21:58:34,542 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-19 21:58:34,545 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-19 21:58:34,547 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-19 21:58:34,548 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-19 21:58:34,549 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-19 21:58:34,551 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-19 21:58:34,551 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-19 21:58:34,551 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-19 21:58:34,552 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-19 21:58:34,553 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-19 21:58:34,553 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-19 21:58:34,554 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-19 21:58:34,554 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-19 21:58:34,555 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-19 21:58:34,555 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-19 21:58:34,556 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-19 21:58:34,557 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-19 21:58:34,557 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-19 21:58:34,557 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-19 21:58:34,558 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-19 21:58:34,558 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-19 21:58:34,559 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-19 21:58:34,560 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_b1f27260-aeaf-4802-85b9-95fe0a263f77/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-11-19 21:58:34,573 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-19 21:58:34,573 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-19 21:58:34,574 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-19 21:58:34,574 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-19 21:58:34,574 INFO L138 SettingsManager]: * Use SBE=true [2019-11-19 21:58:34,577 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-19 21:58:34,585 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-19 21:58:34,585 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-19 21:58:34,585 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-19 21:58:34,586 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-19 21:58:34,586 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-19 21:58:34,586 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-19 21:58:34,586 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-19 21:58:34,586 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-19 21:58:34,587 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-19 21:58:34,587 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-19 21:58:34,587 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-19 21:58:34,587 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-19 21:58:34,588 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-19 21:58:34,588 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-19 21:58:34,588 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-19 21:58:34,588 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-19 21:58:34,589 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-19 21:58:34,589 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-19 21:58:34,589 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-19 21:58:34,589 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-19 21:58:34,590 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-19 21:58:34,590 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-19 21:58:34,590 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-19 21:58:34,590 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-19 21:58:34,592 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_b1f27260-aeaf-4802-85b9-95fe0a263f77/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 -> 9eb992f5fc2d1a4c635ca3f801d15ea699dd32d7 [2019-11-19 21:58:34,916 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-19 21:58:34,925 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-19 21:58:34,928 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-19 21:58:34,929 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-19 21:58:34,930 INFO L275 PluginConnector]: CDTParser initialized [2019-11-19 21:58:34,931 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_b1f27260-aeaf-4802-85b9-95fe0a263f77/bin/uautomizer/../../sv-benchmarks/c/ssh/s3_srvr.blast.01.i.cil-2.c [2019-11-19 21:58:34,996 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_b1f27260-aeaf-4802-85b9-95fe0a263f77/bin/uautomizer/data/81cbe1103/e1a012f0f76847329d813df648b44d1c/FLAG40d60d8e1 [2019-11-19 21:58:35,536 INFO L306 CDTParser]: Found 1 translation units. [2019-11-19 21:58:35,537 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_b1f27260-aeaf-4802-85b9-95fe0a263f77/sv-benchmarks/c/ssh/s3_srvr.blast.01.i.cil-2.c [2019-11-19 21:58:35,564 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_b1f27260-aeaf-4802-85b9-95fe0a263f77/bin/uautomizer/data/81cbe1103/e1a012f0f76847329d813df648b44d1c/FLAG40d60d8e1 [2019-11-19 21:58:35,959 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_b1f27260-aeaf-4802-85b9-95fe0a263f77/bin/uautomizer/data/81cbe1103/e1a012f0f76847329d813df648b44d1c [2019-11-19 21:58:35,963 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-19 21:58:35,964 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-19 21:58:35,965 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-19 21:58:35,965 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-19 21:58:35,969 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-19 21:58:35,969 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:58:35" (1/1) ... [2019-11-19 21:58:35,972 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5718303e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:58:35, skipping insertion in model container [2019-11-19 21:58:35,972 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:58:35" (1/1) ... [2019-11-19 21:58:35,979 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-19 21:58:36,044 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-19 21:58:36,587 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 21:58:36,625 INFO L188 MainTranslator]: Completed pre-run [2019-11-19 21:58:36,797 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 21:58:36,826 INFO L192 MainTranslator]: Completed translation [2019-11-19 21:58:36,827 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:58:36 WrapperNode [2019-11-19 21:58:36,827 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-19 21:58:36,828 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-19 21:58:36,828 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-19 21:58:36,829 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-19 21:58:36,838 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:58:36" (1/1) ... [2019-11-19 21:58:36,879 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:58:36" (1/1) ... [2019-11-19 21:58:36,943 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-19 21:58:36,951 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-19 21:58:36,951 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-19 21:58:36,952 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-19 21:58:36,960 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:58:36" (1/1) ... [2019-11-19 21:58:36,961 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:58:36" (1/1) ... [2019-11-19 21:58:36,984 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:58:36" (1/1) ... [2019-11-19 21:58:36,984 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:58:36" (1/1) ... [2019-11-19 21:58:37,044 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:58:36" (1/1) ... [2019-11-19 21:58:37,065 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:58:36" (1/1) ... [2019-11-19 21:58:37,068 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:58:36" (1/1) ... [2019-11-19 21:58:37,079 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-19 21:58:37,083 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-19 21:58:37,083 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-19 21:58:37,083 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-19 21:58:37,084 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:58:36" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b1f27260-aeaf-4802-85b9-95fe0a263f77/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-19 21:58:37,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-19 21:58:37,156 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-19 21:58:37,156 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-19 21:58:37,156 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-19 21:58:37,157 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-19 21:58:37,157 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-19 21:58:37,157 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-19 21:58:37,157 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-19 21:58:37,393 WARN L736 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-19 21:58:41,355 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2019-11-19 21:58:41,356 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2019-11-19 21:58:41,357 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-19 21:58:41,357 INFO L285 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-19 21:58:41,358 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:58:41 BoogieIcfgContainer [2019-11-19 21:58:41,359 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-19 21:58:41,360 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-19 21:58:41,360 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-19 21:58:41,363 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-19 21:58:41,363 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 09:58:35" (1/3) ... [2019-11-19 21:58:41,364 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b3ffe90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:58:41, skipping insertion in model container [2019-11-19 21:58:41,364 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:58:36" (2/3) ... [2019-11-19 21:58:41,364 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b3ffe90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:58:41, skipping insertion in model container [2019-11-19 21:58:41,365 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:58:41" (3/3) ... [2019-11-19 21:58:41,370 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.01.i.cil-2.c [2019-11-19 21:58:41,379 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-19 21:58:41,386 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-19 21:58:41,396 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-19 21:58:41,421 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-19 21:58:41,421 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-19 21:58:41,421 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-19 21:58:41,422 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-19 21:58:41,422 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-19 21:58:41,425 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-19 21:58:41,426 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-19 21:58:41,426 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-19 21:58:41,442 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states. [2019-11-19 21:58:41,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-19 21:58:41,454 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:58:41,455 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:58:41,455 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:58:41,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:58:41,461 INFO L82 PathProgramCache]: Analyzing trace with hash 522834703, now seen corresponding path program 1 times [2019-11-19 21:58:41,474 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 21:58:41,474 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1836427558] [2019-11-19 21:58:41,475 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b1f27260-aeaf-4802-85b9-95fe0a263f77/bin/uautomizer/cvc4 Starting monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 21:58:41,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:58:41,723 INFO L255 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-19 21:58:41,736 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 21:58:41,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 21:58:41,785 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 21:58:41,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 21:58:41,829 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1836427558] [2019-11-19 21:58:41,829 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:58:41,830 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-19 21:58:41,831 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642928888] [2019-11-19 21:58:41,838 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 21:58:41,838 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 21:58:41,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 21:58:41,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-19 21:58:41,852 INFO L87 Difference]: Start difference. First operand 145 states. Second operand 4 states. [2019-11-19 21:58:41,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:58:41,990 INFO L93 Difference]: Finished difference Result 549 states and 925 transitions. [2019-11-19 21:58:41,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 21:58:41,993 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2019-11-19 21:58:41,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:58:42,016 INFO L225 Difference]: With dead ends: 549 [2019-11-19 21:58:42,018 INFO L226 Difference]: Without dead ends: 373 [2019-11-19 21:58:42,022 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-19 21:58:42,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2019-11-19 21:58:42,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 371. [2019-11-19 21:58:42,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2019-11-19 21:58:42,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 562 transitions. [2019-11-19 21:58:42,121 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 562 transitions. Word has length 45 [2019-11-19 21:58:42,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:58:42,122 INFO L462 AbstractCegarLoop]: Abstraction has 371 states and 562 transitions. [2019-11-19 21:58:42,122 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 21:58:42,123 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 562 transitions. [2019-11-19 21:58:42,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-11-19 21:58:42,132 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:58:42,132 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:58:42,334 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 21:58:42,334 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:58:42,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:58:42,335 INFO L82 PathProgramCache]: Analyzing trace with hash -60762572, now seen corresponding path program 1 times [2019-11-19 21:58:42,335 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 21:58:42,342 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1199507146] [2019-11-19 21:58:42,343 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b1f27260-aeaf-4802-85b9-95fe0a263f77/bin/uautomizer/cvc4 Starting monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 21:58:42,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:58:42,562 INFO L255 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-19 21:58:42,566 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 21:58:42,589 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 21:58:42,590 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 21:58:42,614 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 21:58:42,614 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1199507146] [2019-11-19 21:58:42,614 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:58:42,615 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-19 21:58:42,615 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370819216] [2019-11-19 21:58:42,617 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 21:58:42,617 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 21:58:42,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 21:58:42,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-19 21:58:42,618 INFO L87 Difference]: Start difference. First operand 371 states and 562 transitions. Second operand 4 states. [2019-11-19 21:58:43,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:58:43,190 INFO L93 Difference]: Finished difference Result 853 states and 1299 transitions. [2019-11-19 21:58:43,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 21:58:43,191 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2019-11-19 21:58:43,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:58:43,195 INFO L225 Difference]: With dead ends: 853 [2019-11-19 21:58:43,195 INFO L226 Difference]: Without dead ends: 611 [2019-11-19 21:58:43,199 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-19 21:58:43,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2019-11-19 21:58:43,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 609. [2019-11-19 21:58:43,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 609 states. [2019-11-19 21:58:43,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 609 states to 609 states and 922 transitions. [2019-11-19 21:58:43,259 INFO L78 Accepts]: Start accepts. Automaton has 609 states and 922 transitions. Word has length 63 [2019-11-19 21:58:43,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:58:43,260 INFO L462 AbstractCegarLoop]: Abstraction has 609 states and 922 transitions. [2019-11-19 21:58:43,261 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 21:58:43,264 INFO L276 IsEmpty]: Start isEmpty. Operand 609 states and 922 transitions. [2019-11-19 21:58:43,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-11-19 21:58:43,269 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:58:43,269 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, 1] [2019-11-19 21:58:43,472 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 21:58:43,472 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:58:43,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:58:43,473 INFO L82 PathProgramCache]: Analyzing trace with hash -2005677060, now seen corresponding path program 1 times [2019-11-19 21:58:43,474 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 21:58:43,474 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [71324283] [2019-11-19 21:58:43,474 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b1f27260-aeaf-4802-85b9-95fe0a263f77/bin/uautomizer/cvc4 Starting monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 21:58:43,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:58:43,725 INFO L255 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-19 21:58:43,731 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 21:58:43,786 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-19 21:58:43,793 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 21:58:43,829 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-19 21:58:43,829 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [71324283] [2019-11-19 21:58:43,829 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:58:43,830 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-19 21:58:43,830 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885460567] [2019-11-19 21:58:43,831 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 21:58:43,831 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 21:58:43,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 21:58:43,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-19 21:58:43,832 INFO L87 Difference]: Start difference. First operand 609 states and 922 transitions. Second operand 4 states. [2019-11-19 21:58:44,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:58:44,243 INFO L93 Difference]: Finished difference Result 1091 states and 1654 transitions. [2019-11-19 21:58:44,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 21:58:44,244 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 123 [2019-11-19 21:58:44,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:58:44,248 INFO L225 Difference]: With dead ends: 1091 [2019-11-19 21:58:44,248 INFO L226 Difference]: Without dead ends: 611 [2019-11-19 21:58:44,250 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 242 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-19 21:58:44,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2019-11-19 21:58:44,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 611. [2019-11-19 21:58:44,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 611 states. [2019-11-19 21:58:44,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 918 transitions. [2019-11-19 21:58:44,277 INFO L78 Accepts]: Start accepts. Automaton has 611 states and 918 transitions. Word has length 123 [2019-11-19 21:58:44,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:58:44,277 INFO L462 AbstractCegarLoop]: Abstraction has 611 states and 918 transitions. [2019-11-19 21:58:44,277 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 21:58:44,278 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 918 transitions. [2019-11-19 21:58:44,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-11-19 21:58:44,279 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:58:44,280 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:58:44,482 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 21:58:44,482 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:58:44,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:58:44,484 INFO L82 PathProgramCache]: Analyzing trace with hash -877709346, now seen corresponding path program 1 times [2019-11-19 21:58:44,485 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 21:58:44,487 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1800620405] [2019-11-19 21:58:44,487 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b1f27260-aeaf-4802-85b9-95fe0a263f77/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-19 21:58:45,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 21:58:46,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 21:58:46,921 INFO L174 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2019-11-19 21:58:46,922 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-19 21:58:47,141 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 21:58:47,298 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 09:58:47 BoogieIcfgContainer [2019-11-19 21:58:47,298 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-19 21:58:47,298 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-19 21:58:47,298 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-19 21:58:47,299 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-19 21:58:47,299 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:58:41" (3/4) ... [2019-11-19 21:58:47,301 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-19 21:58:47,472 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_b1f27260-aeaf-4802-85b9-95fe0a263f77/bin/uautomizer/witness.graphml [2019-11-19 21:58:47,473 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-19 21:58:47,474 INFO L168 Benchmark]: Toolchain (without parser) took 11510.16 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 235.9 MB). Free memory was 957.8 MB in the beginning and 1.0 GB in the end (delta: -82.3 MB). Peak memory consumption was 153.7 MB. Max. memory is 11.5 GB. [2019-11-19 21:58:47,475 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 987.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 21:58:47,475 INFO L168 Benchmark]: CACSL2BoogieTranslator took 862.70 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 172.5 MB). Free memory was 957.8 MB in the beginning and 1.1 GB in the end (delta: -184.3 MB). Peak memory consumption was 28.6 MB. Max. memory is 11.5 GB. [2019-11-19 21:58:47,476 INFO L168 Benchmark]: Boogie Procedure Inliner took 122.76 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.4 MB). Peak memory consumption was 6.4 MB. Max. memory is 11.5 GB. [2019-11-19 21:58:47,476 INFO L168 Benchmark]: Boogie Preprocessor took 131.37 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.4 MB). Peak memory consumption was 6.4 MB. Max. memory is 11.5 GB. [2019-11-19 21:58:47,476 INFO L168 Benchmark]: RCFGBuilder took 4276.05 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: 94.6 MB). Peak memory consumption was 94.6 MB. Max. memory is 11.5 GB. [2019-11-19 21:58:47,477 INFO L168 Benchmark]: TraceAbstraction took 5938.17 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 63.4 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -19.4 MB). Peak memory consumption was 44.0 MB. Max. memory is 11.5 GB. [2019-11-19 21:58:47,477 INFO L168 Benchmark]: Witness Printer took 174.50 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 14.1 MB). Peak memory consumption was 14.1 MB. Max. memory is 11.5 GB. [2019-11-19 21:58:47,479 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 987.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 862.70 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 172.5 MB). Free memory was 957.8 MB in the beginning and 1.1 GB in the end (delta: -184.3 MB). Peak memory consumption was 28.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 122.76 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.4 MB). Peak memory consumption was 6.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 131.37 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.4 MB). Peak memory consumption was 6.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 4276.05 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: 94.6 MB). Peak memory consumption was 94.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 5938.17 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 63.4 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -19.4 MB). Peak memory consumption was 44.0 MB. Max. memory is 11.5 GB. * Witness Printer took 174.50 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 14.1 MB). Peak memory consumption was 14.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1706]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L1042] static int init = 1; [L1043] static SSL_METHOD SSLv3_server_data ; VAL [init=1, SSLv3_server_data={2147483645:0}] [L1065] SSL *s ; [L1066] int tmp ; [L1070] s = malloc(sizeof(SSL)) [L1071] s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1072] s->ctx = malloc(sizeof(SSL_CTX)) [L1073] s->session = malloc(sizeof(SSL_SESSION)) [L1074] s->state = 8464 [L1081] BUF_MEM *buf = (BUF_MEM *)__VERIFIER_nondet_ulong(); [L1082] unsigned long l ; [L1083] unsigned long Time ; [L1084] unsigned long tmp = __VERIFIER_nondet_long() ; [L1085] void (*cb)() ; [L1086] long num1 ; [L1087] int ret ; [L1088] int new_state ; [L1089] int state ; [L1090] int skip ; [L1091] int got_new_session ; [L1092] int tmp___1 = __VERIFIER_nondet_int() ; [L1093] int tmp___2 = __VERIFIER_nondet_int() ; [L1094] int tmp___3 ; [L1095] int tmp___4 ; [L1096] int tmp___5 ; [L1097] int tmp___6 ; [L1098] int tmp___7 ; [L1099] long tmp___8 = __VERIFIER_nondet_long() ; [L1100] int tmp___9 ; [L1101] int tmp___10 ; [L1102] int blastFlag ; [L1106] blastFlag = 0 [L1107] s->hit=__VERIFIER_nondet_int () [L1108] s->state = 8464 [L1109] Time = tmp [L1110] cb = (void (*)())((void *)0) [L1111] ret = -1 [L1112] skip = 0 [L1113] got_new_session = 0 [L1114] EXPR s->info_callback VAL [init=1, SSLv3_server_data={2147483645:0}] [L1114] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1115] EXPR s->info_callback [L1115] cb = s->info_callback [L1119] EXPR s->in_handshake [L1119] s->in_handshake += 1 [L1120] COND FALSE !(tmp___1 & 12288) VAL [init=1, SSLv3_server_data={2147483645:0}] [L1129] EXPR s->cert VAL [init=1, SSLv3_server_data={2147483645:0}] [L1129] COND FALSE !((unsigned long )s->cert == (unsigned long )((void *)0)) [L1135] COND TRUE 1 VAL [init=1, SSLv3_server_data={2147483645:0}] [L1137] EXPR s->state [L1137] state = s->state [L1138] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1138] COND FALSE !(s->state == 12292) [L1141] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1141] COND FALSE !(s->state == 16384) [L1144] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1144] COND FALSE !(s->state == 8192) [L1147] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1147] COND FALSE !(s->state == 24576) [L1150] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1150] COND FALSE !(s->state == 8195) [L1153] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1153] COND FALSE !(s->state == 8480) [L1156] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1156] COND FALSE !(s->state == 8481) [L1159] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1159] COND FALSE !(s->state == 8482) [L1162] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1162] COND TRUE s->state == 8464 [L1318] s->shutdown = 0 [L1319] ret = __VERIFIER_nondet_int() [L1320] COND TRUE blastFlag == 0 [L1321] blastFlag = 1 VAL [init=1, SSLv3_server_data={2147483645:0}] [L1325] COND FALSE !(ret <= 0) [L1330] got_new_session = 1 [L1331] s->state = 8496 [L1332] s->init_num = 0 VAL [init=1, SSLv3_server_data={2147483645:0}] [L1665] EXPR s->s3 [L1665] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={2147483645:0}] [L1665] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1694] skip = 0 VAL [init=1, SSLv3_server_data={2147483645:0}] [L1135] COND TRUE 1 VAL [init=1, SSLv3_server_data={2147483645:0}] [L1137] EXPR s->state [L1137] state = s->state [L1138] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1138] COND FALSE !(s->state == 12292) [L1141] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1141] COND FALSE !(s->state == 16384) [L1144] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1144] COND FALSE !(s->state == 8192) [L1147] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1147] COND FALSE !(s->state == 24576) [L1150] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1150] COND FALSE !(s->state == 8195) [L1153] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1153] COND FALSE !(s->state == 8480) [L1156] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1156] COND FALSE !(s->state == 8481) [L1159] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1159] COND FALSE !(s->state == 8482) [L1162] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1162] COND FALSE !(s->state == 8464) [L1165] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1165] COND FALSE !(s->state == 8465) [L1168] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1168] COND FALSE !(s->state == 8466) [L1171] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1171] COND TRUE s->state == 8496 [L1336] ret = __VERIFIER_nondet_int() [L1337] COND TRUE blastFlag == 1 [L1338] blastFlag = 2 VAL [init=1, SSLv3_server_data={2147483645:0}] [L1342] COND FALSE !(ret <= 0) [L1347] s->hit VAL [init=1, SSLv3_server_data={2147483645:0}] [L1347] COND TRUE s->hit [L1348] s->state = 8656 VAL [init=1, SSLv3_server_data={2147483645:0}] [L1352] s->init_num = 0 VAL [init=1, SSLv3_server_data={2147483645:0}] [L1665] EXPR s->s3 [L1665] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={2147483645:0}] [L1665] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1694] skip = 0 VAL [init=1, SSLv3_server_data={2147483645:0}] [L1135] COND TRUE 1 VAL [init=1, SSLv3_server_data={2147483645:0}] [L1137] EXPR s->state [L1137] state = s->state [L1138] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1138] COND FALSE !(s->state == 12292) [L1141] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1141] COND FALSE !(s->state == 16384) [L1144] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1144] COND FALSE !(s->state == 8192) [L1147] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1147] COND FALSE !(s->state == 24576) [L1150] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1150] COND FALSE !(s->state == 8195) [L1153] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1153] COND FALSE !(s->state == 8480) [L1156] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1156] COND FALSE !(s->state == 8481) [L1159] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1159] COND FALSE !(s->state == 8482) [L1162] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1162] COND FALSE !(s->state == 8464) [L1165] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1165] COND FALSE !(s->state == 8465) [L1168] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1168] COND FALSE !(s->state == 8466) [L1171] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1171] COND FALSE !(s->state == 8496) [L1174] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1174] COND FALSE !(s->state == 8497) [L1177] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1177] COND FALSE !(s->state == 8512) [L1180] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1180] COND FALSE !(s->state == 8513) [L1183] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1183] COND FALSE !(s->state == 8528) [L1186] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1186] COND FALSE !(s->state == 8529) [L1189] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1189] COND FALSE !(s->state == 8544) [L1192] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1192] COND FALSE !(s->state == 8545) [L1195] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1195] COND FALSE !(s->state == 8560) [L1198] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1198] COND FALSE !(s->state == 8561) [L1201] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1201] COND FALSE !(s->state == 8448) [L1204] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1204] COND FALSE !(s->state == 8576) [L1207] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1207] COND FALSE !(s->state == 8577) [L1210] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1210] COND FALSE !(s->state == 8592) [L1213] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1213] COND FALSE !(s->state == 8593) [L1216] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1216] COND FALSE !(s->state == 8608) [L1219] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1219] COND FALSE !(s->state == 8609) [L1222] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1222] COND FALSE !(s->state == 8640) [L1225] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1225] COND FALSE !(s->state == 8641) [L1228] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1228] COND TRUE s->state == 8656 [L1552] EXPR s->session [L1552] EXPR s->s3 [L1552] EXPR (s->s3)->tmp.new_cipher [L1552] (s->session)->cipher = (s->s3)->tmp.new_cipher [L1553] tmp___9 = __VERIFIER_nondet_int() [L1554] COND FALSE !(! tmp___9) [L1560] ret = __VERIFIER_nondet_int() [L1561] COND TRUE blastFlag == 2 [L1562] blastFlag = 5 VAL [init=1, SSLv3_server_data={2147483645:0}] [L1566] COND FALSE !(ret <= 0) [L1571] s->state = 8672 [L1572] s->init_num = 0 [L1573] tmp___10 = __VERIFIER_nondet_int() [L1574] COND FALSE !(! tmp___10) VAL [init=1, SSLv3_server_data={2147483645:0}] [L1665] EXPR s->s3 [L1665] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={2147483645:0}] [L1665] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1694] skip = 0 VAL [init=1, SSLv3_server_data={2147483645:0}] [L1135] COND TRUE 1 VAL [init=1, SSLv3_server_data={2147483645:0}] [L1137] EXPR s->state [L1137] state = s->state [L1138] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1138] COND FALSE !(s->state == 12292) [L1141] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1141] COND FALSE !(s->state == 16384) [L1144] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1144] COND FALSE !(s->state == 8192) [L1147] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1147] COND FALSE !(s->state == 24576) [L1150] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1150] COND FALSE !(s->state == 8195) [L1153] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1153] COND FALSE !(s->state == 8480) [L1156] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1156] COND FALSE !(s->state == 8481) [L1159] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1159] COND FALSE !(s->state == 8482) [L1162] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1162] COND FALSE !(s->state == 8464) [L1165] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1165] COND FALSE !(s->state == 8465) [L1168] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1168] COND FALSE !(s->state == 8466) [L1171] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1171] COND FALSE !(s->state == 8496) [L1174] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1174] COND FALSE !(s->state == 8497) [L1177] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1177] COND FALSE !(s->state == 8512) [L1180] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1180] COND FALSE !(s->state == 8513) [L1183] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1183] COND FALSE !(s->state == 8528) [L1186] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1186] COND FALSE !(s->state == 8529) [L1189] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1189] COND FALSE !(s->state == 8544) [L1192] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1192] COND FALSE !(s->state == 8545) [L1195] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1195] COND FALSE !(s->state == 8560) [L1198] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1198] COND FALSE !(s->state == 8561) [L1201] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1201] COND FALSE !(s->state == 8448) [L1204] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1204] COND FALSE !(s->state == 8576) [L1207] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1207] COND FALSE !(s->state == 8577) [L1210] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1210] COND FALSE !(s->state == 8592) [L1213] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1213] COND FALSE !(s->state == 8593) [L1216] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1216] COND FALSE !(s->state == 8608) [L1219] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1219] COND FALSE !(s->state == 8609) [L1222] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1222] COND FALSE !(s->state == 8640) [L1225] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1225] COND FALSE !(s->state == 8641) [L1228] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1228] COND FALSE !(s->state == 8656) [L1231] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1231] COND FALSE !(s->state == 8657) [L1234] EXPR s->state VAL [init=1, SSLv3_server_data={2147483645:0}] [L1234] COND TRUE s->state == 8672 [L1583] ret = __VERIFIER_nondet_int() [L1584] COND FALSE !(blastFlag == 4) VAL [init=1, SSLv3_server_data={2147483645:0}] [L1587] COND TRUE blastFlag == 5 VAL [init=1, SSLv3_server_data={2147483645:0}] [L1706] __VERIFIER_error() VAL [init=1, SSLv3_server_data={2147483645:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 145 locations, 1 error locations. Result: UNSAFE, OverallTime: 5.8s, OverallIterations: 4, TraceHistogramMax: 4, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 951 SDtfs, 1145 SDslu, 976 SDs, 0 SdLazy, 86 SolverSat, 31 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 456 GetRequests, 450 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=611occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 4 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 357 NumberOfCodeBlocks, 357 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 456 ConstructedInterpolants, 0 QuantifiedInterpolants, 120522 SizeOfPredicates, 2 NumberOfNonLiveVariables, 617 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 224/224 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...