./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ssh/s3_srvr.blast.12.i.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_ebe9ee3c-7bc0-40c8-b282-fdc47ff043c7/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_ebe9ee3c-7bc0-40c8-b282-fdc47ff043c7/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_ebe9ee3c-7bc0-40c8-b282-fdc47ff043c7/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_ebe9ee3c-7bc0-40c8-b282-fdc47ff043c7/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh/s3_srvr.blast.12.i.cil-2.c -s /tmp/vcloud-vcloud-master/worker/run_dir_ebe9ee3c-7bc0-40c8-b282-fdc47ff043c7/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_ebe9ee3c-7bc0-40c8-b282-fdc47ff043c7/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 e83cf3c2949f89871817218ec6b0742e2a7cf269 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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_ebe9ee3c-7bc0-40c8-b282-fdc47ff043c7/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_ebe9ee3c-7bc0-40c8-b282-fdc47ff043c7/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_ebe9ee3c-7bc0-40c8-b282-fdc47ff043c7/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_ebe9ee3c-7bc0-40c8-b282-fdc47ff043c7/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh/s3_srvr.blast.12.i.cil-2.c -s /tmp/vcloud-vcloud-master/worker/run_dir_ebe9ee3c-7bc0-40c8-b282-fdc47ff043c7/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_ebe9ee3c-7bc0-40c8-b282-fdc47ff043c7/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 e83cf3c2949f89871817218ec6b0742e2a7cf269 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: NullPointerException: null --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 21:09:09,853 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 21:09:09,855 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 21:09:09,864 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 21:09:09,865 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 21:09:09,866 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 21:09:09,867 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 21:09:09,869 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 21:09:09,871 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 21:09:09,871 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 21:09:09,872 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 21:09:09,873 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 21:09:09,874 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 21:09:09,874 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 21:09:09,875 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 21:09:09,876 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 21:09:09,877 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 21:09:09,878 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 21:09:09,879 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 21:09:09,881 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 21:09:09,882 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 21:09:09,883 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 21:09:09,884 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 21:09:09,884 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 21:09:09,887 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 21:09:09,887 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 21:09:09,887 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 21:09:09,888 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 21:09:09,888 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 21:09:09,889 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 21:09:09,889 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 21:09:09,890 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 21:09:09,891 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 21:09:09,891 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 21:09:09,892 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 21:09:09,893 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 21:09:09,893 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 21:09:09,893 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 21:09:09,894 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 21:09:09,895 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 21:09:09,895 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 21:09:09,896 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_ebe9ee3c-7bc0-40c8-b282-fdc47ff043c7/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-15 21:09:09,907 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 21:09:09,908 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 21:09:09,909 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 21:09:09,909 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 21:09:09,909 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 21:09:09,910 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 21:09:09,910 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 21:09:09,910 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 21:09:09,910 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 21:09:09,911 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 21:09:09,911 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 21:09:09,911 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 21:09:09,911 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 21:09:09,911 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 21:09:09,912 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 21:09:09,912 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 21:09:09,912 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 21:09:09,912 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 21:09:09,913 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 21:09:09,913 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 21:09:09,913 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 21:09:09,913 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 21:09:09,914 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 21:09:09,914 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 21:09:09,914 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 21:09:09,914 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 21:09:09,915 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 21:09:09,915 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 21:09:09,915 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_ebe9ee3c-7bc0-40c8-b282-fdc47ff043c7/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 -> e83cf3c2949f89871817218ec6b0742e2a7cf269 [2019-11-15 21:09:09,940 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 21:09:09,951 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 21:09:09,954 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 21:09:09,957 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 21:09:09,958 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 21:09:09,958 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_ebe9ee3c-7bc0-40c8-b282-fdc47ff043c7/bin/uautomizer/../../sv-benchmarks/c/ssh/s3_srvr.blast.12.i.cil-2.c [2019-11-15 21:09:10,018 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_ebe9ee3c-7bc0-40c8-b282-fdc47ff043c7/bin/uautomizer/data/ef3dc8937/70f3c828342347f7b57a5f072df045df/FLAG27e814523 [2019-11-15 21:09:10,562 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 21:09:10,563 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_ebe9ee3c-7bc0-40c8-b282-fdc47ff043c7/sv-benchmarks/c/ssh/s3_srvr.blast.12.i.cil-2.c [2019-11-15 21:09:10,579 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_ebe9ee3c-7bc0-40c8-b282-fdc47ff043c7/bin/uautomizer/data/ef3dc8937/70f3c828342347f7b57a5f072df045df/FLAG27e814523 [2019-11-15 21:09:11,028 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_ebe9ee3c-7bc0-40c8-b282-fdc47ff043c7/bin/uautomizer/data/ef3dc8937/70f3c828342347f7b57a5f072df045df [2019-11-15 21:09:11,031 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 21:09:11,032 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 21:09:11,033 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 21:09:11,034 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 21:09:11,037 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 21:09:11,038 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 09:09:11" (1/1) ... [2019-11-15 21:09:11,040 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b6ff2ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:09:11, skipping insertion in model container [2019-11-15 21:09:11,041 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 09:09:11" (1/1) ... [2019-11-15 21:09:11,047 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 21:09:11,119 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 21:09:11,537 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 21:09:11,551 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 21:09:11,690 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 21:09:11,708 INFO L192 MainTranslator]: Completed translation [2019-11-15 21:09:11,709 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:09:11 WrapperNode [2019-11-15 21:09:11,709 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 21:09:11,710 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 21:09:11,710 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 21:09:11,710 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 21:09:11,718 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:09:11" (1/1) ... [2019-11-15 21:09:11,740 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:09:11" (1/1) ... [2019-11-15 21:09:11,781 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 21:09:11,781 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 21:09:11,781 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 21:09:11,781 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 21:09:11,790 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:09:11" (1/1) ... [2019-11-15 21:09:11,791 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:09:11" (1/1) ... [2019-11-15 21:09:11,799 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:09:11" (1/1) ... [2019-11-15 21:09:11,799 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:09:11" (1/1) ... [2019-11-15 21:09:11,858 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:09:11" (1/1) ... [2019-11-15 21:09:11,868 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:09:11" (1/1) ... [2019-11-15 21:09:11,886 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:09:11" (1/1) ... [2019-11-15 21:09:11,898 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 21:09:11,900 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 21:09:11,901 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 21:09:11,901 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 21:09:11,902 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:09:11" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ebe9ee3c-7bc0-40c8-b282-fdc47ff043c7/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-15 21:09:11,986 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-15 21:09:11,986 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 21:09:11,986 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 21:09:11,986 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-15 21:09:11,988 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-15 21:09:11,988 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-15 21:09:11,988 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 21:09:11,988 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 21:09:12,295 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-15 21:09:13,198 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2019-11-15 21:09:13,198 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2019-11-15 21:09:13,199 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 21:09:13,199 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-15 21:09:13,201 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:09:13 BoogieIcfgContainer [2019-11-15 21:09:13,201 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 21:09:13,202 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 21:09:13,202 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 21:09:13,204 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 21:09:13,204 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 09:09:11" (1/3) ... [2019-11-15 21:09:13,205 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@743b0085 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 09:09:13, skipping insertion in model container [2019-11-15 21:09:13,205 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:09:11" (2/3) ... [2019-11-15 21:09:13,205 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@743b0085 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 09:09:13, skipping insertion in model container [2019-11-15 21:09:13,205 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:09:13" (3/3) ... [2019-11-15 21:09:13,207 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.12.i.cil-2.c [2019-11-15 21:09:13,215 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 21:09:13,222 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-15 21:09:13,232 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-15 21:09:13,254 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 21:09:13,254 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 21:09:13,254 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 21:09:13,254 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 21:09:13,254 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 21:09:13,254 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 21:09:13,255 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 21:09:13,255 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 21:09:13,271 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states. [2019-11-15 21:09:13,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-15 21:09:13,280 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:09:13,280 INFO L380 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] [2019-11-15 21:09:13,282 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:09:13,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:09:13,287 INFO L82 PathProgramCache]: Analyzing trace with hash 557483936, now seen corresponding path program 1 times [2019-11-15 21:09:13,295 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:09:13,295 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310455242] [2019-11-15 21:09:13,295 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:09:13,296 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:09:13,296 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:09:13,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:09:13,643 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-15 21:09:13,644 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310455242] [2019-11-15 21:09:13,645 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:09:13,645 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:09:13,645 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180157292] [2019-11-15 21:09:13,651 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:09:13,651 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:09:13,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:09:13,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:09:13,666 INFO L87 Difference]: Start difference. First operand 151 states. Second operand 4 states. [2019-11-15 21:09:14,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:09:14,202 INFO L93 Difference]: Finished difference Result 329 states and 559 transitions. [2019-11-15 21:09:14,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:09:14,204 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 42 [2019-11-15 21:09:14,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:09:14,216 INFO L225 Difference]: With dead ends: 329 [2019-11-15 21:09:14,216 INFO L226 Difference]: Without dead ends: 166 [2019-11-15 21:09:14,220 INFO L600 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-15 21:09:14,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-11-15 21:09:14,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 149. [2019-11-15 21:09:14,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-11-15 21:09:14,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 232 transitions. [2019-11-15 21:09:14,281 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 232 transitions. Word has length 42 [2019-11-15 21:09:14,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:09:14,281 INFO L462 AbstractCegarLoop]: Abstraction has 149 states and 232 transitions. [2019-11-15 21:09:14,281 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:09:14,282 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 232 transitions. [2019-11-15 21:09:14,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-15 21:09:14,289 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:09:14,289 INFO L380 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] [2019-11-15 21:09:14,290 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:09:14,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:09:14,290 INFO L82 PathProgramCache]: Analyzing trace with hash 1960137762, now seen corresponding path program 1 times [2019-11-15 21:09:14,290 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:09:14,291 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755762004] [2019-11-15 21:09:14,291 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:09:14,291 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:09:14,291 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:09:14,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:09:14,403 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-15 21:09:14,404 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755762004] [2019-11-15 21:09:14,405 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:09:14,405 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:09:14,406 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317300914] [2019-11-15 21:09:14,408 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:09:14,408 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:09:14,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:09:14,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:09:14,409 INFO L87 Difference]: Start difference. First operand 149 states and 232 transitions. Second operand 4 states. [2019-11-15 21:09:14,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:09:14,817 INFO L93 Difference]: Finished difference Result 296 states and 455 transitions. [2019-11-15 21:09:14,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:09:14,818 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 55 [2019-11-15 21:09:14,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:09:14,820 INFO L225 Difference]: With dead ends: 296 [2019-11-15 21:09:14,820 INFO L226 Difference]: Without dead ends: 166 [2019-11-15 21:09:14,822 INFO L600 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-15 21:09:14,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-11-15 21:09:14,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 149. [2019-11-15 21:09:14,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-11-15 21:09:14,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 231 transitions. [2019-11-15 21:09:14,843 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 231 transitions. Word has length 55 [2019-11-15 21:09:14,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:09:14,844 INFO L462 AbstractCegarLoop]: Abstraction has 149 states and 231 transitions. [2019-11-15 21:09:14,844 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:09:14,845 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 231 transitions. [2019-11-15 21:09:14,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-15 21:09:14,851 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:09:14,851 INFO L380 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] [2019-11-15 21:09:14,851 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:09:14,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:09:14,853 INFO L82 PathProgramCache]: Analyzing trace with hash 1719614288, now seen corresponding path program 1 times [2019-11-15 21:09:14,853 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:09:14,853 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049987665] [2019-11-15 21:09:14,853 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:09:14,854 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:09:14,854 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:09:14,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:09:15,000 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-15 21:09:15,002 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049987665] [2019-11-15 21:09:15,003 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:09:15,003 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:09:15,003 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889862002] [2019-11-15 21:09:15,004 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:09:15,004 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:09:15,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:09:15,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:09:15,005 INFO L87 Difference]: Start difference. First operand 149 states and 231 transitions. Second operand 4 states. [2019-11-15 21:09:15,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:09:15,415 INFO L93 Difference]: Finished difference Result 295 states and 453 transitions. [2019-11-15 21:09:15,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:09:15,416 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2019-11-15 21:09:15,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:09:15,418 INFO L225 Difference]: With dead ends: 295 [2019-11-15 21:09:15,418 INFO L226 Difference]: Without dead ends: 165 [2019-11-15 21:09:15,419 INFO L600 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-15 21:09:15,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2019-11-15 21:09:15,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 149. [2019-11-15 21:09:15,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-11-15 21:09:15,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 230 transitions. [2019-11-15 21:09:15,428 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 230 transitions. Word has length 56 [2019-11-15 21:09:15,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:09:15,428 INFO L462 AbstractCegarLoop]: Abstraction has 149 states and 230 transitions. [2019-11-15 21:09:15,429 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:09:15,429 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 230 transitions. [2019-11-15 21:09:15,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-15 21:09:15,429 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:09:15,430 INFO L380 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] [2019-11-15 21:09:15,430 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:09:15,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:09:15,430 INFO L82 PathProgramCache]: Analyzing trace with hash 857090501, now seen corresponding path program 1 times [2019-11-15 21:09:15,430 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:09:15,431 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103110182] [2019-11-15 21:09:15,431 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:09:15,431 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:09:15,431 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:09:15,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:09:15,499 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-15 21:09:15,499 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103110182] [2019-11-15 21:09:15,499 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:09:15,500 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:09:15,500 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653131748] [2019-11-15 21:09:15,500 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:09:15,500 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:09:15,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:09:15,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:09:15,501 INFO L87 Difference]: Start difference. First operand 149 states and 230 transitions. Second operand 4 states. [2019-11-15 21:09:15,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:09:15,822 INFO L93 Difference]: Finished difference Result 293 states and 450 transitions. [2019-11-15 21:09:15,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:09:15,823 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2019-11-15 21:09:15,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:09:15,824 INFO L225 Difference]: With dead ends: 293 [2019-11-15 21:09:15,825 INFO L226 Difference]: Without dead ends: 163 [2019-11-15 21:09:15,826 INFO L600 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-15 21:09:15,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-11-15 21:09:15,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 149. [2019-11-15 21:09:15,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-11-15 21:09:15,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 229 transitions. [2019-11-15 21:09:15,834 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 229 transitions. Word has length 56 [2019-11-15 21:09:15,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:09:15,835 INFO L462 AbstractCegarLoop]: Abstraction has 149 states and 229 transitions. [2019-11-15 21:09:15,835 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:09:15,835 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 229 transitions. [2019-11-15 21:09:15,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-15 21:09:15,836 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:09:15,836 INFO L380 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] [2019-11-15 21:09:15,836 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:09:15,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:09:15,837 INFO L82 PathProgramCache]: Analyzing trace with hash -463762811, now seen corresponding path program 1 times [2019-11-15 21:09:15,837 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:09:15,837 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532506220] [2019-11-15 21:09:15,837 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:09:15,837 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:09:15,837 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:09:15,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:09:15,950 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-15 21:09:15,951 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532506220] [2019-11-15 21:09:15,952 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:09:15,952 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:09:15,952 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206795602] [2019-11-15 21:09:15,953 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:09:15,954 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:09:15,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:09:15,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:09:15,955 INFO L87 Difference]: Start difference. First operand 149 states and 229 transitions. Second operand 4 states. [2019-11-15 21:09:16,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:09:16,278 INFO L93 Difference]: Finished difference Result 292 states and 448 transitions. [2019-11-15 21:09:16,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:09:16,279 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2019-11-15 21:09:16,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:09:16,280 INFO L225 Difference]: With dead ends: 292 [2019-11-15 21:09:16,280 INFO L226 Difference]: Without dead ends: 162 [2019-11-15 21:09:16,281 INFO L600 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-15 21:09:16,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-11-15 21:09:16,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 149. [2019-11-15 21:09:16,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-11-15 21:09:16,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 228 transitions. [2019-11-15 21:09:16,287 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 228 transitions. Word has length 56 [2019-11-15 21:09:16,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:09:16,288 INFO L462 AbstractCegarLoop]: Abstraction has 149 states and 228 transitions. [2019-11-15 21:09:16,288 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:09:16,288 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 228 transitions. [2019-11-15 21:09:16,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-15 21:09:16,289 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:09:16,289 INFO L380 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] [2019-11-15 21:09:16,290 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:09:16,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:09:16,290 INFO L82 PathProgramCache]: Analyzing trace with hash 672103484, now seen corresponding path program 1 times [2019-11-15 21:09:16,290 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:09:16,290 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508921116] [2019-11-15 21:09:16,291 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:09:16,291 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:09:16,291 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:09:16,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:09:16,353 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-15 21:09:16,353 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508921116] [2019-11-15 21:09:16,354 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:09:16,354 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:09:16,354 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2147051145] [2019-11-15 21:09:16,355 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:09:16,355 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:09:16,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:09:16,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:09:16,355 INFO L87 Difference]: Start difference. First operand 149 states and 228 transitions. Second operand 4 states. [2019-11-15 21:09:16,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:09:16,643 INFO L93 Difference]: Finished difference Result 292 states and 447 transitions. [2019-11-15 21:09:16,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:09:16,645 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2019-11-15 21:09:16,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:09:16,646 INFO L225 Difference]: With dead ends: 292 [2019-11-15 21:09:16,646 INFO L226 Difference]: Without dead ends: 162 [2019-11-15 21:09:16,647 INFO L600 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-15 21:09:16,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-11-15 21:09:16,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 149. [2019-11-15 21:09:16,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-11-15 21:09:16,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 227 transitions. [2019-11-15 21:09:16,652 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 227 transitions. Word has length 56 [2019-11-15 21:09:16,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:09:16,653 INFO L462 AbstractCegarLoop]: Abstraction has 149 states and 227 transitions. [2019-11-15 21:09:16,653 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:09:16,653 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 227 transitions. [2019-11-15 21:09:16,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-11-15 21:09:16,654 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:09:16,654 INFO L380 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] [2019-11-15 21:09:16,654 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:09:16,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:09:16,654 INFO L82 PathProgramCache]: Analyzing trace with hash -1092203463, now seen corresponding path program 1 times [2019-11-15 21:09:16,655 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:09:16,655 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326833420] [2019-11-15 21:09:16,655 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:09:16,655 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:09:16,655 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:09:16,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:09:16,720 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-15 21:09:16,720 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326833420] [2019-11-15 21:09:16,721 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:09:16,721 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:09:16,721 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801673561] [2019-11-15 21:09:16,722 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:09:16,722 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:09:16,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:09:16,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:09:16,722 INFO L87 Difference]: Start difference. First operand 149 states and 227 transitions. Second operand 4 states. [2019-11-15 21:09:17,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:09:17,010 INFO L93 Difference]: Finished difference Result 292 states and 446 transitions. [2019-11-15 21:09:17,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:09:17,011 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2019-11-15 21:09:17,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:09:17,012 INFO L225 Difference]: With dead ends: 292 [2019-11-15 21:09:17,012 INFO L226 Difference]: Without dead ends: 162 [2019-11-15 21:09:17,013 INFO L600 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-15 21:09:17,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-11-15 21:09:17,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 149. [2019-11-15 21:09:17,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-11-15 21:09:17,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 226 transitions. [2019-11-15 21:09:17,018 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 226 transitions. Word has length 57 [2019-11-15 21:09:17,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:09:17,018 INFO L462 AbstractCegarLoop]: Abstraction has 149 states and 226 transitions. [2019-11-15 21:09:17,018 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:09:17,018 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 226 transitions. [2019-11-15 21:09:17,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-11-15 21:09:17,019 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:09:17,019 INFO L380 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] [2019-11-15 21:09:17,019 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:09:17,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:09:17,020 INFO L82 PathProgramCache]: Analyzing trace with hash -1572913161, now seen corresponding path program 1 times [2019-11-15 21:09:17,020 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:09:17,020 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732040561] [2019-11-15 21:09:17,020 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:09:17,020 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:09:17,020 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:09:17,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:09:17,125 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-15 21:09:17,125 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732040561] [2019-11-15 21:09:17,126 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:09:17,126 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:09:17,126 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168886897] [2019-11-15 21:09:17,127 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:09:17,127 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:09:17,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:09:17,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:09:17,129 INFO L87 Difference]: Start difference. First operand 149 states and 226 transitions. Second operand 4 states. [2019-11-15 21:09:17,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:09:17,456 INFO L93 Difference]: Finished difference Result 292 states and 445 transitions. [2019-11-15 21:09:17,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:09:17,456 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2019-11-15 21:09:17,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:09:17,457 INFO L225 Difference]: With dead ends: 292 [2019-11-15 21:09:17,458 INFO L226 Difference]: Without dead ends: 162 [2019-11-15 21:09:17,458 INFO L600 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-15 21:09:17,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-11-15 21:09:17,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 149. [2019-11-15 21:09:17,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-11-15 21:09:17,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 225 transitions. [2019-11-15 21:09:17,463 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 225 transitions. Word has length 58 [2019-11-15 21:09:17,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:09:17,463 INFO L462 AbstractCegarLoop]: Abstraction has 149 states and 225 transitions. [2019-11-15 21:09:17,463 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:09:17,463 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 225 transitions. [2019-11-15 21:09:17,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-11-15 21:09:17,464 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:09:17,464 INFO L380 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] [2019-11-15 21:09:17,464 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:09:17,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:09:17,465 INFO L82 PathProgramCache]: Analyzing trace with hash -916813804, now seen corresponding path program 1 times [2019-11-15 21:09:17,465 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:09:17,465 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859797978] [2019-11-15 21:09:17,465 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:09:17,465 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:09:17,465 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:09:17,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:09:17,520 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-15 21:09:17,520 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859797978] [2019-11-15 21:09:17,521 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:09:17,521 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:09:17,521 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558258486] [2019-11-15 21:09:17,521 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:09:17,522 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:09:17,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:09:17,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:09:17,522 INFO L87 Difference]: Start difference. First operand 149 states and 225 transitions. Second operand 4 states. [2019-11-15 21:09:17,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:09:17,744 INFO L93 Difference]: Finished difference Result 282 states and 431 transitions. [2019-11-15 21:09:17,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:09:17,745 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2019-11-15 21:09:17,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:09:17,746 INFO L225 Difference]: With dead ends: 282 [2019-11-15 21:09:17,746 INFO L226 Difference]: Without dead ends: 152 [2019-11-15 21:09:17,746 INFO L600 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-15 21:09:17,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-11-15 21:09:17,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 149. [2019-11-15 21:09:17,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-11-15 21:09:17,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 224 transitions. [2019-11-15 21:09:17,751 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 224 transitions. Word has length 59 [2019-11-15 21:09:17,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:09:17,751 INFO L462 AbstractCegarLoop]: Abstraction has 149 states and 224 transitions. [2019-11-15 21:09:17,752 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:09:17,752 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 224 transitions. [2019-11-15 21:09:17,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-11-15 21:09:17,752 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:09:17,752 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:09:17,753 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:09:17,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:09:17,753 INFO L82 PathProgramCache]: Analyzing trace with hash -243814996, now seen corresponding path program 1 times [2019-11-15 21:09:17,753 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:09:17,753 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237425244] [2019-11-15 21:09:17,754 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:09:17,754 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:09:17,754 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:09:17,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:09:17,851 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-15 21:09:17,851 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237425244] [2019-11-15 21:09:17,852 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:09:17,852 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:09:17,852 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021372829] [2019-11-15 21:09:17,852 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:09:17,852 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:09:17,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:09:17,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:09:17,853 INFO L87 Difference]: Start difference. First operand 149 states and 224 transitions. Second operand 4 states. [2019-11-15 21:09:18,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:09:18,200 INFO L93 Difference]: Finished difference Result 322 states and 492 transitions. [2019-11-15 21:09:18,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:09:18,201 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2019-11-15 21:09:18,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:09:18,203 INFO L225 Difference]: With dead ends: 322 [2019-11-15 21:09:18,203 INFO L226 Difference]: Without dead ends: 192 [2019-11-15 21:09:18,204 INFO L600 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-15 21:09:18,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2019-11-15 21:09:18,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 171. [2019-11-15 21:09:18,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2019-11-15 21:09:18,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 262 transitions. [2019-11-15 21:09:18,212 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 262 transitions. Word has length 59 [2019-11-15 21:09:18,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:09:18,212 INFO L462 AbstractCegarLoop]: Abstraction has 171 states and 262 transitions. [2019-11-15 21:09:18,212 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:09:18,212 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 262 transitions. [2019-11-15 21:09:18,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-11-15 21:09:18,213 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:09:18,213 INFO L380 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] [2019-11-15 21:09:18,214 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:09:18,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:09:18,214 INFO L82 PathProgramCache]: Analyzing trace with hash 839606678, now seen corresponding path program 1 times [2019-11-15 21:09:18,214 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:09:18,215 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066402961] [2019-11-15 21:09:18,215 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:09:18,215 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:09:18,215 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:09:18,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:09:18,297 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-15 21:09:18,298 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066402961] [2019-11-15 21:09:18,298 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:09:18,299 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:09:18,299 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021173248] [2019-11-15 21:09:18,299 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:09:18,300 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:09:18,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:09:18,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:09:18,300 INFO L87 Difference]: Start difference. First operand 171 states and 262 transitions. Second operand 4 states. [2019-11-15 21:09:18,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:09:18,641 INFO L93 Difference]: Finished difference Result 344 states and 529 transitions. [2019-11-15 21:09:18,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:09:18,642 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 72 [2019-11-15 21:09:18,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:09:18,643 INFO L225 Difference]: With dead ends: 344 [2019-11-15 21:09:18,644 INFO L226 Difference]: Without dead ends: 192 [2019-11-15 21:09:18,644 INFO L600 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-15 21:09:18,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2019-11-15 21:09:18,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 171. [2019-11-15 21:09:18,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2019-11-15 21:09:18,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 261 transitions. [2019-11-15 21:09:18,649 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 261 transitions. Word has length 72 [2019-11-15 21:09:18,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:09:18,649 INFO L462 AbstractCegarLoop]: Abstraction has 171 states and 261 transitions. [2019-11-15 21:09:18,649 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:09:18,649 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 261 transitions. [2019-11-15 21:09:18,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-11-15 21:09:18,650 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:09:18,650 INFO L380 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] [2019-11-15 21:09:18,651 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:09:18,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:09:18,651 INFO L82 PathProgramCache]: Analyzing trace with hash 1342889052, now seen corresponding path program 1 times [2019-11-15 21:09:18,651 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:09:18,651 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883121936] [2019-11-15 21:09:18,653 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:09:18,653 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:09:18,653 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:09:18,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:09:18,721 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-15 21:09:18,722 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883121936] [2019-11-15 21:09:18,722 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:09:18,722 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:09:18,722 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263205942] [2019-11-15 21:09:18,723 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:09:18,723 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:09:18,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:09:18,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:09:18,723 INFO L87 Difference]: Start difference. First operand 171 states and 261 transitions. Second operand 4 states. [2019-11-15 21:09:19,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:09:19,080 INFO L93 Difference]: Finished difference Result 343 states and 526 transitions. [2019-11-15 21:09:19,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:09:19,081 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 73 [2019-11-15 21:09:19,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:09:19,083 INFO L225 Difference]: With dead ends: 343 [2019-11-15 21:09:19,083 INFO L226 Difference]: Without dead ends: 191 [2019-11-15 21:09:19,083 INFO L600 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-15 21:09:19,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2019-11-15 21:09:19,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 171. [2019-11-15 21:09:19,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2019-11-15 21:09:19,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 260 transitions. [2019-11-15 21:09:19,089 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 260 transitions. Word has length 73 [2019-11-15 21:09:19,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:09:19,090 INFO L462 AbstractCegarLoop]: Abstraction has 171 states and 260 transitions. [2019-11-15 21:09:19,090 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:09:19,090 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 260 transitions. [2019-11-15 21:09:19,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-11-15 21:09:19,091 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:09:19,091 INFO L380 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] [2019-11-15 21:09:19,091 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:09:19,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:09:19,092 INFO L82 PathProgramCache]: Analyzing trace with hash 480365265, now seen corresponding path program 1 times [2019-11-15 21:09:19,095 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:09:19,097 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003545687] [2019-11-15 21:09:19,097 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:09:19,097 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:09:19,097 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:09:19,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:09:19,151 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-15 21:09:19,151 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003545687] [2019-11-15 21:09:19,151 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:09:19,151 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:09:19,152 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768448684] [2019-11-15 21:09:19,152 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:09:19,159 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:09:19,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:09:19,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:09:19,160 INFO L87 Difference]: Start difference. First operand 171 states and 260 transitions. Second operand 4 states. [2019-11-15 21:09:19,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:09:19,520 INFO L93 Difference]: Finished difference Result 341 states and 522 transitions. [2019-11-15 21:09:19,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:09:19,520 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 73 [2019-11-15 21:09:19,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:09:19,522 INFO L225 Difference]: With dead ends: 341 [2019-11-15 21:09:19,522 INFO L226 Difference]: Without dead ends: 189 [2019-11-15 21:09:19,522 INFO L600 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-15 21:09:19,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-11-15 21:09:19,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 171. [2019-11-15 21:09:19,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2019-11-15 21:09:19,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 259 transitions. [2019-11-15 21:09:19,529 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 259 transitions. Word has length 73 [2019-11-15 21:09:19,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:09:19,530 INFO L462 AbstractCegarLoop]: Abstraction has 171 states and 259 transitions. [2019-11-15 21:09:19,530 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:09:19,530 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 259 transitions. [2019-11-15 21:09:19,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-11-15 21:09:19,531 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:09:19,532 INFO L380 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] [2019-11-15 21:09:19,532 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:09:19,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:09:19,532 INFO L82 PathProgramCache]: Analyzing trace with hash -840488047, now seen corresponding path program 1 times [2019-11-15 21:09:19,533 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:09:19,533 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121054362] [2019-11-15 21:09:19,533 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:09:19,533 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:09:19,533 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:09:19,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:09:19,600 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-15 21:09:19,604 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121054362] [2019-11-15 21:09:19,604 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:09:19,604 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:09:19,605 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490640210] [2019-11-15 21:09:19,605 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:09:19,605 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:09:19,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:09:19,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:09:19,606 INFO L87 Difference]: Start difference. First operand 171 states and 259 transitions. Second operand 4 states. [2019-11-15 21:09:19,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:09:19,969 INFO L93 Difference]: Finished difference Result 340 states and 519 transitions. [2019-11-15 21:09:19,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:09:19,970 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 73 [2019-11-15 21:09:19,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:09:19,971 INFO L225 Difference]: With dead ends: 340 [2019-11-15 21:09:19,971 INFO L226 Difference]: Without dead ends: 188 [2019-11-15 21:09:19,972 INFO L600 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-15 21:09:19,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2019-11-15 21:09:19,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 171. [2019-11-15 21:09:19,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2019-11-15 21:09:19,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 258 transitions. [2019-11-15 21:09:19,977 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 258 transitions. Word has length 73 [2019-11-15 21:09:19,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:09:19,977 INFO L462 AbstractCegarLoop]: Abstraction has 171 states and 258 transitions. [2019-11-15 21:09:19,977 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:09:19,977 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 258 transitions. [2019-11-15 21:09:19,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-11-15 21:09:19,978 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:09:19,978 INFO L380 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] [2019-11-15 21:09:19,978 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:09:19,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:09:19,979 INFO L82 PathProgramCache]: Analyzing trace with hash 295378248, now seen corresponding path program 1 times [2019-11-15 21:09:19,979 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:09:19,979 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553572964] [2019-11-15 21:09:19,979 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:09:19,979 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:09:19,979 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:09:19,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:09:20,018 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-15 21:09:20,018 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553572964] [2019-11-15 21:09:20,018 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:09:20,018 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:09:20,019 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303426195] [2019-11-15 21:09:20,019 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:09:20,019 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:09:20,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:09:20,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:09:20,020 INFO L87 Difference]: Start difference. First operand 171 states and 258 transitions. Second operand 4 states. [2019-11-15 21:09:20,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:09:20,315 INFO L93 Difference]: Finished difference Result 340 states and 517 transitions. [2019-11-15 21:09:20,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:09:20,315 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 73 [2019-11-15 21:09:20,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:09:20,317 INFO L225 Difference]: With dead ends: 340 [2019-11-15 21:09:20,317 INFO L226 Difference]: Without dead ends: 188 [2019-11-15 21:09:20,317 INFO L600 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-15 21:09:20,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2019-11-15 21:09:20,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 171. [2019-11-15 21:09:20,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2019-11-15 21:09:20,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 257 transitions. [2019-11-15 21:09:20,322 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 257 transitions. Word has length 73 [2019-11-15 21:09:20,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:09:20,323 INFO L462 AbstractCegarLoop]: Abstraction has 171 states and 257 transitions. [2019-11-15 21:09:20,323 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:09:20,323 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 257 transitions. [2019-11-15 21:09:20,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-11-15 21:09:20,327 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:09:20,327 INFO L380 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] [2019-11-15 21:09:20,328 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:09:20,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:09:20,328 INFO L82 PathProgramCache]: Analyzing trace with hash 114216109, now seen corresponding path program 1 times [2019-11-15 21:09:20,328 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:09:20,328 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298491193] [2019-11-15 21:09:20,329 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:09:20,329 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:09:20,329 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:09:20,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:09:20,370 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-15 21:09:20,370 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298491193] [2019-11-15 21:09:20,372 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:09:20,372 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:09:20,372 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61757339] [2019-11-15 21:09:20,372 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:09:20,373 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:09:20,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:09:20,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:09:20,373 INFO L87 Difference]: Start difference. First operand 171 states and 257 transitions. Second operand 4 states. [2019-11-15 21:09:20,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:09:20,686 INFO L93 Difference]: Finished difference Result 340 states and 515 transitions. [2019-11-15 21:09:20,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:09:20,686 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 74 [2019-11-15 21:09:20,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:09:20,687 INFO L225 Difference]: With dead ends: 340 [2019-11-15 21:09:20,687 INFO L226 Difference]: Without dead ends: 188 [2019-11-15 21:09:20,688 INFO L600 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-15 21:09:20,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2019-11-15 21:09:20,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 171. [2019-11-15 21:09:20,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2019-11-15 21:09:20,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 256 transitions. [2019-11-15 21:09:20,693 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 256 transitions. Word has length 74 [2019-11-15 21:09:20,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:09:20,693 INFO L462 AbstractCegarLoop]: Abstraction has 171 states and 256 transitions. [2019-11-15 21:09:20,693 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:09:20,693 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 256 transitions. [2019-11-15 21:09:20,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-11-15 21:09:20,694 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:09:20,694 INFO L380 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] [2019-11-15 21:09:20,694 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:09:20,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:09:20,694 INFO L82 PathProgramCache]: Analyzing trace with hash 1466355203, now seen corresponding path program 1 times [2019-11-15 21:09:20,695 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:09:20,695 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835310197] [2019-11-15 21:09:20,695 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:09:20,695 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:09:20,695 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:09:20,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:09:20,744 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-15 21:09:20,745 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835310197] [2019-11-15 21:09:20,745 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:09:20,745 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:09:20,745 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566748963] [2019-11-15 21:09:20,745 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:09:20,746 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:09:20,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:09:20,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:09:20,746 INFO L87 Difference]: Start difference. First operand 171 states and 256 transitions. Second operand 4 states. [2019-11-15 21:09:21,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:09:21,004 INFO L93 Difference]: Finished difference Result 340 states and 513 transitions. [2019-11-15 21:09:21,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:09:21,004 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2019-11-15 21:09:21,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:09:21,006 INFO L225 Difference]: With dead ends: 340 [2019-11-15 21:09:21,006 INFO L226 Difference]: Without dead ends: 188 [2019-11-15 21:09:21,006 INFO L600 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-15 21:09:21,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2019-11-15 21:09:21,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 171. [2019-11-15 21:09:21,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2019-11-15 21:09:21,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 255 transitions. [2019-11-15 21:09:21,011 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 255 transitions. Word has length 75 [2019-11-15 21:09:21,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:09:21,011 INFO L462 AbstractCegarLoop]: Abstraction has 171 states and 255 transitions. [2019-11-15 21:09:21,011 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:09:21,011 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 255 transitions. [2019-11-15 21:09:21,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-11-15 21:09:21,012 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:09:21,012 INFO L380 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] [2019-11-15 21:09:21,012 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:09:21,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:09:21,013 INFO L82 PathProgramCache]: Analyzing trace with hash -1188775032, now seen corresponding path program 1 times [2019-11-15 21:09:21,013 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:09:21,013 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647940836] [2019-11-15 21:09:21,013 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:09:21,013 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:09:21,013 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:09:21,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:09:21,062 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-15 21:09:21,062 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647940836] [2019-11-15 21:09:21,063 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:09:21,063 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:09:21,063 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290745] [2019-11-15 21:09:21,063 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:09:21,063 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:09:21,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:09:21,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:09:21,064 INFO L87 Difference]: Start difference. First operand 171 states and 255 transitions. Second operand 4 states. [2019-11-15 21:09:21,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:09:21,340 INFO L93 Difference]: Finished difference Result 330 states and 498 transitions. [2019-11-15 21:09:21,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:09:21,340 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2019-11-15 21:09:21,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:09:21,342 INFO L225 Difference]: With dead ends: 330 [2019-11-15 21:09:21,342 INFO L226 Difference]: Without dead ends: 178 [2019-11-15 21:09:21,342 INFO L600 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-15 21:09:21,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2019-11-15 21:09:21,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 171. [2019-11-15 21:09:21,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2019-11-15 21:09:21,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 254 transitions. [2019-11-15 21:09:21,347 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 254 transitions. Word has length 76 [2019-11-15 21:09:21,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:09:21,347 INFO L462 AbstractCegarLoop]: Abstraction has 171 states and 254 transitions. [2019-11-15 21:09:21,347 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:09:21,347 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 254 transitions. [2019-11-15 21:09:21,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-11-15 21:09:21,348 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:09:21,348 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:09:21,348 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:09:21,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:09:21,349 INFO L82 PathProgramCache]: Analyzing trace with hash 328017922, now seen corresponding path program 1 times [2019-11-15 21:09:21,349 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:09:21,349 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109422845] [2019-11-15 21:09:21,349 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:09:21,349 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:09:21,349 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:09:21,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:09:21,410 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-15 21:09:21,410 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109422845] [2019-11-15 21:09:21,410 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:09:21,410 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:09:21,410 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924145845] [2019-11-15 21:09:21,411 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:09:21,411 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:09:21,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:09:21,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:09:21,412 INFO L87 Difference]: Start difference. First operand 171 states and 254 transitions. Second operand 4 states. [2019-11-15 21:09:21,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:09:21,856 INFO L93 Difference]: Finished difference Result 433 states and 657 transitions. [2019-11-15 21:09:21,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:09:21,857 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2019-11-15 21:09:21,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:09:21,859 INFO L225 Difference]: With dead ends: 433 [2019-11-15 21:09:21,859 INFO L226 Difference]: Without dead ends: 281 [2019-11-15 21:09:21,859 INFO L600 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-15 21:09:21,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2019-11-15 21:09:21,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 212. [2019-11-15 21:09:21,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2019-11-15 21:09:21,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 328 transitions. [2019-11-15 21:09:21,866 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 328 transitions. Word has length 81 [2019-11-15 21:09:21,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:09:21,866 INFO L462 AbstractCegarLoop]: Abstraction has 212 states and 328 transitions. [2019-11-15 21:09:21,866 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:09:21,866 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 328 transitions. [2019-11-15 21:09:21,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-11-15 21:09:21,867 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:09:21,867 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:09:21,867 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:09:21,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:09:21,868 INFO L82 PathProgramCache]: Analyzing trace with hash -1043789376, now seen corresponding path program 1 times [2019-11-15 21:09:21,868 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:09:21,868 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017592419] [2019-11-15 21:09:21,868 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:09:21,869 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:09:21,869 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:09:21,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:09:21,968 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-15 21:09:21,969 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017592419] [2019-11-15 21:09:21,969 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:09:21,970 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:09:21,970 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107531322] [2019-11-15 21:09:21,970 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:09:21,970 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:09:21,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:09:21,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:09:21,971 INFO L87 Difference]: Start difference. First operand 212 states and 328 transitions. Second operand 4 states. [2019-11-15 21:09:22,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:09:22,360 INFO L93 Difference]: Finished difference Result 455 states and 711 transitions. [2019-11-15 21:09:22,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:09:22,360 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2019-11-15 21:09:22,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:09:22,362 INFO L225 Difference]: With dead ends: 455 [2019-11-15 21:09:22,363 INFO L226 Difference]: Without dead ends: 262 [2019-11-15 21:09:22,363 INFO L600 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-15 21:09:22,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2019-11-15 21:09:22,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 236. [2019-11-15 21:09:22,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2019-11-15 21:09:22,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 370 transitions. [2019-11-15 21:09:22,370 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 370 transitions. Word has length 81 [2019-11-15 21:09:22,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:09:22,370 INFO L462 AbstractCegarLoop]: Abstraction has 236 states and 370 transitions. [2019-11-15 21:09:22,370 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:09:22,370 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 370 transitions. [2019-11-15 21:09:22,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-11-15 21:09:22,371 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:09:22,372 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:09:22,372 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:09:22,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:09:22,372 INFO L82 PathProgramCache]: Analyzing trace with hash 1337426848, now seen corresponding path program 1 times [2019-11-15 21:09:22,373 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:09:22,373 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006717312] [2019-11-15 21:09:22,373 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:09:22,373 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:09:22,373 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:09:22,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:09:22,437 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-15 21:09:22,438 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006717312] [2019-11-15 21:09:22,438 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:09:22,438 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:09:22,438 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152735166] [2019-11-15 21:09:22,439 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:09:22,439 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:09:22,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:09:22,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:09:22,440 INFO L87 Difference]: Start difference. First operand 236 states and 370 transitions. Second operand 4 states. [2019-11-15 21:09:22,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:09:22,883 INFO L93 Difference]: Finished difference Result 515 states and 805 transitions. [2019-11-15 21:09:22,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:09:22,884 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 82 [2019-11-15 21:09:22,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:09:22,886 INFO L225 Difference]: With dead ends: 515 [2019-11-15 21:09:22,886 INFO L226 Difference]: Without dead ends: 298 [2019-11-15 21:09:22,886 INFO L600 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-15 21:09:22,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2019-11-15 21:09:22,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 237. [2019-11-15 21:09:22,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2019-11-15 21:09:22,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 371 transitions. [2019-11-15 21:09:22,894 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 371 transitions. Word has length 82 [2019-11-15 21:09:22,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:09:22,894 INFO L462 AbstractCegarLoop]: Abstraction has 237 states and 371 transitions. [2019-11-15 21:09:22,894 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:09:22,895 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 371 transitions. [2019-11-15 21:09:22,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-15 21:09:22,896 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:09:22,896 INFO L380 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] [2019-11-15 21:09:22,896 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:09:22,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:09:22,896 INFO L82 PathProgramCache]: Analyzing trace with hash 1823335168, now seen corresponding path program 1 times [2019-11-15 21:09:22,897 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:09:22,897 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841739357] [2019-11-15 21:09:22,897 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:09:22,897 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:09:22,897 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:09:22,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:09:22,964 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-15 21:09:22,965 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841739357] [2019-11-15 21:09:22,965 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:09:22,965 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:09:22,965 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193273271] [2019-11-15 21:09:22,966 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:09:22,966 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:09:22,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:09:22,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:09:22,966 INFO L87 Difference]: Start difference. First operand 237 states and 371 transitions. Second operand 4 states. [2019-11-15 21:09:23,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:09:23,402 INFO L93 Difference]: Finished difference Result 516 states and 805 transitions. [2019-11-15 21:09:23,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:09:23,405 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2019-11-15 21:09:23,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:09:23,406 INFO L225 Difference]: With dead ends: 516 [2019-11-15 21:09:23,407 INFO L226 Difference]: Without dead ends: 298 [2019-11-15 21:09:23,407 INFO L600 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-15 21:09:23,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2019-11-15 21:09:23,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 237. [2019-11-15 21:09:23,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2019-11-15 21:09:23,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 370 transitions. [2019-11-15 21:09:23,416 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 370 transitions. Word has length 94 [2019-11-15 21:09:23,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:09:23,416 INFO L462 AbstractCegarLoop]: Abstraction has 237 states and 370 transitions. [2019-11-15 21:09:23,416 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:09:23,416 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 370 transitions. [2019-11-15 21:09:23,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-15 21:09:23,418 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:09:23,418 INFO L380 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] [2019-11-15 21:09:23,418 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:09:23,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:09:23,418 INFO L82 PathProgramCache]: Analyzing trace with hash -2027731454, now seen corresponding path program 1 times [2019-11-15 21:09:23,419 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:09:23,419 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264032407] [2019-11-15 21:09:23,419 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:09:23,419 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:09:23,419 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:09:23,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:09:23,481 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-15 21:09:23,481 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264032407] [2019-11-15 21:09:23,481 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:09:23,481 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:09:23,482 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044875682] [2019-11-15 21:09:23,483 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:09:23,483 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:09:23,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:09:23,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:09:23,484 INFO L87 Difference]: Start difference. First operand 237 states and 370 transitions. Second operand 4 states. [2019-11-15 21:09:23,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:09:23,809 INFO L93 Difference]: Finished difference Result 481 states and 752 transitions. [2019-11-15 21:09:23,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:09:23,810 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2019-11-15 21:09:23,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:09:23,811 INFO L225 Difference]: With dead ends: 481 [2019-11-15 21:09:23,811 INFO L226 Difference]: Without dead ends: 263 [2019-11-15 21:09:23,812 INFO L600 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-15 21:09:23,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2019-11-15 21:09:23,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 237. [2019-11-15 21:09:23,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2019-11-15 21:09:23,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 369 transitions. [2019-11-15 21:09:23,818 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 369 transitions. Word has length 94 [2019-11-15 21:09:23,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:09:23,818 INFO L462 AbstractCegarLoop]: Abstraction has 237 states and 369 transitions. [2019-11-15 21:09:23,818 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:09:23,818 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 369 transitions. [2019-11-15 21:09:23,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-15 21:09:23,819 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:09:23,820 INFO L380 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] [2019-11-15 21:09:23,820 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:09:23,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:09:23,820 INFO L82 PathProgramCache]: Analyzing trace with hash 1773701170, now seen corresponding path program 1 times [2019-11-15 21:09:23,820 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:09:23,820 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883745640] [2019-11-15 21:09:23,820 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:09:23,821 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:09:23,821 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:09:23,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:09:23,883 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-15 21:09:23,883 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883745640] [2019-11-15 21:09:23,883 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:09:23,884 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:09:23,884 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913259301] [2019-11-15 21:09:23,884 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:09:23,884 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:09:23,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:09:23,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:09:23,885 INFO L87 Difference]: Start difference. First operand 237 states and 369 transitions. Second operand 4 states. [2019-11-15 21:09:24,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:09:24,344 INFO L93 Difference]: Finished difference Result 515 states and 800 transitions. [2019-11-15 21:09:24,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:09:24,345 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2019-11-15 21:09:24,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:09:24,347 INFO L225 Difference]: With dead ends: 515 [2019-11-15 21:09:24,347 INFO L226 Difference]: Without dead ends: 297 [2019-11-15 21:09:24,348 INFO L600 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-15 21:09:24,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2019-11-15 21:09:24,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 237. [2019-11-15 21:09:24,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2019-11-15 21:09:24,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 368 transitions. [2019-11-15 21:09:24,359 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 368 transitions. Word has length 95 [2019-11-15 21:09:24,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:09:24,360 INFO L462 AbstractCegarLoop]: Abstraction has 237 states and 368 transitions. [2019-11-15 21:09:24,360 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:09:24,360 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 368 transitions. [2019-11-15 21:09:24,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-15 21:09:24,361 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:09:24,361 INFO L380 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] [2019-11-15 21:09:24,362 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:09:24,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:09:24,362 INFO L82 PathProgramCache]: Analyzing trace with hash 911177383, now seen corresponding path program 1 times [2019-11-15 21:09:24,362 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:09:24,363 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569366967] [2019-11-15 21:09:24,363 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:09:24,363 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:09:24,363 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:09:24,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:09:24,441 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-15 21:09:24,441 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569366967] [2019-11-15 21:09:24,441 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:09:24,442 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:09:24,442 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059785176] [2019-11-15 21:09:24,442 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:09:24,442 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:09:24,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:09:24,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:09:24,443 INFO L87 Difference]: Start difference. First operand 237 states and 368 transitions. Second operand 4 states. [2019-11-15 21:09:24,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:09:24,913 INFO L93 Difference]: Finished difference Result 513 states and 796 transitions. [2019-11-15 21:09:24,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:09:24,914 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2019-11-15 21:09:24,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:09:24,915 INFO L225 Difference]: With dead ends: 513 [2019-11-15 21:09:24,915 INFO L226 Difference]: Without dead ends: 295 [2019-11-15 21:09:24,916 INFO L600 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-15 21:09:24,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2019-11-15 21:09:24,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 237. [2019-11-15 21:09:24,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2019-11-15 21:09:24,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 367 transitions. [2019-11-15 21:09:24,922 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 367 transitions. Word has length 95 [2019-11-15 21:09:24,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:09:24,922 INFO L462 AbstractCegarLoop]: Abstraction has 237 states and 367 transitions. [2019-11-15 21:09:24,922 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:09:24,922 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 367 transitions. [2019-11-15 21:09:24,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-15 21:09:24,923 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:09:24,923 INFO L380 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] [2019-11-15 21:09:24,924 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:09:24,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:09:24,924 INFO L82 PathProgramCache]: Analyzing trace with hash -409675929, now seen corresponding path program 1 times [2019-11-15 21:09:24,924 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:09:24,924 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115890021] [2019-11-15 21:09:24,924 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:09:24,924 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:09:24,924 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:09:24,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:09:24,985 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-15 21:09:24,985 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115890021] [2019-11-15 21:09:24,985 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:09:24,985 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:09:24,986 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050643446] [2019-11-15 21:09:24,986 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:09:24,986 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:09:24,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:09:24,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:09:24,987 INFO L87 Difference]: Start difference. First operand 237 states and 367 transitions. Second operand 4 states. [2019-11-15 21:09:25,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:09:25,347 INFO L93 Difference]: Finished difference Result 512 states and 793 transitions. [2019-11-15 21:09:25,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:09:25,348 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2019-11-15 21:09:25,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:09:25,349 INFO L225 Difference]: With dead ends: 512 [2019-11-15 21:09:25,350 INFO L226 Difference]: Without dead ends: 294 [2019-11-15 21:09:25,350 INFO L600 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-15 21:09:25,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2019-11-15 21:09:25,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 237. [2019-11-15 21:09:25,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2019-11-15 21:09:25,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 366 transitions. [2019-11-15 21:09:25,356 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 366 transitions. Word has length 95 [2019-11-15 21:09:25,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:09:25,357 INFO L462 AbstractCegarLoop]: Abstraction has 237 states and 366 transitions. [2019-11-15 21:09:25,357 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:09:25,357 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 366 transitions. [2019-11-15 21:09:25,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-15 21:09:25,358 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:09:25,358 INFO L380 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] [2019-11-15 21:09:25,358 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:09:25,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:09:25,359 INFO L82 PathProgramCache]: Analyzing trace with hash 726190366, now seen corresponding path program 1 times [2019-11-15 21:09:25,359 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:09:25,359 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294280717] [2019-11-15 21:09:25,359 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:09:25,359 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:09:25,360 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:09:25,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:09:25,437 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-15 21:09:25,437 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294280717] [2019-11-15 21:09:25,437 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:09:25,437 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 21:09:25,437 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739258920] [2019-11-15 21:09:25,438 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 21:09:25,438 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:09:25,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 21:09:25,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:09:25,438 INFO L87 Difference]: Start difference. First operand 237 states and 366 transitions. Second operand 5 states. [2019-11-15 21:09:25,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:09:25,912 INFO L93 Difference]: Finished difference Result 476 states and 740 transitions. [2019-11-15 21:09:25,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 21:09:25,912 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 95 [2019-11-15 21:09:25,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:09:25,914 INFO L225 Difference]: With dead ends: 476 [2019-11-15 21:09:25,914 INFO L226 Difference]: Without dead ends: 258 [2019-11-15 21:09:25,914 INFO L600 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-15 21:09:25,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2019-11-15 21:09:25,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 257. [2019-11-15 21:09:25,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2019-11-15 21:09:25,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 392 transitions. [2019-11-15 21:09:25,920 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 392 transitions. Word has length 95 [2019-11-15 21:09:25,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:09:25,920 INFO L462 AbstractCegarLoop]: Abstraction has 257 states and 392 transitions. [2019-11-15 21:09:25,920 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 21:09:25,920 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 392 transitions. [2019-11-15 21:09:25,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-15 21:09:25,921 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:09:25,922 INFO L380 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] [2019-11-15 21:09:25,922 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:09:25,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:09:25,922 INFO L82 PathProgramCache]: Analyzing trace with hash 1787196389, now seen corresponding path program 1 times [2019-11-15 21:09:25,922 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:09:25,923 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310991301] [2019-11-15 21:09:25,923 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:09:25,923 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:09:25,923 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:09:25,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:09:25,998 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-15 21:09:25,998 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310991301] [2019-11-15 21:09:25,998 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:09:25,998 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:09:25,999 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373486134] [2019-11-15 21:09:25,999 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:09:25,999 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:09:25,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:09:26,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:09:26,000 INFO L87 Difference]: Start difference. First operand 257 states and 392 transitions. Second operand 4 states. [2019-11-15 21:09:26,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:09:26,345 INFO L93 Difference]: Finished difference Result 518 states and 792 transitions. [2019-11-15 21:09:26,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:09:26,346 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2019-11-15 21:09:26,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:09:26,347 INFO L225 Difference]: With dead ends: 518 [2019-11-15 21:09:26,348 INFO L226 Difference]: Without dead ends: 280 [2019-11-15 21:09:26,348 INFO L600 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-15 21:09:26,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2019-11-15 21:09:26,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 257. [2019-11-15 21:09:26,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2019-11-15 21:09:26,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 391 transitions. [2019-11-15 21:09:26,355 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 391 transitions. Word has length 95 [2019-11-15 21:09:26,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:09:26,355 INFO L462 AbstractCegarLoop]: Abstraction has 257 states and 391 transitions. [2019-11-15 21:09:26,356 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:09:26,356 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 391 transitions. [2019-11-15 21:09:26,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-15 21:09:26,356 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:09:26,357 INFO L380 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] [2019-11-15 21:09:26,357 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:09:26,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:09:26,357 INFO L82 PathProgramCache]: Analyzing trace with hash 466343077, now seen corresponding path program 1 times [2019-11-15 21:09:26,357 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:09:26,358 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166291183] [2019-11-15 21:09:26,358 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:09:26,358 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:09:26,358 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:09:26,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:09:26,414 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-15 21:09:26,414 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166291183] [2019-11-15 21:09:26,414 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:09:26,414 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:09:26,415 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303004378] [2019-11-15 21:09:26,415 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:09:26,415 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:09:26,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:09:26,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:09:26,416 INFO L87 Difference]: Start difference. First operand 257 states and 391 transitions. Second operand 4 states. [2019-11-15 21:09:26,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:09:26,752 INFO L93 Difference]: Finished difference Result 517 states and 789 transitions. [2019-11-15 21:09:26,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:09:26,752 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2019-11-15 21:09:26,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:09:26,754 INFO L225 Difference]: With dead ends: 517 [2019-11-15 21:09:26,754 INFO L226 Difference]: Without dead ends: 279 [2019-11-15 21:09:26,755 INFO L600 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-15 21:09:26,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2019-11-15 21:09:26,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 257. [2019-11-15 21:09:26,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2019-11-15 21:09:26,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 390 transitions. [2019-11-15 21:09:26,763 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 390 transitions. Word has length 95 [2019-11-15 21:09:26,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:09:26,763 INFO L462 AbstractCegarLoop]: Abstraction has 257 states and 390 transitions. [2019-11-15 21:09:26,763 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:09:26,763 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 390 transitions. [2019-11-15 21:09:26,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-11-15 21:09:26,764 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:09:26,764 INFO L380 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] [2019-11-15 21:09:26,765 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:09:26,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:09:26,765 INFO L82 PathProgramCache]: Analyzing trace with hash -1195259004, now seen corresponding path program 1 times [2019-11-15 21:09:26,765 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:09:26,767 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858065749] [2019-11-15 21:09:26,767 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:09:26,767 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:09:26,767 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:09:26,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:09:26,817 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-15 21:09:26,820 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858065749] [2019-11-15 21:09:26,820 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:09:26,820 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:09:26,821 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965029989] [2019-11-15 21:09:26,821 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:09:26,821 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:09:26,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:09:26,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:09:26,822 INFO L87 Difference]: Start difference. First operand 257 states and 390 transitions. Second operand 4 states. [2019-11-15 21:09:27,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:09:27,293 INFO L93 Difference]: Finished difference Result 552 states and 838 transitions. [2019-11-15 21:09:27,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:09:27,294 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2019-11-15 21:09:27,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:09:27,296 INFO L225 Difference]: With dead ends: 552 [2019-11-15 21:09:27,296 INFO L226 Difference]: Without dead ends: 314 [2019-11-15 21:09:27,296 INFO L600 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-15 21:09:27,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2019-11-15 21:09:27,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 257. [2019-11-15 21:09:27,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2019-11-15 21:09:27,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 389 transitions. [2019-11-15 21:09:27,305 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 389 transitions. Word has length 96 [2019-11-15 21:09:27,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:09:27,305 INFO L462 AbstractCegarLoop]: Abstraction has 257 states and 389 transitions. [2019-11-15 21:09:27,305 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:09:27,305 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 389 transitions. [2019-11-15 21:09:27,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-11-15 21:09:27,306 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:09:27,306 INFO L380 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] [2019-11-15 21:09:27,307 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:09:27,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:09:27,307 INFO L82 PathProgramCache]: Analyzing trace with hash 191526406, now seen corresponding path program 1 times [2019-11-15 21:09:27,307 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:09:27,307 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318109123] [2019-11-15 21:09:27,308 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:09:27,308 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:09:27,308 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:09:27,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:09:27,359 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-15 21:09:27,360 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318109123] [2019-11-15 21:09:27,360 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:09:27,360 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:09:27,360 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929605760] [2019-11-15 21:09:27,361 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:09:27,361 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:09:27,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:09:27,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:09:27,361 INFO L87 Difference]: Start difference. First operand 257 states and 389 transitions. Second operand 4 states. [2019-11-15 21:09:27,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:09:27,728 INFO L93 Difference]: Finished difference Result 517 states and 785 transitions. [2019-11-15 21:09:27,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:09:27,729 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2019-11-15 21:09:27,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:09:27,730 INFO L225 Difference]: With dead ends: 517 [2019-11-15 21:09:27,730 INFO L226 Difference]: Without dead ends: 279 [2019-11-15 21:09:27,731 INFO L600 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-15 21:09:27,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2019-11-15 21:09:27,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 257. [2019-11-15 21:09:27,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2019-11-15 21:09:27,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 388 transitions. [2019-11-15 21:09:27,737 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 388 transitions. Word has length 96 [2019-11-15 21:09:27,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:09:27,737 INFO L462 AbstractCegarLoop]: Abstraction has 257 states and 388 transitions. [2019-11-15 21:09:27,737 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:09:27,737 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 388 transitions. [2019-11-15 21:09:27,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-11-15 21:09:27,738 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:09:27,738 INFO L380 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] [2019-11-15 21:09:27,740 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:09:27,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:09:27,740 INFO L82 PathProgramCache]: Analyzing trace with hash -1293006805, now seen corresponding path program 1 times [2019-11-15 21:09:27,740 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:09:27,740 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047733627] [2019-11-15 21:09:27,741 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:09:27,741 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:09:27,741 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:09:27,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:09:27,814 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-15 21:09:27,814 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047733627] [2019-11-15 21:09:27,815 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:09:27,815 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:09:27,815 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055761233] [2019-11-15 21:09:27,815 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:09:27,816 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:09:27,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:09:27,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:09:27,817 INFO L87 Difference]: Start difference. First operand 257 states and 388 transitions. Second operand 4 states. [2019-11-15 21:09:28,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:09:28,210 INFO L93 Difference]: Finished difference Result 552 states and 834 transitions. [2019-11-15 21:09:28,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:09:28,210 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-11-15 21:09:28,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:09:28,212 INFO L225 Difference]: With dead ends: 552 [2019-11-15 21:09:28,212 INFO L226 Difference]: Without dead ends: 314 [2019-11-15 21:09:28,212 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:09:28,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2019-11-15 21:09:28,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 257. [2019-11-15 21:09:28,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2019-11-15 21:09:28,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 387 transitions. [2019-11-15 21:09:28,219 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 387 transitions. Word has length 97 [2019-11-15 21:09:28,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:09:28,219 INFO L462 AbstractCegarLoop]: Abstraction has 257 states and 387 transitions. [2019-11-15 21:09:28,219 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:09:28,220 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 387 transitions. [2019-11-15 21:09:28,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-11-15 21:09:28,220 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:09:28,221 INFO L380 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] [2019-11-15 21:09:28,221 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:09:28,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:09:28,221 INFO L82 PathProgramCache]: Analyzing trace with hash -1252332055, now seen corresponding path program 1 times [2019-11-15 21:09:28,221 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:09:28,221 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403223434] [2019-11-15 21:09:28,221 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:09:28,221 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:09:28,222 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:09:28,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:09:28,285 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-15 21:09:28,285 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403223434] [2019-11-15 21:09:28,286 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:09:28,286 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:09:28,286 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77550542] [2019-11-15 21:09:28,286 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:09:28,287 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:09:28,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:09:28,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:09:28,287 INFO L87 Difference]: Start difference. First operand 257 states and 387 transitions. Second operand 4 states. [2019-11-15 21:09:28,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:09:28,536 INFO L93 Difference]: Finished difference Result 517 states and 781 transitions. [2019-11-15 21:09:28,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:09:28,536 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-11-15 21:09:28,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:09:28,538 INFO L225 Difference]: With dead ends: 517 [2019-11-15 21:09:28,538 INFO L226 Difference]: Without dead ends: 279 [2019-11-15 21:09:28,539 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:09:28,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2019-11-15 21:09:28,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 257. [2019-11-15 21:09:28,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2019-11-15 21:09:28,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 386 transitions. [2019-11-15 21:09:28,546 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 386 transitions. Word has length 97 [2019-11-15 21:09:28,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:09:28,546 INFO L462 AbstractCegarLoop]: Abstraction has 257 states and 386 transitions. [2019-11-15 21:09:28,546 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:09:28,546 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 386 transitions. [2019-11-15 21:09:28,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-15 21:09:28,547 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:09:28,547 INFO L380 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] [2019-11-15 21:09:28,548 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:09:28,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:09:28,548 INFO L82 PathProgramCache]: Analyzing trace with hash 1236541353, now seen corresponding path program 1 times [2019-11-15 21:09:28,548 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:09:28,548 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188089222] [2019-11-15 21:09:28,549 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:09:28,549 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:09:28,549 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:09:28,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:09:28,609 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-15 21:09:28,609 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188089222] [2019-11-15 21:09:28,609 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:09:28,609 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:09:28,609 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056557529] [2019-11-15 21:09:28,610 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:09:28,610 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:09:28,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:09:28,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:09:28,611 INFO L87 Difference]: Start difference. First operand 257 states and 386 transitions. Second operand 4 states. [2019-11-15 21:09:29,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:09:29,043 INFO L93 Difference]: Finished difference Result 552 states and 830 transitions. [2019-11-15 21:09:29,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:09:29,043 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-11-15 21:09:29,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:09:29,045 INFO L225 Difference]: With dead ends: 552 [2019-11-15 21:09:29,045 INFO L226 Difference]: Without dead ends: 314 [2019-11-15 21:09:29,045 INFO L600 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-15 21:09:29,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2019-11-15 21:09:29,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 257. [2019-11-15 21:09:29,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2019-11-15 21:09:29,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 385 transitions. [2019-11-15 21:09:29,053 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 385 transitions. Word has length 98 [2019-11-15 21:09:29,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:09:29,053 INFO L462 AbstractCegarLoop]: Abstraction has 257 states and 385 transitions. [2019-11-15 21:09:29,054 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:09:29,054 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 385 transitions. [2019-11-15 21:09:29,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-15 21:09:29,055 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:09:29,055 INFO L380 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] [2019-11-15 21:09:29,055 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:09:29,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:09:29,056 INFO L82 PathProgramCache]: Analyzing trace with hash -1797508693, now seen corresponding path program 1 times [2019-11-15 21:09:29,056 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:09:29,056 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534891415] [2019-11-15 21:09:29,056 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:09:29,056 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:09:29,056 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:09:29,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:09:29,112 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-15 21:09:29,112 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534891415] [2019-11-15 21:09:29,112 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:09:29,112 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:09:29,113 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192223578] [2019-11-15 21:09:29,113 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:09:29,113 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:09:29,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:09:29,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:09:29,114 INFO L87 Difference]: Start difference. First operand 257 states and 385 transitions. Second operand 4 states. [2019-11-15 21:09:29,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:09:29,364 INFO L93 Difference]: Finished difference Result 517 states and 777 transitions. [2019-11-15 21:09:29,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:09:29,364 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-11-15 21:09:29,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:09:29,365 INFO L225 Difference]: With dead ends: 517 [2019-11-15 21:09:29,366 INFO L226 Difference]: Without dead ends: 279 [2019-11-15 21:09:29,366 INFO L600 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-15 21:09:29,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2019-11-15 21:09:29,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 257. [2019-11-15 21:09:29,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2019-11-15 21:09:29,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 384 transitions. [2019-11-15 21:09:29,373 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 384 transitions. Word has length 98 [2019-11-15 21:09:29,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:09:29,374 INFO L462 AbstractCegarLoop]: Abstraction has 257 states and 384 transitions. [2019-11-15 21:09:29,374 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:09:29,374 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 384 transitions. [2019-11-15 21:09:29,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-15 21:09:29,375 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:09:29,375 INFO L380 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] [2019-11-15 21:09:29,375 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:09:29,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:09:29,375 INFO L82 PathProgramCache]: Analyzing trace with hash -687081680, now seen corresponding path program 1 times [2019-11-15 21:09:29,375 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:09:29,375 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133017333] [2019-11-15 21:09:29,376 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:09:29,376 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:09:29,376 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:09:29,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:09:29,439 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-15 21:09:29,439 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133017333] [2019-11-15 21:09:29,439 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:09:29,439 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:09:29,439 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717587006] [2019-11-15 21:09:29,440 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:09:29,440 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:09:29,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:09:29,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:09:29,441 INFO L87 Difference]: Start difference. First operand 257 states and 384 transitions. Second operand 4 states. [2019-11-15 21:09:29,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:09:29,735 INFO L93 Difference]: Finished difference Result 542 states and 814 transitions. [2019-11-15 21:09:29,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:09:29,736 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 99 [2019-11-15 21:09:29,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:09:29,737 INFO L225 Difference]: With dead ends: 542 [2019-11-15 21:09:29,737 INFO L226 Difference]: Without dead ends: 304 [2019-11-15 21:09:29,737 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:09:29,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2019-11-15 21:09:29,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 257. [2019-11-15 21:09:29,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2019-11-15 21:09:29,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 383 transitions. [2019-11-15 21:09:29,744 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 383 transitions. Word has length 99 [2019-11-15 21:09:29,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:09:29,745 INFO L462 AbstractCegarLoop]: Abstraction has 257 states and 383 transitions. [2019-11-15 21:09:29,745 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:09:29,745 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 383 transitions. [2019-11-15 21:09:29,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-15 21:09:29,746 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:09:29,746 INFO L380 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] [2019-11-15 21:09:29,746 INFO L410 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:09:29,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:09:29,747 INFO L82 PathProgramCache]: Analyzing trace with hash -253352594, now seen corresponding path program 1 times [2019-11-15 21:09:29,747 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:09:29,747 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855662908] [2019-11-15 21:09:29,747 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:09:29,747 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:09:29,748 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:09:29,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:09:29,825 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-15 21:09:29,825 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855662908] [2019-11-15 21:09:29,825 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:09:29,825 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:09:29,825 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470810163] [2019-11-15 21:09:29,826 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:09:29,827 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:09:29,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:09:29,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:09:29,828 INFO L87 Difference]: Start difference. First operand 257 states and 383 transitions. Second operand 4 states. [2019-11-15 21:09:30,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:09:30,029 INFO L93 Difference]: Finished difference Result 507 states and 761 transitions. [2019-11-15 21:09:30,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:09:30,029 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 99 [2019-11-15 21:09:30,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:09:30,030 INFO L225 Difference]: With dead ends: 507 [2019-11-15 21:09:30,030 INFO L226 Difference]: Without dead ends: 269 [2019-11-15 21:09:30,031 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:09:30,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2019-11-15 21:09:30,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 257. [2019-11-15 21:09:30,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2019-11-15 21:09:30,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 382 transitions. [2019-11-15 21:09:30,039 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 382 transitions. Word has length 99 [2019-11-15 21:09:30,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:09:30,040 INFO L462 AbstractCegarLoop]: Abstraction has 257 states and 382 transitions. [2019-11-15 21:09:30,040 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:09:30,040 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 382 transitions. [2019-11-15 21:09:30,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-11-15 21:09:30,041 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:09:30,041 INFO L380 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] [2019-11-15 21:09:30,041 INFO L410 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:09:30,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:09:30,042 INFO L82 PathProgramCache]: Analyzing trace with hash -401565846, now seen corresponding path program 1 times [2019-11-15 21:09:30,042 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:09:30,042 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311256617] [2019-11-15 21:09:30,042 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:09:30,042 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:09:30,042 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:09:30,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:09:30,121 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-15 21:09:30,121 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311256617] [2019-11-15 21:09:30,121 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:09:30,122 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:09:30,122 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286306345] [2019-11-15 21:09:30,122 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:09:30,122 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:09:30,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:09:30,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:09:30,123 INFO L87 Difference]: Start difference. First operand 257 states and 382 transitions. Second operand 4 states. [2019-11-15 21:09:30,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:09:30,554 INFO L93 Difference]: Finished difference Result 542 states and 810 transitions. [2019-11-15 21:09:30,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:09:30,554 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2019-11-15 21:09:30,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:09:30,556 INFO L225 Difference]: With dead ends: 542 [2019-11-15 21:09:30,556 INFO L226 Difference]: Without dead ends: 304 [2019-11-15 21:09:30,557 INFO L600 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-15 21:09:30,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2019-11-15 21:09:30,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 257. [2019-11-15 21:09:30,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2019-11-15 21:09:30,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 381 transitions. [2019-11-15 21:09:30,564 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 381 transitions. Word has length 103 [2019-11-15 21:09:30,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:09:30,564 INFO L462 AbstractCegarLoop]: Abstraction has 257 states and 381 transitions. [2019-11-15 21:09:30,564 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:09:30,565 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 381 transitions. [2019-11-15 21:09:30,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-11-15 21:09:30,566 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:09:30,566 INFO L380 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] [2019-11-15 21:09:30,566 INFO L410 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:09:30,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:09:30,567 INFO L82 PathProgramCache]: Analyzing trace with hash 277706408, now seen corresponding path program 1 times [2019-11-15 21:09:30,567 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:09:30,567 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871049334] [2019-11-15 21:09:30,567 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:09:30,568 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:09:30,568 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:09:30,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:09:30,628 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-15 21:09:30,629 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871049334] [2019-11-15 21:09:30,629 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:09:30,629 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:09:30,629 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966251671] [2019-11-15 21:09:30,629 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:09:30,630 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:09:30,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:09:30,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:09:30,630 INFO L87 Difference]: Start difference. First operand 257 states and 381 transitions. Second operand 3 states. [2019-11-15 21:09:30,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:09:30,700 INFO L93 Difference]: Finished difference Result 731 states and 1098 transitions. [2019-11-15 21:09:30,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:09:30,700 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 103 [2019-11-15 21:09:30,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:09:30,703 INFO L225 Difference]: With dead ends: 731 [2019-11-15 21:09:30,703 INFO L226 Difference]: Without dead ends: 493 [2019-11-15 21:09:30,703 INFO L600 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-15 21:09:30,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states. [2019-11-15 21:09:30,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 493. [2019-11-15 21:09:30,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 493 states. [2019-11-15 21:09:30,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 729 transitions. [2019-11-15 21:09:30,717 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 729 transitions. Word has length 103 [2019-11-15 21:09:30,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:09:30,717 INFO L462 AbstractCegarLoop]: Abstraction has 493 states and 729 transitions. [2019-11-15 21:09:30,717 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:09:30,717 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 729 transitions. [2019-11-15 21:09:30,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-11-15 21:09:30,720 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:09:30,720 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:09:30,720 INFO L410 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:09:30,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:09:30,721 INFO L82 PathProgramCache]: Analyzing trace with hash -980347234, now seen corresponding path program 1 times [2019-11-15 21:09:30,721 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:09:30,721 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422150026] [2019-11-15 21:09:30,721 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:09:30,721 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:09:30,721 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:09:30,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:09:30,773 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-15 21:09:30,773 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422150026] [2019-11-15 21:09:30,773 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:09:30,774 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:09:30,774 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803528379] [2019-11-15 21:09:30,775 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:09:30,776 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:09:30,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:09:30,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:09:30,776 INFO L87 Difference]: Start difference. First operand 493 states and 729 transitions. Second operand 3 states. [2019-11-15 21:09:30,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:09:30,846 INFO L93 Difference]: Finished difference Result 1203 states and 1794 transitions. [2019-11-15 21:09:30,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:09:30,847 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2019-11-15 21:09:30,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:09:30,851 INFO L225 Difference]: With dead ends: 1203 [2019-11-15 21:09:30,851 INFO L226 Difference]: Without dead ends: 729 [2019-11-15 21:09:30,852 INFO L600 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-15 21:09:30,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 729 states. [2019-11-15 21:09:30,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 729 to 729. [2019-11-15 21:09:30,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 729 states. [2019-11-15 21:09:30,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 729 states to 729 states and 1078 transitions. [2019-11-15 21:09:30,872 INFO L78 Accepts]: Start accepts. Automaton has 729 states and 1078 transitions. Word has length 105 [2019-11-15 21:09:30,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:09:30,872 INFO L462 AbstractCegarLoop]: Abstraction has 729 states and 1078 transitions. [2019-11-15 21:09:30,872 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:09:30,872 INFO L276 IsEmpty]: Start isEmpty. Operand 729 states and 1078 transitions. [2019-11-15 21:09:30,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-11-15 21:09:30,874 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:09:30,875 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:09:30,875 INFO L410 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:09:30,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:09:30,875 INFO L82 PathProgramCache]: Analyzing trace with hash 712583787, now seen corresponding path program 1 times [2019-11-15 21:09:30,875 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:09:30,875 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724800097] [2019-11-15 21:09:30,876 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:09:30,876 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:09:30,876 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:09:30,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:09:30,944 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-11-15 21:09:30,944 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724800097] [2019-11-15 21:09:30,944 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:09:30,944 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:09:30,945 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513616697] [2019-11-15 21:09:30,945 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:09:30,945 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:09:30,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:09:30,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:09:30,946 INFO L87 Difference]: Start difference. First operand 729 states and 1078 transitions. Second operand 4 states. [2019-11-15 21:09:31,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:09:31,379 INFO L93 Difference]: Finished difference Result 1628 states and 2428 transitions. [2019-11-15 21:09:31,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:09:31,380 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 134 [2019-11-15 21:09:31,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:09:31,384 INFO L225 Difference]: With dead ends: 1628 [2019-11-15 21:09:31,384 INFO L226 Difference]: Without dead ends: 918 [2019-11-15 21:09:31,385 INFO L600 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-15 21:09:31,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 918 states. [2019-11-15 21:09:31,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 918 to 813. [2019-11-15 21:09:31,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 813 states. [2019-11-15 21:09:31,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 813 states to 813 states and 1225 transitions. [2019-11-15 21:09:31,409 INFO L78 Accepts]: Start accepts. Automaton has 813 states and 1225 transitions. Word has length 134 [2019-11-15 21:09:31,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:09:31,409 INFO L462 AbstractCegarLoop]: Abstraction has 813 states and 1225 transitions. [2019-11-15 21:09:31,409 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:09:31,409 INFO L276 IsEmpty]: Start isEmpty. Operand 813 states and 1225 transitions. [2019-11-15 21:09:31,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-11-15 21:09:31,412 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:09:31,412 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:09:31,413 INFO L410 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:09:31,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:09:31,413 INFO L82 PathProgramCache]: Analyzing trace with hash 1422709559, now seen corresponding path program 1 times [2019-11-15 21:09:31,413 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:09:31,413 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636505735] [2019-11-15 21:09:31,414 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:09:31,414 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:09:31,414 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:09:31,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:09:31,496 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-11-15 21:09:31,496 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636505735] [2019-11-15 21:09:31,496 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:09:31,496 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:09:31,496 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124708813] [2019-11-15 21:09:31,497 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:09:31,497 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:09:31,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:09:31,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:09:31,498 INFO L87 Difference]: Start difference. First operand 813 states and 1225 transitions. Second operand 4 states. [2019-11-15 21:09:31,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:09:31,900 INFO L93 Difference]: Finished difference Result 1712 states and 2572 transitions. [2019-11-15 21:09:31,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:09:31,900 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 147 [2019-11-15 21:09:31,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:09:31,905 INFO L225 Difference]: With dead ends: 1712 [2019-11-15 21:09:31,905 INFO L226 Difference]: Without dead ends: 918 [2019-11-15 21:09:31,906 INFO L600 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-15 21:09:31,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 918 states. [2019-11-15 21:09:31,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 918 to 813. [2019-11-15 21:09:31,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 813 states. [2019-11-15 21:09:31,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 813 states to 813 states and 1222 transitions. [2019-11-15 21:09:31,929 INFO L78 Accepts]: Start accepts. Automaton has 813 states and 1222 transitions. Word has length 147 [2019-11-15 21:09:31,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:09:31,929 INFO L462 AbstractCegarLoop]: Abstraction has 813 states and 1222 transitions. [2019-11-15 21:09:31,929 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:09:31,930 INFO L276 IsEmpty]: Start isEmpty. Operand 813 states and 1222 transitions. [2019-11-15 21:09:31,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-11-15 21:09:31,932 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:09:31,933 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:09:31,933 INFO L410 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:09:31,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:09:31,934 INFO L82 PathProgramCache]: Analyzing trace with hash 1376685392, now seen corresponding path program 1 times [2019-11-15 21:09:31,934 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:09:31,934 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138847964] [2019-11-15 21:09:31,934 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:09:31,934 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:09:31,934 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:09:31,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:09:32,003 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-11-15 21:09:32,004 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138847964] [2019-11-15 21:09:32,005 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:09:32,005 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:09:32,005 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702329387] [2019-11-15 21:09:32,006 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:09:32,006 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:09:32,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:09:32,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:09:32,007 INFO L87 Difference]: Start difference. First operand 813 states and 1222 transitions. Second operand 4 states. [2019-11-15 21:09:32,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:09:32,431 INFO L93 Difference]: Finished difference Result 1706 states and 2560 transitions. [2019-11-15 21:09:32,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:09:32,432 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 148 [2019-11-15 21:09:32,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:09:32,437 INFO L225 Difference]: With dead ends: 1706 [2019-11-15 21:09:32,437 INFO L226 Difference]: Without dead ends: 912 [2019-11-15 21:09:32,439 INFO L600 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-15 21:09:32,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 912 states. [2019-11-15 21:09:32,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 912 to 813. [2019-11-15 21:09:32,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 813 states. [2019-11-15 21:09:32,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 813 states to 813 states and 1219 transitions. [2019-11-15 21:09:32,462 INFO L78 Accepts]: Start accepts. Automaton has 813 states and 1219 transitions. Word has length 148 [2019-11-15 21:09:32,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:09:32,462 INFO L462 AbstractCegarLoop]: Abstraction has 813 states and 1219 transitions. [2019-11-15 21:09:32,462 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:09:32,462 INFO L276 IsEmpty]: Start isEmpty. Operand 813 states and 1219 transitions. [2019-11-15 21:09:32,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-11-15 21:09:32,464 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:09:32,465 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:09:32,465 INFO L410 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:09:32,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:09:32,465 INFO L82 PathProgramCache]: Analyzing trace with hash 55832080, now seen corresponding path program 1 times [2019-11-15 21:09:32,466 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:09:32,466 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993319098] [2019-11-15 21:09:32,466 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:09:32,466 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:09:32,466 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:09:32,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:09:32,542 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-11-15 21:09:32,543 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993319098] [2019-11-15 21:09:32,543 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:09:32,543 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:09:32,543 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75278500] [2019-11-15 21:09:32,544 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:09:32,544 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:09:32,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:09:32,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:09:32,547 INFO L87 Difference]: Start difference. First operand 813 states and 1219 transitions. Second operand 4 states. [2019-11-15 21:09:32,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:09:32,993 INFO L93 Difference]: Finished difference Result 1703 states and 2551 transitions. [2019-11-15 21:09:32,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:09:32,994 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 148 [2019-11-15 21:09:32,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:09:32,998 INFO L225 Difference]: With dead ends: 1703 [2019-11-15 21:09:32,999 INFO L226 Difference]: Without dead ends: 909 [2019-11-15 21:09:33,000 INFO L600 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-15 21:09:33,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 909 states. [2019-11-15 21:09:33,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 909 to 813. [2019-11-15 21:09:33,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 813 states. [2019-11-15 21:09:33,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 813 states to 813 states and 1216 transitions. [2019-11-15 21:09:33,071 INFO L78 Accepts]: Start accepts. Automaton has 813 states and 1216 transitions. Word has length 148 [2019-11-15 21:09:33,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:09:33,071 INFO L462 AbstractCegarLoop]: Abstraction has 813 states and 1216 transitions. [2019-11-15 21:09:33,072 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:09:33,072 INFO L276 IsEmpty]: Start isEmpty. Operand 813 states and 1216 transitions. [2019-11-15 21:09:33,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-11-15 21:09:33,074 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:09:33,074 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:09:33,074 INFO L410 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:09:33,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:09:33,075 INFO L82 PathProgramCache]: Analyzing trace with hash 350587387, now seen corresponding path program 1 times [2019-11-15 21:09:33,075 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:09:33,075 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766244996] [2019-11-15 21:09:33,075 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:09:33,075 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:09:33,075 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:09:33,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:09:33,152 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-11-15 21:09:33,152 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766244996] [2019-11-15 21:09:33,153 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:09:33,153 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:09:33,153 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045017440] [2019-11-15 21:09:33,153 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:09:33,154 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:09:33,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:09:33,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:09:33,154 INFO L87 Difference]: Start difference. First operand 813 states and 1216 transitions. Second operand 4 states. [2019-11-15 21:09:33,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:09:33,500 INFO L93 Difference]: Finished difference Result 1703 states and 2545 transitions. [2019-11-15 21:09:33,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:09:33,500 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 149 [2019-11-15 21:09:33,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:09:33,505 INFO L225 Difference]: With dead ends: 1703 [2019-11-15 21:09:33,505 INFO L226 Difference]: Without dead ends: 909 [2019-11-15 21:09:33,507 INFO L600 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-15 21:09:33,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 909 states. [2019-11-15 21:09:33,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 909 to 813. [2019-11-15 21:09:33,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 813 states. [2019-11-15 21:09:33,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 813 states to 813 states and 1213 transitions. [2019-11-15 21:09:33,528 INFO L78 Accepts]: Start accepts. Automaton has 813 states and 1213 transitions. Word has length 149 [2019-11-15 21:09:33,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:09:33,529 INFO L462 AbstractCegarLoop]: Abstraction has 813 states and 1213 transitions. [2019-11-15 21:09:33,529 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:09:33,529 INFO L276 IsEmpty]: Start isEmpty. Operand 813 states and 1213 transitions. [2019-11-15 21:09:33,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-11-15 21:09:33,531 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:09:33,531 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:09:33,532 INFO L410 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:09:33,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:09:33,532 INFO L82 PathProgramCache]: Analyzing trace with hash -616408940, now seen corresponding path program 1 times [2019-11-15 21:09:33,532 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:09:33,532 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434371190] [2019-11-15 21:09:33,532 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:09:33,533 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:09:33,533 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:09:33,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:09:33,603 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-11-15 21:09:33,603 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434371190] [2019-11-15 21:09:33,604 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:09:33,604 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:09:33,604 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137507243] [2019-11-15 21:09:33,604 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:09:33,604 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:09:33,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:09:33,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:09:33,605 INFO L87 Difference]: Start difference. First operand 813 states and 1213 transitions. Second operand 4 states. [2019-11-15 21:09:33,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:09:33,905 INFO L93 Difference]: Finished difference Result 1703 states and 2539 transitions. [2019-11-15 21:09:33,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:09:33,906 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 150 [2019-11-15 21:09:33,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:09:33,911 INFO L225 Difference]: With dead ends: 1703 [2019-11-15 21:09:33,911 INFO L226 Difference]: Without dead ends: 909 [2019-11-15 21:09:33,912 INFO L600 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-15 21:09:33,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 909 states. [2019-11-15 21:09:33,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 909 to 813. [2019-11-15 21:09:33,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 813 states. [2019-11-15 21:09:33,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 813 states to 813 states and 1210 transitions. [2019-11-15 21:09:33,933 INFO L78 Accepts]: Start accepts. Automaton has 813 states and 1210 transitions. Word has length 150 [2019-11-15 21:09:33,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:09:33,933 INFO L462 AbstractCegarLoop]: Abstraction has 813 states and 1210 transitions. [2019-11-15 21:09:33,933 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:09:33,933 INFO L276 IsEmpty]: Start isEmpty. Operand 813 states and 1210 transitions. [2019-11-15 21:09:33,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-11-15 21:09:33,935 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:09:33,936 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:09:33,936 INFO L410 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:09:33,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:09:33,936 INFO L82 PathProgramCache]: Analyzing trace with hash 736238688, now seen corresponding path program 1 times [2019-11-15 21:09:33,937 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:09:33,937 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109485344] [2019-11-15 21:09:33,937 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:09:33,937 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:09:33,937 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:09:33,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:09:34,013 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-11-15 21:09:34,013 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109485344] [2019-11-15 21:09:34,013 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:09:34,014 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:09:34,014 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685840109] [2019-11-15 21:09:34,014 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:09:34,014 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:09:34,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:09:34,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:09:34,015 INFO L87 Difference]: Start difference. First operand 813 states and 1210 transitions. Second operand 4 states. [2019-11-15 21:09:34,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:09:34,373 INFO L93 Difference]: Finished difference Result 1703 states and 2533 transitions. [2019-11-15 21:09:34,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:09:34,376 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 151 [2019-11-15 21:09:34,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:09:34,380 INFO L225 Difference]: With dead ends: 1703 [2019-11-15 21:09:34,381 INFO L226 Difference]: Without dead ends: 909 [2019-11-15 21:09:34,382 INFO L600 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-15 21:09:34,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 909 states. [2019-11-15 21:09:34,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 909 to 813. [2019-11-15 21:09:34,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 813 states. [2019-11-15 21:09:34,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 813 states to 813 states and 1207 transitions. [2019-11-15 21:09:34,402 INFO L78 Accepts]: Start accepts. Automaton has 813 states and 1207 transitions. Word has length 151 [2019-11-15 21:09:34,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:09:34,403 INFO L462 AbstractCegarLoop]: Abstraction has 813 states and 1207 transitions. [2019-11-15 21:09:34,403 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:09:34,403 INFO L276 IsEmpty]: Start isEmpty. Operand 813 states and 1207 transitions. [2019-11-15 21:09:34,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-11-15 21:09:34,405 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:09:34,405 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:09:34,405 INFO L410 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:09:34,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:09:34,406 INFO L82 PathProgramCache]: Analyzing trace with hash 983404889, now seen corresponding path program 1 times [2019-11-15 21:09:34,406 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:09:34,406 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750535734] [2019-11-15 21:09:34,406 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:09:34,406 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:09:34,407 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:09:34,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:09:34,476 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-11-15 21:09:34,476 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750535734] [2019-11-15 21:09:34,477 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:09:34,477 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:09:34,477 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327549295] [2019-11-15 21:09:34,477 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:09:34,478 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:09:34,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:09:34,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:09:34,478 INFO L87 Difference]: Start difference. First operand 813 states and 1207 transitions. Second operand 4 states. [2019-11-15 21:09:34,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:09:34,843 INFO L93 Difference]: Finished difference Result 1673 states and 2491 transitions. [2019-11-15 21:09:34,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:09:34,844 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 152 [2019-11-15 21:09:34,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:09:34,848 INFO L225 Difference]: With dead ends: 1673 [2019-11-15 21:09:34,848 INFO L226 Difference]: Without dead ends: 879 [2019-11-15 21:09:34,850 INFO L600 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-15 21:09:34,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 879 states. [2019-11-15 21:09:34,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 879 to 813. [2019-11-15 21:09:34,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 813 states. [2019-11-15 21:09:34,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 813 states to 813 states and 1204 transitions. [2019-11-15 21:09:34,871 INFO L78 Accepts]: Start accepts. Automaton has 813 states and 1204 transitions. Word has length 152 [2019-11-15 21:09:34,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:09:34,871 INFO L462 AbstractCegarLoop]: Abstraction has 813 states and 1204 transitions. [2019-11-15 21:09:34,871 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:09:34,872 INFO L276 IsEmpty]: Start isEmpty. Operand 813 states and 1204 transitions. [2019-11-15 21:09:34,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-11-15 21:09:34,874 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:09:34,874 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 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-15 21:09:34,874 INFO L410 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:09:34,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:09:34,874 INFO L82 PathProgramCache]: Analyzing trace with hash -1752763117, now seen corresponding path program 1 times [2019-11-15 21:09:34,875 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:09:34,875 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89343029] [2019-11-15 21:09:34,875 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:09:34,875 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:09:34,876 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:09:34,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:09:34,952 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 156 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-11-15 21:09:34,952 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89343029] [2019-11-15 21:09:34,952 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:09:34,953 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:09:34,953 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102914796] [2019-11-15 21:09:34,953 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:09:34,953 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:09:34,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:09:34,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:09:34,954 INFO L87 Difference]: Start difference. First operand 813 states and 1204 transitions. Second operand 4 states. [2019-11-15 21:09:35,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:09:35,342 INFO L93 Difference]: Finished difference Result 1673 states and 2485 transitions. [2019-11-15 21:09:35,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:09:35,343 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 156 [2019-11-15 21:09:35,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:09:35,347 INFO L225 Difference]: With dead ends: 1673 [2019-11-15 21:09:35,347 INFO L226 Difference]: Without dead ends: 879 [2019-11-15 21:09:35,349 INFO L600 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-15 21:09:35,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 879 states. [2019-11-15 21:09:35,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 879 to 813. [2019-11-15 21:09:35,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 813 states. [2019-11-15 21:09:35,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 813 states to 813 states and 1201 transitions. [2019-11-15 21:09:35,369 INFO L78 Accepts]: Start accepts. Automaton has 813 states and 1201 transitions. Word has length 156 [2019-11-15 21:09:35,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:09:35,370 INFO L462 AbstractCegarLoop]: Abstraction has 813 states and 1201 transitions. [2019-11-15 21:09:35,370 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:09:35,370 INFO L276 IsEmpty]: Start isEmpty. Operand 813 states and 1201 transitions. [2019-11-15 21:09:35,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-11-15 21:09:35,372 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:09:35,372 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:09:35,372 INFO L410 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:09:35,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:09:35,373 INFO L82 PathProgramCache]: Analyzing trace with hash -1490860902, now seen corresponding path program 1 times [2019-11-15 21:09:35,373 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:09:35,373 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205288610] [2019-11-15 21:09:35,373 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:09:35,373 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:09:35,374 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:09:35,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:09:35,456 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 158 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-11-15 21:09:35,457 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205288610] [2019-11-15 21:09:35,457 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:09:35,457 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:09:35,457 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223721015] [2019-11-15 21:09:35,458 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:09:35,458 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:09:35,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:09:35,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:09:35,459 INFO L87 Difference]: Start difference. First operand 813 states and 1201 transitions. Second operand 4 states. [2019-11-15 21:09:35,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:09:35,916 INFO L93 Difference]: Finished difference Result 1658 states and 2458 transitions. [2019-11-15 21:09:35,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:09:35,920 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 157 [2019-11-15 21:09:35,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:09:35,923 INFO L225 Difference]: With dead ends: 1658 [2019-11-15 21:09:35,923 INFO L226 Difference]: Without dead ends: 864 [2019-11-15 21:09:35,924 INFO L600 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-15 21:09:35,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 864 states. [2019-11-15 21:09:35,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 864 to 813. [2019-11-15 21:09:35,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 813 states. [2019-11-15 21:09:35,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 813 states to 813 states and 1198 transitions. [2019-11-15 21:09:35,943 INFO L78 Accepts]: Start accepts. Automaton has 813 states and 1198 transitions. Word has length 157 [2019-11-15 21:09:35,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:09:35,944 INFO L462 AbstractCegarLoop]: Abstraction has 813 states and 1198 transitions. [2019-11-15 21:09:35,944 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:09:35,944 INFO L276 IsEmpty]: Start isEmpty. Operand 813 states and 1198 transitions. [2019-11-15 21:09:35,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-11-15 21:09:35,946 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:09:35,946 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:09:35,947 INFO L410 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:09:35,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:09:35,947 INFO L82 PathProgramCache]: Analyzing trace with hash 870486010, now seen corresponding path program 1 times [2019-11-15 21:09:35,947 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:09:35,947 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004183165] [2019-11-15 21:09:35,948 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:09:35,948 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:09:35,948 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:09:35,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:09:36,027 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-11-15 21:09:36,027 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004183165] [2019-11-15 21:09:36,028 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:09:36,028 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:09:36,028 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722394851] [2019-11-15 21:09:36,028 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:09:36,028 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:09:36,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:09:36,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:09:36,029 INFO L87 Difference]: Start difference. First operand 813 states and 1198 transitions. Second operand 4 states. [2019-11-15 21:09:36,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:09:36,473 INFO L93 Difference]: Finished difference Result 1808 states and 2686 transitions. [2019-11-15 21:09:36,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:09:36,473 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 159 [2019-11-15 21:09:36,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:09:36,478 INFO L225 Difference]: With dead ends: 1808 [2019-11-15 21:09:36,479 INFO L226 Difference]: Without dead ends: 1014 [2019-11-15 21:09:36,480 INFO L600 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-15 21:09:36,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1014 states. [2019-11-15 21:09:36,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1014 to 903. [2019-11-15 21:09:36,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 903 states. [2019-11-15 21:09:36,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 903 states to 903 states and 1357 transitions. [2019-11-15 21:09:36,502 INFO L78 Accepts]: Start accepts. Automaton has 903 states and 1357 transitions. Word has length 159 [2019-11-15 21:09:36,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:09:36,502 INFO L462 AbstractCegarLoop]: Abstraction has 903 states and 1357 transitions. [2019-11-15 21:09:36,502 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:09:36,502 INFO L276 IsEmpty]: Start isEmpty. Operand 903 states and 1357 transitions. [2019-11-15 21:09:36,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-11-15 21:09:36,505 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:09:36,505 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:09:36,505 INFO L410 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:09:36,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:09:36,506 INFO L82 PathProgramCache]: Analyzing trace with hash 402001855, now seen corresponding path program 1 times [2019-11-15 21:09:36,506 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:09:36,506 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665478449] [2019-11-15 21:09:36,506 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:09:36,506 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:09:36,506 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:09:36,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:09:36,582 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-11-15 21:09:36,583 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665478449] [2019-11-15 21:09:36,583 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:09:36,583 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:09:36,583 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341728345] [2019-11-15 21:09:36,583 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:09:36,584 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:09:36,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:09:36,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:09:36,584 INFO L87 Difference]: Start difference. First operand 903 states and 1357 transitions. Second operand 3 states. [2019-11-15 21:09:36,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:09:36,645 INFO L93 Difference]: Finished difference Result 2081 states and 3143 transitions. [2019-11-15 21:09:36,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:09:36,645 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 165 [2019-11-15 21:09:36,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:09:36,649 INFO L225 Difference]: With dead ends: 2081 [2019-11-15 21:09:36,650 INFO L226 Difference]: Without dead ends: 1197 [2019-11-15 21:09:36,650 INFO L600 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-15 21:09:36,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1197 states. [2019-11-15 21:09:36,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1197 to 1197. [2019-11-15 21:09:36,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1197 states. [2019-11-15 21:09:36,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1197 states to 1197 states and 1801 transitions. [2019-11-15 21:09:36,673 INFO L78 Accepts]: Start accepts. Automaton has 1197 states and 1801 transitions. Word has length 165 [2019-11-15 21:09:36,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:09:36,674 INFO L462 AbstractCegarLoop]: Abstraction has 1197 states and 1801 transitions. [2019-11-15 21:09:36,674 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:09:36,674 INFO L276 IsEmpty]: Start isEmpty. Operand 1197 states and 1801 transitions. [2019-11-15 21:09:36,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-11-15 21:09:36,677 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:09:36,677 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 4, 4, 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] [2019-11-15 21:09:36,677 INFO L410 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:09:36,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:09:36,678 INFO L82 PathProgramCache]: Analyzing trace with hash 1332197165, now seen corresponding path program 1 times [2019-11-15 21:09:36,678 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:09:36,678 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367043018] [2019-11-15 21:09:36,678 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:09:36,679 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:09:36,679 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:09:36,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:09:36,762 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 237 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2019-11-15 21:09:36,762 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367043018] [2019-11-15 21:09:36,763 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:09:36,763 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:09:36,763 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128189890] [2019-11-15 21:09:36,763 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:09:36,764 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:09:36,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:09:36,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:09:36,764 INFO L87 Difference]: Start difference. First operand 1197 states and 1801 transitions. Second operand 4 states. [2019-11-15 21:09:37,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:09:37,047 INFO L93 Difference]: Finished difference Result 2443 states and 3684 transitions. [2019-11-15 21:09:37,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:09:37,047 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 188 [2019-11-15 21:09:37,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:09:37,052 INFO L225 Difference]: With dead ends: 2443 [2019-11-15 21:09:37,052 INFO L226 Difference]: Without dead ends: 1265 [2019-11-15 21:09:37,053 INFO L600 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-15 21:09:37,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1265 states. [2019-11-15 21:09:37,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1265 to 1197. [2019-11-15 21:09:37,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1197 states. [2019-11-15 21:09:37,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1197 states to 1197 states and 1797 transitions. [2019-11-15 21:09:37,077 INFO L78 Accepts]: Start accepts. Automaton has 1197 states and 1797 transitions. Word has length 188 [2019-11-15 21:09:37,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:09:37,078 INFO L462 AbstractCegarLoop]: Abstraction has 1197 states and 1797 transitions. [2019-11-15 21:09:37,078 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:09:37,078 INFO L276 IsEmpty]: Start isEmpty. Operand 1197 states and 1797 transitions. [2019-11-15 21:09:37,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-11-15 21:09:37,083 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:09:37,083 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 4, 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-15 21:09:37,083 INFO L410 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:09:37,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:09:37,084 INFO L82 PathProgramCache]: Analyzing trace with hash 1479571284, now seen corresponding path program 1 times [2019-11-15 21:09:37,084 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:09:37,084 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647989110] [2019-11-15 21:09:37,084 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:09:37,084 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:09:37,084 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:09:37,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:09:37,166 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 241 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2019-11-15 21:09:37,167 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647989110] [2019-11-15 21:09:37,167 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:09:37,167 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:09:37,167 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960250386] [2019-11-15 21:09:37,168 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:09:37,168 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:09:37,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:09:37,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:09:37,169 INFO L87 Difference]: Start difference. First operand 1197 states and 1797 transitions. Second operand 4 states. [2019-11-15 21:09:37,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:09:37,450 INFO L93 Difference]: Finished difference Result 2427 states and 3652 transitions. [2019-11-15 21:09:37,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:09:37,450 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 189 [2019-11-15 21:09:37,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:09:37,454 INFO L225 Difference]: With dead ends: 2427 [2019-11-15 21:09:37,455 INFO L226 Difference]: Without dead ends: 1249 [2019-11-15 21:09:37,456 INFO L600 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-15 21:09:37,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1249 states. [2019-11-15 21:09:37,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1249 to 1197. [2019-11-15 21:09:37,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1197 states. [2019-11-15 21:09:37,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1197 states to 1197 states and 1793 transitions. [2019-11-15 21:09:37,477 INFO L78 Accepts]: Start accepts. Automaton has 1197 states and 1793 transitions. Word has length 189 [2019-11-15 21:09:37,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:09:37,478 INFO L462 AbstractCegarLoop]: Abstraction has 1197 states and 1793 transitions. [2019-11-15 21:09:37,478 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:09:37,478 INFO L276 IsEmpty]: Start isEmpty. Operand 1197 states and 1793 transitions. [2019-11-15 21:09:37,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2019-11-15 21:09:37,483 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:09:37,483 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:09:37,483 INFO L410 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:09:37,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:09:37,484 INFO L82 PathProgramCache]: Analyzing trace with hash -1805622995, now seen corresponding path program 1 times [2019-11-15 21:09:37,484 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:09:37,484 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820866063] [2019-11-15 21:09:37,484 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:09:37,484 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:09:37,484 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:09:37,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:09:37,577 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2019-11-15 21:09:37,577 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820866063] [2019-11-15 21:09:37,578 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:09:37,578 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:09:37,578 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545785399] [2019-11-15 21:09:37,578 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:09:37,578 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:09:37,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:09:37,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:09:37,579 INFO L87 Difference]: Start difference. First operand 1197 states and 1793 transitions. Second operand 3 states. [2019-11-15 21:09:37,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:09:37,713 INFO L93 Difference]: Finished difference Result 2669 states and 4013 transitions. [2019-11-15 21:09:37,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:09:37,714 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 197 [2019-11-15 21:09:37,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:09:37,724 INFO L225 Difference]: With dead ends: 2669 [2019-11-15 21:09:37,725 INFO L226 Difference]: Without dead ends: 1491 [2019-11-15 21:09:37,730 INFO L600 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-15 21:09:37,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1491 states. [2019-11-15 21:09:37,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1491 to 1491. [2019-11-15 21:09:37,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1491 states. [2019-11-15 21:09:37,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1491 states to 1491 states and 2236 transitions. [2019-11-15 21:09:37,765 INFO L78 Accepts]: Start accepts. Automaton has 1491 states and 2236 transitions. Word has length 197 [2019-11-15 21:09:37,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:09:37,765 INFO L462 AbstractCegarLoop]: Abstraction has 1491 states and 2236 transitions. [2019-11-15 21:09:37,765 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:09:37,765 INFO L276 IsEmpty]: Start isEmpty. Operand 1491 states and 2236 transitions. [2019-11-15 21:09:37,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2019-11-15 21:09:37,767 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:09:37,767 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:09:37,767 INFO L410 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:09:37,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:09:37,768 INFO L82 PathProgramCache]: Analyzing trace with hash -1322460169, now seen corresponding path program 1 times [2019-11-15 21:09:37,768 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:09:37,768 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613104532] [2019-11-15 21:09:37,768 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:09:37,768 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:09:37,768 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:09:37,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:09:37,894 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2019-11-15 21:09:37,894 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613104532] [2019-11-15 21:09:37,894 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:09:37,895 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:09:37,895 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020227328] [2019-11-15 21:09:37,895 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:09:37,895 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:09:37,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:09:37,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:09:37,896 INFO L87 Difference]: Start difference. First operand 1491 states and 2236 transitions. Second operand 3 states. [2019-11-15 21:09:37,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:09:37,986 INFO L93 Difference]: Finished difference Result 3257 states and 4899 transitions. [2019-11-15 21:09:37,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:09:37,987 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 199 [2019-11-15 21:09:37,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:09:37,992 INFO L225 Difference]: With dead ends: 3257 [2019-11-15 21:09:37,992 INFO L226 Difference]: Without dead ends: 1785 [2019-11-15 21:09:37,994 INFO L600 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-15 21:09:37,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1785 states. [2019-11-15 21:09:38,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1785 to 1785. [2019-11-15 21:09:38,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1785 states. [2019-11-15 21:09:38,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1785 states to 1785 states and 2680 transitions. [2019-11-15 21:09:38,024 INFO L78 Accepts]: Start accepts. Automaton has 1785 states and 2680 transitions. Word has length 199 [2019-11-15 21:09:38,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:09:38,025 INFO L462 AbstractCegarLoop]: Abstraction has 1785 states and 2680 transitions. [2019-11-15 21:09:38,025 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:09:38,025 INFO L276 IsEmpty]: Start isEmpty. Operand 1785 states and 2680 transitions. [2019-11-15 21:09:38,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-11-15 21:09:38,027 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:09:38,028 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:09:38,028 INFO L410 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:09:38,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:09:38,028 INFO L82 PathProgramCache]: Analyzing trace with hash -1509594081, now seen corresponding path program 1 times [2019-11-15 21:09:38,029 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:09:38,029 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162794077] [2019-11-15 21:09:38,029 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:09:38,029 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:09:38,029 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:09:38,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:09:38,137 INFO L134 CoverageAnalysis]: Checked inductivity of 513 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2019-11-15 21:09:38,138 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162794077] [2019-11-15 21:09:38,138 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:09:38,138 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:09:38,138 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334569701] [2019-11-15 21:09:38,139 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:09:38,139 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:09:38,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:09:38,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:09:38,139 INFO L87 Difference]: Start difference. First operand 1785 states and 2680 transitions. Second operand 3 states. [2019-11-15 21:09:38,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:09:38,230 INFO L93 Difference]: Finished difference Result 3845 states and 5787 transitions. [2019-11-15 21:09:38,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:09:38,231 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 232 [2019-11-15 21:09:38,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:09:38,236 INFO L225 Difference]: With dead ends: 3845 [2019-11-15 21:09:38,236 INFO L226 Difference]: Without dead ends: 2079 [2019-11-15 21:09:38,238 INFO L600 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-15 21:09:38,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2079 states. [2019-11-15 21:09:38,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2079 to 2079. [2019-11-15 21:09:38,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2079 states. [2019-11-15 21:09:38,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2079 states to 2079 states and 3125 transitions. [2019-11-15 21:09:38,286 INFO L78 Accepts]: Start accepts. Automaton has 2079 states and 3125 transitions. Word has length 232 [2019-11-15 21:09:38,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:09:38,287 INFO L462 AbstractCegarLoop]: Abstraction has 2079 states and 3125 transitions. [2019-11-15 21:09:38,287 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:09:38,287 INFO L276 IsEmpty]: Start isEmpty. Operand 2079 states and 3125 transitions. [2019-11-15 21:09:38,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2019-11-15 21:09:38,291 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:09:38,291 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 5, 5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:09:38,291 INFO L410 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:09:38,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:09:38,292 INFO L82 PathProgramCache]: Analyzing trace with hash 2072566463, now seen corresponding path program 1 times [2019-11-15 21:09:38,292 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:09:38,292 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780119148] [2019-11-15 21:09:38,292 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:09:38,292 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:09:38,292 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:09:38,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:09:38,412 INFO L134 CoverageAnalysis]: Checked inductivity of 694 backedges. 181 proven. 0 refuted. 0 times theorem prover too weak. 513 trivial. 0 not checked. [2019-11-15 21:09:38,412 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780119148] [2019-11-15 21:09:38,412 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:09:38,413 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:09:38,413 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579392879] [2019-11-15 21:09:38,413 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:09:38,413 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:09:38,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:09:38,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:09:38,414 INFO L87 Difference]: Start difference. First operand 2079 states and 3125 transitions. Second operand 3 states. [2019-11-15 21:09:38,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:09:38,537 INFO L93 Difference]: Finished difference Result 4428 states and 6670 transitions. [2019-11-15 21:09:38,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:09:38,538 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 267 [2019-11-15 21:09:38,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:09:38,542 INFO L225 Difference]: With dead ends: 4428 [2019-11-15 21:09:38,542 INFO L226 Difference]: Without dead ends: 2368 [2019-11-15 21:09:38,544 INFO L600 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-15 21:09:38,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2368 states. [2019-11-15 21:09:38,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2368 to 2368. [2019-11-15 21:09:38,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2368 states. [2019-11-15 21:09:38,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2368 states to 2368 states and 3555 transitions. [2019-11-15 21:09:38,594 INFO L78 Accepts]: Start accepts. Automaton has 2368 states and 3555 transitions. Word has length 267 [2019-11-15 21:09:38,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:09:38,595 INFO L462 AbstractCegarLoop]: Abstraction has 2368 states and 3555 transitions. [2019-11-15 21:09:38,595 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:09:38,595 INFO L276 IsEmpty]: Start isEmpty. Operand 2368 states and 3555 transitions. [2019-11-15 21:09:38,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2019-11-15 21:09:38,599 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:09:38,600 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 6, 6, 5, 5, 5, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:09:38,600 INFO L410 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:09:38,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:09:38,600 INFO L82 PathProgramCache]: Analyzing trace with hash -1787849424, now seen corresponding path program 1 times [2019-11-15 21:09:38,600 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:09:38,601 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709668427] [2019-11-15 21:09:38,601 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:09:38,601 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:09:38,601 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:09:38,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:09:38,744 INFO L134 CoverageAnalysis]: Checked inductivity of 911 backedges. 217 proven. 0 refuted. 0 times theorem prover too weak. 694 trivial. 0 not checked. [2019-11-15 21:09:38,745 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709668427] [2019-11-15 21:09:38,745 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:09:38,745 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:09:38,745 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044870359] [2019-11-15 21:09:38,746 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:09:38,746 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:09:38,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:09:38,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:09:38,746 INFO L87 Difference]: Start difference. First operand 2368 states and 3555 transitions. Second operand 3 states. [2019-11-15 21:09:38,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:09:38,845 INFO L93 Difference]: Finished difference Result 5011 states and 7537 transitions. [2019-11-15 21:09:38,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:09:38,845 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 306 [2019-11-15 21:09:38,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:09:38,850 INFO L225 Difference]: With dead ends: 5011 [2019-11-15 21:09:38,850 INFO L226 Difference]: Without dead ends: 2662 [2019-11-15 21:09:38,853 INFO L600 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-15 21:09:38,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2662 states. [2019-11-15 21:09:38,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2662 to 2662. [2019-11-15 21:09:38,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2662 states. [2019-11-15 21:09:38,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2662 states to 2662 states and 4002 transitions. [2019-11-15 21:09:38,918 INFO L78 Accepts]: Start accepts. Automaton has 2662 states and 4002 transitions. Word has length 306 [2019-11-15 21:09:38,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:09:38,918 INFO L462 AbstractCegarLoop]: Abstraction has 2662 states and 4002 transitions. [2019-11-15 21:09:38,918 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:09:38,918 INFO L276 IsEmpty]: Start isEmpty. Operand 2662 states and 4002 transitions. [2019-11-15 21:09:38,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 348 [2019-11-15 21:09:38,925 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:09:38,925 INFO L380 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 9, 9, 8, 8, 7, 7, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 21:09:38,925 INFO L410 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:09:38,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:09:38,926 INFO L82 PathProgramCache]: Analyzing trace with hash -1856469910, now seen corresponding path program 1 times [2019-11-15 21:09:38,926 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:09:38,926 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530637092] [2019-11-15 21:09:38,927 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:09:38,927 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:09:38,927 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:09:38,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:09:39,177 INFO L134 CoverageAnalysis]: Checked inductivity of 1160 backedges. 251 proven. 0 refuted. 0 times theorem prover too weak. 909 trivial. 0 not checked. [2019-11-15 21:09:39,178 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530637092] [2019-11-15 21:09:39,178 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:09:39,178 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:09:39,178 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082142506] [2019-11-15 21:09:39,179 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:09:39,179 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:09:39,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:09:39,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:09:39,180 INFO L87 Difference]: Start difference. First operand 2662 states and 4002 transitions. Second operand 3 states. [2019-11-15 21:09:39,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:09:39,253 INFO L93 Difference]: Finished difference Result 2958 states and 4452 transitions. [2019-11-15 21:09:39,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:09:39,254 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 347 [2019-11-15 21:09:39,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:09:39,259 INFO L225 Difference]: With dead ends: 2958 [2019-11-15 21:09:39,260 INFO L226 Difference]: Without dead ends: 2956 [2019-11-15 21:09:39,260 INFO L600 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-15 21:09:39,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2956 states. [2019-11-15 21:09:39,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2956 to 2956. [2019-11-15 21:09:39,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2956 states. [2019-11-15 21:09:39,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2956 states to 2956 states and 4450 transitions. [2019-11-15 21:09:39,324 INFO L78 Accepts]: Start accepts. Automaton has 2956 states and 4450 transitions. Word has length 347 [2019-11-15 21:09:39,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:09:39,324 INFO L462 AbstractCegarLoop]: Abstraction has 2956 states and 4450 transitions. [2019-11-15 21:09:39,324 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:09:39,325 INFO L276 IsEmpty]: Start isEmpty. Operand 2956 states and 4450 transitions. [2019-11-15 21:09:39,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 391 [2019-11-15 21:09:39,330 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:09:39,330 INFO L380 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 10, 10, 9, 9, 8, 8, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 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, 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-15 21:09:39,331 INFO L410 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:09:39,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:09:39,331 INFO L82 PathProgramCache]: Analyzing trace with hash 51951590, now seen corresponding path program 1 times [2019-11-15 21:09:39,331 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:09:39,331 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464518076] [2019-11-15 21:09:39,332 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:09:39,332 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:09:39,332 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:09:39,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:09:39,570 INFO L134 CoverageAnalysis]: Checked inductivity of 1445 backedges. 717 proven. 0 refuted. 0 times theorem prover too weak. 728 trivial. 0 not checked. [2019-11-15 21:09:39,570 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464518076] [2019-11-15 21:09:39,570 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:09:39,571 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:09:39,571 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526369758] [2019-11-15 21:09:39,571 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:09:39,571 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:09:39,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:09:39,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:09:39,571 INFO L87 Difference]: Start difference. First operand 2956 states and 4450 transitions. Second operand 4 states. [2019-11-15 21:09:39,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:09:39,983 INFO L93 Difference]: Finished difference Result 6942 states and 10480 transitions. [2019-11-15 21:09:39,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:09:39,984 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 390 [2019-11-15 21:09:39,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:09:39,992 INFO L225 Difference]: With dead ends: 6942 [2019-11-15 21:09:39,992 INFO L226 Difference]: Without dead ends: 4005 [2019-11-15 21:09:39,995 INFO L600 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-15 21:09:40,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4005 states. [2019-11-15 21:09:40,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4005 to 3366. [2019-11-15 21:09:40,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3366 states. [2019-11-15 21:09:40,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3366 states to 3366 states and 5200 transitions. [2019-11-15 21:09:40,074 INFO L78 Accepts]: Start accepts. Automaton has 3366 states and 5200 transitions. Word has length 390 [2019-11-15 21:09:40,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:09:40,075 INFO L462 AbstractCegarLoop]: Abstraction has 3366 states and 5200 transitions. [2019-11-15 21:09:40,075 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:09:40,075 INFO L276 IsEmpty]: Start isEmpty. Operand 3366 states and 5200 transitions. [2019-11-15 21:09:40,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 391 [2019-11-15 21:09:40,082 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:09:40,082 INFO L380 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 10, 10, 9, 9, 8, 8, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 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, 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-15 21:09:40,082 INFO L410 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:09:40,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:09:40,083 INFO L82 PathProgramCache]: Analyzing trace with hash 998989476, now seen corresponding path program 1 times [2019-11-15 21:09:40,083 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:09:40,083 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65825674] [2019-11-15 21:09:40,083 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:09:40,083 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:09:40,084 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:09:40,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:09:41,041 INFO L134 CoverageAnalysis]: Checked inductivity of 1445 backedges. 708 proven. 156 refuted. 0 times theorem prover too weak. 581 trivial. 0 not checked. [2019-11-15 21:09:41,041 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65825674] [2019-11-15 21:09:41,042 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1183303212] [2019-11-15 21:09:41,042 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ebe9ee3c-7bc0-40c8-b282-fdc47ff043c7/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:09:41,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:09:41,389 INFO L256 TraceCheckSpWp]: Trace formula consists of 1322 conjuncts, 39 conjunts are in the unsatisfiable core [2019-11-15 21:09:41,427 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:09:41,535 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:09:41,535 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 31 [2019-11-15 21:09:41,536 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:09:41,560 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:09:41,562 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_164|], 2=[|v_#memory_$Pointer$.base_159|, |v_#memory_$Pointer$.base_158|]} [2019-11-15 21:09:41,570 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:09:41,571 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:09:41,572 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:09:41,573 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:09:41,573 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:09:41,574 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:09:41,596 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2019-11-15 21:09:41,597 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:09:41,632 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:09:41,637 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:09:41,638 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:09:41,639 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:09:41,639 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:09:41,640 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:09:41,641 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:09:41,647 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 37 [2019-11-15 21:09:41,647 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 21:09:41,667 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:09:41,696 INFO L341 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-11-15 21:09:41,697 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 47 treesize of output 37 [2019-11-15 21:09:41,698 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-15 21:09:41,723 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:09:41,724 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:09:41,724 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:95, output treesize:53 [2019-11-15 21:09:41,790 INFO L341 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-11-15 21:09:41,791 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 44 [2019-11-15 21:09:41,791 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:09:41,800 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:09:41,800 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:09:41,801 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2019-11-15 21:09:41,854 INFO L341 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-11-15 21:09:41,854 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 44 [2019-11-15 21:09:41,855 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:09:41,862 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:09:41,862 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:09:41,862 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2019-11-15 21:09:41,865 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_160|], 12=[|v_#memory_$Pointer$.base_167|]} [2019-11-15 21:09:41,872 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:09:41,888 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:09:41,937 INFO L341 Elim1Store]: treesize reduction 260, result has 12.5 percent of original size [2019-11-15 21:09:41,938 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 77 treesize of output 53 [2019-11-15 21:09:41,938 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:09:41,955 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:09:41,955 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:09:41,955 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:91, output treesize:53 [2019-11-15 21:09:41,998 INFO L341 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-11-15 21:09:41,998 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 44 [2019-11-15 21:09:41,999 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:09:42,011 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:09:42,011 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:09:42,011 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2019-11-15 21:09:42,045 INFO L341 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-11-15 21:09:42,046 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 44 [2019-11-15 21:09:42,046 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:09:42,053 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:09:42,053 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:09:42,054 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2019-11-15 21:09:42,061 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_161|], 12=[|v_#memory_$Pointer$.base_170|]} [2019-11-15 21:09:42,063 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:09:42,082 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:09:42,140 INFO L341 Elim1Store]: treesize reduction 260, result has 12.5 percent of original size [2019-11-15 21:09:42,141 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 77 treesize of output 53 [2019-11-15 21:09:42,141 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:09:42,154 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:09:42,155 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:09:42,155 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:91, output treesize:53 [2019-11-15 21:09:42,171 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_159|], 12=[|v_#memory_$Pointer$.base_171|]} [2019-11-15 21:09:42,176 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 37 [2019-11-15 21:09:42,176 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:09:42,190 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:09:42,322 WARN L191 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 46 [2019-11-15 21:09:42,322 INFO L341 Elim1Store]: treesize reduction 36, result has 80.4 percent of original size [2019-11-15 21:09:42,322 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 90 treesize of output 182 [2019-11-15 21:09:42,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:09:42,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:09:42,326 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:09:42,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:09:42,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:09:42,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:09:42,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:09:42,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:09:42,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:09:42,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:09:42,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:09:42,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:09:42,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:09:42,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:09:42,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:09:42,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:09:42,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:09:42,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:09:42,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:09:42,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:09:42,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:09:42,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:09:42,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:09:42,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:09:42,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:09:42,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:09:42,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:09:42,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:09:42,378 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 7 xjuncts. [2019-11-15 21:09:42,474 INFO L567 ElimStorePlain]: treesize reduction 1115, result has 4.6 percent of original size [2019-11-15 21:09:42,474 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:09:42,474 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:102, output treesize:53 [2019-11-15 21:09:42,479 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_162|], 12=[|v_#memory_$Pointer$.base_172|]} [2019-11-15 21:09:42,481 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:09:42,501 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:09:42,567 INFO L341 Elim1Store]: treesize reduction 260, result has 12.5 percent of original size [2019-11-15 21:09:42,568 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 77 treesize of output 53 [2019-11-15 21:09:42,568 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:09:42,580 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:09:42,580 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:09:42,580 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:91, output treesize:53 [2019-11-15 21:09:42,592 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_160|], 12=[|v_#memory_$Pointer$.base_173|]} [2019-11-15 21:09:42,596 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 37 [2019-11-15 21:09:42,596 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:09:42,612 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:09:42,721 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 46 [2019-11-15 21:09:42,721 INFO L341 Elim1Store]: treesize reduction 36, result has 80.4 percent of original size [2019-11-15 21:09:42,721 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 90 treesize of output 182 [2019-11-15 21:09:42,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:09:42,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:09:42,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:09:42,724 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:09:42,756 INFO L567 ElimStorePlain]: treesize reduction 156, result has 25.7 percent of original size [2019-11-15 21:09:42,756 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:09:42,756 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:102, output treesize:53 [2019-11-15 21:09:42,760 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_158|, |v_#memory_int_178|], 2=[|v_#memory_$Pointer$.base_163|], 12=[|v_#memory_$Pointer$.base_174|]} [2019-11-15 21:09:42,765 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 97 [2019-11-15 21:09:42,766 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:09:42,787 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:09:42,791 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:09:42,792 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:09:42,793 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 34 [2019-11-15 21:09:42,793 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:09:42,813 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:09:42,815 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:09:42,829 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:09:42,831 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 59 [2019-11-15 21:09:42,834 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:09:42,835 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:09:42,836 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:09:42,840 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:09:42,842 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:09:42,845 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:09:42,846 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:09:42,847 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:09:42,847 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 26 [2019-11-15 21:09:42,848 INFO L496 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:09:42,853 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:09:42,853 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:09:42,861 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:09:42,862 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 21:09:42,862 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:181, output treesize:32 [2019-11-15 21:09:42,944 INFO L341 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-11-15 21:09:42,944 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 13 [2019-11-15 21:09:42,945 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:09:42,949 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:09:42,949 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:09:42,950 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:41, output treesize:3 [2019-11-15 21:09:43,504 INFO L134 CoverageAnalysis]: Checked inductivity of 1445 backedges. 714 proven. 91 refuted. 0 times theorem prover too weak. 640 trivial. 0 not checked. [2019-11-15 21:09:43,504 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:09:43,504 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 10 [2019-11-15 21:09:43,505 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343845913] [2019-11-15 21:09:43,506 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-15 21:09:43,506 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:09:43,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-15 21:09:43,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-15 21:09:43,506 INFO L87 Difference]: Start difference. First operand 3366 states and 5200 transitions. Second operand 10 states. [2019-11-15 21:09:45,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:09:45,876 INFO L93 Difference]: Finished difference Result 12360 states and 19132 transitions. [2019-11-15 21:09:45,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 21:09:45,877 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 390 [2019-11-15 21:09:45,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:09:45,900 INFO L225 Difference]: With dead ends: 12360 [2019-11-15 21:09:45,901 INFO L226 Difference]: Without dead ends: 9013 [2019-11-15 21:09:45,906 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 410 GetRequests, 396 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2019-11-15 21:09:45,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9013 states. [2019-11-15 21:09:46,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9013 to 7151. [2019-11-15 21:09:46,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7151 states. [2019-11-15 21:09:46,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7151 states to 7151 states and 11267 transitions. [2019-11-15 21:09:46,113 INFO L78 Accepts]: Start accepts. Automaton has 7151 states and 11267 transitions. Word has length 390 [2019-11-15 21:09:46,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:09:46,114 INFO L462 AbstractCegarLoop]: Abstraction has 7151 states and 11267 transitions. [2019-11-15 21:09:46,114 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-15 21:09:46,114 INFO L276 IsEmpty]: Start isEmpty. Operand 7151 states and 11267 transitions. [2019-11-15 21:09:46,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 400 [2019-11-15 21:09:46,141 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:09:46,142 INFO L380 BasicCegarLoop]: trace histogram [13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 10, 10, 9, 9, 8, 8, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 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, 1, 1, 1, 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-15 21:09:46,355 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:09:46,355 INFO L410 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:09:46,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:09:46,356 INFO L82 PathProgramCache]: Analyzing trace with hash -10666121, now seen corresponding path program 1 times [2019-11-15 21:09:46,356 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:09:46,356 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616314020] [2019-11-15 21:09:46,356 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:09:46,356 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:09:46,356 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:09:46,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:09:46,562 INFO L134 CoverageAnalysis]: Checked inductivity of 1526 backedges. 718 proven. 0 refuted. 0 times theorem prover too weak. 808 trivial. 0 not checked. [2019-11-15 21:09:46,562 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616314020] [2019-11-15 21:09:46,644 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:09:46,644 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:09:46,644 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536882889] [2019-11-15 21:09:46,645 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:09:46,645 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:09:46,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:09:46,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:09:46,645 INFO L87 Difference]: Start difference. First operand 7151 states and 11267 transitions. Second operand 4 states. [2019-11-15 21:09:47,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:09:47,254 INFO L93 Difference]: Finished difference Result 11458 states and 17889 transitions. [2019-11-15 21:09:47,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:09:47,254 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 399 [2019-11-15 21:09:47,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:09:47,267 INFO L225 Difference]: With dead ends: 11458 [2019-11-15 21:09:47,268 INFO L226 Difference]: Without dead ends: 7791 [2019-11-15 21:09:47,273 INFO L600 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-15 21:09:47,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7791 states. [2019-11-15 21:09:47,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7791 to 7151. [2019-11-15 21:09:47,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7151 states. [2019-11-15 21:09:47,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7151 states to 7151 states and 11247 transitions. [2019-11-15 21:09:47,455 INFO L78 Accepts]: Start accepts. Automaton has 7151 states and 11247 transitions. Word has length 399 [2019-11-15 21:09:47,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:09:47,456 INFO L462 AbstractCegarLoop]: Abstraction has 7151 states and 11247 transitions. [2019-11-15 21:09:47,456 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:09:47,456 INFO L276 IsEmpty]: Start isEmpty. Operand 7151 states and 11247 transitions. [2019-11-15 21:09:47,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 401 [2019-11-15 21:09:47,468 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:09:47,469 INFO L380 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 10, 10, 9, 9, 8, 8, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 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, 1, 1, 1, 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-15 21:09:47,469 INFO L410 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:09:47,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:09:47,470 INFO L82 PathProgramCache]: Analyzing trace with hash -636572992, now seen corresponding path program 1 times [2019-11-15 21:09:47,470 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:09:47,470 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125978269] [2019-11-15 21:09:47,470 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:09:47,470 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:09:47,471 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:09:47,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:09:47,688 INFO L134 CoverageAnalysis]: Checked inductivity of 1538 backedges. 730 proven. 0 refuted. 0 times theorem prover too weak. 808 trivial. 0 not checked. [2019-11-15 21:09:47,688 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125978269] [2019-11-15 21:09:47,689 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:09:47,689 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:09:47,689 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026249009] [2019-11-15 21:09:47,689 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:09:47,690 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:09:47,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:09:47,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:09:47,690 INFO L87 Difference]: Start difference. First operand 7151 states and 11247 transitions. Second operand 4 states. [2019-11-15 21:09:48,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:09:48,197 INFO L93 Difference]: Finished difference Result 11458 states and 17859 transitions. [2019-11-15 21:09:48,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:09:48,197 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 400 [2019-11-15 21:09:48,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:09:48,208 INFO L225 Difference]: With dead ends: 11458 [2019-11-15 21:09:48,208 INFO L226 Difference]: Without dead ends: 7791 [2019-11-15 21:09:48,213 INFO L600 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-15 21:09:48,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7791 states. [2019-11-15 21:09:48,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7791 to 7151. [2019-11-15 21:09:48,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7151 states. [2019-11-15 21:09:48,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7151 states to 7151 states and 11227 transitions. [2019-11-15 21:09:48,401 INFO L78 Accepts]: Start accepts. Automaton has 7151 states and 11227 transitions. Word has length 400 [2019-11-15 21:09:48,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:09:48,402 INFO L462 AbstractCegarLoop]: Abstraction has 7151 states and 11227 transitions. [2019-11-15 21:09:48,402 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:09:48,402 INFO L276 IsEmpty]: Start isEmpty. Operand 7151 states and 11227 transitions. [2019-11-15 21:09:48,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 402 [2019-11-15 21:09:48,414 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:09:48,414 INFO L380 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 10, 10, 9, 9, 8, 8, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 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, 1, 1, 1, 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-15 21:09:48,415 INFO L410 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:09:48,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:09:48,415 INFO L82 PathProgramCache]: Analyzing trace with hash 226663922, now seen corresponding path program 1 times [2019-11-15 21:09:48,415 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:09:48,415 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409998181] [2019-11-15 21:09:48,416 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:09:48,416 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:09:48,416 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:09:48,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:09:48,611 INFO L134 CoverageAnalysis]: Checked inductivity of 1550 backedges. 742 proven. 0 refuted. 0 times theorem prover too weak. 808 trivial. 0 not checked. [2019-11-15 21:09:48,612 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409998181] [2019-11-15 21:09:48,612 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:09:48,612 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:09:48,612 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852145461] [2019-11-15 21:09:48,614 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:09:48,615 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:09:48,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:09:48,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:09:48,616 INFO L87 Difference]: Start difference. First operand 7151 states and 11227 transitions. Second operand 4 states. [2019-11-15 21:09:49,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:09:49,167 INFO L93 Difference]: Finished difference Result 11458 states and 17829 transitions. [2019-11-15 21:09:49,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:09:49,167 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 401 [2019-11-15 21:09:49,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:09:49,176 INFO L225 Difference]: With dead ends: 11458 [2019-11-15 21:09:49,176 INFO L226 Difference]: Without dead ends: 7791 [2019-11-15 21:09:49,181 INFO L600 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-15 21:09:49,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7791 states. [2019-11-15 21:09:49,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7791 to 7151. [2019-11-15 21:09:49,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7151 states. [2019-11-15 21:09:49,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7151 states to 7151 states and 11207 transitions. [2019-11-15 21:09:49,437 INFO L78 Accepts]: Start accepts. Automaton has 7151 states and 11207 transitions. Word has length 401 [2019-11-15 21:09:49,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:09:49,437 INFO L462 AbstractCegarLoop]: Abstraction has 7151 states and 11207 transitions. [2019-11-15 21:09:49,438 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:09:49,438 INFO L276 IsEmpty]: Start isEmpty. Operand 7151 states and 11207 transitions. [2019-11-15 21:09:49,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 403 [2019-11-15 21:09:49,450 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:09:49,451 INFO L380 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 10, 10, 9, 9, 8, 8, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 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, 1, 1, 1, 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-15 21:09:49,451 INFO L410 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:09:49,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:09:49,451 INFO L82 PathProgramCache]: Analyzing trace with hash 8717915, now seen corresponding path program 1 times [2019-11-15 21:09:49,452 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:09:49,452 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863042333] [2019-11-15 21:09:49,452 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:09:49,452 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:09:49,452 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:09:49,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:09:49,638 INFO L134 CoverageAnalysis]: Checked inductivity of 1562 backedges. 754 proven. 0 refuted. 0 times theorem prover too weak. 808 trivial. 0 not checked. [2019-11-15 21:09:49,638 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863042333] [2019-11-15 21:09:49,639 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:09:49,639 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:09:49,639 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806999632] [2019-11-15 21:09:49,640 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:09:49,640 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:09:49,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:09:49,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:09:49,640 INFO L87 Difference]: Start difference. First operand 7151 states and 11207 transitions. Second operand 4 states. [2019-11-15 21:09:50,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:09:50,046 INFO L93 Difference]: Finished difference Result 11358 states and 17679 transitions. [2019-11-15 21:09:50,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:09:50,046 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 402 [2019-11-15 21:09:50,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:09:50,054 INFO L225 Difference]: With dead ends: 11358 [2019-11-15 21:09:50,054 INFO L226 Difference]: Without dead ends: 7691 [2019-11-15 21:09:50,057 INFO L600 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-15 21:09:50,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7691 states. [2019-11-15 21:09:50,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7691 to 7151. [2019-11-15 21:09:50,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7151 states. [2019-11-15 21:09:50,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7151 states to 7151 states and 11187 transitions. [2019-11-15 21:09:50,195 INFO L78 Accepts]: Start accepts. Automaton has 7151 states and 11187 transitions. Word has length 402 [2019-11-15 21:09:50,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:09:50,195 INFO L462 AbstractCegarLoop]: Abstraction has 7151 states and 11187 transitions. [2019-11-15 21:09:50,195 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:09:50,196 INFO L276 IsEmpty]: Start isEmpty. Operand 7151 states and 11187 transitions. [2019-11-15 21:09:50,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 406 [2019-11-15 21:09:50,202 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:09:50,202 INFO L380 BasicCegarLoop]: trace histogram [13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 10, 10, 9, 9, 8, 8, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 21:09:50,202 INFO L410 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:09:50,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:09:50,203 INFO L82 PathProgramCache]: Analyzing trace with hash 1223182652, now seen corresponding path program 1 times [2019-11-15 21:09:50,203 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:09:50,203 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018435068] [2019-11-15 21:09:50,203 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:09:50,203 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:09:50,203 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:09:50,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:09:50,468 INFO L134 CoverageAnalysis]: Checked inductivity of 1526 backedges. 854 proven. 0 refuted. 0 times theorem prover too weak. 672 trivial. 0 not checked. [2019-11-15 21:09:50,469 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018435068] [2019-11-15 21:09:50,469 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:09:50,469 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 21:09:50,469 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820651656] [2019-11-15 21:09:50,470 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 21:09:50,470 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:09:50,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 21:09:50,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:09:50,471 INFO L87 Difference]: Start difference. First operand 7151 states and 11187 transitions. Second operand 5 states. [2019-11-15 21:09:51,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:09:51,024 INFO L93 Difference]: Finished difference Result 16769 states and 26295 transitions. [2019-11-15 21:09:51,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:09:51,025 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 405 [2019-11-15 21:09:51,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:09:51,032 INFO L225 Difference]: With dead ends: 16769 [2019-11-15 21:09:51,032 INFO L226 Difference]: Without dead ends: 9637 [2019-11-15 21:09:51,038 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-15 21:09:51,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9637 states. [2019-11-15 21:09:51,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9637 to 7701. [2019-11-15 21:09:51,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7701 states. [2019-11-15 21:09:51,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7701 states to 7701 states and 12167 transitions. [2019-11-15 21:09:51,173 INFO L78 Accepts]: Start accepts. Automaton has 7701 states and 12167 transitions. Word has length 405 [2019-11-15 21:09:51,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:09:51,174 INFO L462 AbstractCegarLoop]: Abstraction has 7701 states and 12167 transitions. [2019-11-15 21:09:51,174 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 21:09:51,174 INFO L276 IsEmpty]: Start isEmpty. Operand 7701 states and 12167 transitions. [2019-11-15 21:09:51,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 406 [2019-11-15 21:09:51,251 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:09:51,251 INFO L380 BasicCegarLoop]: trace histogram [13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 10, 10, 9, 9, 8, 8, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 21:09:51,251 INFO L410 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:09:51,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:09:51,251 INFO L82 PathProgramCache]: Analyzing trace with hash 1549537306, now seen corresponding path program 2 times [2019-11-15 21:09:51,252 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:09:51,252 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217538116] [2019-11-15 21:09:51,252 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:09:51,252 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:09:51,252 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:09:51,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:09:51,483 INFO L134 CoverageAnalysis]: Checked inductivity of 1526 backedges. 616 proven. 0 refuted. 0 times theorem prover too weak. 910 trivial. 0 not checked. [2019-11-15 21:09:51,483 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217538116] [2019-11-15 21:09:51,483 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:09:51,484 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 21:09:51,484 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897185754] [2019-11-15 21:09:51,484 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 21:09:51,484 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:09:51,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 21:09:51,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-15 21:09:51,485 INFO L87 Difference]: Start difference. First operand 7701 states and 12167 transitions. Second operand 6 states. [2019-11-15 21:09:52,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:09:52,562 INFO L93 Difference]: Finished difference Result 19215 states and 30148 transitions. [2019-11-15 21:09:52,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 21:09:52,563 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 405 [2019-11-15 21:09:52,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:09:52,571 INFO L225 Difference]: With dead ends: 19215 [2019-11-15 21:09:52,571 INFO L226 Difference]: Without dead ends: 11533 [2019-11-15 21:09:52,577 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-15 21:09:52,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11533 states. [2019-11-15 21:09:52,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11533 to 8371. [2019-11-15 21:09:52,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8371 states. [2019-11-15 21:09:52,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8371 states to 8371 states and 13237 transitions. [2019-11-15 21:09:52,754 INFO L78 Accepts]: Start accepts. Automaton has 8371 states and 13237 transitions. Word has length 405 [2019-11-15 21:09:52,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:09:52,754 INFO L462 AbstractCegarLoop]: Abstraction has 8371 states and 13237 transitions. [2019-11-15 21:09:52,754 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 21:09:52,754 INFO L276 IsEmpty]: Start isEmpty. Operand 8371 states and 13237 transitions. [2019-11-15 21:09:52,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 407 [2019-11-15 21:09:52,760 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:09:52,760 INFO L380 BasicCegarLoop]: trace histogram [13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 10, 10, 9, 9, 8, 8, 7, 7, 7, 7, 7, 7, 6, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 21:09:52,760 INFO L410 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:09:52,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:09:52,761 INFO L82 PathProgramCache]: Analyzing trace with hash 383945128, now seen corresponding path program 1 times [2019-11-15 21:09:52,761 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:09:52,761 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779345316] [2019-11-15 21:09:52,761 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:09:52,761 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:09:52,761 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:09:52,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:09:53,033 INFO L134 CoverageAnalysis]: Checked inductivity of 1532 backedges. 718 proven. 0 refuted. 0 times theorem prover too weak. 814 trivial. 0 not checked. [2019-11-15 21:09:53,033 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779345316] [2019-11-15 21:09:53,033 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:09:53,033 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:09:53,034 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58640953] [2019-11-15 21:09:53,034 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:09:53,034 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:09:53,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:09:53,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:09:53,035 INFO L87 Difference]: Start difference. First operand 8371 states and 13237 transitions. Second operand 4 states. [2019-11-15 21:09:53,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:09:53,567 INFO L93 Difference]: Finished difference Result 14187 states and 22314 transitions. [2019-11-15 21:09:53,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:09:53,568 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 406 [2019-11-15 21:09:53,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:09:53,574 INFO L225 Difference]: With dead ends: 14187 [2019-11-15 21:09:53,575 INFO L226 Difference]: Without dead ends: 9780 [2019-11-15 21:09:53,579 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 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-15 21:09:53,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9780 states. [2019-11-15 21:09:53,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9780 to 8491. [2019-11-15 21:09:53,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8491 states. [2019-11-15 21:09:53,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8491 states to 8491 states and 13387 transitions. [2019-11-15 21:09:53,767 INFO L78 Accepts]: Start accepts. Automaton has 8491 states and 13387 transitions. Word has length 406 [2019-11-15 21:09:53,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:09:53,768 INFO L462 AbstractCegarLoop]: Abstraction has 8491 states and 13387 transitions. [2019-11-15 21:09:53,768 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:09:53,768 INFO L276 IsEmpty]: Start isEmpty. Operand 8491 states and 13387 transitions. [2019-11-15 21:09:53,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 408 [2019-11-15 21:09:53,777 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:09:53,777 INFO L380 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 10, 10, 9, 9, 9, 8, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 21:09:53,777 INFO L410 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:09:53,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:09:53,778 INFO L82 PathProgramCache]: Analyzing trace with hash 1026115724, now seen corresponding path program 1 times [2019-11-15 21:09:53,778 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:09:53,778 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721490987] [2019-11-15 21:09:53,778 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:09:53,779 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:09:53,779 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:09:53,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:09:54,068 INFO L134 CoverageAnalysis]: Checked inductivity of 1546 backedges. 516 proven. 0 refuted. 0 times theorem prover too weak. 1030 trivial. 0 not checked. [2019-11-15 21:09:54,069 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721490987] [2019-11-15 21:09:54,069 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:09:54,069 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:09:54,069 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873002289] [2019-11-15 21:09:54,070 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:09:54,070 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:09:54,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:09:54,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:09:54,071 INFO L87 Difference]: Start difference. First operand 8491 states and 13387 transitions. Second operand 4 states. [2019-11-15 21:09:54,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:09:54,635 INFO L93 Difference]: Finished difference Result 14374 states and 22468 transitions. [2019-11-15 21:09:54,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:09:54,636 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 407 [2019-11-15 21:09:54,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:09:54,642 INFO L225 Difference]: With dead ends: 14374 [2019-11-15 21:09:54,642 INFO L226 Difference]: Without dead ends: 9967 [2019-11-15 21:09:54,645 INFO L600 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-15 21:09:54,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9967 states. [2019-11-15 21:09:54,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9967 to 8491. [2019-11-15 21:09:54,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8491 states. [2019-11-15 21:09:54,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8491 states to 8491 states and 13367 transitions. [2019-11-15 21:09:54,803 INFO L78 Accepts]: Start accepts. Automaton has 8491 states and 13367 transitions. Word has length 407 [2019-11-15 21:09:54,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:09:54,803 INFO L462 AbstractCegarLoop]: Abstraction has 8491 states and 13367 transitions. [2019-11-15 21:09:54,803 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:09:54,804 INFO L276 IsEmpty]: Start isEmpty. Operand 8491 states and 13367 transitions. [2019-11-15 21:09:54,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 408 [2019-11-15 21:09:54,811 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:09:54,811 INFO L380 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 10, 10, 9, 9, 8, 8, 7, 7, 7, 7, 7, 7, 6, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 21:09:54,812 INFO L410 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:09:54,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:09:54,812 INFO L82 PathProgramCache]: Analyzing trace with hash -1116207831, now seen corresponding path program 1 times [2019-11-15 21:09:54,812 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:09:54,812 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007048784] [2019-11-15 21:09:54,813 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:09:54,813 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:09:54,813 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:09:54,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:09:55,066 INFO L134 CoverageAnalysis]: Checked inductivity of 1544 backedges. 867 proven. 0 refuted. 0 times theorem prover too weak. 677 trivial. 0 not checked. [2019-11-15 21:09:55,066 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007048784] [2019-11-15 21:09:55,066 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:09:55,066 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 21:09:55,066 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101540843] [2019-11-15 21:09:55,067 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 21:09:55,067 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:09:55,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 21:09:55,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:09:55,067 INFO L87 Difference]: Start difference. First operand 8491 states and 13367 transitions. Second operand 5 states. [2019-11-15 21:09:55,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:09:55,600 INFO L93 Difference]: Finished difference Result 18589 states and 29102 transitions. [2019-11-15 21:09:55,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:09:55,601 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 407 [2019-11-15 21:09:55,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:09:55,610 INFO L225 Difference]: With dead ends: 18589 [2019-11-15 21:09:55,610 INFO L226 Difference]: Without dead ends: 10117 [2019-11-15 21:09:55,616 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-15 21:09:55,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10117 states. [2019-11-15 21:09:55,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10117 to 8581. [2019-11-15 21:09:55,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8581 states. [2019-11-15 21:09:55,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8581 states to 8581 states and 13487 transitions. [2019-11-15 21:09:55,787 INFO L78 Accepts]: Start accepts. Automaton has 8581 states and 13487 transitions. Word has length 407 [2019-11-15 21:09:55,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:09:55,787 INFO L462 AbstractCegarLoop]: Abstraction has 8581 states and 13487 transitions. [2019-11-15 21:09:55,787 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 21:09:55,787 INFO L276 IsEmpty]: Start isEmpty. Operand 8581 states and 13487 transitions. [2019-11-15 21:09:55,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 409 [2019-11-15 21:09:55,795 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:09:55,796 INFO L380 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 10, 10, 9, 9, 9, 8, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 21:09:55,796 INFO L410 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:09:55,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:09:55,796 INFO L82 PathProgramCache]: Analyzing trace with hash 1129113554, now seen corresponding path program 1 times [2019-11-15 21:09:55,797 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:09:55,797 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754531859] [2019-11-15 21:09:55,797 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:09:55,797 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:09:55,797 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:09:55,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:09:56,043 INFO L134 CoverageAnalysis]: Checked inductivity of 1558 backedges. 528 proven. 0 refuted. 0 times theorem prover too weak. 1030 trivial. 0 not checked. [2019-11-15 21:09:56,043 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754531859] [2019-11-15 21:09:56,043 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:09:56,043 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:09:56,043 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126767956] [2019-11-15 21:09:56,043 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:09:56,044 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:09:56,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:09:56,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:09:56,044 INFO L87 Difference]: Start difference. First operand 8581 states and 13487 transitions. Second operand 4 states. [2019-11-15 21:09:56,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:09:56,606 INFO L93 Difference]: Finished difference Result 14424 states and 22502 transitions. [2019-11-15 21:09:56,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:09:56,606 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 408 [2019-11-15 21:09:56,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:09:56,613 INFO L225 Difference]: With dead ends: 14424 [2019-11-15 21:09:56,613 INFO L226 Difference]: Without dead ends: 9937 [2019-11-15 21:09:56,616 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:09:56,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9937 states. [2019-11-15 21:09:56,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9937 to 8581. [2019-11-15 21:09:56,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8581 states. [2019-11-15 21:09:56,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8581 states to 8581 states and 13467 transitions. [2019-11-15 21:09:56,777 INFO L78 Accepts]: Start accepts. Automaton has 8581 states and 13467 transitions. Word has length 408 [2019-11-15 21:09:56,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:09:56,777 INFO L462 AbstractCegarLoop]: Abstraction has 8581 states and 13467 transitions. [2019-11-15 21:09:56,777 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:09:56,777 INFO L276 IsEmpty]: Start isEmpty. Operand 8581 states and 13467 transitions. [2019-11-15 21:09:56,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 410 [2019-11-15 21:09:56,782 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:09:56,783 INFO L380 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 10, 10, 9, 9, 9, 8, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 21:09:56,783 INFO L410 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:09:56,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:09:56,783 INFO L82 PathProgramCache]: Analyzing trace with hash -804582959, now seen corresponding path program 1 times [2019-11-15 21:09:56,783 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:09:56,783 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319211690] [2019-11-15 21:09:56,784 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:09:56,784 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:09:56,784 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:09:56,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:09:56,946 INFO L134 CoverageAnalysis]: Checked inductivity of 1570 backedges. 540 proven. 0 refuted. 0 times theorem prover too weak. 1030 trivial. 0 not checked. [2019-11-15 21:09:56,947 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319211690] [2019-11-15 21:09:56,947 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:09:56,947 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:09:56,947 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009102588] [2019-11-15 21:09:56,948 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:09:56,948 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:09:56,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:09:56,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:09:56,949 INFO L87 Difference]: Start difference. First operand 8581 states and 13467 transitions. Second operand 4 states. [2019-11-15 21:09:57,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:09:57,467 INFO L93 Difference]: Finished difference Result 14324 states and 22352 transitions. [2019-11-15 21:09:57,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:09:57,468 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 409 [2019-11-15 21:09:57,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:09:57,474 INFO L225 Difference]: With dead ends: 14324 [2019-11-15 21:09:57,474 INFO L226 Difference]: Without dead ends: 9837 [2019-11-15 21:09:57,477 INFO L600 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-15 21:09:57,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9837 states. [2019-11-15 21:09:57,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9837 to 8581. [2019-11-15 21:09:57,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8581 states. [2019-11-15 21:09:57,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8581 states to 8581 states and 13447 transitions. [2019-11-15 21:09:57,639 INFO L78 Accepts]: Start accepts. Automaton has 8581 states and 13447 transitions. Word has length 409 [2019-11-15 21:09:57,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:09:57,639 INFO L462 AbstractCegarLoop]: Abstraction has 8581 states and 13447 transitions. [2019-11-15 21:09:57,639 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:09:57,639 INFO L276 IsEmpty]: Start isEmpty. Operand 8581 states and 13447 transitions. [2019-11-15 21:09:57,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 421 [2019-11-15 21:09:57,645 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:09:57,645 INFO L380 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 12, 12, 12, 11, 11, 11, 10, 10, 9, 9, 9, 8, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 21:09:57,645 INFO L410 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:09:57,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:09:57,646 INFO L82 PathProgramCache]: Analyzing trace with hash -10602158, now seen corresponding path program 1 times [2019-11-15 21:09:57,646 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:09:57,646 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453663144] [2019-11-15 21:09:57,646 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:09:57,646 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:09:57,646 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:09:57,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:09:57,819 INFO L134 CoverageAnalysis]: Checked inductivity of 1683 backedges. 623 proven. 0 refuted. 0 times theorem prover too weak. 1060 trivial. 0 not checked. [2019-11-15 21:09:57,820 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453663144] [2019-11-15 21:09:57,820 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:09:57,820 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:09:57,820 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207174830] [2019-11-15 21:09:57,821 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:09:57,821 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:09:57,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:09:57,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:09:57,821 INFO L87 Difference]: Start difference. First operand 8581 states and 13447 transitions. Second operand 4 states. [2019-11-15 21:09:58,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:09:58,301 INFO L93 Difference]: Finished difference Result 14088 states and 21989 transitions. [2019-11-15 21:09:58,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:09:58,302 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 420 [2019-11-15 21:09:58,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:09:58,308 INFO L225 Difference]: With dead ends: 14088 [2019-11-15 21:09:58,308 INFO L226 Difference]: Without dead ends: 9601 [2019-11-15 21:09:58,311 INFO L600 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-15 21:09:58,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9601 states. [2019-11-15 21:09:58,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9601 to 8711. [2019-11-15 21:09:58,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8711 states. [2019-11-15 21:09:58,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8711 states to 8711 states and 13617 transitions. [2019-11-15 21:09:58,554 INFO L78 Accepts]: Start accepts. Automaton has 8711 states and 13617 transitions. Word has length 420 [2019-11-15 21:09:58,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:09:58,554 INFO L462 AbstractCegarLoop]: Abstraction has 8711 states and 13617 transitions. [2019-11-15 21:09:58,554 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:09:58,554 INFO L276 IsEmpty]: Start isEmpty. Operand 8711 states and 13617 transitions. [2019-11-15 21:09:58,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 421 [2019-11-15 21:09:58,563 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:09:58,563 INFO L380 BasicCegarLoop]: trace histogram [14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 11, 11, 11, 10, 10, 9, 9, 9, 8, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 21:09:58,563 INFO L410 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:09:58,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:09:58,563 INFO L82 PathProgramCache]: Analyzing trace with hash -1050165976, now seen corresponding path program 1 times [2019-11-15 21:09:58,563 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:09:58,563 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365557735] [2019-11-15 21:09:58,564 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:09:58,564 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:09:58,564 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:09:58,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:09:58,854 INFO L134 CoverageAnalysis]: Checked inductivity of 1694 backedges. 628 proven. 0 refuted. 0 times theorem prover too weak. 1066 trivial. 0 not checked. [2019-11-15 21:09:58,854 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365557735] [2019-11-15 21:09:58,854 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:09:58,854 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:09:58,854 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891357931] [2019-11-15 21:09:58,855 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:09:58,855 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:09:58,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:09:58,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:09:58,855 INFO L87 Difference]: Start difference. First operand 8711 states and 13617 transitions. Second operand 4 states. [2019-11-15 21:09:59,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:09:59,383 INFO L93 Difference]: Finished difference Result 14254 states and 22042 transitions. [2019-11-15 21:09:59,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:09:59,384 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 420 [2019-11-15 21:09:59,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:09:59,390 INFO L225 Difference]: With dead ends: 14254 [2019-11-15 21:09:59,390 INFO L226 Difference]: Without dead ends: 9767 [2019-11-15 21:09:59,395 INFO L600 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-15 21:09:59,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9767 states. [2019-11-15 21:09:59,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9767 to 8711. [2019-11-15 21:09:59,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8711 states. [2019-11-15 21:09:59,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8711 states to 8711 states and 13597 transitions. [2019-11-15 21:09:59,562 INFO L78 Accepts]: Start accepts. Automaton has 8711 states and 13597 transitions. Word has length 420 [2019-11-15 21:09:59,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:09:59,562 INFO L462 AbstractCegarLoop]: Abstraction has 8711 states and 13597 transitions. [2019-11-15 21:09:59,562 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:09:59,562 INFO L276 IsEmpty]: Start isEmpty. Operand 8711 states and 13597 transitions. [2019-11-15 21:09:59,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 422 [2019-11-15 21:09:59,568 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:09:59,568 INFO L380 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 12, 11, 11, 11, 10, 10, 9, 9, 9, 8, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 21:09:59,569 INFO L410 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:09:59,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:09:59,569 INFO L82 PathProgramCache]: Analyzing trace with hash -944369716, now seen corresponding path program 1 times [2019-11-15 21:09:59,569 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:09:59,569 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562650010] [2019-11-15 21:09:59,569 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:09:59,569 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:09:59,569 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:09:59,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:09:59,743 INFO L134 CoverageAnalysis]: Checked inductivity of 1696 backedges. 636 proven. 0 refuted. 0 times theorem prover too weak. 1060 trivial. 0 not checked. [2019-11-15 21:09:59,743 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562650010] [2019-11-15 21:09:59,743 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:09:59,744 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:09:59,744 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087742694] [2019-11-15 21:09:59,744 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:09:59,744 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:09:59,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:09:59,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:09:59,745 INFO L87 Difference]: Start difference. First operand 8711 states and 13597 transitions. Second operand 4 states. [2019-11-15 21:10:00,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:10:00,259 INFO L93 Difference]: Finished difference Result 14088 states and 21929 transitions. [2019-11-15 21:10:00,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:10:00,260 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 421 [2019-11-15 21:10:00,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:10:00,269 INFO L225 Difference]: With dead ends: 14088 [2019-11-15 21:10:00,269 INFO L226 Difference]: Without dead ends: 9601 [2019-11-15 21:10:00,273 INFO L600 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-15 21:10:00,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9601 states. [2019-11-15 21:10:00,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9601 to 8721. [2019-11-15 21:10:00,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8721 states. [2019-11-15 21:10:00,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8721 states to 8721 states and 13597 transitions. [2019-11-15 21:10:00,446 INFO L78 Accepts]: Start accepts. Automaton has 8721 states and 13597 transitions. Word has length 421 [2019-11-15 21:10:00,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:10:00,446 INFO L462 AbstractCegarLoop]: Abstraction has 8721 states and 13597 transitions. [2019-11-15 21:10:00,446 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:10:00,446 INFO L276 IsEmpty]: Start isEmpty. Operand 8721 states and 13597 transitions. [2019-11-15 21:10:00,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 422 [2019-11-15 21:10:00,452 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:10:00,453 INFO L380 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 12, 11, 11, 11, 10, 10, 9, 9, 9, 8, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 21:10:00,453 INFO L410 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:10:00,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:10:00,453 INFO L82 PathProgramCache]: Analyzing trace with hash 2020552241, now seen corresponding path program 1 times [2019-11-15 21:10:00,453 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:10:00,453 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578026082] [2019-11-15 21:10:00,454 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:10:00,454 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:10:00,454 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:10:00,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:10:00,622 INFO L134 CoverageAnalysis]: Checked inductivity of 1707 backedges. 641 proven. 0 refuted. 0 times theorem prover too weak. 1066 trivial. 0 not checked. [2019-11-15 21:10:00,623 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578026082] [2019-11-15 21:10:00,623 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:10:00,623 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:10:00,623 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191384354] [2019-11-15 21:10:00,624 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:10:00,624 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:10:00,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:10:00,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:10:00,624 INFO L87 Difference]: Start difference. First operand 8721 states and 13597 transitions. Second operand 4 states. [2019-11-15 21:10:01,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:10:01,282 INFO L93 Difference]: Finished difference Result 14264 states and 22002 transitions. [2019-11-15 21:10:01,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:10:01,283 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 421 [2019-11-15 21:10:01,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:10:01,289 INFO L225 Difference]: With dead ends: 14264 [2019-11-15 21:10:01,289 INFO L226 Difference]: Without dead ends: 9777 [2019-11-15 21:10:01,291 INFO L600 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-15 21:10:01,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9777 states. [2019-11-15 21:10:01,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9777 to 8721. [2019-11-15 21:10:01,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8721 states. [2019-11-15 21:10:01,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8721 states to 8721 states and 13577 transitions. [2019-11-15 21:10:01,464 INFO L78 Accepts]: Start accepts. Automaton has 8721 states and 13577 transitions. Word has length 421 [2019-11-15 21:10:01,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:10:01,464 INFO L462 AbstractCegarLoop]: Abstraction has 8721 states and 13577 transitions. [2019-11-15 21:10:01,464 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:10:01,464 INFO L276 IsEmpty]: Start isEmpty. Operand 8721 states and 13577 transitions. [2019-11-15 21:10:01,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 423 [2019-11-15 21:10:01,470 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:10:01,471 INFO L380 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 12, 12, 12, 11, 11, 11, 10, 10, 9, 9, 9, 8, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 21:10:01,471 INFO L410 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:10:01,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:10:01,471 INFO L82 PathProgramCache]: Analyzing trace with hash -658054889, now seen corresponding path program 1 times [2019-11-15 21:10:01,471 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:10:01,471 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479919855] [2019-11-15 21:10:01,471 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:10:01,471 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:10:01,471 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:10:01,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:10:01,629 INFO L134 CoverageAnalysis]: Checked inductivity of 1709 backedges. 649 proven. 0 refuted. 0 times theorem prover too weak. 1060 trivial. 0 not checked. [2019-11-15 21:10:01,629 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479919855] [2019-11-15 21:10:01,630 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:10:01,630 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:10:01,630 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884440773] [2019-11-15 21:10:01,630 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:10:01,630 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:10:01,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:10:01,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:10:01,631 INFO L87 Difference]: Start difference. First operand 8721 states and 13577 transitions. Second operand 4 states. [2019-11-15 21:10:02,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:10:02,112 INFO L93 Difference]: Finished difference Result 13988 states and 21749 transitions. [2019-11-15 21:10:02,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:10:02,116 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 422 [2019-11-15 21:10:02,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:10:02,124 INFO L225 Difference]: With dead ends: 13988 [2019-11-15 21:10:02,124 INFO L226 Difference]: Without dead ends: 9501 [2019-11-15 21:10:02,129 INFO L600 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-15 21:10:02,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9501 states. [2019-11-15 21:10:02,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9501 to 8731. [2019-11-15 21:10:02,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8731 states. [2019-11-15 21:10:02,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8731 states to 8731 states and 13577 transitions. [2019-11-15 21:10:02,308 INFO L78 Accepts]: Start accepts. Automaton has 8731 states and 13577 transitions. Word has length 422 [2019-11-15 21:10:02,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:10:02,308 INFO L462 AbstractCegarLoop]: Abstraction has 8731 states and 13577 transitions. [2019-11-15 21:10:02,308 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:10:02,308 INFO L276 IsEmpty]: Start isEmpty. Operand 8731 states and 13577 transitions. [2019-11-15 21:10:02,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 423 [2019-11-15 21:10:02,314 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:10:02,315 INFO L380 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 12, 11, 11, 11, 10, 10, 9, 9, 9, 8, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 21:10:02,315 INFO L410 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:10:02,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:10:02,315 INFO L82 PathProgramCache]: Analyzing trace with hash 1891874509, now seen corresponding path program 1 times [2019-11-15 21:10:02,315 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:10:02,315 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606586139] [2019-11-15 21:10:02,315 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:10:02,316 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:10:02,316 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:10:02,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:10:02,485 INFO L134 CoverageAnalysis]: Checked inductivity of 1720 backedges. 654 proven. 0 refuted. 0 times theorem prover too weak. 1066 trivial. 0 not checked. [2019-11-15 21:10:02,485 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606586139] [2019-11-15 21:10:02,485 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:10:02,486 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:10:02,486 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630337678] [2019-11-15 21:10:02,486 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:10:02,486 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:10:02,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:10:02,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:10:02,487 INFO L87 Difference]: Start difference. First operand 8731 states and 13577 transitions. Second operand 4 states. [2019-11-15 21:10:03,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:10:03,137 INFO L93 Difference]: Finished difference Result 14274 states and 21962 transitions. [2019-11-15 21:10:03,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:10:03,138 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 422 [2019-11-15 21:10:03,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:10:03,144 INFO L225 Difference]: With dead ends: 14274 [2019-11-15 21:10:03,144 INFO L226 Difference]: Without dead ends: 9787 [2019-11-15 21:10:03,147 INFO L600 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-15 21:10:03,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9787 states. [2019-11-15 21:10:03,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9787 to 8731. [2019-11-15 21:10:03,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8731 states. [2019-11-15 21:10:03,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8731 states to 8731 states and 13557 transitions. [2019-11-15 21:10:03,351 INFO L78 Accepts]: Start accepts. Automaton has 8731 states and 13557 transitions. Word has length 422 [2019-11-15 21:10:03,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:10:03,352 INFO L462 AbstractCegarLoop]: Abstraction has 8731 states and 13557 transitions. [2019-11-15 21:10:03,352 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:10:03,352 INFO L276 IsEmpty]: Start isEmpty. Operand 8731 states and 13557 transitions. [2019-11-15 21:10:03,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 424 [2019-11-15 21:10:03,358 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:10:03,358 INFO L380 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 12, 11, 11, 11, 10, 10, 9, 9, 9, 8, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 21:10:03,358 INFO L410 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:10:03,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:10:03,359 INFO L82 PathProgramCache]: Analyzing trace with hash 1366170166, now seen corresponding path program 1 times [2019-11-15 21:10:03,359 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:10:03,359 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654379155] [2019-11-15 21:10:03,359 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:10:03,359 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:10:03,359 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:10:03,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:10:03,541 INFO L134 CoverageAnalysis]: Checked inductivity of 1733 backedges. 667 proven. 0 refuted. 0 times theorem prover too weak. 1066 trivial. 0 not checked. [2019-11-15 21:10:03,541 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654379155] [2019-11-15 21:10:03,541 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:10:03,542 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:10:03,542 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998257274] [2019-11-15 21:10:03,542 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:10:03,542 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:10:03,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:10:03,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:10:03,542 INFO L87 Difference]: Start difference. First operand 8731 states and 13557 transitions. Second operand 4 states. [2019-11-15 21:10:04,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:10:04,190 INFO L93 Difference]: Finished difference Result 14174 states and 21812 transitions. [2019-11-15 21:10:04,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:10:04,191 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 423 [2019-11-15 21:10:04,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:10:04,201 INFO L225 Difference]: With dead ends: 14174 [2019-11-15 21:10:04,201 INFO L226 Difference]: Without dead ends: 9687 [2019-11-15 21:10:04,206 INFO L600 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-15 21:10:04,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9687 states. [2019-11-15 21:10:04,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9687 to 8731. [2019-11-15 21:10:04,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8731 states. [2019-11-15 21:10:04,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8731 states to 8731 states and 13537 transitions. [2019-11-15 21:10:04,500 INFO L78 Accepts]: Start accepts. Automaton has 8731 states and 13537 transitions. Word has length 423 [2019-11-15 21:10:04,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:10:04,500 INFO L462 AbstractCegarLoop]: Abstraction has 8731 states and 13537 transitions. [2019-11-15 21:10:04,500 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:10:04,500 INFO L276 IsEmpty]: Start isEmpty. Operand 8731 states and 13537 transitions. [2019-11-15 21:10:04,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 434 [2019-11-15 21:10:04,506 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:10:04,507 INFO L380 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 11, 11, 10, 10, 9, 9, 8, 8, 8, 8, 7, 6, 6, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 21:10:04,507 INFO L410 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:10:04,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:10:04,507 INFO L82 PathProgramCache]: Analyzing trace with hash 2141119759, now seen corresponding path program 1 times [2019-11-15 21:10:04,508 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:10:04,508 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830810267] [2019-11-15 21:10:04,508 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:10:04,508 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:10:04,508 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:10:04,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:10:04,717 INFO L134 CoverageAnalysis]: Checked inductivity of 1800 backedges. 575 proven. 0 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2019-11-15 21:10:04,717 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830810267] [2019-11-15 21:10:04,717 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:10:04,718 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:10:04,718 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367854696] [2019-11-15 21:10:04,718 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:10:04,719 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:10:04,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:10:04,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:10:04,719 INFO L87 Difference]: Start difference. First operand 8731 states and 13537 transitions. Second operand 4 states. [2019-11-15 21:10:05,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:10:05,283 INFO L93 Difference]: Finished difference Result 18203 states and 28108 transitions. [2019-11-15 21:10:05,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:10:05,284 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 433 [2019-11-15 21:10:05,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:10:05,290 INFO L225 Difference]: With dead ends: 18203 [2019-11-15 21:10:05,291 INFO L226 Difference]: Without dead ends: 9491 [2019-11-15 21:10:05,295 INFO L600 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-15 21:10:05,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9491 states. [2019-11-15 21:10:05,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9491 to 8731. [2019-11-15 21:10:05,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8731 states. [2019-11-15 21:10:05,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8731 states to 8731 states and 13517 transitions. [2019-11-15 21:10:05,501 INFO L78 Accepts]: Start accepts. Automaton has 8731 states and 13517 transitions. Word has length 433 [2019-11-15 21:10:05,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:10:05,502 INFO L462 AbstractCegarLoop]: Abstraction has 8731 states and 13517 transitions. [2019-11-15 21:10:05,502 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:10:05,502 INFO L276 IsEmpty]: Start isEmpty. Operand 8731 states and 13517 transitions. [2019-11-15 21:10:05,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 434 [2019-11-15 21:10:05,508 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:10:05,508 INFO L380 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 12, 12, 12, 11, 11, 10, 10, 9, 9, 8, 8, 8, 8, 7, 6, 6, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 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-15 21:10:05,508 INFO L410 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:10:05,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:10:05,508 INFO L82 PathProgramCache]: Analyzing trace with hash 1891149376, now seen corresponding path program 1 times [2019-11-15 21:10:05,509 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:10:05,509 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928348932] [2019-11-15 21:10:05,509 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:10:05,509 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:10:05,509 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:10:05,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:10:05,736 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 325 proven. 0 refuted. 0 times theorem prover too weak. 1566 trivial. 0 not checked. [2019-11-15 21:10:05,737 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928348932] [2019-11-15 21:10:05,737 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:10:05,737 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:10:05,737 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123360470] [2019-11-15 21:10:05,738 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:10:05,738 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:10:05,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:10:05,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:10:05,738 INFO L87 Difference]: Start difference. First operand 8731 states and 13517 transitions. Second operand 4 states. [2019-11-15 21:10:06,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:10:06,319 INFO L93 Difference]: Finished difference Result 18399 states and 28289 transitions. [2019-11-15 21:10:06,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:10:06,319 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 433 [2019-11-15 21:10:06,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:10:06,329 INFO L225 Difference]: With dead ends: 18399 [2019-11-15 21:10:06,329 INFO L226 Difference]: Without dead ends: 9687 [2019-11-15 21:10:06,335 INFO L600 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-15 21:10:06,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9687 states. [2019-11-15 21:10:06,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9687 to 8731. [2019-11-15 21:10:06,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8731 states. [2019-11-15 21:10:06,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8731 states to 8731 states and 13497 transitions. [2019-11-15 21:10:06,552 INFO L78 Accepts]: Start accepts. Automaton has 8731 states and 13497 transitions. Word has length 433 [2019-11-15 21:10:06,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:10:06,552 INFO L462 AbstractCegarLoop]: Abstraction has 8731 states and 13497 transitions. [2019-11-15 21:10:06,552 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:10:06,552 INFO L276 IsEmpty]: Start isEmpty. Operand 8731 states and 13497 transitions. [2019-11-15 21:10:06,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 435 [2019-11-15 21:10:06,558 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:10:06,559 INFO L380 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 12, 12, 12, 11, 11, 10, 10, 9, 9, 8, 8, 8, 8, 7, 6, 6, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 21:10:06,559 INFO L410 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:10:06,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:10:06,559 INFO L82 PathProgramCache]: Analyzing trace with hash -1745105630, now seen corresponding path program 1 times [2019-11-15 21:10:06,559 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:10:06,559 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770184312] [2019-11-15 21:10:06,559 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:10:06,560 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:10:06,560 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:10:06,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:10:06,818 INFO L134 CoverageAnalysis]: Checked inductivity of 1893 backedges. 327 proven. 0 refuted. 0 times theorem prover too weak. 1566 trivial. 0 not checked. [2019-11-15 21:10:06,818 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770184312] [2019-11-15 21:10:06,818 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:10:06,819 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:10:06,819 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856550694] [2019-11-15 21:10:06,819 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:10:06,820 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:10:06,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:10:06,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:10:06,820 INFO L87 Difference]: Start difference. First operand 8731 states and 13497 transitions. Second operand 4 states. [2019-11-15 21:10:07,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:10:07,570 INFO L93 Difference]: Finished difference Result 18303 states and 28128 transitions. [2019-11-15 21:10:07,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:10:07,571 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 434 [2019-11-15 21:10:07,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:10:07,580 INFO L225 Difference]: With dead ends: 18303 [2019-11-15 21:10:07,580 INFO L226 Difference]: Without dead ends: 9591 [2019-11-15 21:10:07,585 INFO L600 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-15 21:10:07,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9591 states. [2019-11-15 21:10:07,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9591 to 8731. [2019-11-15 21:10:07,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8731 states. [2019-11-15 21:10:07,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8731 states to 8731 states and 13477 transitions. [2019-11-15 21:10:07,792 INFO L78 Accepts]: Start accepts. Automaton has 8731 states and 13477 transitions. Word has length 434 [2019-11-15 21:10:07,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:10:07,792 INFO L462 AbstractCegarLoop]: Abstraction has 8731 states and 13477 transitions. [2019-11-15 21:10:07,792 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:10:07,792 INFO L276 IsEmpty]: Start isEmpty. Operand 8731 states and 13477 transitions. [2019-11-15 21:10:07,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 435 [2019-11-15 21:10:07,798 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:10:07,799 INFO L380 BasicCegarLoop]: trace histogram [14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 11, 11, 10, 10, 9, 9, 8, 8, 8, 8, 7, 6, 6, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 21:10:07,799 INFO L410 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:10:07,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:10:07,799 INFO L82 PathProgramCache]: Analyzing trace with hash 1410848715, now seen corresponding path program 1 times [2019-11-15 21:10:07,799 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:10:07,799 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542506242] [2019-11-15 21:10:07,799 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:10:07,800 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:10:07,800 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:10:07,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:10:08,147 INFO L134 CoverageAnalysis]: Checked inductivity of 1813 backedges. 392 proven. 63 refuted. 0 times theorem prover too weak. 1358 trivial. 0 not checked. [2019-11-15 21:10:08,147 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542506242] [2019-11-15 21:10:08,147 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2129110660] [2019-11-15 21:10:08,148 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ebe9ee3c-7bc0-40c8-b282-fdc47ff043c7/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:10:08,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:10:08,439 INFO L256 TraceCheckSpWp]: Trace formula consists of 1453 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-15 21:10:08,452 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:10:08,468 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2019-11-15 21:10:08,468 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:10:08,472 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:10:08,473 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:10:08,473 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:4 [2019-11-15 21:10:08,478 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_175|, |v_#memory_$Pointer$.offset_161|], 5=[|v_#memory_int_179|]} [2019-11-15 21:10:08,480 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 63 [2019-11-15 21:10:08,480 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:10:08,483 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:10:08,486 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 51 [2019-11-15 21:10:08,486 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:10:08,489 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:10:08,532 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:10:08,532 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 100 treesize of output 141 [2019-11-15 21:10:08,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:10:08,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:10:08,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:10:08,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:10:08,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:10:08,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:10:08,742 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:10:08,742 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: This case should habe been handled by DER at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.classify(DerPreprocessor.java:212) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.classify(DerPreprocessor.java:192) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.(DerPreprocessor.java:95) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:291) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:253) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:256) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:216) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:306) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:245) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:200) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:292) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.tryExecuteInterpolantGenerator(TraceAbstractionRefinementEngine.java:299) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.generateProof(TraceAbstractionRefinementEngine.java:184) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.executeStrategy(TraceAbstractionRefinementEngine.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.RefinementEngineFactory.runRefinementEngine(RefinementEngineFactory.java:124) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-11-15 21:10:08,745 INFO L168 Benchmark]: Toolchain (without parser) took 57713.43 ms. Allocated memory was 1.0 GB in the beginning and 3.3 GB in the end (delta: 2.2 GB). Free memory was 938.0 MB in the beginning and 2.4 GB in the end (delta: -1.4 GB). Peak memory consumption was 810.9 MB. Max. memory is 11.5 GB. [2019-11-15 21:10:08,746 INFO L168 Benchmark]: CDTParser took 0.44 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-15 21:10:08,746 INFO L168 Benchmark]: CACSL2BoogieTranslator took 676.11 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 938.0 MB in the beginning and 1.1 GB in the end (delta: -174.5 MB). Peak memory consumption was 24.0 MB. Max. memory is 11.5 GB. [2019-11-15 21:10:08,746 INFO L168 Benchmark]: Boogie Procedure Inliner took 71.03 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-15 21:10:08,746 INFO L168 Benchmark]: Boogie Preprocessor took 118.63 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-15 21:10:08,747 INFO L168 Benchmark]: RCFGBuilder took 1300.92 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 97.6 MB). Peak memory consumption was 97.6 MB. Max. memory is 11.5 GB. [2019-11-15 21:10:08,747 INFO L168 Benchmark]: TraceAbstraction took 55542.97 ms. Allocated memory was 1.2 GB in the beginning and 3.3 GB in the end (delta: 2.1 GB). Free memory was 1.0 GB in the beginning and 2.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 736.1 MB. Max. memory is 11.5 GB. [2019-11-15 21:10:08,749 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.44 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 676.11 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 938.0 MB in the beginning and 1.1 GB in the end (delta: -174.5 MB). Peak memory consumption was 24.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 71.03 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 118.63 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1300.92 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 97.6 MB). Peak memory consumption was 97.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 55542.97 ms. Allocated memory was 1.2 GB in the beginning and 3.3 GB in the end (delta: 2.1 GB). Free memory was 1.0 GB in the beginning and 2.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 736.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: This case should habe been handled by DER de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: This case should habe been handled by DER: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.classify(DerPreprocessor.java:212) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.24-cad4683 [2019-11-15 21:10:10,909 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 21:10:10,912 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 21:10:10,930 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 21:10:10,931 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 21:10:10,932 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 21:10:10,933 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 21:10:10,935 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 21:10:10,936 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 21:10:10,937 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 21:10:10,937 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 21:10:10,938 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 21:10:10,938 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 21:10:10,939 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 21:10:10,939 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 21:10:10,940 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 21:10:10,941 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 21:10:10,942 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 21:10:10,944 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 21:10:10,946 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 21:10:10,948 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 21:10:10,949 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 21:10:10,950 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 21:10:10,951 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 21:10:10,958 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 21:10:10,958 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 21:10:10,958 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 21:10:10,959 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 21:10:10,960 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 21:10:10,961 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 21:10:10,961 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 21:10:10,962 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 21:10:10,962 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 21:10:10,963 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 21:10:10,963 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 21:10:10,964 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 21:10:10,964 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 21:10:10,964 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 21:10:10,965 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 21:10:10,965 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 21:10:10,966 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 21:10:10,967 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_ebe9ee3c-7bc0-40c8-b282-fdc47ff043c7/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-11-15 21:10:10,987 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 21:10:10,987 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 21:10:10,989 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 21:10:10,989 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 21:10:10,990 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 21:10:10,990 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 21:10:10,990 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 21:10:10,991 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 21:10:10,991 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 21:10:10,991 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 21:10:10,992 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 21:10:10,992 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 21:10:10,993 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-15 21:10:10,993 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-15 21:10:10,993 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 21:10:10,993 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 21:10:10,994 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 21:10:10,994 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 21:10:10,994 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 21:10:10,994 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 21:10:10,994 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 21:10:10,995 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 21:10:10,995 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 21:10:10,995 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 21:10:10,995 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 21:10:10,996 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 21:10:10,996 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-15 21:10:10,996 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-15 21:10:10,996 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 21:10:10,997 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-15 21:10:10,997 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_ebe9ee3c-7bc0-40c8-b282-fdc47ff043c7/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 -> e83cf3c2949f89871817218ec6b0742e2a7cf269 [2019-11-15 21:10:11,035 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 21:10:11,045 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 21:10:11,047 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 21:10:11,048 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 21:10:11,049 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 21:10:11,049 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_ebe9ee3c-7bc0-40c8-b282-fdc47ff043c7/bin/uautomizer/../../sv-benchmarks/c/ssh/s3_srvr.blast.12.i.cil-2.c [2019-11-15 21:10:11,099 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_ebe9ee3c-7bc0-40c8-b282-fdc47ff043c7/bin/uautomizer/data/6f868e1f7/eaf9262d186947fb9373705693f2b6df/FLAG42f12b9f2 [2019-11-15 21:10:11,657 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 21:10:11,658 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_ebe9ee3c-7bc0-40c8-b282-fdc47ff043c7/sv-benchmarks/c/ssh/s3_srvr.blast.12.i.cil-2.c [2019-11-15 21:10:11,684 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_ebe9ee3c-7bc0-40c8-b282-fdc47ff043c7/bin/uautomizer/data/6f868e1f7/eaf9262d186947fb9373705693f2b6df/FLAG42f12b9f2 [2019-11-15 21:10:11,929 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_ebe9ee3c-7bc0-40c8-b282-fdc47ff043c7/bin/uautomizer/data/6f868e1f7/eaf9262d186947fb9373705693f2b6df [2019-11-15 21:10:11,931 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 21:10:11,932 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 21:10:11,933 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 21:10:11,933 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 21:10:11,936 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 21:10:11,937 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 09:10:11" (1/1) ... [2019-11-15 21:10:11,940 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@646439d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:10:11, skipping insertion in model container [2019-11-15 21:10:11,940 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 09:10:11" (1/1) ... [2019-11-15 21:10:11,946 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 21:10:12,019 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 21:10:12,559 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 21:10:12,581 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 21:10:12,771 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 21:10:12,813 INFO L192 MainTranslator]: Completed translation [2019-11-15 21:10:12,814 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:10:12 WrapperNode [2019-11-15 21:10:12,814 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 21:10:12,815 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 21:10:12,815 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 21:10:12,815 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 21:10:12,825 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:10:12" (1/1) ... [2019-11-15 21:10:12,869 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:10:12" (1/1) ... [2019-11-15 21:10:12,928 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 21:10:12,928 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 21:10:12,928 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 21:10:12,928 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 21:10:12,944 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:10:12" (1/1) ... [2019-11-15 21:10:12,945 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:10:12" (1/1) ... [2019-11-15 21:10:12,968 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:10:12" (1/1) ... [2019-11-15 21:10:12,972 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:10:12" (1/1) ... [2019-11-15 21:10:13,019 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:10:12" (1/1) ... [2019-11-15 21:10:13,026 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:10:12" (1/1) ... [2019-11-15 21:10:13,030 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:10:12" (1/1) ... [2019-11-15 21:10:13,036 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 21:10:13,037 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 21:10:13,037 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 21:10:13,037 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 21:10:13,038 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:10:12" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ebe9ee3c-7bc0-40c8-b282-fdc47ff043c7/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-15 21:10:13,093 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-15 21:10:13,093 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 21:10:13,093 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-15 21:10:13,093 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-15 21:10:13,093 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-15 21:10:13,094 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 21:10:13,094 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 21:10:13,094 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-15 21:10:13,368 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-15 21:10:17,567 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2019-11-15 21:10:17,567 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2019-11-15 21:10:17,568 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 21:10:17,568 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-15 21:10:17,569 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:10:17 BoogieIcfgContainer [2019-11-15 21:10:17,570 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 21:10:17,571 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 21:10:17,571 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 21:10:17,575 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 21:10:17,576 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 09:10:11" (1/3) ... [2019-11-15 21:10:17,577 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@785878c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 09:10:17, skipping insertion in model container [2019-11-15 21:10:17,577 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:10:12" (2/3) ... [2019-11-15 21:10:17,579 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@785878c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 09:10:17, skipping insertion in model container [2019-11-15 21:10:17,579 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:10:17" (3/3) ... [2019-11-15 21:10:17,582 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.12.i.cil-2.c [2019-11-15 21:10:17,591 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 21:10:17,601 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-15 21:10:17,608 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-15 21:10:17,629 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 21:10:17,630 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 21:10:17,630 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 21:10:17,630 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 21:10:17,630 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 21:10:17,630 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 21:10:17,631 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 21:10:17,631 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 21:10:17,648 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states. [2019-11-15 21:10:17,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-15 21:10:17,657 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:10:17,658 INFO L380 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] [2019-11-15 21:10:17,659 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:10:17,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:10:17,663 INFO L82 PathProgramCache]: Analyzing trace with hash 557483936, now seen corresponding path program 1 times [2019-11-15 21:10:17,673 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 21:10:17,673 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1855398932] [2019-11-15 21:10:17,674 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ebe9ee3c-7bc0-40c8-b282-fdc47ff043c7/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-15 21:10:17,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:10:17,912 INFO L256 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 21:10:17,926 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:10:17,973 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-15 21:10:17,973 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 21:10:18,017 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-15 21:10:18,018 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1855398932] [2019-11-15 21:10:18,019 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:10:18,020 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-15 21:10:18,020 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813114055] [2019-11-15 21:10:18,025 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:10:18,025 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 21:10:18,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:10:18,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:10:18,042 INFO L87 Difference]: Start difference. First operand 151 states. Second operand 4 states. [2019-11-15 21:10:18,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:10:18,336 INFO L93 Difference]: Finished difference Result 572 states and 981 transitions. [2019-11-15 21:10:18,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:10:18,338 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 42 [2019-11-15 21:10:18,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:10:18,361 INFO L225 Difference]: With dead ends: 572 [2019-11-15 21:10:18,364 INFO L226 Difference]: Without dead ends: 390 [2019-11-15 21:10:18,369 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 80 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-15 21:10:18,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2019-11-15 21:10:18,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 390. [2019-11-15 21:10:18,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2019-11-15 21:10:18,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 596 transitions. [2019-11-15 21:10:18,461 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 596 transitions. Word has length 42 [2019-11-15 21:10:18,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:10:18,462 INFO L462 AbstractCegarLoop]: Abstraction has 390 states and 596 transitions. [2019-11-15 21:10:18,462 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:10:18,462 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 596 transitions. [2019-11-15 21:10:18,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-11-15 21:10:18,474 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:10:18,475 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 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-15 21:10:18,677 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 21:10:18,678 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:10:18,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:10:18,678 INFO L82 PathProgramCache]: Analyzing trace with hash -2090002076, now seen corresponding path program 1 times [2019-11-15 21:10:18,679 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 21:10:18,679 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1884279366] [2019-11-15 21:10:18,679 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ebe9ee3c-7bc0-40c8-b282-fdc47ff043c7/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-15 21:10:18,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:10:18,942 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 21:10:18,947 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:10:18,996 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:10:18,996 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 21:10:19,034 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:10:19,034 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1884279366] [2019-11-15 21:10:19,035 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:10:19,035 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-15 21:10:19,035 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045855013] [2019-11-15 21:10:19,038 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:10:19,038 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 21:10:19,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:10:19,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:10:19,039 INFO L87 Difference]: Start difference. First operand 390 states and 596 transitions. Second operand 4 states. [2019-11-15 21:10:20,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:10:20,474 INFO L93 Difference]: Finished difference Result 895 states and 1386 transitions. [2019-11-15 21:10:20,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:10:20,477 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-11-15 21:10:20,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:10:20,481 INFO L225 Difference]: With dead ends: 895 [2019-11-15 21:10:20,481 INFO L226 Difference]: Without dead ends: 640 [2019-11-15 21:10:20,486 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 200 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-15 21:10:20,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 640 states. [2019-11-15 21:10:20,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 640 to 640. [2019-11-15 21:10:20,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 640 states. [2019-11-15 21:10:20,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 640 states and 974 transitions. [2019-11-15 21:10:20,567 INFO L78 Accepts]: Start accepts. Automaton has 640 states and 974 transitions. Word has length 102 [2019-11-15 21:10:20,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:10:20,567 INFO L462 AbstractCegarLoop]: Abstraction has 640 states and 974 transitions. [2019-11-15 21:10:20,567 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:10:20,568 INFO L276 IsEmpty]: Start isEmpty. Operand 640 states and 974 transitions. [2019-11-15 21:10:20,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-11-15 21:10:20,570 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:10:20,571 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:10:20,773 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 21:10:20,774 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:10:20,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:10:20,774 INFO L82 PathProgramCache]: Analyzing trace with hash -1625612872, now seen corresponding path program 1 times [2019-11-15 21:10:20,775 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 21:10:20,776 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [876428527] [2019-11-15 21:10:20,776 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ebe9ee3c-7bc0-40c8-b282-fdc47ff043c7/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-15 21:10:21,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:10:21,051 INFO L256 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 21:10:21,057 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:10:21,097 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-11-15 21:10:21,098 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 21:10:21,139 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-11-15 21:10:21,139 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [876428527] [2019-11-15 21:10:21,139 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:10:21,140 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-15 21:10:21,140 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11504316] [2019-11-15 21:10:21,141 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:10:21,141 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 21:10:21,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:10:21,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:10:21,142 INFO L87 Difference]: Start difference. First operand 640 states and 974 transitions. Second operand 4 states. [2019-11-15 21:10:21,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:10:21,857 INFO L93 Difference]: Finished difference Result 1398 states and 2145 transitions. [2019-11-15 21:10:21,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:10:21,858 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 165 [2019-11-15 21:10:21,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:10:21,866 INFO L225 Difference]: With dead ends: 1398 [2019-11-15 21:10:21,866 INFO L226 Difference]: Without dead ends: 893 [2019-11-15 21:10:21,870 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 328 GetRequests, 326 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-15 21:10:21,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 893 states. [2019-11-15 21:10:21,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 893 to 893. [2019-11-15 21:10:21,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 893 states. [2019-11-15 21:10:21,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 893 states to 893 states and 1355 transitions. [2019-11-15 21:10:21,913 INFO L78 Accepts]: Start accepts. Automaton has 893 states and 1355 transitions. Word has length 165 [2019-11-15 21:10:21,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:10:21,914 INFO L462 AbstractCegarLoop]: Abstraction has 893 states and 1355 transitions. [2019-11-15 21:10:21,915 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:10:21,915 INFO L276 IsEmpty]: Start isEmpty. Operand 893 states and 1355 transitions. [2019-11-15 21:10:21,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2019-11-15 21:10:21,919 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:10:21,919 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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-15 21:10:22,121 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 21:10:22,124 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:10:22,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:10:22,124 INFO L82 PathProgramCache]: Analyzing trace with hash -1436171483, now seen corresponding path program 1 times [2019-11-15 21:10:22,125 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 21:10:22,126 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1413131344] [2019-11-15 21:10:22,126 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ebe9ee3c-7bc0-40c8-b282-fdc47ff043c7/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-15 21:10:22,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:10:22,446 INFO L256 TraceCheckSpWp]: Trace formula consists of 510 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 21:10:22,453 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:10:22,514 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 292 proven. 0 refuted. 0 times theorem prover too weak. 143 trivial. 0 not checked. [2019-11-15 21:10:22,514 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 21:10:22,591 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 292 proven. 0 refuted. 0 times theorem prover too weak. 143 trivial. 0 not checked. [2019-11-15 21:10:22,591 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1413131344] [2019-11-15 21:10:22,592 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:10:22,592 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-15 21:10:22,592 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793133049] [2019-11-15 21:10:22,593 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:10:22,594 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 21:10:22,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:10:22,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:10:22,594 INFO L87 Difference]: Start difference. First operand 893 states and 1355 transitions. Second operand 4 states. [2019-11-15 21:10:23,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:10:23,479 INFO L93 Difference]: Finished difference Result 1902 states and 2902 transitions. [2019-11-15 21:10:23,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:10:23,480 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 228 [2019-11-15 21:10:23,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:10:23,488 INFO L225 Difference]: With dead ends: 1902 [2019-11-15 21:10:23,488 INFO L226 Difference]: Without dead ends: 1144 [2019-11-15 21:10:23,489 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 454 GetRequests, 452 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-15 21:10:23,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1144 states. [2019-11-15 21:10:23,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1144 to 1144. [2019-11-15 21:10:23,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1144 states. [2019-11-15 21:10:23,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1144 states to 1144 states and 1731 transitions. [2019-11-15 21:10:23,535 INFO L78 Accepts]: Start accepts. Automaton has 1144 states and 1731 transitions. Word has length 228 [2019-11-15 21:10:23,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:10:23,536 INFO L462 AbstractCegarLoop]: Abstraction has 1144 states and 1731 transitions. [2019-11-15 21:10:23,536 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:10:23,536 INFO L276 IsEmpty]: Start isEmpty. Operand 1144 states and 1731 transitions. [2019-11-15 21:10:23,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2019-11-15 21:10:23,541 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:10:23,542 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 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, 1, 1, 1, 1] [2019-11-15 21:10:23,748 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 21:10:23,748 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:10:23,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:10:23,749 INFO L82 PathProgramCache]: Analyzing trace with hash 232931248, now seen corresponding path program 1 times [2019-11-15 21:10:23,749 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 21:10:23,749 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1952045685] [2019-11-15 21:10:23,749 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ebe9ee3c-7bc0-40c8-b282-fdc47ff043c7/bin/uautomizer/cvc4 Starting monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 21:10:24,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:10:24,085 INFO L256 TraceCheckSpWp]: Trace formula consists of 638 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 21:10:24,090 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:10:24,154 INFO L134 CoverageAnalysis]: Checked inductivity of 762 backedges. 468 proven. 0 refuted. 0 times theorem prover too weak. 294 trivial. 0 not checked. [2019-11-15 21:10:24,155 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 21:10:24,230 INFO L134 CoverageAnalysis]: Checked inductivity of 762 backedges. 468 proven. 0 refuted. 0 times theorem prover too weak. 294 trivial. 0 not checked. [2019-11-15 21:10:24,230 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1952045685] [2019-11-15 21:10:24,230 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:10:24,231 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-15 21:10:24,231 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507151251] [2019-11-15 21:10:24,232 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:10:24,232 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 21:10:24,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:10:24,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:10:24,233 INFO L87 Difference]: Start difference. First operand 1144 states and 1731 transitions. Second operand 4 states. [2019-11-15 21:10:24,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:10:24,914 INFO L93 Difference]: Finished difference Result 2407 states and 3656 transitions. [2019-11-15 21:10:24,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:10:24,915 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 292 [2019-11-15 21:10:24,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:10:24,924 INFO L225 Difference]: With dead ends: 2407 [2019-11-15 21:10:24,924 INFO L226 Difference]: Without dead ends: 1398 [2019-11-15 21:10:24,926 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 582 GetRequests, 580 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-15 21:10:24,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1398 states. [2019-11-15 21:10:24,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1398 to 1398. [2019-11-15 21:10:24,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1398 states. [2019-11-15 21:10:24,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1398 states to 1398 states and 2109 transitions. [2019-11-15 21:10:24,984 INFO L78 Accepts]: Start accepts. Automaton has 1398 states and 2109 transitions. Word has length 292 [2019-11-15 21:10:24,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:10:24,985 INFO L462 AbstractCegarLoop]: Abstraction has 1398 states and 2109 transitions. [2019-11-15 21:10:24,985 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:10:24,986 INFO L276 IsEmpty]: Start isEmpty. Operand 1398 states and 2109 transitions. [2019-11-15 21:10:24,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 357 [2019-11-15 21:10:24,994 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:10:24,994 INFO L380 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 9, 9, 8, 8, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:10:25,196 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 21:10:25,197 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:10:25,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:10:25,198 INFO L82 PathProgramCache]: Analyzing trace with hash 303911324, now seen corresponding path program 1 times [2019-11-15 21:10:25,198 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 21:10:25,199 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1408675164] [2019-11-15 21:10:25,199 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ebe9ee3c-7bc0-40c8-b282-fdc47ff043c7/bin/uautomizer/cvc4 Starting monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 21:10:25,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:10:25,612 INFO L256 TraceCheckSpWp]: Trace formula consists of 774 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 21:10:25,618 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:10:25,703 INFO L134 CoverageAnalysis]: Checked inductivity of 1186 backedges. 696 proven. 0 refuted. 0 times theorem prover too weak. 490 trivial. 0 not checked. [2019-11-15 21:10:25,704 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 21:10:25,790 INFO L134 CoverageAnalysis]: Checked inductivity of 1186 backedges. 696 proven. 0 refuted. 0 times theorem prover too weak. 490 trivial. 0 not checked. [2019-11-15 21:10:25,791 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1408675164] [2019-11-15 21:10:25,791 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:10:25,791 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-15 21:10:25,791 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326149648] [2019-11-15 21:10:25,792 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:10:25,792 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 21:10:25,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:10:25,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:10:25,793 INFO L87 Difference]: Start difference. First operand 1398 states and 2109 transitions. Second operand 4 states. [2019-11-15 21:10:26,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:10:26,190 INFO L93 Difference]: Finished difference Result 2912 states and 4405 transitions. [2019-11-15 21:10:26,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:10:26,190 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 356 [2019-11-15 21:10:26,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:10:26,200 INFO L225 Difference]: With dead ends: 2912 [2019-11-15 21:10:26,200 INFO L226 Difference]: Without dead ends: 1649 [2019-11-15 21:10:26,202 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 710 GetRequests, 708 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-15 21:10:26,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1649 states. [2019-11-15 21:10:26,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1649 to 1649. [2019-11-15 21:10:26,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1649 states. [2019-11-15 21:10:26,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1649 states to 1649 states and 2481 transitions. [2019-11-15 21:10:26,273 INFO L78 Accepts]: Start accepts. Automaton has 1649 states and 2481 transitions. Word has length 356 [2019-11-15 21:10:26,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:10:26,274 INFO L462 AbstractCegarLoop]: Abstraction has 1649 states and 2481 transitions. [2019-11-15 21:10:26,274 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:10:26,274 INFO L276 IsEmpty]: Start isEmpty. Operand 1649 states and 2481 transitions. [2019-11-15 21:10:26,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 391 [2019-11-15 21:10:26,281 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:10:26,282 INFO L380 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 10, 10, 9, 9, 8, 8, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 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, 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-15 21:10:26,484 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 21:10:26,484 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:10:26,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:10:26,485 INFO L82 PathProgramCache]: Analyzing trace with hash 803618532, now seen corresponding path program 1 times [2019-11-15 21:10:26,486 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 21:10:26,486 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [2098665399] [2019-11-15 21:10:26,486 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ebe9ee3c-7bc0-40c8-b282-fdc47ff043c7/bin/uautomizer/cvc4 Starting monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 21:10:31,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:10:31,101 INFO L256 TraceCheckSpWp]: Trace formula consists of 841 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-15 21:10:31,110 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:10:31,187 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-15 21:10:31,188 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:10:31,196 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:10:31,197 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:10:31,197 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2019-11-15 21:10:31,233 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:10:31,234 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2019-11-15 21:10:31,235 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:10:31,246 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:10:31,247 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:10:31,247 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2019-11-15 21:10:31,282 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:10:31,283 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2019-11-15 21:10:31,283 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:10:31,285 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:10:31,285 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:10:31,285 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:5 [2019-11-15 21:10:31,481 INFO L134 CoverageAnalysis]: Checked inductivity of 1445 backedges. 717 proven. 0 refuted. 0 times theorem prover too weak. 728 trivial. 0 not checked. [2019-11-15 21:10:31,481 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 21:10:31,640 INFO L134 CoverageAnalysis]: Checked inductivity of 1445 backedges. 717 proven. 0 refuted. 0 times theorem prover too weak. 728 trivial. 0 not checked. [2019-11-15 21:10:31,641 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2098665399] [2019-11-15 21:10:31,641 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:10:31,641 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6, 4] imperfect sequences [] total 8 [2019-11-15 21:10:31,641 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901186324] [2019-11-15 21:10:31,642 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 21:10:31,642 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 21:10:31,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 21:10:31,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-15 21:10:31,642 INFO L87 Difference]: Start difference. First operand 1649 states and 2481 transitions. Second operand 8 states. [2019-11-15 21:10:46,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:10:46,823 INFO L93 Difference]: Finished difference Result 7367 states and 11142 transitions. [2019-11-15 21:10:46,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 21:10:46,828 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 390 [2019-11-15 21:10:46,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:10:46,860 INFO L225 Difference]: With dead ends: 7367 [2019-11-15 21:10:46,860 INFO L226 Difference]: Without dead ends: 5726 [2019-11-15 21:10:46,866 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 783 GetRequests, 772 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2019-11-15 21:10:46,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5726 states. [2019-11-15 21:10:46,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5726 to 2205. [2019-11-15 21:10:46,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2205 states. [2019-11-15 21:10:46,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2205 states to 2205 states and 3492 transitions. [2019-11-15 21:10:46,996 INFO L78 Accepts]: Start accepts. Automaton has 2205 states and 3492 transitions. Word has length 390 [2019-11-15 21:10:46,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:10:46,997 INFO L462 AbstractCegarLoop]: Abstraction has 2205 states and 3492 transitions. [2019-11-15 21:10:46,997 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 21:10:46,997 INFO L276 IsEmpty]: Start isEmpty. Operand 2205 states and 3492 transitions. [2019-11-15 21:10:47,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 391 [2019-11-15 21:10:47,006 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:10:47,006 INFO L380 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 10, 10, 9, 9, 8, 8, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 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, 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-15 21:10:47,227 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 21:10:47,227 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:10:47,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:10:47,227 INFO L82 PathProgramCache]: Analyzing trace with hash 1750656418, now seen corresponding path program 1 times [2019-11-15 21:10:47,229 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 21:10:47,229 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [399519201] [2019-11-15 21:10:47,229 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ebe9ee3c-7bc0-40c8-b282-fdc47ff043c7/bin/uautomizer/cvc4 Starting monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 21:10:58,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:10:58,250 INFO L256 TraceCheckSpWp]: Trace formula consists of 841 conjuncts, 61 conjunts are in the unsatisfiable core [2019-11-15 21:10:58,262 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:10:58,659 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-11-15 21:10:58,659 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:11:00,102 WARN L191 SmtUtils]: Spent 1.44 s on a formula simplification that was a NOOP. DAG size: 68 [2019-11-15 21:11:00,102 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:11:00,107 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_211|, |v_#memory_$Pointer$.offset_211|], 2=[|v_#memory_$Pointer$.offset_205|, |v_#memory_$Pointer$.offset_206|, |v_#memory_$Pointer$.base_206|, |v_#memory_$Pointer$.base_205|]} [2019-11-15 21:11:00,346 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:11:00,394 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:11:00,461 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:11:00,548 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:11:00,593 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:11:00,661 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:11:00,732 INFO L235 Elim1Store]: Index analysis took 487 ms [2019-11-15 21:11:01,085 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2019-11-15 21:11:01,086 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:11:02,115 WARN L191 SmtUtils]: Spent 1.03 s on a formula simplification that was a NOOP. DAG size: 65 [2019-11-15 21:11:02,115 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:11:02,172 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:11:02,208 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:11:02,234 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:11:02,265 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:11:02,274 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:11:02,293 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:11:02,323 INFO L235 Elim1Store]: Index analysis took 167 ms [2019-11-15 21:11:02,455 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2019-11-15 21:11:02,455 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 21:11:03,098 WARN L191 SmtUtils]: Spent 642.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2019-11-15 21:11:03,098 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:11:03,111 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:11:03,482 WARN L191 SmtUtils]: Spent 371.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2019-11-15 21:11:03,483 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:11:03,499 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:11:03,504 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:11:03,510 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:11:03,520 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:11:03,528 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:11:03,534 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:11:03,543 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:11:03,548 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:11:03,553 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:11:03,557 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:11:03,558 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 11 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 46 [2019-11-15 21:11:03,559 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-15 21:11:03,720 WARN L191 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2019-11-15 21:11:03,720 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:11:03,727 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:11:03,729 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:11:03,730 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:11:03,731 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:11:03,733 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:11:03,734 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:11:03,747 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 37 [2019-11-15 21:11:03,747 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-15 21:11:03,810 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:11:03,825 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:11:03,826 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:11:03,832 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:11:03,833 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:11:03,834 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:11:03,835 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:11:03,836 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 37 [2019-11-15 21:11:03,837 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-15 21:11:03,871 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:11:03,871 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, 6 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:11:03,872 INFO L221 ElimStorePlain]: Needed 8 recursive calls to eliminate 12 variables, input treesize:156, output treesize:23 [2019-11-15 21:11:03,896 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:11:03,897 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2019-11-15 21:11:03,897 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:11:03,918 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:11:03,922 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:11:03,922 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2019-11-15 21:11:03,923 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:11:03,930 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:11:03,930 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:11:03,930 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:61, output treesize:23 [2019-11-15 21:11:03,948 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:11:03,949 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2019-11-15 21:11:03,949 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:11:03,968 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:11:03,973 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:11:03,974 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2019-11-15 21:11:03,974 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:11:03,992 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:11:03,993 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:11:03,993 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:61, output treesize:23 [2019-11-15 21:11:04,027 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:11:04,048 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2019-11-15 21:11:04,048 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:11:04,115 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:11:04,126 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:11:04,127 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2019-11-15 21:11:04,127 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:11:04,163 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:11:04,166 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:11:04,195 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:11:04,198 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:11:04,199 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:11:04,200 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:11:04,201 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 23 [2019-11-15 21:11:04,201 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-15 21:11:04,216 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:11:04,216 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:11:04,216 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:99, output treesize:23 [2019-11-15 21:11:04,255 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:11:04,255 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2019-11-15 21:11:04,256 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:11:04,312 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:11:04,318 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:11:04,319 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2019-11-15 21:11:04,319 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:11:04,340 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:11:04,344 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:11:04,345 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2019-11-15 21:11:04,345 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 21:11:04,357 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:11:04,358 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:11:04,358 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:84, output treesize:42 [2019-11-15 21:11:04,384 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_216|, |v_#memory_$Pointer$.base_216|], 6=[|v_#memory_int_228|]} [2019-11-15 21:11:04,401 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:11:04,402 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2019-11-15 21:11:04,402 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:11:04,453 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:11:04,459 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:11:04,459 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2019-11-15 21:11:04,460 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:11:04,483 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:11:04,487 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:11:04,488 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:11:04,489 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:11:04,489 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 35 [2019-11-15 21:11:04,490 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 21:11:04,512 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:11:04,513 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:11:04,513 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:93, output treesize:51 [2019-11-15 21:11:04,548 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_217|, |v_#memory_$Pointer$.base_208|, |v_#memory_$Pointer$.offset_208|, |v_#memory_$Pointer$.base_217|], 18=[|v_#memory_int_229|]} [2019-11-15 21:11:04,620 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:11:04,695 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2019-11-15 21:11:04,696 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:11:05,081 WARN L191 SmtUtils]: Spent 385.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2019-11-15 21:11:05,082 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:11:05,089 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:11:05,338 WARN L191 SmtUtils]: Spent 249.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2019-11-15 21:11:05,339 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:11:05,365 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:11:05,366 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2019-11-15 21:11:05,367 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 21:11:05,473 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2019-11-15 21:11:05,474 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:11:05,488 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:11:05,492 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:11:05,495 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:11:05,496 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 23 [2019-11-15 21:11:05,496 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-15 21:11:05,545 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:11:05,549 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:11:05,550 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:11:05,551 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:11:05,552 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 38 [2019-11-15 21:11:05,553 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-15 21:11:05,594 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:11:05,595 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:11:05,595 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:145, output treesize:51 [2019-11-15 21:11:05,664 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_218|, |v_#memory_$Pointer$.base_218|], 12=[|v_#memory_int_230|]} [2019-11-15 21:11:05,672 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 139 treesize of output 105 [2019-11-15 21:11:05,673 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:11:05,731 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:11:05,736 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:11:05,736 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 63 [2019-11-15 21:11:05,737 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:11:05,780 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:11:05,784 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:11:05,785 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:11:05,785 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:11:05,786 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 59 [2019-11-15 21:11:05,787 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 21:11:05,807 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:11:05,807 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:11:05,807 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:180, output treesize:72 [2019-11-15 21:11:05,854 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_209|, |v_#memory_$Pointer$.base_219|, |v_#memory_$Pointer$.offset_219|, |v_#memory_$Pointer$.offset_209|], 28=[|v_#memory_int_231|]} [2019-11-15 21:11:05,869 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:11:06,422 WARN L191 SmtUtils]: Spent 552.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2019-11-15 21:11:06,422 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:11:06,457 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:11:06,464 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:11:06,472 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:11:06,473 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 38 [2019-11-15 21:11:06,473 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:11:06,649 WARN L191 SmtUtils]: Spent 175.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2019-11-15 21:11:06,649 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:11:06,665 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:11:06,676 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 28 [2019-11-15 21:11:06,677 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 21:11:06,768 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:11:06,778 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:11:06,779 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2019-11-15 21:11:06,779 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-15 21:11:06,837 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:11:06,844 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:11:06,845 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:11:06,846 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:11:06,847 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 56 [2019-11-15 21:11:06,847 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-15 21:11:06,872 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:11:06,872 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:11:06,872 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:166, output treesize:64 [2019-11-15 21:11:06,917 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_220|, |v_#memory_$Pointer$.base_220|], 20=[|v_#memory_int_232|]} [2019-11-15 21:11:06,923 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 139 treesize of output 105 [2019-11-15 21:11:06,924 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:11:06,973 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:11:06,977 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:11:06,978 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 70 [2019-11-15 21:11:06,978 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:11:07,014 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:11:07,018 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:11:07,018 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:11:07,019 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:11:07,020 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:11:07,021 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 75 [2019-11-15 21:11:07,022 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 21:11:07,047 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:11:07,047 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:11:07,047 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:193, output treesize:87 [2019-11-15 21:11:07,097 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_210|, |v_#memory_$Pointer$.offset_221|, |v_#memory_$Pointer$.base_210|, |v_#memory_$Pointer$.base_221|], 50=[|v_#memory_int_233|]} [2019-11-15 21:11:07,108 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:11:07,425 WARN L191 SmtUtils]: Spent 316.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2019-11-15 21:11:07,425 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:11:07,431 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 152 treesize of output 144 [2019-11-15 21:11:07,436 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:11:07,440 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:11:07,443 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 134 treesize of output 118 [2019-11-15 21:11:07,443 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 21:11:07,501 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:11:07,502 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:11:07,822 WARN L191 SmtUtils]: Spent 320.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2019-11-15 21:11:07,823 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:11:07,825 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:11:07,961 WARN L191 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2019-11-15 21:11:07,961 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:11:07,966 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 154 treesize of output 140 [2019-11-15 21:11:07,969 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:11:07,973 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:11:07,975 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 92 [2019-11-15 21:11:07,976 INFO L496 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:11:08,055 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:11:08,056 INFO L496 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:11:08,222 WARN L191 SmtUtils]: Spent 166.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2019-11-15 21:11:08,223 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:11:08,226 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:11:08,227 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:11:08,228 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:11:08,230 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 69 [2019-11-15 21:11:08,231 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-15 21:11:08,257 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:11:08,258 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:11:08,258 INFO L221 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:236, output treesize:61 [2019-11-15 21:11:08,985 INFO L134 CoverageAnalysis]: Checked inductivity of 1445 backedges. 798 proven. 150 refuted. 0 times theorem prover too weak. 497 trivial. 0 not checked. [2019-11-15 21:11:08,986 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 21:11:09,156 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:11:09,183 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:11:09,185 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:11:09,216 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:11:09,216 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 21:11:09,216 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:169, output treesize:157 [2019-11-15 21:11:09,308 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:11:09,386 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:11:09,388 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:11:09,502 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2019-11-15 21:11:09,502 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:11:09,503 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-15 21:11:09,503 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:481, output treesize:549 [2019-11-15 21:11:09,793 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_209|, |v_#memory_$Pointer$.offset_209|], 6=[|v_#memory_$Pointer$.base_234|, |v_#memory_$Pointer$.offset_234|]} [2019-11-15 21:11:09,834 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:11:10,503 WARN L191 SmtUtils]: Spent 669.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-11-15 21:11:10,504 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:11:10,521 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:11:10,792 WARN L191 SmtUtils]: Spent 270.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2019-11-15 21:11:10,792 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:11:10,796 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:11:11,152 WARN L191 SmtUtils]: Spent 355.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2019-11-15 21:11:11,152 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:11:11,157 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:11:11,333 WARN L191 SmtUtils]: Spent 175.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2019-11-15 21:11:11,333 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:11:11,334 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-2 vars, End of recursive call: 8 dim-0 vars, and 1 xjuncts. [2019-11-15 21:11:11,334 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:869, output treesize:1391 [2019-11-15 21:11:12,888 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:11:13,048 WARN L191 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2019-11-15 21:11:13,049 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:11:13,051 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:11:13,168 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2019-11-15 21:11:13,168 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:11:13,169 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-11-15 21:11:13,169 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:1097, output treesize:2509 [2019-11-15 21:11:17,473 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_208|, |v_#memory_$Pointer$.offset_208|], 19=[|v_#memory_$Pointer$.offset_236|, |v_#memory_$Pointer$.base_236|]} [2019-11-15 21:11:17,533 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:11:18,891 WARN L191 SmtUtils]: Spent 1.36 s on a formula simplification that was a NOOP. DAG size: 104 [2019-11-15 21:11:18,891 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:11:18,922 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:11:20,240 WARN L191 SmtUtils]: Spent 1.32 s on a formula simplification that was a NOOP. DAG size: 99 [2019-11-15 21:11:20,240 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:11:20,245 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:11:20,900 WARN L191 SmtUtils]: Spent 655.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2019-11-15 21:11:20,901 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:11:20,905 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:11:21,170 WARN L191 SmtUtils]: Spent 264.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2019-11-15 21:11:21,171 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:11:21,171 INFO L496 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 4 dim-2 vars, End of recursive call: 10 dim-0 vars, and 1 xjuncts. [2019-11-15 21:11:21,171 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 10 variables, input treesize:3069, output treesize:6709 [2019-11-15 21:11:28,617 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 21:11:28,617 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.NullPointerException at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder$MyWalker.walk(ArrayOccurrenceAnalysis.java:277) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive$TermWalker.walk(NonRecursive.java:139) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder$MyWalker.walk(ArrayOccurrenceAnalysis.java:195) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder.(ArrayOccurrenceAnalysis.java:181) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis.(ArrayOccurrenceAnalysis.java:83) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis.downgradeDimensionsIfNecessary(ArrayOccurrenceAnalysis.java:171) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayIndexBasedCostEstimation.computeCostEstimation(ArrayIndexBasedCostEstimation.java:132) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayIndexBasedCostEstimation.(ArrayIndexBasedCostEstimation.java:64) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.computeCostEstimation(ElimStorePlain.java:519) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:390) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:216) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:306) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:245) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:418) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:290) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:335) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.checkFeasibility(TraceAbstractionRefinementEngine.java:244) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.executeStrategy(TraceAbstractionRefinementEngine.java:160) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.RefinementEngineFactory.runRefinementEngine(RefinementEngineFactory.java:124) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-11-15 21:11:28,621 INFO L168 Benchmark]: Toolchain (without parser) took 76689.33 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 460.8 MB). Free memory was 942.9 MB in the beginning and 1.2 GB in the end (delta: -212.5 MB). Peak memory consumption was 248.4 MB. Max. memory is 11.5 GB. [2019-11-15 21:11:28,622 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 1.0 GB. Free memory is still 977.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 21:11:28,622 INFO L168 Benchmark]: CACSL2BoogieTranslator took 881.58 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 159.4 MB). Free memory was 942.9 MB in the beginning and 1.1 GB in the end (delta: -184.0 MB). Peak memory consumption was 31.8 MB. Max. memory is 11.5 GB. [2019-11-15 21:11:28,622 INFO L168 Benchmark]: Boogie Procedure Inliner took 112.76 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 21:11:28,623 INFO L168 Benchmark]: Boogie Preprocessor took 108.39 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.3 MB). Peak memory consumption was 6.3 MB. Max. memory is 11.5 GB. [2019-11-15 21:11:28,623 INFO L168 Benchmark]: RCFGBuilder took 4533.06 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: 99.4 MB). Peak memory consumption was 99.4 MB. Max. memory is 11.5 GB. [2019-11-15 21:11:28,623 INFO L168 Benchmark]: TraceAbstraction took 71049.60 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 301.5 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -134.2 MB). Peak memory consumption was 167.2 MB. Max. memory is 11.5 GB. [2019-11-15 21:11:28,625 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.24 ms. Allocated memory is still 1.0 GB. Free memory is still 977.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 881.58 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 159.4 MB). Free memory was 942.9 MB in the beginning and 1.1 GB in the end (delta: -184.0 MB). Peak memory consumption was 31.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 112.76 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 108.39 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.3 MB). Peak memory consumption was 6.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 4533.06 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: 99.4 MB). Peak memory consumption was 99.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 71049.60 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 301.5 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -134.2 MB). Peak memory consumption was 167.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: NullPointerException: null de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: NullPointerException: null: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder$MyWalker.walk(ArrayOccurrenceAnalysis.java:277) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...