./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/openssl/s3_srvr.blast.07.i.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a4ecdabc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_42dd8acb-5f7c-4b36-90da-de8d148c03f2/bin/uautomizer/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_42dd8acb-5f7c-4b36-90da-de8d148c03f2/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_42dd8acb-5f7c-4b36-90da-de8d148c03f2/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_42dd8acb-5f7c-4b36-90da-de8d148c03f2/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/openssl/s3_srvr.blast.07.i.cil-2.c -s /tmp/vcloud-vcloud-master/worker/run_dir_42dd8acb-5f7c-4b36-90da-de8d148c03f2/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_42dd8acb-5f7c-4b36-90da-de8d148c03f2/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 067932990963acfd6ba0f96c79e6e2b99ade7977 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_42dd8acb-5f7c-4b36-90da-de8d148c03f2/bin/uautomizer/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_42dd8acb-5f7c-4b36-90da-de8d148c03f2/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_42dd8acb-5f7c-4b36-90da-de8d148c03f2/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_42dd8acb-5f7c-4b36-90da-de8d148c03f2/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/openssl/s3_srvr.blast.07.i.cil-2.c -s /tmp/vcloud-vcloud-master/worker/run_dir_42dd8acb-5f7c-4b36-90da-de8d148c03f2/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_42dd8acb-5f7c-4b36-90da-de8d148c03f2/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 067932990963acfd6ba0f96c79e6e2b99ade7977 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.2.0-a4ecdab [2020-11-29 18:31:22,905 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-29 18:31:22,908 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-29 18:31:22,962 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-29 18:31:22,964 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-29 18:31:22,970 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-29 18:31:22,973 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-29 18:31:22,982 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-29 18:31:22,985 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-29 18:31:22,995 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-29 18:31:22,996 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-29 18:31:22,999 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-29 18:31:23,000 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-29 18:31:23,004 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-29 18:31:23,006 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-29 18:31:23,009 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-29 18:31:23,011 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-29 18:31:23,014 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-29 18:31:23,021 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-29 18:31:23,024 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-29 18:31:23,027 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-29 18:31:23,028 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-29 18:31:23,030 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-29 18:31:23,031 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-29 18:31:23,036 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-29 18:31:23,036 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-29 18:31:23,037 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-29 18:31:23,038 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-29 18:31:23,039 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-29 18:31:23,041 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-29 18:31:23,041 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-29 18:31:23,042 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-29 18:31:23,044 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-29 18:31:23,045 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-29 18:31:23,047 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-29 18:31:23,047 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-29 18:31:23,048 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-29 18:31:23,049 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-29 18:31:23,049 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-29 18:31:23,051 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-29 18:31:23,052 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-29 18:31:23,053 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_42dd8acb-5f7c-4b36-90da-de8d148c03f2/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-11-29 18:31:23,088 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-29 18:31:23,089 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-29 18:31:23,090 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-29 18:31:23,091 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-29 18:31:23,091 INFO L138 SettingsManager]: * Use SBE=true [2020-11-29 18:31:23,091 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-29 18:31:23,092 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-29 18:31:23,092 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-29 18:31:23,093 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-29 18:31:23,093 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-29 18:31:23,093 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-29 18:31:23,094 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-29 18:31:23,094 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-29 18:31:23,095 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-29 18:31:23,095 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-29 18:31:23,095 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-29 18:31:23,096 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-29 18:31:23,096 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-29 18:31:23,096 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-29 18:31:23,097 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-29 18:31:23,097 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-29 18:31:23,097 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-29 18:31:23,098 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-29 18:31:23,098 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-29 18:31:23,099 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-29 18:31:23,099 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-29 18:31:23,099 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-29 18:31:23,100 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-29 18:31:23,100 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-29 18:31:23,100 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud-vcloud-master/worker/run_dir_42dd8acb-5f7c-4b36-90da-de8d148c03f2/bin/uautomizer/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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_42dd8acb-5f7c-4b36-90da-de8d148c03f2/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(reach_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 -> 067932990963acfd6ba0f96c79e6e2b99ade7977 [2020-11-29 18:31:23,399 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-29 18:31:23,450 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-29 18:31:23,455 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-29 18:31:23,457 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-29 18:31:23,460 INFO L275 PluginConnector]: CDTParser initialized [2020-11-29 18:31:23,461 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_42dd8acb-5f7c-4b36-90da-de8d148c03f2/bin/uautomizer/../../sv-benchmarks/c/openssl/s3_srvr.blast.07.i.cil-2.c [2020-11-29 18:31:23,555 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_42dd8acb-5f7c-4b36-90da-de8d148c03f2/bin/uautomizer/data/53e803413/746ae631954d4ce493ddc7e3019b3100/FLAGcdf2eab45 [2020-11-29 18:31:24,293 INFO L306 CDTParser]: Found 1 translation units. [2020-11-29 18:31:24,293 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_42dd8acb-5f7c-4b36-90da-de8d148c03f2/sv-benchmarks/c/openssl/s3_srvr.blast.07.i.cil-2.c [2020-11-29 18:31:24,340 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_42dd8acb-5f7c-4b36-90da-de8d148c03f2/bin/uautomizer/data/53e803413/746ae631954d4ce493ddc7e3019b3100/FLAGcdf2eab45 [2020-11-29 18:31:24,406 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_42dd8acb-5f7c-4b36-90da-de8d148c03f2/bin/uautomizer/data/53e803413/746ae631954d4ce493ddc7e3019b3100 [2020-11-29 18:31:24,409 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-29 18:31:24,411 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-11-29 18:31:24,417 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-29 18:31:24,418 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-29 18:31:24,421 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-29 18:31:24,423 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 06:31:24" (1/1) ... [2020-11-29 18:31:24,425 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@579c9ba6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:31:24, skipping insertion in model container [2020-11-29 18:31:24,425 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 06:31:24" (1/1) ... [2020-11-29 18:31:24,432 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-29 18:31:24,528 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-29 18:31:25,019 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-29 18:31:25,043 INFO L203 MainTranslator]: Completed pre-run [2020-11-29 18:31:25,215 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-29 18:31:25,240 INFO L208 MainTranslator]: Completed translation [2020-11-29 18:31:25,246 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:31:25 WrapperNode [2020-11-29 18:31:25,248 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-29 18:31:25,250 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-29 18:31:25,250 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-29 18:31:25,250 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-29 18:31:25,260 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:31:25" (1/1) ... [2020-11-29 18:31:25,310 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:31:25" (1/1) ... [2020-11-29 18:31:25,442 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-29 18:31:25,452 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-29 18:31:25,454 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-29 18:31:25,454 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-29 18:31:25,465 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:31:25" (1/1) ... [2020-11-29 18:31:25,466 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:31:25" (1/1) ... [2020-11-29 18:31:25,502 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:31:25" (1/1) ... [2020-11-29 18:31:25,502 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:31:25" (1/1) ... [2020-11-29 18:31:25,583 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:31:25" (1/1) ... [2020-11-29 18:31:25,606 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:31:25" (1/1) ... [2020-11-29 18:31:25,617 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:31:25" (1/1) ... [2020-11-29 18:31:25,631 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-29 18:31:25,637 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-29 18:31:25,637 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-29 18:31:25,637 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-29 18:31:25,639 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:31:25" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_42dd8acb-5f7c-4b36-90da-de8d148c03f2/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 [2020-11-29 18:31:25,722 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-11-29 18:31:25,722 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-29 18:31:25,722 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-29 18:31:25,722 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-11-29 18:31:25,723 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-11-29 18:31:25,723 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-29 18:31:25,723 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-11-29 18:31:25,723 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-29 18:31:25,724 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-29 18:31:26,217 WARN L798 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2020-11-29 18:31:27,418 INFO L751 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2020-11-29 18:31:27,418 INFO L751 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2020-11-29 18:31:27,430 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-29 18:31:27,430 INFO L298 CfgBuilder]: Removed 9 assume(true) statements. [2020-11-29 18:31:27,433 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 06:31:27 BoogieIcfgContainer [2020-11-29 18:31:27,433 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-29 18:31:27,435 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-29 18:31:27,435 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-29 18:31:27,439 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-29 18:31:27,439 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 06:31:24" (1/3) ... [2020-11-29 18:31:27,440 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46645948 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 06:31:27, skipping insertion in model container [2020-11-29 18:31:27,441 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:31:25" (2/3) ... [2020-11-29 18:31:27,441 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46645948 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 06:31:27, skipping insertion in model container [2020-11-29 18:31:27,441 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 06:31:27" (3/3) ... [2020-11-29 18:31:27,443 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.07.i.cil-2.c [2020-11-29 18:31:27,457 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-29 18:31:27,462 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-11-29 18:31:27,476 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-11-29 18:31:27,522 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-29 18:31:27,522 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-29 18:31:27,523 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-29 18:31:27,523 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-29 18:31:27,523 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-29 18:31:27,523 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-29 18:31:27,524 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-29 18:31:27,524 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-29 18:31:27,550 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states. [2020-11-29 18:31:27,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-11-29 18:31:27,567 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 18:31:27,576 INFO L422 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] [2020-11-29 18:31:27,577 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 18:31:27,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 18:31:27,584 INFO L82 PathProgramCache]: Analyzing trace with hash -2031756973, now seen corresponding path program 1 times [2020-11-29 18:31:27,595 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 18:31:27,596 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109620411] [2020-11-29 18:31:27,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 18:31:27,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:31:28,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 18:31:28,023 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109620411] [2020-11-29 18:31:28,024 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 18:31:28,025 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-29 18:31:28,025 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290893440] [2020-11-29 18:31:28,030 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-29 18:31:28,031 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 18:31:28,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-29 18:31:28,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-29 18:31:28,049 INFO L87 Difference]: Start difference. First operand 149 states. Second operand 4 states. [2020-11-29 18:31:28,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 18:31:28,755 INFO L93 Difference]: Finished difference Result 324 states and 548 transitions. [2020-11-29 18:31:28,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-29 18:31:28,758 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2020-11-29 18:31:28,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 18:31:28,790 INFO L225 Difference]: With dead ends: 324 [2020-11-29 18:31:28,790 INFO L226 Difference]: Without dead ends: 163 [2020-11-29 18:31:28,794 INFO L677 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 [2020-11-29 18:31:28,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2020-11-29 18:31:28,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 146. [2020-11-29 18:31:28,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2020-11-29 18:31:28,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 226 transitions. [2020-11-29 18:31:28,880 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 226 transitions. Word has length 35 [2020-11-29 18:31:28,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 18:31:28,880 INFO L481 AbstractCegarLoop]: Abstraction has 146 states and 226 transitions. [2020-11-29 18:31:28,881 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-29 18:31:28,881 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 226 transitions. [2020-11-29 18:31:28,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2020-11-29 18:31:28,886 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 18:31:28,887 INFO L422 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] [2020-11-29 18:31:28,887 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-29 18:31:28,887 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 18:31:28,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 18:31:28,891 INFO L82 PathProgramCache]: Analyzing trace with hash 972749596, now seen corresponding path program 1 times [2020-11-29 18:31:28,891 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 18:31:28,892 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487227427] [2020-11-29 18:31:28,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 18:31:28,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:31:29,086 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 18:31:29,087 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487227427] [2020-11-29 18:31:29,087 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 18:31:29,087 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-29 18:31:29,088 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515715822] [2020-11-29 18:31:29,089 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-29 18:31:29,089 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 18:31:29,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-29 18:31:29,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-29 18:31:29,091 INFO L87 Difference]: Start difference. First operand 146 states and 226 transitions. Second operand 4 states. [2020-11-29 18:31:29,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 18:31:29,624 INFO L93 Difference]: Finished difference Result 290 states and 443 transitions. [2020-11-29 18:31:29,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-29 18:31:29,625 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 48 [2020-11-29 18:31:29,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 18:31:29,627 INFO L225 Difference]: With dead ends: 290 [2020-11-29 18:31:29,627 INFO L226 Difference]: Without dead ends: 163 [2020-11-29 18:31:29,629 INFO L677 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 [2020-11-29 18:31:29,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2020-11-29 18:31:29,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 146. [2020-11-29 18:31:29,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2020-11-29 18:31:29,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 225 transitions. [2020-11-29 18:31:29,650 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 225 transitions. Word has length 48 [2020-11-29 18:31:29,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 18:31:29,652 INFO L481 AbstractCegarLoop]: Abstraction has 146 states and 225 transitions. [2020-11-29 18:31:29,652 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-29 18:31:29,653 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 225 transitions. [2020-11-29 18:31:29,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2020-11-29 18:31:29,656 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 18:31:29,657 INFO L422 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] [2020-11-29 18:31:29,657 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-29 18:31:29,658 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 18:31:29,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 18:31:29,659 INFO L82 PathProgramCache]: Analyzing trace with hash 1295428526, now seen corresponding path program 1 times [2020-11-29 18:31:29,659 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 18:31:29,659 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713980744] [2020-11-29 18:31:29,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 18:31:29,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:31:29,811 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 18:31:29,813 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713980744] [2020-11-29 18:31:29,816 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 18:31:29,816 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-29 18:31:29,817 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410824435] [2020-11-29 18:31:29,817 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-29 18:31:29,817 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 18:31:29,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-29 18:31:29,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-29 18:31:29,818 INFO L87 Difference]: Start difference. First operand 146 states and 225 transitions. Second operand 4 states. [2020-11-29 18:31:30,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 18:31:30,327 INFO L93 Difference]: Finished difference Result 289 states and 441 transitions. [2020-11-29 18:31:30,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-29 18:31:30,329 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2020-11-29 18:31:30,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 18:31:30,331 INFO L225 Difference]: With dead ends: 289 [2020-11-29 18:31:30,331 INFO L226 Difference]: Without dead ends: 162 [2020-11-29 18:31:30,332 INFO L677 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 [2020-11-29 18:31:30,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2020-11-29 18:31:30,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 146. [2020-11-29 18:31:30,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2020-11-29 18:31:30,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 224 transitions. [2020-11-29 18:31:30,341 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 224 transitions. Word has length 49 [2020-11-29 18:31:30,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 18:31:30,341 INFO L481 AbstractCegarLoop]: Abstraction has 146 states and 224 transitions. [2020-11-29 18:31:30,341 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-29 18:31:30,341 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 224 transitions. [2020-11-29 18:31:30,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2020-11-29 18:31:30,347 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 18:31:30,348 INFO L422 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] [2020-11-29 18:31:30,348 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-29 18:31:30,348 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 18:31:30,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 18:31:30,349 INFO L82 PathProgramCache]: Analyzing trace with hash 1231677145, now seen corresponding path program 1 times [2020-11-29 18:31:30,349 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 18:31:30,349 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888191926] [2020-11-29 18:31:30,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 18:31:30,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:31:30,477 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 18:31:30,478 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888191926] [2020-11-29 18:31:30,478 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 18:31:30,478 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-29 18:31:30,478 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288384878] [2020-11-29 18:31:30,479 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-29 18:31:30,479 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 18:31:30,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-29 18:31:30,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-29 18:31:30,480 INFO L87 Difference]: Start difference. First operand 146 states and 224 transitions. Second operand 4 states. [2020-11-29 18:31:30,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 18:31:30,896 INFO L93 Difference]: Finished difference Result 287 states and 438 transitions. [2020-11-29 18:31:30,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-29 18:31:30,897 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2020-11-29 18:31:30,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 18:31:30,898 INFO L225 Difference]: With dead ends: 287 [2020-11-29 18:31:30,898 INFO L226 Difference]: Without dead ends: 160 [2020-11-29 18:31:30,899 INFO L677 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 [2020-11-29 18:31:30,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2020-11-29 18:31:30,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 146. [2020-11-29 18:31:30,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2020-11-29 18:31:30,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 223 transitions. [2020-11-29 18:31:30,918 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 223 transitions. Word has length 49 [2020-11-29 18:31:30,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 18:31:30,918 INFO L481 AbstractCegarLoop]: Abstraction has 146 states and 223 transitions. [2020-11-29 18:31:30,923 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-29 18:31:30,923 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 223 transitions. [2020-11-29 18:31:30,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2020-11-29 18:31:30,925 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 18:31:30,926 INFO L422 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] [2020-11-29 18:31:30,926 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-29 18:31:30,926 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 18:31:30,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 18:31:30,927 INFO L82 PathProgramCache]: Analyzing trace with hash 1771822617, now seen corresponding path program 1 times [2020-11-29 18:31:30,927 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 18:31:30,927 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031332522] [2020-11-29 18:31:30,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 18:31:30,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:31:31,072 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 18:31:31,072 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031332522] [2020-11-29 18:31:31,072 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 18:31:31,073 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-29 18:31:31,073 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835567243] [2020-11-29 18:31:31,073 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-29 18:31:31,074 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 18:31:31,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-29 18:31:31,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-29 18:31:31,075 INFO L87 Difference]: Start difference. First operand 146 states and 223 transitions. Second operand 4 states. [2020-11-29 18:31:31,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 18:31:31,499 INFO L93 Difference]: Finished difference Result 286 states and 436 transitions. [2020-11-29 18:31:31,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-29 18:31:31,500 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2020-11-29 18:31:31,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 18:31:31,501 INFO L225 Difference]: With dead ends: 286 [2020-11-29 18:31:31,501 INFO L226 Difference]: Without dead ends: 159 [2020-11-29 18:31:31,502 INFO L677 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 [2020-11-29 18:31:31,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2020-11-29 18:31:31,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 146. [2020-11-29 18:31:31,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2020-11-29 18:31:31,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 222 transitions. [2020-11-29 18:31:31,510 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 222 transitions. Word has length 49 [2020-11-29 18:31:31,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 18:31:31,510 INFO L481 AbstractCegarLoop]: Abstraction has 146 states and 222 transitions. [2020-11-29 18:31:31,510 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-29 18:31:31,510 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 222 transitions. [2020-11-29 18:31:31,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2020-11-29 18:31:31,516 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 18:31:31,518 INFO L422 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] [2020-11-29 18:31:31,518 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-29 18:31:31,518 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 18:31:31,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 18:31:31,519 INFO L82 PathProgramCache]: Analyzing trace with hash -2133959614, now seen corresponding path program 1 times [2020-11-29 18:31:31,519 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 18:31:31,519 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22427533] [2020-11-29 18:31:31,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 18:31:31,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:31:31,636 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 18:31:31,636 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22427533] [2020-11-29 18:31:31,636 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 18:31:31,636 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-29 18:31:31,636 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026207608] [2020-11-29 18:31:31,637 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-29 18:31:31,637 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 18:31:31,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-29 18:31:31,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-29 18:31:31,638 INFO L87 Difference]: Start difference. First operand 146 states and 222 transitions. Second operand 4 states. [2020-11-29 18:31:31,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 18:31:31,969 INFO L93 Difference]: Finished difference Result 286 states and 435 transitions. [2020-11-29 18:31:31,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-29 18:31:31,969 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2020-11-29 18:31:31,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 18:31:31,971 INFO L225 Difference]: With dead ends: 286 [2020-11-29 18:31:31,971 INFO L226 Difference]: Without dead ends: 159 [2020-11-29 18:31:31,971 INFO L677 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 [2020-11-29 18:31:31,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2020-11-29 18:31:31,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 146. [2020-11-29 18:31:31,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2020-11-29 18:31:31,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 221 transitions. [2020-11-29 18:31:31,978 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 221 transitions. Word has length 49 [2020-11-29 18:31:31,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 18:31:31,978 INFO L481 AbstractCegarLoop]: Abstraction has 146 states and 221 transitions. [2020-11-29 18:31:31,978 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-29 18:31:31,978 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 221 transitions. [2020-11-29 18:31:31,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2020-11-29 18:31:31,990 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 18:31:31,990 INFO L422 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] [2020-11-29 18:31:31,990 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-29 18:31:31,990 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 18:31:31,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 18:31:31,996 INFO L82 PathProgramCache]: Analyzing trace with hash -824123675, now seen corresponding path program 1 times [2020-11-29 18:31:31,996 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 18:31:31,997 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191634438] [2020-11-29 18:31:31,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 18:31:32,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:31:32,116 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 18:31:32,118 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191634438] [2020-11-29 18:31:32,118 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 18:31:32,119 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-29 18:31:32,119 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545047892] [2020-11-29 18:31:32,120 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-29 18:31:32,120 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 18:31:32,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-29 18:31:32,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-29 18:31:32,122 INFO L87 Difference]: Start difference. First operand 146 states and 221 transitions. Second operand 4 states. [2020-11-29 18:31:32,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 18:31:32,439 INFO L93 Difference]: Finished difference Result 286 states and 434 transitions. [2020-11-29 18:31:32,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-29 18:31:32,440 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2020-11-29 18:31:32,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 18:31:32,441 INFO L225 Difference]: With dead ends: 286 [2020-11-29 18:31:32,441 INFO L226 Difference]: Without dead ends: 159 [2020-11-29 18:31:32,442 INFO L677 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 [2020-11-29 18:31:32,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2020-11-29 18:31:32,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 146. [2020-11-29 18:31:32,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2020-11-29 18:31:32,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 220 transitions. [2020-11-29 18:31:32,447 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 220 transitions. Word has length 50 [2020-11-29 18:31:32,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 18:31:32,447 INFO L481 AbstractCegarLoop]: Abstraction has 146 states and 220 transitions. [2020-11-29 18:31:32,447 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-29 18:31:32,447 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 220 transitions. [2020-11-29 18:31:32,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2020-11-29 18:31:32,448 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 18:31:32,448 INFO L422 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] [2020-11-29 18:31:32,448 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-29 18:31:32,448 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 18:31:32,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 18:31:32,449 INFO L82 PathProgramCache]: Analyzing trace with hash 807634151, now seen corresponding path program 1 times [2020-11-29 18:31:32,449 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 18:31:32,449 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824289922] [2020-11-29 18:31:32,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 18:31:32,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:31:32,509 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 18:31:32,509 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824289922] [2020-11-29 18:31:32,510 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 18:31:32,510 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-29 18:31:32,510 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327937750] [2020-11-29 18:31:32,510 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-29 18:31:32,510 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 18:31:32,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-29 18:31:32,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-29 18:31:32,511 INFO L87 Difference]: Start difference. First operand 146 states and 220 transitions. Second operand 4 states. [2020-11-29 18:31:32,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 18:31:32,972 INFO L93 Difference]: Finished difference Result 286 states and 433 transitions. [2020-11-29 18:31:32,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-29 18:31:32,973 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 51 [2020-11-29 18:31:32,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 18:31:32,974 INFO L225 Difference]: With dead ends: 286 [2020-11-29 18:31:32,974 INFO L226 Difference]: Without dead ends: 159 [2020-11-29 18:31:32,975 INFO L677 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 [2020-11-29 18:31:32,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2020-11-29 18:31:32,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 146. [2020-11-29 18:31:32,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2020-11-29 18:31:32,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 219 transitions. [2020-11-29 18:31:32,981 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 219 transitions. Word has length 51 [2020-11-29 18:31:32,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 18:31:32,981 INFO L481 AbstractCegarLoop]: Abstraction has 146 states and 219 transitions. [2020-11-29 18:31:32,981 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-29 18:31:32,981 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 219 transitions. [2020-11-29 18:31:32,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2020-11-29 18:31:32,986 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 18:31:32,986 INFO L422 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] [2020-11-29 18:31:32,986 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-29 18:31:32,986 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 18:31:32,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 18:31:32,987 INFO L82 PathProgramCache]: Analyzing trace with hash -465931414, now seen corresponding path program 1 times [2020-11-29 18:31:32,987 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 18:31:32,988 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636344182] [2020-11-29 18:31:32,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 18:31:33,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:31:33,112 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 18:31:33,119 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636344182] [2020-11-29 18:31:33,120 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 18:31:33,120 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-29 18:31:33,120 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234694085] [2020-11-29 18:31:33,120 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-29 18:31:33,121 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 18:31:33,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-29 18:31:33,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-29 18:31:33,122 INFO L87 Difference]: Start difference. First operand 146 states and 219 transitions. Second operand 4 states. [2020-11-29 18:31:33,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 18:31:33,452 INFO L93 Difference]: Finished difference Result 276 states and 419 transitions. [2020-11-29 18:31:33,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-29 18:31:33,454 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2020-11-29 18:31:33,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 18:31:33,455 INFO L225 Difference]: With dead ends: 276 [2020-11-29 18:31:33,455 INFO L226 Difference]: Without dead ends: 149 [2020-11-29 18:31:33,456 INFO L677 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 [2020-11-29 18:31:33,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2020-11-29 18:31:33,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 146. [2020-11-29 18:31:33,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2020-11-29 18:31:33,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 218 transitions. [2020-11-29 18:31:33,462 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 218 transitions. Word has length 52 [2020-11-29 18:31:33,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 18:31:33,463 INFO L481 AbstractCegarLoop]: Abstraction has 146 states and 218 transitions. [2020-11-29 18:31:33,463 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-29 18:31:33,463 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 218 transitions. [2020-11-29 18:31:33,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2020-11-29 18:31:33,463 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 18:31:33,464 INFO L422 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] [2020-11-29 18:31:33,464 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-29 18:31:33,464 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 18:31:33,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 18:31:33,464 INFO L82 PathProgramCache]: Analyzing trace with hash -1405490990, now seen corresponding path program 1 times [2020-11-29 18:31:33,465 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 18:31:33,465 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556411456] [2020-11-29 18:31:33,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 18:31:33,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:31:33,571 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 18:31:33,571 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556411456] [2020-11-29 18:31:33,571 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 18:31:33,572 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-29 18:31:33,574 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456204145] [2020-11-29 18:31:33,574 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-29 18:31:33,575 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 18:31:33,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-29 18:31:33,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-29 18:31:33,576 INFO L87 Difference]: Start difference. First operand 146 states and 218 transitions. Second operand 4 states. [2020-11-29 18:31:33,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 18:31:33,961 INFO L93 Difference]: Finished difference Result 316 states and 480 transitions. [2020-11-29 18:31:33,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-29 18:31:33,962 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2020-11-29 18:31:33,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 18:31:33,963 INFO L225 Difference]: With dead ends: 316 [2020-11-29 18:31:33,964 INFO L226 Difference]: Without dead ends: 189 [2020-11-29 18:31:33,964 INFO L677 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 [2020-11-29 18:31:33,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2020-11-29 18:31:33,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 168. [2020-11-29 18:31:33,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2020-11-29 18:31:33,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 256 transitions. [2020-11-29 18:31:33,968 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 256 transitions. Word has length 52 [2020-11-29 18:31:33,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 18:31:33,969 INFO L481 AbstractCegarLoop]: Abstraction has 168 states and 256 transitions. [2020-11-29 18:31:33,969 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-29 18:31:33,969 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 256 transitions. [2020-11-29 18:31:33,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2020-11-29 18:31:33,969 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 18:31:33,970 INFO L422 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] [2020-11-29 18:31:33,970 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-29 18:31:33,970 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 18:31:33,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 18:31:33,971 INFO L82 PathProgramCache]: Analyzing trace with hash 1761497597, now seen corresponding path program 1 times [2020-11-29 18:31:33,971 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 18:31:33,971 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464932275] [2020-11-29 18:31:33,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 18:31:34,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:31:34,060 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 18:31:34,060 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464932275] [2020-11-29 18:31:34,060 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 18:31:34,061 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-29 18:31:34,062 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637600048] [2020-11-29 18:31:34,062 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-29 18:31:34,062 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 18:31:34,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-29 18:31:34,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-29 18:31:34,064 INFO L87 Difference]: Start difference. First operand 168 states and 256 transitions. Second operand 4 states. [2020-11-29 18:31:34,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 18:31:34,416 INFO L93 Difference]: Finished difference Result 338 states and 517 transitions. [2020-11-29 18:31:34,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-29 18:31:34,417 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2020-11-29 18:31:34,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 18:31:34,418 INFO L225 Difference]: With dead ends: 338 [2020-11-29 18:31:34,418 INFO L226 Difference]: Without dead ends: 189 [2020-11-29 18:31:34,419 INFO L677 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 [2020-11-29 18:31:34,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2020-11-29 18:31:34,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 168. [2020-11-29 18:31:34,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2020-11-29 18:31:34,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 255 transitions. [2020-11-29 18:31:34,425 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 255 transitions. Word has length 65 [2020-11-29 18:31:34,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 18:31:34,425 INFO L481 AbstractCegarLoop]: Abstraction has 168 states and 255 transitions. [2020-11-29 18:31:34,425 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-29 18:31:34,425 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 255 transitions. [2020-11-29 18:31:34,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2020-11-29 18:31:34,426 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 18:31:34,426 INFO L422 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] [2020-11-29 18:31:34,426 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-29 18:31:34,426 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 18:31:34,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 18:31:34,427 INFO L82 PathProgramCache]: Analyzing trace with hash -23187219, now seen corresponding path program 1 times [2020-11-29 18:31:34,427 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 18:31:34,427 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340307263] [2020-11-29 18:31:34,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 18:31:34,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:31:34,519 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 18:31:34,519 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340307263] [2020-11-29 18:31:34,520 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 18:31:34,520 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-29 18:31:34,520 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793149281] [2020-11-29 18:31:34,521 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-29 18:31:34,521 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 18:31:34,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-29 18:31:34,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-29 18:31:34,522 INFO L87 Difference]: Start difference. First operand 168 states and 255 transitions. Second operand 4 states. [2020-11-29 18:31:34,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 18:31:34,958 INFO L93 Difference]: Finished difference Result 337 states and 514 transitions. [2020-11-29 18:31:34,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-29 18:31:34,959 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2020-11-29 18:31:34,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 18:31:34,960 INFO L225 Difference]: With dead ends: 337 [2020-11-29 18:31:34,960 INFO L226 Difference]: Without dead ends: 188 [2020-11-29 18:31:34,961 INFO L677 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 [2020-11-29 18:31:34,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2020-11-29 18:31:34,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 168. [2020-11-29 18:31:34,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2020-11-29 18:31:34,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 254 transitions. [2020-11-29 18:31:34,969 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 254 transitions. Word has length 66 [2020-11-29 18:31:34,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 18:31:34,969 INFO L481 AbstractCegarLoop]: Abstraction has 168 states and 254 transitions. [2020-11-29 18:31:34,969 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-29 18:31:34,970 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 254 transitions. [2020-11-29 18:31:34,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2020-11-29 18:31:34,971 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 18:31:34,971 INFO L422 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] [2020-11-29 18:31:34,971 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-11-29 18:31:34,971 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 18:31:34,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 18:31:34,972 INFO L82 PathProgramCache]: Analyzing trace with hash -86938600, now seen corresponding path program 1 times [2020-11-29 18:31:34,972 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 18:31:34,972 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962213022] [2020-11-29 18:31:34,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 18:31:34,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:31:35,038 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 18:31:35,039 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962213022] [2020-11-29 18:31:35,039 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 18:31:35,039 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-29 18:31:35,040 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477873073] [2020-11-29 18:31:35,040 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-29 18:31:35,040 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 18:31:35,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-29 18:31:35,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-29 18:31:35,041 INFO L87 Difference]: Start difference. First operand 168 states and 254 transitions. Second operand 4 states. [2020-11-29 18:31:35,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 18:31:35,433 INFO L93 Difference]: Finished difference Result 335 states and 510 transitions. [2020-11-29 18:31:35,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-29 18:31:35,434 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2020-11-29 18:31:35,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 18:31:35,435 INFO L225 Difference]: With dead ends: 335 [2020-11-29 18:31:35,435 INFO L226 Difference]: Without dead ends: 186 [2020-11-29 18:31:35,436 INFO L677 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 [2020-11-29 18:31:35,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2020-11-29 18:31:35,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 168. [2020-11-29 18:31:35,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2020-11-29 18:31:35,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 253 transitions. [2020-11-29 18:31:35,442 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 253 transitions. Word has length 66 [2020-11-29 18:31:35,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 18:31:35,443 INFO L481 AbstractCegarLoop]: Abstraction has 168 states and 253 transitions. [2020-11-29 18:31:35,443 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-29 18:31:35,444 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 253 transitions. [2020-11-29 18:31:35,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2020-11-29 18:31:35,444 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 18:31:35,445 INFO L422 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] [2020-11-29 18:31:35,445 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-11-29 18:31:35,445 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 18:31:35,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 18:31:35,445 INFO L82 PathProgramCache]: Analyzing trace with hash 453206872, now seen corresponding path program 1 times [2020-11-29 18:31:35,445 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 18:31:35,446 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333635937] [2020-11-29 18:31:35,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 18:31:35,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:31:35,503 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 18:31:35,506 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333635937] [2020-11-29 18:31:35,506 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 18:31:35,507 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-29 18:31:35,507 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692296693] [2020-11-29 18:31:35,507 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-29 18:31:35,507 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 18:31:35,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-29 18:31:35,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-29 18:31:35,508 INFO L87 Difference]: Start difference. First operand 168 states and 253 transitions. Second operand 4 states. [2020-11-29 18:31:35,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 18:31:35,900 INFO L93 Difference]: Finished difference Result 334 states and 507 transitions. [2020-11-29 18:31:35,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-29 18:31:35,901 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2020-11-29 18:31:35,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 18:31:35,902 INFO L225 Difference]: With dead ends: 334 [2020-11-29 18:31:35,902 INFO L226 Difference]: Without dead ends: 185 [2020-11-29 18:31:35,903 INFO L677 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 [2020-11-29 18:31:35,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2020-11-29 18:31:35,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 168. [2020-11-29 18:31:35,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2020-11-29 18:31:35,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 252 transitions. [2020-11-29 18:31:35,909 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 252 transitions. Word has length 66 [2020-11-29 18:31:35,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 18:31:35,909 INFO L481 AbstractCegarLoop]: Abstraction has 168 states and 252 transitions. [2020-11-29 18:31:35,909 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-29 18:31:35,910 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 252 transitions. [2020-11-29 18:31:35,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2020-11-29 18:31:35,912 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 18:31:35,912 INFO L422 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] [2020-11-29 18:31:35,912 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-11-29 18:31:35,912 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 18:31:35,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 18:31:35,913 INFO L82 PathProgramCache]: Analyzing trace with hash 842391937, now seen corresponding path program 1 times [2020-11-29 18:31:35,913 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 18:31:35,913 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012394997] [2020-11-29 18:31:35,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 18:31:35,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:31:35,972 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 18:31:35,972 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012394997] [2020-11-29 18:31:35,973 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 18:31:35,973 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-29 18:31:35,973 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41203997] [2020-11-29 18:31:35,973 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-29 18:31:35,974 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 18:31:35,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-29 18:31:35,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-29 18:31:35,974 INFO L87 Difference]: Start difference. First operand 168 states and 252 transitions. Second operand 4 states. [2020-11-29 18:31:36,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 18:31:36,397 INFO L93 Difference]: Finished difference Result 334 states and 505 transitions. [2020-11-29 18:31:36,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-29 18:31:36,398 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2020-11-29 18:31:36,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 18:31:36,399 INFO L225 Difference]: With dead ends: 334 [2020-11-29 18:31:36,399 INFO L226 Difference]: Without dead ends: 185 [2020-11-29 18:31:36,400 INFO L677 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 [2020-11-29 18:31:36,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2020-11-29 18:31:36,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 168. [2020-11-29 18:31:36,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2020-11-29 18:31:36,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 251 transitions. [2020-11-29 18:31:36,409 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 251 transitions. Word has length 66 [2020-11-29 18:31:36,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 18:31:36,409 INFO L481 AbstractCegarLoop]: Abstraction has 168 states and 251 transitions. [2020-11-29 18:31:36,409 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-29 18:31:36,410 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 251 transitions. [2020-11-29 18:31:36,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2020-11-29 18:31:36,411 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 18:31:36,411 INFO L422 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] [2020-11-29 18:31:36,411 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-11-29 18:31:36,411 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 18:31:36,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 18:31:36,412 INFO L82 PathProgramCache]: Analyzing trace with hash 1248461190, now seen corresponding path program 1 times [2020-11-29 18:31:36,412 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 18:31:36,412 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405790302] [2020-11-29 18:31:36,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 18:31:36,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:31:36,467 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 18:31:36,468 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405790302] [2020-11-29 18:31:36,470 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 18:31:36,470 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-29 18:31:36,470 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850573724] [2020-11-29 18:31:36,471 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-29 18:31:36,472 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 18:31:36,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-29 18:31:36,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-29 18:31:36,476 INFO L87 Difference]: Start difference. First operand 168 states and 251 transitions. Second operand 4 states. [2020-11-29 18:31:36,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 18:31:36,837 INFO L93 Difference]: Finished difference Result 334 states and 503 transitions. [2020-11-29 18:31:36,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-29 18:31:36,838 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2020-11-29 18:31:36,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 18:31:36,839 INFO L225 Difference]: With dead ends: 334 [2020-11-29 18:31:36,839 INFO L226 Difference]: Without dead ends: 185 [2020-11-29 18:31:36,840 INFO L677 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 [2020-11-29 18:31:36,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2020-11-29 18:31:36,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 168. [2020-11-29 18:31:36,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2020-11-29 18:31:36,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 250 transitions. [2020-11-29 18:31:36,845 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 250 transitions. Word has length 67 [2020-11-29 18:31:36,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 18:31:36,845 INFO L481 AbstractCegarLoop]: Abstraction has 168 states and 250 transitions. [2020-11-29 18:31:36,845 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-29 18:31:36,845 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 250 transitions. [2020-11-29 18:31:36,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2020-11-29 18:31:36,848 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 18:31:36,848 INFO L422 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] [2020-11-29 18:31:36,848 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-11-29 18:31:36,849 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 18:31:36,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 18:31:36,849 INFO L82 PathProgramCache]: Analyzing trace with hash 633255526, now seen corresponding path program 1 times [2020-11-29 18:31:36,849 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 18:31:36,850 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893117785] [2020-11-29 18:31:36,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 18:31:36,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:31:36,905 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 18:31:36,905 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893117785] [2020-11-29 18:31:36,905 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 18:31:36,905 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-29 18:31:36,906 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777053887] [2020-11-29 18:31:36,906 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-29 18:31:36,906 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 18:31:36,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-29 18:31:36,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-29 18:31:36,907 INFO L87 Difference]: Start difference. First operand 168 states and 250 transitions. Second operand 4 states. [2020-11-29 18:31:37,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 18:31:37,240 INFO L93 Difference]: Finished difference Result 334 states and 501 transitions. [2020-11-29 18:31:37,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-29 18:31:37,241 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2020-11-29 18:31:37,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 18:31:37,242 INFO L225 Difference]: With dead ends: 334 [2020-11-29 18:31:37,242 INFO L226 Difference]: Without dead ends: 185 [2020-11-29 18:31:37,243 INFO L677 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 [2020-11-29 18:31:37,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2020-11-29 18:31:37,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 168. [2020-11-29 18:31:37,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2020-11-29 18:31:37,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 249 transitions. [2020-11-29 18:31:37,248 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 249 transitions. Word has length 68 [2020-11-29 18:31:37,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 18:31:37,248 INFO L481 AbstractCegarLoop]: Abstraction has 168 states and 249 transitions. [2020-11-29 18:31:37,249 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-29 18:31:37,249 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 249 transitions. [2020-11-29 18:31:37,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2020-11-29 18:31:37,249 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 18:31:37,249 INFO L422 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] [2020-11-29 18:31:37,250 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-11-29 18:31:37,254 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 18:31:37,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 18:31:37,254 INFO L82 PathProgramCache]: Analyzing trace with hash -1576701493, now seen corresponding path program 1 times [2020-11-29 18:31:37,255 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 18:31:37,255 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520964910] [2020-11-29 18:31:37,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 18:31:37,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:31:37,319 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 18:31:37,320 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520964910] [2020-11-29 18:31:37,320 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 18:31:37,320 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-29 18:31:37,320 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41789880] [2020-11-29 18:31:37,322 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-29 18:31:37,322 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 18:31:37,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-29 18:31:37,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-29 18:31:37,323 INFO L87 Difference]: Start difference. First operand 168 states and 249 transitions. Second operand 4 states. [2020-11-29 18:31:37,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 18:31:37,665 INFO L93 Difference]: Finished difference Result 324 states and 486 transitions. [2020-11-29 18:31:37,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-29 18:31:37,666 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 69 [2020-11-29 18:31:37,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 18:31:37,667 INFO L225 Difference]: With dead ends: 324 [2020-11-29 18:31:37,667 INFO L226 Difference]: Without dead ends: 175 [2020-11-29 18:31:37,668 INFO L677 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 [2020-11-29 18:31:37,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2020-11-29 18:31:37,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 168. [2020-11-29 18:31:37,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2020-11-29 18:31:37,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 248 transitions. [2020-11-29 18:31:37,674 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 248 transitions. Word has length 69 [2020-11-29 18:31:37,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 18:31:37,674 INFO L481 AbstractCegarLoop]: Abstraction has 168 states and 248 transitions. [2020-11-29 18:31:37,675 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-29 18:31:37,675 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 248 transitions. [2020-11-29 18:31:37,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2020-11-29 18:31:37,675 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 18:31:37,676 INFO L422 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] [2020-11-29 18:31:37,676 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-11-29 18:31:37,676 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 18:31:37,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 18:31:37,677 INFO L82 PathProgramCache]: Analyzing trace with hash 1274616071, now seen corresponding path program 1 times [2020-11-29 18:31:37,677 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 18:31:37,677 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975462709] [2020-11-29 18:31:37,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 18:31:37,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:31:37,756 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-11-29 18:31:37,756 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975462709] [2020-11-29 18:31:37,756 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 18:31:37,756 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-29 18:31:37,757 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928953949] [2020-11-29 18:31:37,758 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-29 18:31:37,758 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 18:31:37,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-29 18:31:37,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-29 18:31:37,759 INFO L87 Difference]: Start difference. First operand 168 states and 248 transitions. Second operand 4 states. [2020-11-29 18:31:38,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 18:31:38,277 INFO L93 Difference]: Finished difference Result 422 states and 635 transitions. [2020-11-29 18:31:38,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-29 18:31:38,278 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 74 [2020-11-29 18:31:38,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 18:31:38,280 INFO L225 Difference]: With dead ends: 422 [2020-11-29 18:31:38,280 INFO L226 Difference]: Without dead ends: 273 [2020-11-29 18:31:38,281 INFO L677 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 [2020-11-29 18:31:38,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2020-11-29 18:31:38,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 198. [2020-11-29 18:31:38,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2020-11-29 18:31:38,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 300 transitions. [2020-11-29 18:31:38,288 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 300 transitions. Word has length 74 [2020-11-29 18:31:38,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 18:31:38,288 INFO L481 AbstractCegarLoop]: Abstraction has 198 states and 300 transitions. [2020-11-29 18:31:38,288 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-29 18:31:38,288 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 300 transitions. [2020-11-29 18:31:38,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2020-11-29 18:31:38,289 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 18:31:38,289 INFO L422 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] [2020-11-29 18:31:38,290 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-11-29 18:31:38,290 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 18:31:38,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 18:31:38,290 INFO L82 PathProgramCache]: Analyzing trace with hash 1202229513, now seen corresponding path program 1 times [2020-11-29 18:31:38,291 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 18:31:38,291 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110988235] [2020-11-29 18:31:38,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 18:31:38,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:31:38,353 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-11-29 18:31:38,353 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110988235] [2020-11-29 18:31:38,353 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 18:31:38,354 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-29 18:31:38,354 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748779350] [2020-11-29 18:31:38,354 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-29 18:31:38,354 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 18:31:38,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-29 18:31:38,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-29 18:31:38,355 INFO L87 Difference]: Start difference. First operand 198 states and 300 transitions. Second operand 4 states. [2020-11-29 18:31:38,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 18:31:38,786 INFO L93 Difference]: Finished difference Result 427 states and 655 transitions. [2020-11-29 18:31:38,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-29 18:31:38,787 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 74 [2020-11-29 18:31:38,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 18:31:38,789 INFO L225 Difference]: With dead ends: 427 [2020-11-29 18:31:38,789 INFO L226 Difference]: Without dead ends: 248 [2020-11-29 18:31:38,789 INFO L677 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 [2020-11-29 18:31:38,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2020-11-29 18:31:38,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 222. [2020-11-29 18:31:38,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2020-11-29 18:31:38,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 342 transitions. [2020-11-29 18:31:38,796 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 342 transitions. Word has length 74 [2020-11-29 18:31:38,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 18:31:38,796 INFO L481 AbstractCegarLoop]: Abstraction has 222 states and 342 transitions. [2020-11-29 18:31:38,796 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-29 18:31:38,796 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 342 transitions. [2020-11-29 18:31:38,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2020-11-29 18:31:38,797 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 18:31:38,797 INFO L422 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] [2020-11-29 18:31:38,797 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-11-29 18:31:38,797 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 18:31:38,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 18:31:38,798 INFO L82 PathProgramCache]: Analyzing trace with hash -1047936766, now seen corresponding path program 1 times [2020-11-29 18:31:38,798 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 18:31:38,798 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71642187] [2020-11-29 18:31:38,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 18:31:38,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:31:38,865 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-11-29 18:31:38,865 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71642187] [2020-11-29 18:31:38,865 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 18:31:38,866 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-29 18:31:38,866 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453585618] [2020-11-29 18:31:38,866 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-29 18:31:38,866 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 18:31:38,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-29 18:31:38,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-29 18:31:38,867 INFO L87 Difference]: Start difference. First operand 222 states and 342 transitions. Second operand 4 states. [2020-11-29 18:31:39,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 18:31:39,414 INFO L93 Difference]: Finished difference Result 492 states and 757 transitions. [2020-11-29 18:31:39,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-29 18:31:39,415 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2020-11-29 18:31:39,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 18:31:39,417 INFO L225 Difference]: With dead ends: 492 [2020-11-29 18:31:39,417 INFO L226 Difference]: Without dead ends: 289 [2020-11-29 18:31:39,418 INFO L677 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 [2020-11-29 18:31:39,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2020-11-29 18:31:39,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 223. [2020-11-29 18:31:39,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2020-11-29 18:31:39,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 343 transitions. [2020-11-29 18:31:39,426 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 343 transitions. Word has length 75 [2020-11-29 18:31:39,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 18:31:39,426 INFO L481 AbstractCegarLoop]: Abstraction has 223 states and 343 transitions. [2020-11-29 18:31:39,426 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-29 18:31:39,426 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 343 transitions. [2020-11-29 18:31:39,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2020-11-29 18:31:39,427 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 18:31:39,427 INFO L422 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] [2020-11-29 18:31:39,428 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-11-29 18:31:39,428 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 18:31:39,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 18:31:39,428 INFO L82 PathProgramCache]: Analyzing trace with hash -2006174842, now seen corresponding path program 1 times [2020-11-29 18:31:39,429 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 18:31:39,429 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427089273] [2020-11-29 18:31:39,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 18:31:39,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:31:39,500 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-11-29 18:31:39,500 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427089273] [2020-11-29 18:31:39,500 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 18:31:39,500 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-29 18:31:39,501 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88136564] [2020-11-29 18:31:39,501 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-29 18:31:39,501 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 18:31:39,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-29 18:31:39,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-29 18:31:39,502 INFO L87 Difference]: Start difference. First operand 223 states and 343 transitions. Second operand 4 states. [2020-11-29 18:31:40,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 18:31:40,055 INFO L93 Difference]: Finished difference Result 493 states and 757 transitions. [2020-11-29 18:31:40,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-29 18:31:40,059 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2020-11-29 18:31:40,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 18:31:40,061 INFO L225 Difference]: With dead ends: 493 [2020-11-29 18:31:40,061 INFO L226 Difference]: Without dead ends: 289 [2020-11-29 18:31:40,062 INFO L677 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 [2020-11-29 18:31:40,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2020-11-29 18:31:40,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 233. [2020-11-29 18:31:40,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2020-11-29 18:31:40,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 362 transitions. [2020-11-29 18:31:40,083 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 362 transitions. Word has length 80 [2020-11-29 18:31:40,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 18:31:40,083 INFO L481 AbstractCegarLoop]: Abstraction has 233 states and 362 transitions. [2020-11-29 18:31:40,083 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-29 18:31:40,083 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 362 transitions. [2020-11-29 18:31:40,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2020-11-29 18:31:40,084 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 18:31:40,085 INFO L422 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] [2020-11-29 18:31:40,085 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-11-29 18:31:40,085 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 18:31:40,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 18:31:40,086 INFO L82 PathProgramCache]: Analyzing trace with hash -2068915140, now seen corresponding path program 1 times [2020-11-29 18:31:40,086 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 18:31:40,086 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105255583] [2020-11-29 18:31:40,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 18:31:40,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:31:40,171 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-11-29 18:31:40,172 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105255583] [2020-11-29 18:31:40,172 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 18:31:40,172 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-29 18:31:40,174 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483737095] [2020-11-29 18:31:40,174 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-29 18:31:40,174 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 18:31:40,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-29 18:31:40,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-29 18:31:40,175 INFO L87 Difference]: Start difference. First operand 233 states and 362 transitions. Second operand 4 states. [2020-11-29 18:31:40,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 18:31:40,671 INFO L93 Difference]: Finished difference Result 497 states and 768 transitions. [2020-11-29 18:31:40,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-29 18:31:40,671 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2020-11-29 18:31:40,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 18:31:40,673 INFO L225 Difference]: With dead ends: 497 [2020-11-29 18:31:40,673 INFO L226 Difference]: Without dead ends: 283 [2020-11-29 18:31:40,674 INFO L677 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 [2020-11-29 18:31:40,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2020-11-29 18:31:40,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 234. [2020-11-29 18:31:40,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2020-11-29 18:31:40,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 363 transitions. [2020-11-29 18:31:40,681 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 363 transitions. Word has length 81 [2020-11-29 18:31:40,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 18:31:40,681 INFO L481 AbstractCegarLoop]: Abstraction has 234 states and 363 transitions. [2020-11-29 18:31:40,681 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-29 18:31:40,682 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 363 transitions. [2020-11-29 18:31:40,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2020-11-29 18:31:40,683 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 18:31:40,684 INFO L422 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] [2020-11-29 18:31:40,684 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-11-29 18:31:40,684 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 18:31:40,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 18:31:40,685 INFO L82 PathProgramCache]: Analyzing trace with hash -262676504, now seen corresponding path program 1 times [2020-11-29 18:31:40,685 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 18:31:40,685 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581570694] [2020-11-29 18:31:40,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 18:31:40,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:31:40,767 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-11-29 18:31:40,767 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581570694] [2020-11-29 18:31:40,767 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 18:31:40,768 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-29 18:31:40,768 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571131601] [2020-11-29 18:31:40,770 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-29 18:31:40,770 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 18:31:40,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-29 18:31:40,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-29 18:31:40,774 INFO L87 Difference]: Start difference. First operand 234 states and 363 transitions. Second operand 4 states. [2020-11-29 18:31:41,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 18:31:41,351 INFO L93 Difference]: Finished difference Result 498 states and 768 transitions. [2020-11-29 18:31:41,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-29 18:31:41,352 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2020-11-29 18:31:41,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 18:31:41,354 INFO L225 Difference]: With dead ends: 498 [2020-11-29 18:31:41,354 INFO L226 Difference]: Without dead ends: 283 [2020-11-29 18:31:41,355 INFO L677 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 [2020-11-29 18:31:41,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2020-11-29 18:31:41,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 234. [2020-11-29 18:31:41,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2020-11-29 18:31:41,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 362 transitions. [2020-11-29 18:31:41,364 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 362 transitions. Word has length 87 [2020-11-29 18:31:41,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 18:31:41,364 INFO L481 AbstractCegarLoop]: Abstraction has 234 states and 362 transitions. [2020-11-29 18:31:41,365 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-29 18:31:41,365 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 362 transitions. [2020-11-29 18:31:41,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2020-11-29 18:31:41,366 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 18:31:41,366 INFO L422 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] [2020-11-29 18:31:41,366 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-11-29 18:31:41,366 INFO L429 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 18:31:41,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 18:31:41,367 INFO L82 PathProgramCache]: Analyzing trace with hash 1665596198, now seen corresponding path program 1 times [2020-11-29 18:31:41,367 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 18:31:41,367 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368807148] [2020-11-29 18:31:41,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 18:31:41,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:31:41,440 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-11-29 18:31:41,441 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368807148] [2020-11-29 18:31:41,441 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 18:31:41,441 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-29 18:31:41,441 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811803111] [2020-11-29 18:31:41,441 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-29 18:31:41,442 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 18:31:41,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-29 18:31:41,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-29 18:31:41,442 INFO L87 Difference]: Start difference. First operand 234 states and 362 transitions. Second operand 4 states. [2020-11-29 18:31:41,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 18:31:41,855 INFO L93 Difference]: Finished difference Result 475 states and 736 transitions. [2020-11-29 18:31:41,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-29 18:31:41,856 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2020-11-29 18:31:41,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 18:31:41,857 INFO L225 Difference]: With dead ends: 475 [2020-11-29 18:31:41,857 INFO L226 Difference]: Without dead ends: 260 [2020-11-29 18:31:41,858 INFO L677 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 [2020-11-29 18:31:41,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2020-11-29 18:31:41,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 234. [2020-11-29 18:31:41,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2020-11-29 18:31:41,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 361 transitions. [2020-11-29 18:31:41,864 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 361 transitions. Word has length 87 [2020-11-29 18:31:41,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 18:31:41,865 INFO L481 AbstractCegarLoop]: Abstraction has 234 states and 361 transitions. [2020-11-29 18:31:41,865 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-29 18:31:41,865 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 361 transitions. [2020-11-29 18:31:41,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2020-11-29 18:31:41,866 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 18:31:41,866 INFO L422 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] [2020-11-29 18:31:41,867 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-11-29 18:31:41,867 INFO L429 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 18:31:41,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 18:31:41,867 INFO L82 PathProgramCache]: Analyzing trace with hash 1651925090, now seen corresponding path program 1 times [2020-11-29 18:31:41,867 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 18:31:41,868 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071416519] [2020-11-29 18:31:41,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 18:31:41,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:31:41,933 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-11-29 18:31:41,934 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071416519] [2020-11-29 18:31:41,934 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 18:31:41,934 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-29 18:31:41,934 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739857945] [2020-11-29 18:31:41,935 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-29 18:31:41,935 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 18:31:41,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-29 18:31:41,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-29 18:31:41,936 INFO L87 Difference]: Start difference. First operand 234 states and 361 transitions. Second operand 4 states. [2020-11-29 18:31:42,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 18:31:42,358 INFO L93 Difference]: Finished difference Result 497 states and 763 transitions. [2020-11-29 18:31:42,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-29 18:31:42,359 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2020-11-29 18:31:42,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 18:31:42,360 INFO L225 Difference]: With dead ends: 497 [2020-11-29 18:31:42,360 INFO L226 Difference]: Without dead ends: 282 [2020-11-29 18:31:42,361 INFO L677 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 [2020-11-29 18:31:42,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2020-11-29 18:31:42,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 234. [2020-11-29 18:31:42,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2020-11-29 18:31:42,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 360 transitions. [2020-11-29 18:31:42,368 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 360 transitions. Word has length 88 [2020-11-29 18:31:42,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 18:31:42,368 INFO L481 AbstractCegarLoop]: Abstraction has 234 states and 360 transitions. [2020-11-29 18:31:42,369 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-29 18:31:42,369 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 360 transitions. [2020-11-29 18:31:42,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2020-11-29 18:31:42,370 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 18:31:42,370 INFO L422 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] [2020-11-29 18:31:42,370 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2020-11-29 18:31:42,370 INFO L429 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 18:31:42,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 18:31:42,371 INFO L82 PathProgramCache]: Analyzing trace with hash 1588173709, now seen corresponding path program 1 times [2020-11-29 18:31:42,371 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 18:31:42,371 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572523456] [2020-11-29 18:31:42,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 18:31:42,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:31:42,440 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-11-29 18:31:42,440 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572523456] [2020-11-29 18:31:42,440 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 18:31:42,441 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-29 18:31:42,441 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539282591] [2020-11-29 18:31:42,441 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-29 18:31:42,441 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 18:31:42,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-29 18:31:42,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-29 18:31:42,442 INFO L87 Difference]: Start difference. First operand 234 states and 360 transitions. Second operand 4 states. [2020-11-29 18:31:42,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 18:31:42,893 INFO L93 Difference]: Finished difference Result 495 states and 759 transitions. [2020-11-29 18:31:42,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-29 18:31:42,893 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2020-11-29 18:31:42,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 18:31:42,895 INFO L225 Difference]: With dead ends: 495 [2020-11-29 18:31:42,895 INFO L226 Difference]: Without dead ends: 280 [2020-11-29 18:31:42,895 INFO L677 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 [2020-11-29 18:31:42,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2020-11-29 18:31:42,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 234. [2020-11-29 18:31:42,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2020-11-29 18:31:42,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 359 transitions. [2020-11-29 18:31:42,902 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 359 transitions. Word has length 88 [2020-11-29 18:31:42,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 18:31:42,902 INFO L481 AbstractCegarLoop]: Abstraction has 234 states and 359 transitions. [2020-11-29 18:31:42,902 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-29 18:31:42,903 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 359 transitions. [2020-11-29 18:31:42,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2020-11-29 18:31:42,904 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 18:31:42,904 INFO L422 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] [2020-11-29 18:31:42,904 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2020-11-29 18:31:42,904 INFO L429 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 18:31:42,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 18:31:42,904 INFO L82 PathProgramCache]: Analyzing trace with hash 2128319181, now seen corresponding path program 1 times [2020-11-29 18:31:42,904 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 18:31:42,905 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016160611] [2020-11-29 18:31:42,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 18:31:42,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:31:42,967 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-11-29 18:31:42,967 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016160611] [2020-11-29 18:31:42,967 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 18:31:42,968 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-29 18:31:42,968 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884126490] [2020-11-29 18:31:42,968 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-29 18:31:42,968 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 18:31:42,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-29 18:31:42,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-29 18:31:42,969 INFO L87 Difference]: Start difference. First operand 234 states and 359 transitions. Second operand 4 states. [2020-11-29 18:31:43,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 18:31:43,484 INFO L93 Difference]: Finished difference Result 494 states and 756 transitions. [2020-11-29 18:31:43,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-29 18:31:43,485 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2020-11-29 18:31:43,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 18:31:43,486 INFO L225 Difference]: With dead ends: 494 [2020-11-29 18:31:43,486 INFO L226 Difference]: Without dead ends: 279 [2020-11-29 18:31:43,487 INFO L677 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 [2020-11-29 18:31:43,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2020-11-29 18:31:43,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 234. [2020-11-29 18:31:43,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2020-11-29 18:31:43,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 358 transitions. [2020-11-29 18:31:43,494 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 358 transitions. Word has length 88 [2020-11-29 18:31:43,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 18:31:43,494 INFO L481 AbstractCegarLoop]: Abstraction has 234 states and 358 transitions. [2020-11-29 18:31:43,494 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-29 18:31:43,494 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 358 transitions. [2020-11-29 18:31:43,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2020-11-29 18:31:43,495 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 18:31:43,496 INFO L422 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] [2020-11-29 18:31:43,496 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2020-11-29 18:31:43,496 INFO L429 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 18:31:43,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 18:31:43,496 INFO L82 PathProgramCache]: Analyzing trace with hash -1777463050, now seen corresponding path program 1 times [2020-11-29 18:31:43,496 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 18:31:43,497 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83131989] [2020-11-29 18:31:43,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 18:31:43,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:31:43,583 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-11-29 18:31:43,583 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83131989] [2020-11-29 18:31:43,583 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 18:31:43,583 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-29 18:31:43,583 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436520928] [2020-11-29 18:31:43,584 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-29 18:31:43,584 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 18:31:43,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-29 18:31:43,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-29 18:31:43,584 INFO L87 Difference]: Start difference. First operand 234 states and 358 transitions. Second operand 5 states. [2020-11-29 18:31:44,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 18:31:44,172 INFO L93 Difference]: Finished difference Result 470 states and 724 transitions. [2020-11-29 18:31:44,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-29 18:31:44,173 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 88 [2020-11-29 18:31:44,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 18:31:44,175 INFO L225 Difference]: With dead ends: 470 [2020-11-29 18:31:44,175 INFO L226 Difference]: Without dead ends: 255 [2020-11-29 18:31:44,176 INFO L677 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 [2020-11-29 18:31:44,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2020-11-29 18:31:44,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 254. [2020-11-29 18:31:44,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2020-11-29 18:31:44,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 384 transitions. [2020-11-29 18:31:44,185 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 384 transitions. Word has length 88 [2020-11-29 18:31:44,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 18:31:44,185 INFO L481 AbstractCegarLoop]: Abstraction has 254 states and 384 transitions. [2020-11-29 18:31:44,186 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-29 18:31:44,186 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 384 transitions. [2020-11-29 18:31:44,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2020-11-29 18:31:44,187 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 18:31:44,187 INFO L422 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] [2020-11-29 18:31:44,187 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2020-11-29 18:31:44,188 INFO L429 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 18:31:44,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 18:31:44,188 INFO L82 PathProgramCache]: Analyzing trace with hash 1235085327, now seen corresponding path program 1 times [2020-11-29 18:31:44,188 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 18:31:44,188 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478207168] [2020-11-29 18:31:44,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 18:31:44,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:31:44,257 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-11-29 18:31:44,258 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478207168] [2020-11-29 18:31:44,258 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 18:31:44,258 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-29 18:31:44,258 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492696713] [2020-11-29 18:31:44,258 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-29 18:31:44,259 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 18:31:44,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-29 18:31:44,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-29 18:31:44,259 INFO L87 Difference]: Start difference. First operand 254 states and 384 transitions. Second operand 4 states. [2020-11-29 18:31:44,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 18:31:44,563 INFO L93 Difference]: Finished difference Result 512 states and 776 transitions. [2020-11-29 18:31:44,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-29 18:31:44,564 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2020-11-29 18:31:44,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 18:31:44,565 INFO L225 Difference]: With dead ends: 512 [2020-11-29 18:31:44,565 INFO L226 Difference]: Without dead ends: 277 [2020-11-29 18:31:44,566 INFO L677 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 [2020-11-29 18:31:44,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2020-11-29 18:31:44,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 254. [2020-11-29 18:31:44,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2020-11-29 18:31:44,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 383 transitions. [2020-11-29 18:31:44,574 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 383 transitions. Word has length 88 [2020-11-29 18:31:44,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 18:31:44,574 INFO L481 AbstractCegarLoop]: Abstraction has 254 states and 383 transitions. [2020-11-29 18:31:44,574 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-29 18:31:44,574 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 383 transitions. [2020-11-29 18:31:44,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2020-11-29 18:31:44,575 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 18:31:44,575 INFO L422 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] [2020-11-29 18:31:44,575 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2020-11-29 18:31:44,575 INFO L429 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 18:31:44,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 18:31:44,576 INFO L82 PathProgramCache]: Analyzing trace with hash 1775230799, now seen corresponding path program 1 times [2020-11-29 18:31:44,576 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 18:31:44,576 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669704367] [2020-11-29 18:31:44,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 18:31:44,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:31:44,656 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-11-29 18:31:44,657 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669704367] [2020-11-29 18:31:44,657 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 18:31:44,657 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-29 18:31:44,657 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811530157] [2020-11-29 18:31:44,657 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-29 18:31:44,657 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 18:31:44,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-29 18:31:44,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-29 18:31:44,658 INFO L87 Difference]: Start difference. First operand 254 states and 383 transitions. Second operand 4 states. [2020-11-29 18:31:44,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 18:31:44,984 INFO L93 Difference]: Finished difference Result 511 states and 773 transitions. [2020-11-29 18:31:44,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-29 18:31:44,984 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2020-11-29 18:31:44,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 18:31:44,986 INFO L225 Difference]: With dead ends: 511 [2020-11-29 18:31:44,986 INFO L226 Difference]: Without dead ends: 276 [2020-11-29 18:31:44,987 INFO L677 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 [2020-11-29 18:31:44,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2020-11-29 18:31:44,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 254. [2020-11-29 18:31:44,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2020-11-29 18:31:44,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 382 transitions. [2020-11-29 18:31:44,994 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 382 transitions. Word has length 88 [2020-11-29 18:31:44,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 18:31:44,994 INFO L481 AbstractCegarLoop]: Abstraction has 254 states and 382 transitions. [2020-11-29 18:31:44,995 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-29 18:31:44,995 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 382 transitions. [2020-11-29 18:31:44,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2020-11-29 18:31:44,996 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 18:31:44,996 INFO L422 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] [2020-11-29 18:31:44,996 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2020-11-29 18:31:44,996 INFO L429 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 18:31:44,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 18:31:44,996 INFO L82 PathProgramCache]: Analyzing trace with hash 1768485220, now seen corresponding path program 1 times [2020-11-29 18:31:44,997 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 18:31:44,997 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908057940] [2020-11-29 18:31:44,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 18:31:45,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:31:45,067 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-11-29 18:31:45,067 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908057940] [2020-11-29 18:31:45,067 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 18:31:45,068 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-29 18:31:45,068 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799302279] [2020-11-29 18:31:45,068 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-29 18:31:45,068 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 18:31:45,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-29 18:31:45,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-29 18:31:45,069 INFO L87 Difference]: Start difference. First operand 254 states and 382 transitions. Second operand 4 states. [2020-11-29 18:31:45,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 18:31:45,480 INFO L93 Difference]: Finished difference Result 534 states and 801 transitions. [2020-11-29 18:31:45,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-29 18:31:45,480 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 89 [2020-11-29 18:31:45,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 18:31:45,482 INFO L225 Difference]: With dead ends: 534 [2020-11-29 18:31:45,482 INFO L226 Difference]: Without dead ends: 299 [2020-11-29 18:31:45,483 INFO L677 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 [2020-11-29 18:31:45,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2020-11-29 18:31:45,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 254. [2020-11-29 18:31:45,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2020-11-29 18:31:45,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 381 transitions. [2020-11-29 18:31:45,490 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 381 transitions. Word has length 89 [2020-11-29 18:31:45,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 18:31:45,490 INFO L481 AbstractCegarLoop]: Abstraction has 254 states and 381 transitions. [2020-11-29 18:31:45,490 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-29 18:31:45,491 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 381 transitions. [2020-11-29 18:31:45,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2020-11-29 18:31:45,491 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 18:31:45,492 INFO L422 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] [2020-11-29 18:31:45,492 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2020-11-29 18:31:45,492 INFO L429 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 18:31:45,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 18:31:45,492 INFO L82 PathProgramCache]: Analyzing trace with hash -587320030, now seen corresponding path program 1 times [2020-11-29 18:31:45,492 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 18:31:45,492 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21053683] [2020-11-29 18:31:45,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 18:31:45,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:31:45,561 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-11-29 18:31:45,562 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21053683] [2020-11-29 18:31:45,562 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 18:31:45,562 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-29 18:31:45,564 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065076342] [2020-11-29 18:31:45,564 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-29 18:31:45,564 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 18:31:45,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-29 18:31:45,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-29 18:31:45,565 INFO L87 Difference]: Start difference. First operand 254 states and 381 transitions. Second operand 4 states. [2020-11-29 18:31:45,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 18:31:45,989 INFO L93 Difference]: Finished difference Result 511 states and 769 transitions. [2020-11-29 18:31:45,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-29 18:31:45,990 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 89 [2020-11-29 18:31:45,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 18:31:45,992 INFO L225 Difference]: With dead ends: 511 [2020-11-29 18:31:45,992 INFO L226 Difference]: Without dead ends: 276 [2020-11-29 18:31:45,992 INFO L677 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 [2020-11-29 18:31:45,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2020-11-29 18:31:45,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 254. [2020-11-29 18:31:45,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2020-11-29 18:31:46,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 380 transitions. [2020-11-29 18:31:46,003 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 380 transitions. Word has length 89 [2020-11-29 18:31:46,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 18:31:46,003 INFO L481 AbstractCegarLoop]: Abstraction has 254 states and 380 transitions. [2020-11-29 18:31:46,003 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-29 18:31:46,003 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 380 transitions. [2020-11-29 18:31:46,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2020-11-29 18:31:46,004 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 18:31:46,004 INFO L422 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] [2020-11-29 18:31:46,005 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2020-11-29 18:31:46,005 INFO L429 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 18:31:46,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 18:31:46,005 INFO L82 PathProgramCache]: Analyzing trace with hash 253049097, now seen corresponding path program 1 times [2020-11-29 18:31:46,005 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 18:31:46,005 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903250706] [2020-11-29 18:31:46,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 18:31:46,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:31:46,079 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-11-29 18:31:46,079 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903250706] [2020-11-29 18:31:46,079 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 18:31:46,080 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-29 18:31:46,080 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417717530] [2020-11-29 18:31:46,080 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-29 18:31:46,080 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 18:31:46,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-29 18:31:46,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-29 18:31:46,081 INFO L87 Difference]: Start difference. First operand 254 states and 380 transitions. Second operand 4 states. [2020-11-29 18:31:46,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 18:31:46,534 INFO L93 Difference]: Finished difference Result 534 states and 797 transitions. [2020-11-29 18:31:46,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-29 18:31:46,535 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 90 [2020-11-29 18:31:46,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 18:31:46,536 INFO L225 Difference]: With dead ends: 534 [2020-11-29 18:31:46,536 INFO L226 Difference]: Without dead ends: 299 [2020-11-29 18:31:46,537 INFO L677 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 [2020-11-29 18:31:46,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2020-11-29 18:31:46,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 254. [2020-11-29 18:31:46,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2020-11-29 18:31:46,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 379 transitions. [2020-11-29 18:31:46,544 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 379 transitions. Word has length 90 [2020-11-29 18:31:46,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 18:31:46,544 INFO L481 AbstractCegarLoop]: Abstraction has 254 states and 379 transitions. [2020-11-29 18:31:46,544 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-29 18:31:46,544 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 379 transitions. [2020-11-29 18:31:46,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2020-11-29 18:31:46,545 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 18:31:46,546 INFO L422 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] [2020-11-29 18:31:46,546 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2020-11-29 18:31:46,546 INFO L429 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 18:31:46,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 18:31:46,546 INFO L82 PathProgramCache]: Analyzing trace with hash 237530379, now seen corresponding path program 1 times [2020-11-29 18:31:46,546 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 18:31:46,546 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372290984] [2020-11-29 18:31:46,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 18:31:46,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:31:46,608 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-11-29 18:31:46,608 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372290984] [2020-11-29 18:31:46,608 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 18:31:46,608 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-29 18:31:46,609 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579344856] [2020-11-29 18:31:46,609 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-29 18:31:46,609 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 18:31:46,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-29 18:31:46,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-29 18:31:46,610 INFO L87 Difference]: Start difference. First operand 254 states and 379 transitions. Second operand 4 states. [2020-11-29 18:31:47,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 18:31:47,031 INFO L93 Difference]: Finished difference Result 511 states and 765 transitions. [2020-11-29 18:31:47,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-29 18:31:47,032 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 90 [2020-11-29 18:31:47,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 18:31:47,034 INFO L225 Difference]: With dead ends: 511 [2020-11-29 18:31:47,034 INFO L226 Difference]: Without dead ends: 276 [2020-11-29 18:31:47,034 INFO L677 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 [2020-11-29 18:31:47,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2020-11-29 18:31:47,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 254. [2020-11-29 18:31:47,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2020-11-29 18:31:47,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 378 transitions. [2020-11-29 18:31:47,042 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 378 transitions. Word has length 90 [2020-11-29 18:31:47,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 18:31:47,042 INFO L481 AbstractCegarLoop]: Abstraction has 254 states and 378 transitions. [2020-11-29 18:31:47,042 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-29 18:31:47,042 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 378 transitions. [2020-11-29 18:31:47,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2020-11-29 18:31:47,043 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 18:31:47,043 INFO L422 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] [2020-11-29 18:31:47,043 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2020-11-29 18:31:47,045 INFO L429 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 18:31:47,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 18:31:47,045 INFO L82 PathProgramCache]: Analyzing trace with hash -762865057, now seen corresponding path program 1 times [2020-11-29 18:31:47,045 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 18:31:47,045 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882540155] [2020-11-29 18:31:47,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 18:31:47,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:31:47,116 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-11-29 18:31:47,116 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882540155] [2020-11-29 18:31:47,116 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 18:31:47,117 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-29 18:31:47,117 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507827675] [2020-11-29 18:31:47,117 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-29 18:31:47,117 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 18:31:47,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-29 18:31:47,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-29 18:31:47,118 INFO L87 Difference]: Start difference. First operand 254 states and 378 transitions. Second operand 4 states. [2020-11-29 18:31:47,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 18:31:47,570 INFO L93 Difference]: Finished difference Result 534 states and 793 transitions. [2020-11-29 18:31:47,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-29 18:31:47,571 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2020-11-29 18:31:47,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 18:31:47,572 INFO L225 Difference]: With dead ends: 534 [2020-11-29 18:31:47,573 INFO L226 Difference]: Without dead ends: 299 [2020-11-29 18:31:47,573 INFO L677 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 [2020-11-29 18:31:47,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2020-11-29 18:31:47,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 254. [2020-11-29 18:31:47,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2020-11-29 18:31:47,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 377 transitions. [2020-11-29 18:31:47,581 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 377 transitions. Word has length 91 [2020-11-29 18:31:47,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 18:31:47,581 INFO L481 AbstractCegarLoop]: Abstraction has 254 states and 377 transitions. [2020-11-29 18:31:47,581 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-29 18:31:47,581 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 377 transitions. [2020-11-29 18:31:47,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2020-11-29 18:31:47,582 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 18:31:47,582 INFO L422 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] [2020-11-29 18:31:47,582 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2020-11-29 18:31:47,582 INFO L429 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 18:31:47,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 18:31:47,583 INFO L82 PathProgramCache]: Analyzing trace with hash -1243945315, now seen corresponding path program 1 times [2020-11-29 18:31:47,583 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 18:31:47,583 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952621865] [2020-11-29 18:31:47,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 18:31:47,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:31:47,639 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-11-29 18:31:47,639 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952621865] [2020-11-29 18:31:47,639 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 18:31:47,640 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-29 18:31:47,640 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530144090] [2020-11-29 18:31:47,640 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-29 18:31:47,640 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 18:31:47,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-29 18:31:47,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-29 18:31:47,641 INFO L87 Difference]: Start difference. First operand 254 states and 377 transitions. Second operand 4 states. [2020-11-29 18:31:48,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 18:31:48,059 INFO L93 Difference]: Finished difference Result 511 states and 761 transitions. [2020-11-29 18:31:48,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-29 18:31:48,060 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2020-11-29 18:31:48,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 18:31:48,061 INFO L225 Difference]: With dead ends: 511 [2020-11-29 18:31:48,061 INFO L226 Difference]: Without dead ends: 276 [2020-11-29 18:31:48,062 INFO L677 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 [2020-11-29 18:31:48,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2020-11-29 18:31:48,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 254. [2020-11-29 18:31:48,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2020-11-29 18:31:48,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 376 transitions. [2020-11-29 18:31:48,069 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 376 transitions. Word has length 91 [2020-11-29 18:31:48,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 18:31:48,070 INFO L481 AbstractCegarLoop]: Abstraction has 254 states and 376 transitions. [2020-11-29 18:31:48,070 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-29 18:31:48,070 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 376 transitions. [2020-11-29 18:31:48,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2020-11-29 18:31:48,070 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 18:31:48,071 INFO L422 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] [2020-11-29 18:31:48,071 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2020-11-29 18:31:48,071 INFO L429 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 18:31:48,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 18:31:48,071 INFO L82 PathProgramCache]: Analyzing trace with hash 821499940, now seen corresponding path program 1 times [2020-11-29 18:31:48,071 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 18:31:48,071 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773331902] [2020-11-29 18:31:48,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 18:31:48,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:31:48,149 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-11-29 18:31:48,149 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773331902] [2020-11-29 18:31:48,149 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 18:31:48,149 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-29 18:31:48,149 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165179839] [2020-11-29 18:31:48,150 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-29 18:31:48,150 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 18:31:48,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-29 18:31:48,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-29 18:31:48,150 INFO L87 Difference]: Start difference. First operand 254 states and 376 transitions. Second operand 4 states. [2020-11-29 18:31:48,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 18:31:48,619 INFO L93 Difference]: Finished difference Result 524 states and 777 transitions. [2020-11-29 18:31:48,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-29 18:31:48,620 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2020-11-29 18:31:48,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 18:31:48,622 INFO L225 Difference]: With dead ends: 524 [2020-11-29 18:31:48,622 INFO L226 Difference]: Without dead ends: 289 [2020-11-29 18:31:48,622 INFO L677 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 [2020-11-29 18:31:48,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2020-11-29 18:31:48,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 254. [2020-11-29 18:31:48,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2020-11-29 18:31:48,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 375 transitions. [2020-11-29 18:31:48,630 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 375 transitions. Word has length 92 [2020-11-29 18:31:48,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 18:31:48,631 INFO L481 AbstractCegarLoop]: Abstraction has 254 states and 375 transitions. [2020-11-29 18:31:48,631 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-29 18:31:48,631 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 375 transitions. [2020-11-29 18:31:48,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2020-11-29 18:31:48,632 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 18:31:48,632 INFO L422 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] [2020-11-29 18:31:48,632 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2020-11-29 18:31:48,632 INFO L429 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 18:31:48,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 18:31:48,633 INFO L82 PathProgramCache]: Analyzing trace with hash -1207086170, now seen corresponding path program 1 times [2020-11-29 18:31:48,633 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 18:31:48,633 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612429869] [2020-11-29 18:31:48,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 18:31:48,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:31:48,692 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-11-29 18:31:48,692 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612429869] [2020-11-29 18:31:48,693 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 18:31:48,693 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-29 18:31:48,693 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423897020] [2020-11-29 18:31:48,693 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-29 18:31:48,693 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 18:31:48,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-29 18:31:48,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-29 18:31:48,694 INFO L87 Difference]: Start difference. First operand 254 states and 375 transitions. Second operand 4 states. [2020-11-29 18:31:49,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 18:31:49,079 INFO L93 Difference]: Finished difference Result 501 states and 745 transitions. [2020-11-29 18:31:49,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-29 18:31:49,080 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2020-11-29 18:31:49,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 18:31:49,081 INFO L225 Difference]: With dead ends: 501 [2020-11-29 18:31:49,081 INFO L226 Difference]: Without dead ends: 266 [2020-11-29 18:31:49,082 INFO L677 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 [2020-11-29 18:31:49,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2020-11-29 18:31:49,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 254. [2020-11-29 18:31:49,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2020-11-29 18:31:49,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 374 transitions. [2020-11-29 18:31:49,090 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 374 transitions. Word has length 92 [2020-11-29 18:31:49,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 18:31:49,090 INFO L481 AbstractCegarLoop]: Abstraction has 254 states and 374 transitions. [2020-11-29 18:31:49,090 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-29 18:31:49,090 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 374 transitions. [2020-11-29 18:31:49,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2020-11-29 18:31:49,091 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 18:31:49,091 INFO L422 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] [2020-11-29 18:31:49,092 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2020-11-29 18:31:49,092 INFO L429 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 18:31:49,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 18:31:49,092 INFO L82 PathProgramCache]: Analyzing trace with hash 1797179946, now seen corresponding path program 1 times [2020-11-29 18:31:49,092 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 18:31:49,092 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384721744] [2020-11-29 18:31:49,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 18:31:49,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:31:49,153 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-11-29 18:31:49,153 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384721744] [2020-11-29 18:31:49,154 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 18:31:49,154 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-29 18:31:49,154 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170926107] [2020-11-29 18:31:49,154 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-29 18:31:49,154 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 18:31:49,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-29 18:31:49,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-29 18:31:49,155 INFO L87 Difference]: Start difference. First operand 254 states and 374 transitions. Second operand 4 states. [2020-11-29 18:31:49,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 18:31:49,591 INFO L93 Difference]: Finished difference Result 524 states and 773 transitions. [2020-11-29 18:31:49,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-29 18:31:49,592 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2020-11-29 18:31:49,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 18:31:49,593 INFO L225 Difference]: With dead ends: 524 [2020-11-29 18:31:49,594 INFO L226 Difference]: Without dead ends: 289 [2020-11-29 18:31:49,594 INFO L677 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 [2020-11-29 18:31:49,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2020-11-29 18:31:49,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 254. [2020-11-29 18:31:49,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2020-11-29 18:31:49,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 373 transitions. [2020-11-29 18:31:49,602 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 373 transitions. Word has length 96 [2020-11-29 18:31:49,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 18:31:49,602 INFO L481 AbstractCegarLoop]: Abstraction has 254 states and 373 transitions. [2020-11-29 18:31:49,602 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-29 18:31:49,602 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 373 transitions. [2020-11-29 18:31:49,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2020-11-29 18:31:49,603 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 18:31:49,603 INFO L422 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] [2020-11-29 18:31:49,604 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2020-11-29 18:31:49,604 INFO L429 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 18:31:49,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 18:31:49,604 INFO L82 PathProgramCache]: Analyzing trace with hash -1111001940, now seen corresponding path program 1 times [2020-11-29 18:31:49,604 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 18:31:49,604 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816964024] [2020-11-29 18:31:49,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 18:31:49,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:31:49,670 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-11-29 18:31:49,670 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816964024] [2020-11-29 18:31:49,670 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 18:31:49,670 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 18:31:49,671 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387250630] [2020-11-29 18:31:49,671 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-29 18:31:49,671 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 18:31:49,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 18:31:49,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 18:31:49,672 INFO L87 Difference]: Start difference. First operand 254 states and 373 transitions. Second operand 3 states. [2020-11-29 18:31:49,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 18:31:49,754 INFO L93 Difference]: Finished difference Result 717 states and 1067 transitions. [2020-11-29 18:31:49,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 18:31:49,755 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 96 [2020-11-29 18:31:49,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 18:31:49,757 INFO L225 Difference]: With dead ends: 717 [2020-11-29 18:31:49,757 INFO L226 Difference]: Without dead ends: 482 [2020-11-29 18:31:49,758 INFO L677 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 [2020-11-29 18:31:49,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2020-11-29 18:31:49,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 482. [2020-11-29 18:31:49,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 482 states. [2020-11-29 18:31:49,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 708 transitions. [2020-11-29 18:31:49,772 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 708 transitions. Word has length 96 [2020-11-29 18:31:49,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 18:31:49,772 INFO L481 AbstractCegarLoop]: Abstraction has 482 states and 708 transitions. [2020-11-29 18:31:49,773 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-29 18:31:49,773 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 708 transitions. [2020-11-29 18:31:49,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2020-11-29 18:31:49,774 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 18:31:49,774 INFO L422 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] [2020-11-29 18:31:49,774 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2020-11-29 18:31:49,775 INFO L429 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 18:31:49,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 18:31:49,775 INFO L82 PathProgramCache]: Analyzing trace with hash 149915310, now seen corresponding path program 1 times [2020-11-29 18:31:49,775 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 18:31:49,775 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828781997] [2020-11-29 18:31:49,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 18:31:49,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:31:49,830 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2020-11-29 18:31:49,830 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828781997] [2020-11-29 18:31:49,831 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 18:31:49,831 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 18:31:49,831 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529511873] [2020-11-29 18:31:49,831 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-29 18:31:49,832 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 18:31:49,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 18:31:49,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 18:31:49,832 INFO L87 Difference]: Start difference. First operand 482 states and 708 transitions. Second operand 3 states. [2020-11-29 18:31:50,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 18:31:50,004 INFO L93 Difference]: Finished difference Result 972 states and 1431 transitions. [2020-11-29 18:31:50,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 18:31:50,005 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 96 [2020-11-29 18:31:50,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 18:31:50,008 INFO L225 Difference]: With dead ends: 972 [2020-11-29 18:31:50,008 INFO L226 Difference]: Without dead ends: 509 [2020-11-29 18:31:50,009 INFO L677 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 [2020-11-29 18:31:50,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2020-11-29 18:31:50,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 509. [2020-11-29 18:31:50,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 509 states. [2020-11-29 18:31:50,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 743 transitions. [2020-11-29 18:31:50,025 INFO L78 Accepts]: Start accepts. Automaton has 509 states and 743 transitions. Word has length 96 [2020-11-29 18:31:50,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 18:31:50,026 INFO L481 AbstractCegarLoop]: Abstraction has 509 states and 743 transitions. [2020-11-29 18:31:50,026 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-29 18:31:50,026 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 743 transitions. [2020-11-29 18:31:50,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2020-11-29 18:31:50,027 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 18:31:50,027 INFO L422 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] [2020-11-29 18:31:50,028 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2020-11-29 18:31:50,028 INFO L429 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 18:31:50,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 18:31:50,028 INFO L82 PathProgramCache]: Analyzing trace with hash 176980912, now seen corresponding path program 1 times [2020-11-29 18:31:50,028 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 18:31:50,029 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908398654] [2020-11-29 18:31:50,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 18:31:50,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:31:50,067 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2020-11-29 18:31:50,067 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908398654] [2020-11-29 18:31:50,068 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 18:31:50,069 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 18:31:50,069 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928329141] [2020-11-29 18:31:50,069 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-29 18:31:50,069 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 18:31:50,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 18:31:50,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 18:31:50,070 INFO L87 Difference]: Start difference. First operand 509 states and 743 transitions. Second operand 3 states. [2020-11-29 18:31:50,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 18:31:50,118 INFO L93 Difference]: Finished difference Result 1001 states and 1467 transitions. [2020-11-29 18:31:50,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 18:31:50,119 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 96 [2020-11-29 18:31:50,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 18:31:50,121 INFO L225 Difference]: With dead ends: 1001 [2020-11-29 18:31:50,121 INFO L226 Difference]: Without dead ends: 511 [2020-11-29 18:31:50,122 INFO L677 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 [2020-11-29 18:31:50,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2020-11-29 18:31:50,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 511. [2020-11-29 18:31:50,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 511 states. [2020-11-29 18:31:50,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 745 transitions. [2020-11-29 18:31:50,139 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 745 transitions. Word has length 96 [2020-11-29 18:31:50,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 18:31:50,140 INFO L481 AbstractCegarLoop]: Abstraction has 511 states and 745 transitions. [2020-11-29 18:31:50,141 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-29 18:31:50,141 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 745 transitions. [2020-11-29 18:31:50,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2020-11-29 18:31:50,142 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 18:31:50,142 INFO L422 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] [2020-11-29 18:31:50,142 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2020-11-29 18:31:50,143 INFO L429 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 18:31:50,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 18:31:50,143 INFO L82 PathProgramCache]: Analyzing trace with hash 870924278, now seen corresponding path program 1 times [2020-11-29 18:31:50,143 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 18:31:50,143 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920171241] [2020-11-29 18:31:50,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 18:31:50,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:31:50,194 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2020-11-29 18:31:50,195 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920171241] [2020-11-29 18:31:50,195 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 18:31:50,195 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 18:31:50,195 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970668094] [2020-11-29 18:31:50,195 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-29 18:31:50,196 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 18:31:50,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 18:31:50,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 18:31:50,196 INFO L87 Difference]: Start difference. First operand 511 states and 745 transitions. Second operand 3 states. [2020-11-29 18:31:50,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 18:31:50,287 INFO L93 Difference]: Finished difference Result 1236 states and 1817 transitions. [2020-11-29 18:31:50,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 18:31:50,288 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2020-11-29 18:31:50,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 18:31:50,291 INFO L225 Difference]: With dead ends: 1236 [2020-11-29 18:31:50,292 INFO L226 Difference]: Without dead ends: 746 [2020-11-29 18:31:50,292 INFO L677 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 [2020-11-29 18:31:50,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 746 states. [2020-11-29 18:31:50,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 746 to 744. [2020-11-29 18:31:50,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 744 states. [2020-11-29 18:31:50,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 744 states to 744 states and 1093 transitions. [2020-11-29 18:31:50,316 INFO L78 Accepts]: Start accepts. Automaton has 744 states and 1093 transitions. Word has length 98 [2020-11-29 18:31:50,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 18:31:50,317 INFO L481 AbstractCegarLoop]: Abstraction has 744 states and 1093 transitions. [2020-11-29 18:31:50,317 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-29 18:31:50,317 INFO L276 IsEmpty]: Start isEmpty. Operand 744 states and 1093 transitions. [2020-11-29 18:31:50,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2020-11-29 18:31:50,318 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 18:31:50,318 INFO L422 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] [2020-11-29 18:31:50,319 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2020-11-29 18:31:50,319 INFO L429 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 18:31:50,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 18:31:50,319 INFO L82 PathProgramCache]: Analyzing trace with hash 1276717877, now seen corresponding path program 1 times [2020-11-29 18:31:50,319 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 18:31:50,319 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940660075] [2020-11-29 18:31:50,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 18:31:50,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:31:50,374 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2020-11-29 18:31:50,374 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940660075] [2020-11-29 18:31:50,375 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 18:31:50,375 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 18:31:50,375 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033127576] [2020-11-29 18:31:50,375 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-29 18:31:50,375 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 18:31:50,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 18:31:50,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 18:31:50,376 INFO L87 Difference]: Start difference. First operand 744 states and 1093 transitions. Second operand 3 states. [2020-11-29 18:31:50,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 18:31:50,484 INFO L93 Difference]: Finished difference Result 1702 states and 2511 transitions. [2020-11-29 18:31:50,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 18:31:50,484 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2020-11-29 18:31:50,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 18:31:50,490 INFO L225 Difference]: With dead ends: 1702 [2020-11-29 18:31:50,490 INFO L226 Difference]: Without dead ends: 979 [2020-11-29 18:31:50,491 INFO L677 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 [2020-11-29 18:31:50,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 979 states. [2020-11-29 18:31:50,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 979 to 977. [2020-11-29 18:31:50,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 977 states. [2020-11-29 18:31:50,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 977 states to 977 states and 1427 transitions. [2020-11-29 18:31:50,523 INFO L78 Accepts]: Start accepts. Automaton has 977 states and 1427 transitions. Word has length 104 [2020-11-29 18:31:50,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 18:31:50,523 INFO L481 AbstractCegarLoop]: Abstraction has 977 states and 1427 transitions. [2020-11-29 18:31:50,524 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-29 18:31:50,524 INFO L276 IsEmpty]: Start isEmpty. Operand 977 states and 1427 transitions. [2020-11-29 18:31:50,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2020-11-29 18:31:50,526 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 18:31:50,526 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 18:31:50,526 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2020-11-29 18:31:50,526 INFO L429 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 18:31:50,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 18:31:50,527 INFO L82 PathProgramCache]: Analyzing trace with hash 2010094734, now seen corresponding path program 1 times [2020-11-29 18:31:50,527 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 18:31:50,527 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988434982] [2020-11-29 18:31:50,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 18:31:50,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:31:50,590 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2020-11-29 18:31:50,590 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988434982] [2020-11-29 18:31:50,590 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 18:31:50,591 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 18:31:50,591 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959567699] [2020-11-29 18:31:50,591 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-29 18:31:50,591 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 18:31:50,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 18:31:50,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 18:31:50,592 INFO L87 Difference]: Start difference. First operand 977 states and 1427 transitions. Second operand 3 states. [2020-11-29 18:31:50,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 18:31:50,685 INFO L93 Difference]: Finished difference Result 2166 states and 3178 transitions. [2020-11-29 18:31:50,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 18:31:50,686 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2020-11-29 18:31:50,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 18:31:50,692 INFO L225 Difference]: With dead ends: 2166 [2020-11-29 18:31:50,692 INFO L226 Difference]: Without dead ends: 1210 [2020-11-29 18:31:50,693 INFO L677 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 [2020-11-29 18:31:50,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1210 states. [2020-11-29 18:31:50,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1210 to 1210. [2020-11-29 18:31:50,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1210 states. [2020-11-29 18:31:50,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1210 states to 1210 states and 1772 transitions. [2020-11-29 18:31:50,729 INFO L78 Accepts]: Start accepts. Automaton has 1210 states and 1772 transitions. Word has length 121 [2020-11-29 18:31:50,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 18:31:50,729 INFO L481 AbstractCegarLoop]: Abstraction has 1210 states and 1772 transitions. [2020-11-29 18:31:50,730 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-29 18:31:50,730 INFO L276 IsEmpty]: Start isEmpty. Operand 1210 states and 1772 transitions. [2020-11-29 18:31:50,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2020-11-29 18:31:50,732 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 18:31:50,732 INFO L422 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] [2020-11-29 18:31:50,732 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2020-11-29 18:31:50,733 INFO L429 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 18:31:50,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 18:31:50,733 INFO L82 PathProgramCache]: Analyzing trace with hash 893597874, now seen corresponding path program 1 times [2020-11-29 18:31:50,733 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 18:31:50,733 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806796006] [2020-11-29 18:31:50,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 18:31:50,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:31:50,795 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2020-11-29 18:31:50,795 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806796006] [2020-11-29 18:31:50,796 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 18:31:50,796 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 18:31:50,796 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487464825] [2020-11-29 18:31:50,796 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-29 18:31:50,796 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 18:31:50,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 18:31:50,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 18:31:50,797 INFO L87 Difference]: Start difference. First operand 1210 states and 1772 transitions. Second operand 3 states. [2020-11-29 18:31:50,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 18:31:50,880 INFO L93 Difference]: Finished difference Result 1447 states and 2117 transitions. [2020-11-29 18:31:50,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 18:31:50,881 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 127 [2020-11-29 18:31:50,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 18:31:50,889 INFO L225 Difference]: With dead ends: 1447 [2020-11-29 18:31:50,889 INFO L226 Difference]: Without dead ends: 1445 [2020-11-29 18:31:50,889 INFO L677 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 [2020-11-29 18:31:50,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1445 states. [2020-11-29 18:31:50,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1445 to 1443. [2020-11-29 18:31:50,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1443 states. [2020-11-29 18:31:50,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1443 states to 1443 states and 2114 transitions. [2020-11-29 18:31:50,934 INFO L78 Accepts]: Start accepts. Automaton has 1443 states and 2114 transitions. Word has length 127 [2020-11-29 18:31:50,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 18:31:50,934 INFO L481 AbstractCegarLoop]: Abstraction has 1443 states and 2114 transitions. [2020-11-29 18:31:50,935 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-29 18:31:50,935 INFO L276 IsEmpty]: Start isEmpty. Operand 1443 states and 2114 transitions. [2020-11-29 18:31:50,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2020-11-29 18:31:50,938 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 18:31:50,938 INFO L422 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] [2020-11-29 18:31:50,938 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2020-11-29 18:31:50,938 INFO L429 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 18:31:50,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 18:31:50,939 INFO L82 PathProgramCache]: Analyzing trace with hash 990449606, now seen corresponding path program 1 times [2020-11-29 18:31:50,939 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 18:31:50,939 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878843317] [2020-11-29 18:31:50,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 18:31:51,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:31:51,710 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 14 proven. 185 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 18:31:51,710 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878843317] [2020-11-29 18:31:51,711 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [107650401] [2020-11-29 18:31:51,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_42dd8acb-5f7c-4b36-90da-de8d148c03f2/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 [2020-11-29 18:31:51,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:31:51,996 INFO L263 TraceCheckSpWp]: Trace formula consists of 626 conjuncts, 43 conjunts are in the unsatisfiable core [2020-11-29 18:31:52,012 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 18:31:52,266 INFO L384 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 [2020-11-29 18:31:52,269 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 18:31:52,404 WARN L193 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2020-11-29 18:31:52,406 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 18:31:52,414 INFO L441 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_162|, |v_#memory_$Pointer$.offset_161|], 2=[|v_#memory_$Pointer$.offset_159|, |v_#memory_$Pointer$.base_159|, |v_#memory_$Pointer$.base_158|, |v_#memory_$Pointer$.offset_158|]} [2020-11-29 18:31:52,438 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 18:31:52,456 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 18:31:52,461 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 18:31:52,467 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 18:31:52,471 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 18:31:52,476 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 18:31:52,522 INFO L384 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 [2020-11-29 18:31:52,522 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-29 18:31:52,623 WARN L193 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2020-11-29 18:31:52,624 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 18:31:52,646 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 18:31:52,648 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 18:31:52,650 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 18:31:52,653 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 18:31:52,655 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 18:31:52,658 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 18:31:52,687 INFO L384 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 [2020-11-29 18:31:52,687 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-11-29 18:31:52,762 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 18:31:52,770 INFO L545 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-29 18:31:52,839 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 18:31:52,849 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 18:31:52,852 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 18:31:52,854 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 18:31:52,856 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 18:31:52,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 18:31:52,860 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 18:31:52,870 INFO L384 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 [2020-11-29 18:31:52,872 INFO L545 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2020-11-29 18:31:52,923 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 18:31:52,936 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 18:31:52,937 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 18:31:52,938 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 18:31:52,940 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 18:31:52,941 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 18:31:52,942 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 18:31:52,944 INFO L384 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 [2020-11-29 18:31:52,945 INFO L545 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2020-11-29 18:31:52,976 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 18:31:52,995 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 18:31:52,997 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 18:31:52,999 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 18:31:53,000 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 18:31:53,002 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 18:31:53,003 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 18:31:53,005 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 18:31:53,006 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 18:31:53,007 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 18:31:53,018 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 18:31:53,020 INFO L384 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 [2020-11-29 18:31:53,022 INFO L545 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2020-11-29 18:31:53,056 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 18:31:53,065 INFO L545 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, 6 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 18:31:53,065 INFO L244 ElimStorePlain]: Needed 8 recursive calls to eliminate 13 variables, input treesize:159, output treesize:23 [2020-11-29 18:31:53,107 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 18:31:53,108 INFO L384 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 [2020-11-29 18:31:53,109 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 18:31:53,121 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 18:31:53,126 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 18:31:53,127 INFO L384 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 [2020-11-29 18:31:53,128 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-29 18:31:53,137 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 18:31:53,137 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 18:31:53,137 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:61, output treesize:23 [2020-11-29 18:31:53,165 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 18:31:53,166 INFO L384 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 [2020-11-29 18:31:53,167 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 18:31:53,180 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 18:31:53,185 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 18:31:53,185 INFO L384 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 [2020-11-29 18:31:53,186 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-29 18:31:53,195 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 18:31:53,196 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 18:31:53,196 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:61, output treesize:23 [2020-11-29 18:31:53,212 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-29 18:31:53,240 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 18:31:53,244 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-29 18:31:53,266 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 18:31:53,272 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 18:31:53,274 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 18:31:53,276 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 18:31:53,277 INFO L384 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 34 treesize of output 22 [2020-11-29 18:31:53,278 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-11-29 18:31:53,296 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 18:31:53,301 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 18:31:53,303 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 18:31:53,304 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 18:31:53,306 INFO L384 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 [2020-11-29 18:31:53,307 INFO L545 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-11-29 18:31:53,322 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 18:31:53,325 INFO L545 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 18:31:53,325 INFO L244 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:99, output treesize:23 [2020-11-29 18:31:53,338 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 18:31:53,339 INFO L384 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 [2020-11-29 18:31:53,340 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 18:31:53,353 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 18:31:53,358 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 18:31:53,359 INFO L384 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 [2020-11-29 18:31:53,360 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-29 18:31:53,369 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 18:31:53,369 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 18:31:53,369 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:61, output treesize:23 [2020-11-29 18:31:53,380 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 18:31:53,381 INFO L384 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 [2020-11-29 18:31:53,382 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 18:31:53,392 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 18:31:53,396 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 18:31:53,396 INFO L384 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 [2020-11-29 18:31:53,397 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-29 18:31:53,409 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 18:31:53,409 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 18:31:53,410 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:61, output treesize:23 [2020-11-29 18:31:53,421 INFO L441 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_167|], 12=[|v_#memory_$Pointer$.base_168|]} [2020-11-29 18:31:53,435 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 18:31:53,436 INFO L384 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 0 case distinctions, treesize of input 59 treesize of output 41 [2020-11-29 18:31:53,439 INFO L545 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-29 18:31:53,452 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 18:31:53,460 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 18:31:53,463 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 18:31:53,564 INFO L350 Elim1Store]: treesize reduction 34, result has 71.4 percent of original size [2020-11-29 18:31:53,564 INFO L384 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 5 new quantified variables, introduced 5 case distinctions, treesize of input 48 treesize of output 113 [2020-11-29 18:31:53,568 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 3, 2, 1] term [2020-11-29 18:31:53,568 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 18:31:53,570 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-29 18:31:53,632 INFO L625 ElimStorePlain]: treesize reduction 207, result has 26.3 percent of original size [2020-11-29 18:31:53,634 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 18:31:53,638 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-29 18:31:53,639 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:72, output treesize:74 [2020-11-29 18:31:53,640 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 18:31:53,692 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 18:31:55,823 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 18:31:55,838 INFO L441 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_161|], 30=[|v_#memory_$Pointer$.base_169|]} [2020-11-29 18:31:55,844 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-29 18:31:55,851 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-29 18:31:55,920 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 18:31:55,932 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 18:31:55,939 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 18:31:55,941 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 18:31:55,943 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 18:31:55,944 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 18:31:55,947 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 18:31:56,110 WARN L193 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 41 [2020-11-29 18:31:56,111 INFO L350 Elim1Store]: treesize reduction 39, result has 69.0 percent of original size [2020-11-29 18:31:56,111 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 56 treesize of output 124 [2020-11-29 18:31:56,112 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-11-29 18:31:56,119 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 18:31:56,121 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 18:31:56,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 18:31:56,123 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 18:31:56,125 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 18:31:56,126 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 18:31:56,130 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 18:31:56,131 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 18:31:56,138 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 18:31:56,281 WARN L193 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 58 [2020-11-29 18:31:56,282 INFO L350 Elim1Store]: treesize reduction 39, result has 75.3 percent of original size [2020-11-29 18:31:56,282 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 62 treesize of output 168 [2020-11-29 18:31:56,284 INFO L545 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-11-29 18:31:56,396 WARN L193 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 43 [2020-11-29 18:31:56,397 INFO L625 ElimStorePlain]: treesize reduction 292, result has 26.1 percent of original size [2020-11-29 18:31:56,405 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2020-11-29 18:31:56,406 INFO L244 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:161, output treesize:85 [2020-11-29 18:33:19,582 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 18:33:19,618 INFO L441 ElimStorePlain]: Different costs {0=[|v_#memory_int_178|], 30=[|v_#memory_$Pointer$.base_170|]} [2020-11-29 18:33:19,630 INFO L384 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 [2020-11-29 18:33:19,630 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 18:33:19,640 INFO L384 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 [2020-11-29 18:33:19,641 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-29 18:33:19,696 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 18:33:19,704 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 18:33:19,707 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 18:33:19,710 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 18:33:19,722 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 18:33:19,725 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 18:33:19,799 INFO L350 Elim1Store]: treesize reduction 28, result has 75.4 percent of original size [2020-11-29 18:33:19,799 INFO L384 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 6 new quantified variables, introduced 6 case distinctions, treesize of input 57 treesize of output 126 [2020-11-29 18:33:19,801 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-11-29 18:33:19,815 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 18:33:19,816 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 18:33:19,817 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 18:33:19,900 INFO L350 Elim1Store]: treesize reduction 28, result has 65.9 percent of original size [2020-11-29 18:33:19,901 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 82 [2020-11-29 18:33:19,901 INFO L545 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-11-29 18:33:19,984 INFO L625 ElimStorePlain]: treesize reduction 190, result has 35.2 percent of original size [2020-11-29 18:33:19,985 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2020-11-29 18:33:19,985 INFO L244 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:149, output treesize:103 [2020-11-29 18:33:22,091 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 18:33:22,108 INFO L441 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_168|], 2=[|v_#memory_int_179|], 20=[|v_#memory_$Pointer$.base_171|]} [2020-11-29 18:33:22,118 INFO L384 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 31 treesize of output 25 [2020-11-29 18:33:22,119 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-29 18:33:22,131 INFO L384 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 31 treesize of output 25 [2020-11-29 18:33:22,131 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-29 18:33:22,173 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 18:33:22,183 INFO L384 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 35 treesize of output 28 [2020-11-29 18:33:22,183 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-11-29 18:33:22,190 INFO L384 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 35 treesize of output 28 [2020-11-29 18:33:22,191 INFO L545 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-11-29 18:33:22,239 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 18:33:22,251 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 18:33:22,270 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 18:33:22,323 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 18:33:22,324 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 53 treesize of output 87 [2020-11-29 18:33:22,326 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-11-29 18:33:22,329 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-11-29 18:33:22,335 INFO L545 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-29 18:33:22,347 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 18:33:22,380 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 18:33:22,380 INFO L384 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 4 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 52 [2020-11-29 18:33:22,384 INFO L545 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-29 18:33:22,429 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 18:33:22,431 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 3 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2020-11-29 18:33:22,432 INFO L244 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:165, output treesize:58 [2020-11-29 18:33:25,410 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 18:33:25,411 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2020-11-29 18:33:25,412 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 18:33:25,422 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 18:33:25,423 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-29 18:33:25,423 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:39, output treesize:35 [2020-11-29 18:33:25,539 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 18:33:25,540 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 13 [2020-11-29 18:33:25,541 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 18:33:25,549 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 18:33:25,551 INFO L545 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 18:33:25,551 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:44, output treesize:3 [2020-11-29 18:33:25,865 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 0 proven. 160 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2020-11-29 18:33:25,865 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 18:33:25,865 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2020-11-29 18:33:25,866 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481469441] [2020-11-29 18:33:25,866 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-11-29 18:33:25,866 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 18:33:25,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-11-29 18:33:25,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=197, Unknown=4, NotChecked=0, Total=240 [2020-11-29 18:33:25,867 INFO L87 Difference]: Start difference. First operand 1443 states and 2114 transitions. Second operand 16 states. [2020-11-29 18:33:34,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 18:33:34,386 INFO L93 Difference]: Finished difference Result 6543 states and 9668 transitions. [2020-11-29 18:33:34,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-29 18:33:34,388 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 164 [2020-11-29 18:33:34,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 18:33:34,417 INFO L225 Difference]: With dead ends: 6543 [2020-11-29 18:33:34,418 INFO L226 Difference]: Without dead ends: 5121 [2020-11-29 18:33:34,421 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 116 SyntacticMatches, 48 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 242 ImplicationChecksByTransitivity, 90.9s TimeCoverageRelationStatistics Valid=136, Invalid=412, Unknown=4, NotChecked=0, Total=552 [2020-11-29 18:33:34,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5121 states. [2020-11-29 18:33:34,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5121 to 2935. [2020-11-29 18:33:34,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2935 states. [2020-11-29 18:33:34,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2935 states to 2935 states and 4395 transitions. [2020-11-29 18:33:34,585 INFO L78 Accepts]: Start accepts. Automaton has 2935 states and 4395 transitions. Word has length 164 [2020-11-29 18:33:34,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 18:33:34,585 INFO L481 AbstractCegarLoop]: Abstraction has 2935 states and 4395 transitions. [2020-11-29 18:33:34,585 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-11-29 18:33:34,586 INFO L276 IsEmpty]: Start isEmpty. Operand 2935 states and 4395 transitions. [2020-11-29 18:33:34,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2020-11-29 18:33:34,592 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 18:33:34,593 INFO L422 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, 1, 1, 1, 1, 1] [2020-11-29 18:33:34,806 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable47 [2020-11-29 18:33:34,806 INFO L429 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 18:33:34,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 18:33:34,807 INFO L82 PathProgramCache]: Analyzing trace with hash -1277551777, now seen corresponding path program 1 times [2020-11-29 18:33:34,807 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 18:33:34,807 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060836237] [2020-11-29 18:33:34,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 18:33:34,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:33:34,912 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 159 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2020-11-29 18:33:34,913 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060836237] [2020-11-29 18:33:34,913 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 18:33:34,913 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-29 18:33:34,913 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485650975] [2020-11-29 18:33:34,914 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-29 18:33:34,914 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 18:33:34,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-29 18:33:34,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-29 18:33:34,914 INFO L87 Difference]: Start difference. First operand 2935 states and 4395 transitions. Second operand 4 states. [2020-11-29 18:33:35,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 18:33:35,670 INFO L93 Difference]: Finished difference Result 6545 states and 9846 transitions. [2020-11-29 18:33:35,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-29 18:33:35,671 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 170 [2020-11-29 18:33:35,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 18:33:35,692 INFO L225 Difference]: With dead ends: 6545 [2020-11-29 18:33:35,692 INFO L226 Difference]: Without dead ends: 3631 [2020-11-29 18:33:35,697 INFO L677 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 [2020-11-29 18:33:35,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3631 states. [2020-11-29 18:33:35,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3631 to 3271. [2020-11-29 18:33:35,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3271 states. [2020-11-29 18:33:35,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3271 states to 3271 states and 4983 transitions. [2020-11-29 18:33:35,832 INFO L78 Accepts]: Start accepts. Automaton has 3271 states and 4983 transitions. Word has length 170 [2020-11-29 18:33:35,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 18:33:35,832 INFO L481 AbstractCegarLoop]: Abstraction has 3271 states and 4983 transitions. [2020-11-29 18:33:35,832 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-29 18:33:35,832 INFO L276 IsEmpty]: Start isEmpty. Operand 3271 states and 4983 transitions. [2020-11-29 18:33:35,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2020-11-29 18:33:35,839 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 18:33:35,839 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 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, 1] [2020-11-29 18:33:35,840 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2020-11-29 18:33:35,840 INFO L429 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 18:33:35,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 18:33:35,840 INFO L82 PathProgramCache]: Analyzing trace with hash 1034431756, now seen corresponding path program 1 times [2020-11-29 18:33:35,840 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 18:33:35,841 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008363209] [2020-11-29 18:33:35,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 18:33:35,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:33:35,985 INFO L134 CoverageAnalysis]: Checked inductivity of 261 backedges. 109 proven. 0 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2020-11-29 18:33:35,985 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008363209] [2020-11-29 18:33:35,985 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 18:33:35,986 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-29 18:33:35,986 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767796828] [2020-11-29 18:33:35,986 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-29 18:33:35,986 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 18:33:35,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-29 18:33:35,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-29 18:33:35,987 INFO L87 Difference]: Start difference. First operand 3271 states and 4983 transitions. Second operand 4 states. [2020-11-29 18:33:36,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 18:33:36,672 INFO L93 Difference]: Finished difference Result 7663 states and 11689 transitions. [2020-11-29 18:33:36,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-29 18:33:36,673 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 178 [2020-11-29 18:33:36,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 18:33:36,691 INFO L225 Difference]: With dead ends: 7663 [2020-11-29 18:33:36,692 INFO L226 Difference]: Without dead ends: 4413 [2020-11-29 18:33:36,696 INFO L677 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 [2020-11-29 18:33:36,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4413 states. [2020-11-29 18:33:36,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4413 to 3739. [2020-11-29 18:33:36,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3739 states. [2020-11-29 18:33:36,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3739 states to 3739 states and 5835 transitions. [2020-11-29 18:33:36,845 INFO L78 Accepts]: Start accepts. Automaton has 3739 states and 5835 transitions. Word has length 178 [2020-11-29 18:33:36,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 18:33:36,846 INFO L481 AbstractCegarLoop]: Abstraction has 3739 states and 5835 transitions. [2020-11-29 18:33:36,846 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-29 18:33:36,846 INFO L276 IsEmpty]: Start isEmpty. Operand 3739 states and 5835 transitions. [2020-11-29 18:33:36,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2020-11-29 18:33:36,855 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 18:33:36,855 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 18:33:36,856 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2020-11-29 18:33:36,856 INFO L429 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 18:33:36,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 18:33:36,856 INFO L82 PathProgramCache]: Analyzing trace with hash 1995576182, now seen corresponding path program 1 times [2020-11-29 18:33:36,857 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 18:33:36,857 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268613907] [2020-11-29 18:33:36,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 18:33:36,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:33:36,989 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2020-11-29 18:33:36,989 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268613907] [2020-11-29 18:33:36,989 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 18:33:36,990 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-29 18:33:36,990 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482363540] [2020-11-29 18:33:36,990 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-29 18:33:36,990 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 18:33:36,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-29 18:33:36,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-29 18:33:36,991 INFO L87 Difference]: Start difference. First operand 3739 states and 5835 transitions. Second operand 4 states. [2020-11-29 18:33:37,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 18:33:37,814 INFO L93 Difference]: Finished difference Result 8081 states and 12466 transitions. [2020-11-29 18:33:37,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-29 18:33:37,815 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 179 [2020-11-29 18:33:37,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 18:33:37,828 INFO L225 Difference]: With dead ends: 8081 [2020-11-29 18:33:37,828 INFO L226 Difference]: Without dead ends: 4363 [2020-11-29 18:33:37,832 INFO L677 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 [2020-11-29 18:33:37,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4363 states. [2020-11-29 18:33:37,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4363 to 3619. [2020-11-29 18:33:37,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3619 states. [2020-11-29 18:33:37,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3619 states to 3619 states and 5607 transitions. [2020-11-29 18:33:37,953 INFO L78 Accepts]: Start accepts. Automaton has 3619 states and 5607 transitions. Word has length 179 [2020-11-29 18:33:37,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 18:33:37,954 INFO L481 AbstractCegarLoop]: Abstraction has 3619 states and 5607 transitions. [2020-11-29 18:33:37,954 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-29 18:33:37,954 INFO L276 IsEmpty]: Start isEmpty. Operand 3619 states and 5607 transitions. [2020-11-29 18:33:37,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2020-11-29 18:33:37,962 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 18:33:37,962 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 18:33:37,962 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2020-11-29 18:33:37,962 INFO L429 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 18:33:37,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 18:33:37,963 INFO L82 PathProgramCache]: Analyzing trace with hash 289713635, now seen corresponding path program 1 times [2020-11-29 18:33:37,963 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 18:33:37,963 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818500607] [2020-11-29 18:33:37,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 18:33:38,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:33:38,148 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2020-11-29 18:33:38,149 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818500607] [2020-11-29 18:33:38,149 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 18:33:38,149 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-29 18:33:38,149 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506431370] [2020-11-29 18:33:38,150 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-29 18:33:38,150 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 18:33:38,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-29 18:33:38,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-29 18:33:38,150 INFO L87 Difference]: Start difference. First operand 3619 states and 5607 transitions. Second operand 5 states. [2020-11-29 18:33:38,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 18:33:38,983 INFO L93 Difference]: Finished difference Result 8731 states and 13553 transitions. [2020-11-29 18:33:38,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-29 18:33:38,984 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 179 [2020-11-29 18:33:38,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 18:33:38,993 INFO L225 Difference]: With dead ends: 8731 [2020-11-29 18:33:38,993 INFO L226 Difference]: Without dead ends: 5133 [2020-11-29 18:33:38,997 INFO L677 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 [2020-11-29 18:33:39,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5133 states. [2020-11-29 18:33:39,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5133 to 4093. [2020-11-29 18:33:39,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4093 states. [2020-11-29 18:33:39,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4093 states to 4093 states and 6465 transitions. [2020-11-29 18:33:39,127 INFO L78 Accepts]: Start accepts. Automaton has 4093 states and 6465 transitions. Word has length 179 [2020-11-29 18:33:39,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 18:33:39,127 INFO L481 AbstractCegarLoop]: Abstraction has 4093 states and 6465 transitions. [2020-11-29 18:33:39,127 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-29 18:33:39,127 INFO L276 IsEmpty]: Start isEmpty. Operand 4093 states and 6465 transitions. [2020-11-29 18:33:39,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2020-11-29 18:33:39,134 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 18:33:39,135 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 18:33:39,135 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2020-11-29 18:33:39,135 INFO L429 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 18:33:39,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 18:33:39,136 INFO L82 PathProgramCache]: Analyzing trace with hash -1455825383, now seen corresponding path program 2 times [2020-11-29 18:33:39,136 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 18:33:39,136 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093424098] [2020-11-29 18:33:39,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 18:33:39,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:33:39,272 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 158 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2020-11-29 18:33:39,272 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093424098] [2020-11-29 18:33:39,272 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 18:33:39,273 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-29 18:33:39,273 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726736277] [2020-11-29 18:33:39,273 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-29 18:33:39,273 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 18:33:39,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-29 18:33:39,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-29 18:33:39,274 INFO L87 Difference]: Start difference. First operand 4093 states and 6465 transitions. Second operand 4 states. [2020-11-29 18:33:39,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 18:33:39,939 INFO L93 Difference]: Finished difference Result 7055 states and 11050 transitions. [2020-11-29 18:33:39,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-29 18:33:39,940 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 179 [2020-11-29 18:33:39,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 18:33:39,951 INFO L225 Difference]: With dead ends: 7055 [2020-11-29 18:33:39,951 INFO L226 Difference]: Without dead ends: 5051 [2020-11-29 18:33:39,954 INFO L677 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 [2020-11-29 18:33:39,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5051 states. [2020-11-29 18:33:40,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5051 to 4213. [2020-11-29 18:33:40,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4213 states. [2020-11-29 18:33:40,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4213 states to 4213 states and 6635 transitions. [2020-11-29 18:33:40,137 INFO L78 Accepts]: Start accepts. Automaton has 4213 states and 6635 transitions. Word has length 179 [2020-11-29 18:33:40,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 18:33:40,138 INFO L481 AbstractCegarLoop]: Abstraction has 4213 states and 6635 transitions. [2020-11-29 18:33:40,138 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-29 18:33:40,138 INFO L276 IsEmpty]: Start isEmpty. Operand 4213 states and 6635 transitions. [2020-11-29 18:33:40,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2020-11-29 18:33:40,145 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 18:33:40,145 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 18:33:40,145 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2020-11-29 18:33:40,146 INFO L429 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 18:33:40,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 18:33:40,146 INFO L82 PathProgramCache]: Analyzing trace with hash -1317975036, now seen corresponding path program 1 times [2020-11-29 18:33:40,146 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 18:33:40,146 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211624458] [2020-11-29 18:33:40,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 18:33:40,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:33:40,270 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 163 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2020-11-29 18:33:40,270 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211624458] [2020-11-29 18:33:40,270 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 18:33:40,271 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-29 18:33:40,271 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123008920] [2020-11-29 18:33:40,271 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-29 18:33:40,271 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 18:33:40,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-29 18:33:40,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-29 18:33:40,272 INFO L87 Difference]: Start difference. First operand 4213 states and 6635 transitions. Second operand 4 states. [2020-11-29 18:33:40,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 18:33:40,922 INFO L93 Difference]: Finished difference Result 7115 states and 11125 transitions. [2020-11-29 18:33:40,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-29 18:33:40,923 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 180 [2020-11-29 18:33:40,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 18:33:40,934 INFO L225 Difference]: With dead ends: 7115 [2020-11-29 18:33:40,934 INFO L226 Difference]: Without dead ends: 5051 [2020-11-29 18:33:40,937 INFO L677 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 [2020-11-29 18:33:40,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5051 states. [2020-11-29 18:33:41,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5051 to 4223. [2020-11-29 18:33:41,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4223 states. [2020-11-29 18:33:41,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4223 states to 4223 states and 6645 transitions. [2020-11-29 18:33:41,118 INFO L78 Accepts]: Start accepts. Automaton has 4223 states and 6645 transitions. Word has length 180 [2020-11-29 18:33:41,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 18:33:41,118 INFO L481 AbstractCegarLoop]: Abstraction has 4223 states and 6645 transitions. [2020-11-29 18:33:41,118 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-29 18:33:41,118 INFO L276 IsEmpty]: Start isEmpty. Operand 4223 states and 6645 transitions. [2020-11-29 18:33:41,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2020-11-29 18:33:41,125 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 18:33:41,125 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 18:33:41,126 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2020-11-29 18:33:41,126 INFO L429 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 18:33:41,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 18:33:41,126 INFO L82 PathProgramCache]: Analyzing trace with hash 384150911, now seen corresponding path program 1 times [2020-11-29 18:33:41,126 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 18:33:41,127 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176167444] [2020-11-29 18:33:41,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 18:33:41,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:33:41,297 INFO L134 CoverageAnalysis]: Checked inductivity of 233 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2020-11-29 18:33:41,297 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176167444] [2020-11-29 18:33:41,297 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 18:33:41,297 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-29 18:33:41,298 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414016300] [2020-11-29 18:33:41,299 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-29 18:33:41,299 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 18:33:41,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-29 18:33:41,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-29 18:33:41,299 INFO L87 Difference]: Start difference. First operand 4223 states and 6645 transitions. Second operand 5 states. [2020-11-29 18:33:42,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 18:33:42,087 INFO L93 Difference]: Finished difference Result 9603 states and 15083 transitions. [2020-11-29 18:33:42,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-29 18:33:42,088 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 180 [2020-11-29 18:33:42,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 18:33:42,097 INFO L225 Difference]: With dead ends: 9603 [2020-11-29 18:33:42,098 INFO L226 Difference]: Without dead ends: 5401 [2020-11-29 18:33:42,103 INFO L677 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 [2020-11-29 18:33:42,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5401 states. [2020-11-29 18:33:42,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5401 to 4091. [2020-11-29 18:33:42,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4091 states. [2020-11-29 18:33:42,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4091 states to 4091 states and 6465 transitions. [2020-11-29 18:33:42,326 INFO L78 Accepts]: Start accepts. Automaton has 4091 states and 6465 transitions. Word has length 180 [2020-11-29 18:33:42,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 18:33:42,327 INFO L481 AbstractCegarLoop]: Abstraction has 4091 states and 6465 transitions. [2020-11-29 18:33:42,327 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-29 18:33:42,327 INFO L276 IsEmpty]: Start isEmpty. Operand 4091 states and 6465 transitions. [2020-11-29 18:33:42,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2020-11-29 18:33:42,335 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 18:33:42,335 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 18:33:42,335 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2020-11-29 18:33:42,335 INFO L429 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 18:33:42,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 18:33:42,336 INFO L82 PathProgramCache]: Analyzing trace with hash 1028551806, now seen corresponding path program 1 times [2020-11-29 18:33:42,336 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 18:33:42,336 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505236750] [2020-11-29 18:33:42,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 18:33:42,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:33:42,458 INFO L134 CoverageAnalysis]: Checked inductivity of 241 backedges. 168 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2020-11-29 18:33:42,458 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505236750] [2020-11-29 18:33:42,458 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 18:33:42,458 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-29 18:33:42,459 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599017373] [2020-11-29 18:33:42,459 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-29 18:33:42,459 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 18:33:42,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-29 18:33:42,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-29 18:33:42,460 INFO L87 Difference]: Start difference. First operand 4091 states and 6465 transitions. Second operand 4 states. [2020-11-29 18:33:43,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 18:33:43,117 INFO L93 Difference]: Finished difference Result 6880 states and 10787 transitions. [2020-11-29 18:33:43,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-29 18:33:43,118 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 181 [2020-11-29 18:33:43,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 18:33:43,124 INFO L225 Difference]: With dead ends: 6880 [2020-11-29 18:33:43,124 INFO L226 Difference]: Without dead ends: 4877 [2020-11-29 18:33:43,127 INFO L677 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 [2020-11-29 18:33:43,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4877 states. [2020-11-29 18:33:43,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4877 to 4101. [2020-11-29 18:33:43,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4101 states. [2020-11-29 18:33:43,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4101 states to 4101 states and 6475 transitions. [2020-11-29 18:33:43,271 INFO L78 Accepts]: Start accepts. Automaton has 4101 states and 6475 transitions. Word has length 181 [2020-11-29 18:33:43,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 18:33:43,272 INFO L481 AbstractCegarLoop]: Abstraction has 4101 states and 6475 transitions. [2020-11-29 18:33:43,272 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-29 18:33:43,272 INFO L276 IsEmpty]: Start isEmpty. Operand 4101 states and 6475 transitions. [2020-11-29 18:33:43,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2020-11-29 18:33:43,280 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 18:33:43,280 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 18:33:43,280 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2020-11-29 18:33:43,281 INFO L429 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 18:33:43,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 18:33:43,281 INFO L82 PathProgramCache]: Analyzing trace with hash -1170394039, now seen corresponding path program 1 times [2020-11-29 18:33:43,281 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 18:33:43,281 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515736020] [2020-11-29 18:33:43,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 18:33:43,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:33:43,389 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 173 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2020-11-29 18:33:43,390 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515736020] [2020-11-29 18:33:43,390 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 18:33:43,390 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-29 18:33:43,390 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147327956] [2020-11-29 18:33:43,391 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-29 18:33:43,391 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 18:33:43,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-29 18:33:43,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-29 18:33:43,392 INFO L87 Difference]: Start difference. First operand 4101 states and 6475 transitions. Second operand 4 states. [2020-11-29 18:33:44,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 18:33:44,078 INFO L93 Difference]: Finished difference Result 6835 states and 10722 transitions. [2020-11-29 18:33:44,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-29 18:33:44,078 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 182 [2020-11-29 18:33:44,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 18:33:44,082 INFO L225 Difference]: With dead ends: 6835 [2020-11-29 18:33:44,082 INFO L226 Difference]: Without dead ends: 4827 [2020-11-29 18:33:44,084 INFO L677 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 [2020-11-29 18:33:44,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4827 states. [2020-11-29 18:33:44,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4827 to 4111. [2020-11-29 18:33:44,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4111 states. [2020-11-29 18:33:44,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4111 states to 4111 states and 6485 transitions. [2020-11-29 18:33:44,224 INFO L78 Accepts]: Start accepts. Automaton has 4111 states and 6485 transitions. Word has length 182 [2020-11-29 18:33:44,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 18:33:44,225 INFO L481 AbstractCegarLoop]: Abstraction has 4111 states and 6485 transitions. [2020-11-29 18:33:44,225 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-29 18:33:44,225 INFO L276 IsEmpty]: Start isEmpty. Operand 4111 states and 6485 transitions. [2020-11-29 18:33:44,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2020-11-29 18:33:44,231 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 18:33:44,231 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 18:33:44,232 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2020-11-29 18:33:44,232 INFO L429 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 18:33:44,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 18:33:44,232 INFO L82 PathProgramCache]: Analyzing trace with hash -983707367, now seen corresponding path program 1 times [2020-11-29 18:33:44,232 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 18:33:44,233 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459127116] [2020-11-29 18:33:44,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 18:33:44,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:33:44,319 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 211 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2020-11-29 18:33:44,319 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459127116] [2020-11-29 18:33:44,319 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 18:33:44,319 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-29 18:33:44,320 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706037598] [2020-11-29 18:33:44,321 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-29 18:33:44,321 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 18:33:44,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-29 18:33:44,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-29 18:33:44,322 INFO L87 Difference]: Start difference. First operand 4111 states and 6485 transitions. Second operand 4 states. [2020-11-29 18:33:44,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 18:33:44,801 INFO L93 Difference]: Finished difference Result 8549 states and 13414 transitions. [2020-11-29 18:33:44,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-29 18:33:44,802 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 184 [2020-11-29 18:33:44,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 18:33:44,806 INFO L225 Difference]: With dead ends: 8549 [2020-11-29 18:33:44,806 INFO L226 Difference]: Without dead ends: 4459 [2020-11-29 18:33:44,809 INFO L677 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 [2020-11-29 18:33:44,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4459 states. [2020-11-29 18:33:44,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4459 to 4111. [2020-11-29 18:33:44,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4111 states. [2020-11-29 18:33:44,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4111 states to 4111 states and 6473 transitions. [2020-11-29 18:33:44,949 INFO L78 Accepts]: Start accepts. Automaton has 4111 states and 6473 transitions. Word has length 184 [2020-11-29 18:33:44,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 18:33:44,949 INFO L481 AbstractCegarLoop]: Abstraction has 4111 states and 6473 transitions. [2020-11-29 18:33:44,949 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-29 18:33:44,949 INFO L276 IsEmpty]: Start isEmpty. Operand 4111 states and 6473 transitions. [2020-11-29 18:33:44,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2020-11-29 18:33:44,955 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 18:33:44,955 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 18:33:44,956 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2020-11-29 18:33:44,956 INFO L429 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 18:33:44,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 18:33:44,956 INFO L82 PathProgramCache]: Analyzing trace with hash -1263023272, now seen corresponding path program 1 times [2020-11-29 18:33:44,956 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 18:33:44,957 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534758077] [2020-11-29 18:33:44,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 18:33:44,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:33:45,038 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 175 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2020-11-29 18:33:45,039 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534758077] [2020-11-29 18:33:45,039 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 18:33:45,039 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-29 18:33:45,039 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219152001] [2020-11-29 18:33:45,040 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-29 18:33:45,040 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 18:33:45,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-29 18:33:45,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-29 18:33:45,040 INFO L87 Difference]: Start difference. First operand 4111 states and 6473 transitions. Second operand 4 states. [2020-11-29 18:33:45,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 18:33:45,547 INFO L93 Difference]: Finished difference Result 6472 states and 10073 transitions. [2020-11-29 18:33:45,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-29 18:33:45,550 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 185 [2020-11-29 18:33:45,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 18:33:45,554 INFO L225 Difference]: With dead ends: 6472 [2020-11-29 18:33:45,554 INFO L226 Difference]: Without dead ends: 4459 [2020-11-29 18:33:45,557 INFO L677 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 [2020-11-29 18:33:45,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4459 states. [2020-11-29 18:33:45,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4459 to 4111. [2020-11-29 18:33:45,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4111 states. [2020-11-29 18:33:45,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4111 states to 4111 states and 6461 transitions. [2020-11-29 18:33:45,744 INFO L78 Accepts]: Start accepts. Automaton has 4111 states and 6461 transitions. Word has length 185 [2020-11-29 18:33:45,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 18:33:45,744 INFO L481 AbstractCegarLoop]: Abstraction has 4111 states and 6461 transitions. [2020-11-29 18:33:45,744 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-29 18:33:45,744 INFO L276 IsEmpty]: Start isEmpty. Operand 4111 states and 6461 transitions. [2020-11-29 18:33:45,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2020-11-29 18:33:45,750 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 18:33:45,750 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 18:33:45,750 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2020-11-29 18:33:45,750 INFO L429 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 18:33:45,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 18:33:45,751 INFO L82 PathProgramCache]: Analyzing trace with hash -1547746275, now seen corresponding path program 1 times [2020-11-29 18:33:45,751 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 18:33:45,751 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299620665] [2020-11-29 18:33:45,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 18:33:45,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:33:45,871 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 181 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2020-11-29 18:33:45,871 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299620665] [2020-11-29 18:33:45,871 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 18:33:45,872 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-29 18:33:45,872 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106755827] [2020-11-29 18:33:45,872 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-29 18:33:45,873 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 18:33:45,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-29 18:33:45,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-29 18:33:45,873 INFO L87 Difference]: Start difference. First operand 4111 states and 6461 transitions. Second operand 4 states. [2020-11-29 18:33:46,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 18:33:46,589 INFO L93 Difference]: Finished difference Result 6472 states and 10055 transitions. [2020-11-29 18:33:46,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-29 18:33:46,590 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 186 [2020-11-29 18:33:46,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 18:33:46,594 INFO L225 Difference]: With dead ends: 6472 [2020-11-29 18:33:46,595 INFO L226 Difference]: Without dead ends: 4459 [2020-11-29 18:33:46,597 INFO L677 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 [2020-11-29 18:33:46,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4459 states. [2020-11-29 18:33:46,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4459 to 4111. [2020-11-29 18:33:46,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4111 states. [2020-11-29 18:33:46,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4111 states to 4111 states and 6449 transitions. [2020-11-29 18:33:46,767 INFO L78 Accepts]: Start accepts. Automaton has 4111 states and 6449 transitions. Word has length 186 [2020-11-29 18:33:46,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 18:33:46,768 INFO L481 AbstractCegarLoop]: Abstraction has 4111 states and 6449 transitions. [2020-11-29 18:33:46,768 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-29 18:33:46,768 INFO L276 IsEmpty]: Start isEmpty. Operand 4111 states and 6449 transitions. [2020-11-29 18:33:46,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2020-11-29 18:33:46,774 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 18:33:46,775 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 18:33:46,775 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2020-11-29 18:33:46,775 INFO L429 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 18:33:46,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 18:33:46,777 INFO L82 PathProgramCache]: Analyzing trace with hash -619567939, now seen corresponding path program 1 times [2020-11-29 18:33:46,777 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 18:33:46,777 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001410984] [2020-11-29 18:33:46,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 18:33:46,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:33:46,865 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 187 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2020-11-29 18:33:46,865 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001410984] [2020-11-29 18:33:46,865 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 18:33:46,865 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-29 18:33:46,865 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451556113] [2020-11-29 18:33:46,866 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-29 18:33:46,866 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 18:33:46,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-29 18:33:46,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-29 18:33:46,867 INFO L87 Difference]: Start difference. First operand 4111 states and 6449 transitions. Second operand 4 states. [2020-11-29 18:33:47,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 18:33:47,395 INFO L93 Difference]: Finished difference Result 6472 states and 10037 transitions. [2020-11-29 18:33:47,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-29 18:33:47,396 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 187 [2020-11-29 18:33:47,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 18:33:47,400 INFO L225 Difference]: With dead ends: 6472 [2020-11-29 18:33:47,400 INFO L226 Difference]: Without dead ends: 4459 [2020-11-29 18:33:47,402 INFO L677 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 [2020-11-29 18:33:47,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4459 states. [2020-11-29 18:33:47,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4459 to 4111. [2020-11-29 18:33:47,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4111 states. [2020-11-29 18:33:47,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4111 states to 4111 states and 6437 transitions. [2020-11-29 18:33:47,515 INFO L78 Accepts]: Start accepts. Automaton has 4111 states and 6437 transitions. Word has length 187 [2020-11-29 18:33:47,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 18:33:47,515 INFO L481 AbstractCegarLoop]: Abstraction has 4111 states and 6437 transitions. [2020-11-29 18:33:47,515 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-29 18:33:47,515 INFO L276 IsEmpty]: Start isEmpty. Operand 4111 states and 6437 transitions. [2020-11-29 18:33:47,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2020-11-29 18:33:47,520 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 18:33:47,521 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 18:33:47,521 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2020-11-29 18:33:47,521 INFO L429 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 18:33:47,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 18:33:47,522 INFO L82 PathProgramCache]: Analyzing trace with hash -746153758, now seen corresponding path program 1 times [2020-11-29 18:33:47,522 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 18:33:47,522 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27445231] [2020-11-29 18:33:47,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 18:33:47,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:33:47,619 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 193 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2020-11-29 18:33:47,620 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27445231] [2020-11-29 18:33:47,620 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 18:33:47,620 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-29 18:33:47,620 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666609513] [2020-11-29 18:33:47,622 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-29 18:33:47,622 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 18:33:47,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-29 18:33:47,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-29 18:33:47,622 INFO L87 Difference]: Start difference. First operand 4111 states and 6437 transitions. Second operand 4 states. [2020-11-29 18:33:48,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 18:33:48,208 INFO L93 Difference]: Finished difference Result 6412 states and 9947 transitions. [2020-11-29 18:33:48,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-29 18:33:48,209 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 188 [2020-11-29 18:33:48,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 18:33:48,212 INFO L225 Difference]: With dead ends: 6412 [2020-11-29 18:33:48,213 INFO L226 Difference]: Without dead ends: 4399 [2020-11-29 18:33:48,215 INFO L677 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 [2020-11-29 18:33:48,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4399 states. [2020-11-29 18:33:48,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4399 to 4111. [2020-11-29 18:33:48,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4111 states. [2020-11-29 18:33:48,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4111 states to 4111 states and 6425 transitions. [2020-11-29 18:33:48,316 INFO L78 Accepts]: Start accepts. Automaton has 4111 states and 6425 transitions. Word has length 188 [2020-11-29 18:33:48,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 18:33:48,316 INFO L481 AbstractCegarLoop]: Abstraction has 4111 states and 6425 transitions. [2020-11-29 18:33:48,316 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-29 18:33:48,316 INFO L276 IsEmpty]: Start isEmpty. Operand 4111 states and 6425 transitions. [2020-11-29 18:33:48,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2020-11-29 18:33:48,320 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 18:33:48,321 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 18:33:48,321 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2020-11-29 18:33:48,321 INFO L429 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 18:33:48,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 18:33:48,322 INFO L82 PathProgramCache]: Analyzing trace with hash 791063530, now seen corresponding path program 1 times [2020-11-29 18:33:48,322 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 18:33:48,322 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243493381] [2020-11-29 18:33:48,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 18:33:48,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:33:48,434 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 203 proven. 0 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2020-11-29 18:33:48,435 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243493381] [2020-11-29 18:33:48,435 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 18:33:48,435 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-29 18:33:48,435 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431879732] [2020-11-29 18:33:48,436 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-29 18:33:48,436 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 18:33:48,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-29 18:33:48,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-29 18:33:48,437 INFO L87 Difference]: Start difference. First operand 4111 states and 6425 transitions. Second operand 4 states. [2020-11-29 18:33:49,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 18:33:49,177 INFO L93 Difference]: Finished difference Result 8917 states and 13920 transitions. [2020-11-29 18:33:49,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-29 18:33:49,178 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 192 [2020-11-29 18:33:49,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 18:33:49,181 INFO L225 Difference]: With dead ends: 8917 [2020-11-29 18:33:49,182 INFO L226 Difference]: Without dead ends: 4827 [2020-11-29 18:33:49,185 INFO L677 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 [2020-11-29 18:33:49,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4827 states. [2020-11-29 18:33:49,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4827 to 4121. [2020-11-29 18:33:49,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4121 states. [2020-11-29 18:33:49,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4121 states to 4121 states and 6435 transitions. [2020-11-29 18:33:49,329 INFO L78 Accepts]: Start accepts. Automaton has 4121 states and 6435 transitions. Word has length 192 [2020-11-29 18:33:49,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 18:33:49,329 INFO L481 AbstractCegarLoop]: Abstraction has 4121 states and 6435 transitions. [2020-11-29 18:33:49,329 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-29 18:33:49,329 INFO L276 IsEmpty]: Start isEmpty. Operand 4121 states and 6435 transitions. [2020-11-29 18:33:49,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2020-11-29 18:33:49,332 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 18:33:49,332 INFO L422 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 18:33:49,332 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2020-11-29 18:33:49,332 INFO L429 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 18:33:49,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 18:33:49,333 INFO L82 PathProgramCache]: Analyzing trace with hash 426346312, now seen corresponding path program 1 times [2020-11-29 18:33:49,333 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 18:33:49,333 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135930170] [2020-11-29 18:33:49,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 18:33:49,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:33:49,428 INFO L134 CoverageAnalysis]: Checked inductivity of 346 backedges. 237 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2020-11-29 18:33:49,428 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135930170] [2020-11-29 18:33:49,428 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 18:33:49,429 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-29 18:33:49,429 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268595784] [2020-11-29 18:33:49,429 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-29 18:33:49,430 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 18:33:49,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-29 18:33:49,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-29 18:33:49,430 INFO L87 Difference]: Start difference. First operand 4121 states and 6435 transitions. Second operand 4 states. [2020-11-29 18:33:49,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 18:33:49,960 INFO L93 Difference]: Finished difference Result 8509 states and 13242 transitions. [2020-11-29 18:33:49,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-29 18:33:49,961 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 192 [2020-11-29 18:33:49,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 18:33:49,964 INFO L225 Difference]: With dead ends: 8509 [2020-11-29 18:33:49,964 INFO L226 Difference]: Without dead ends: 4409 [2020-11-29 18:33:49,968 INFO L677 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 [2020-11-29 18:33:49,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4409 states. [2020-11-29 18:33:50,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4409 to 4121. [2020-11-29 18:33:50,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4121 states. [2020-11-29 18:33:50,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4121 states to 4121 states and 6423 transitions. [2020-11-29 18:33:50,098 INFO L78 Accepts]: Start accepts. Automaton has 4121 states and 6423 transitions. Word has length 192 [2020-11-29 18:33:50,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 18:33:50,099 INFO L481 AbstractCegarLoop]: Abstraction has 4121 states and 6423 transitions. [2020-11-29 18:33:50,099 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-29 18:33:50,099 INFO L276 IsEmpty]: Start isEmpty. Operand 4121 states and 6423 transitions. [2020-11-29 18:33:50,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2020-11-29 18:33:50,102 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 18:33:50,102 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 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, 1] [2020-11-29 18:33:50,102 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2020-11-29 18:33:50,102 INFO L429 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 18:33:50,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 18:33:50,103 INFO L82 PathProgramCache]: Analyzing trace with hash 147913884, now seen corresponding path program 1 times [2020-11-29 18:33:50,103 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 18:33:50,103 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773914107] [2020-11-29 18:33:50,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 18:33:50,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:33:50,251 INFO L134 CoverageAnalysis]: Checked inductivity of 352 backedges. 243 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2020-11-29 18:33:50,252 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773914107] [2020-11-29 18:33:50,252 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 18:33:50,252 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-29 18:33:50,252 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590091058] [2020-11-29 18:33:50,253 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-29 18:33:50,253 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 18:33:50,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-29 18:33:50,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-29 18:33:50,254 INFO L87 Difference]: Start difference. First operand 4121 states and 6423 transitions. Second operand 4 states. [2020-11-29 18:33:50,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 18:33:50,810 INFO L93 Difference]: Finished difference Result 8509 states and 13218 transitions. [2020-11-29 18:33:50,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-29 18:33:50,810 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 192 [2020-11-29 18:33:50,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 18:33:50,814 INFO L225 Difference]: With dead ends: 8509 [2020-11-29 18:33:50,815 INFO L226 Difference]: Without dead ends: 4409 [2020-11-29 18:33:50,819 INFO L677 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 [2020-11-29 18:33:50,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4409 states. [2020-11-29 18:33:50,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4409 to 4121. [2020-11-29 18:33:50,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4121 states. [2020-11-29 18:33:50,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4121 states to 4121 states and 6411 transitions. [2020-11-29 18:33:50,936 INFO L78 Accepts]: Start accepts. Automaton has 4121 states and 6411 transitions. Word has length 192 [2020-11-29 18:33:50,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 18:33:50,936 INFO L481 AbstractCegarLoop]: Abstraction has 4121 states and 6411 transitions. [2020-11-29 18:33:50,936 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-29 18:33:50,937 INFO L276 IsEmpty]: Start isEmpty. Operand 4121 states and 6411 transitions. [2020-11-29 18:33:50,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2020-11-29 18:33:50,939 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 18:33:50,940 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 18:33:50,940 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2020-11-29 18:33:50,940 INFO L429 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 18:33:50,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 18:33:50,940 INFO L82 PathProgramCache]: Analyzing trace with hash 323502751, now seen corresponding path program 1 times [2020-11-29 18:33:50,940 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 18:33:50,940 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422168471] [2020-11-29 18:33:50,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 18:33:50,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:33:51,038 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 208 proven. 0 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2020-11-29 18:33:51,039 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422168471] [2020-11-29 18:33:51,039 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 18:33:51,039 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-29 18:33:51,039 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692005675] [2020-11-29 18:33:51,039 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-29 18:33:51,040 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 18:33:51,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-29 18:33:51,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-29 18:33:51,040 INFO L87 Difference]: Start difference. First operand 4121 states and 6411 transitions. Second operand 4 states. [2020-11-29 18:33:51,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 18:33:51,706 INFO L93 Difference]: Finished difference Result 8907 states and 13852 transitions. [2020-11-29 18:33:51,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-29 18:33:51,707 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 193 [2020-11-29 18:33:51,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 18:33:51,711 INFO L225 Difference]: With dead ends: 8907 [2020-11-29 18:33:51,711 INFO L226 Difference]: Without dead ends: 4807 [2020-11-29 18:33:51,714 INFO L677 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 [2020-11-29 18:33:51,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4807 states. [2020-11-29 18:33:51,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4807 to 4131. [2020-11-29 18:33:51,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4131 states. [2020-11-29 18:33:51,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4131 states to 4131 states and 6421 transitions. [2020-11-29 18:33:51,875 INFO L78 Accepts]: Start accepts. Automaton has 4131 states and 6421 transitions. Word has length 193 [2020-11-29 18:33:51,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 18:33:51,875 INFO L481 AbstractCegarLoop]: Abstraction has 4131 states and 6421 transitions. [2020-11-29 18:33:51,875 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-29 18:33:51,875 INFO L276 IsEmpty]: Start isEmpty. Operand 4131 states and 6421 transitions. [2020-11-29 18:33:51,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2020-11-29 18:33:51,878 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 18:33:51,879 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 18:33:51,879 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2020-11-29 18:33:51,879 INFO L429 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 18:33:51,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 18:33:51,879 INFO L82 PathProgramCache]: Analyzing trace with hash 1478506975, now seen corresponding path program 1 times [2020-11-29 18:33:51,880 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 18:33:51,880 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308785710] [2020-11-29 18:33:51,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 18:33:51,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:33:51,974 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 191 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2020-11-29 18:33:51,974 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308785710] [2020-11-29 18:33:51,974 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 18:33:51,974 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-29 18:33:51,975 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67194294] [2020-11-29 18:33:51,975 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-29 18:33:51,975 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 18:33:51,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-29 18:33:51,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-29 18:33:51,976 INFO L87 Difference]: Start difference. First operand 4131 states and 6421 transitions. Second operand 4 states. [2020-11-29 18:33:52,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 18:33:52,746 INFO L93 Difference]: Finished difference Result 7246 states and 11187 transitions. [2020-11-29 18:33:52,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-29 18:33:52,747 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 193 [2020-11-29 18:33:52,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 18:33:52,751 INFO L225 Difference]: With dead ends: 7246 [2020-11-29 18:33:52,751 INFO L226 Difference]: Without dead ends: 5223 [2020-11-29 18:33:52,753 INFO L677 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 [2020-11-29 18:33:52,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5223 states. [2020-11-29 18:33:52,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5223 to 4275. [2020-11-29 18:33:52,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4275 states. [2020-11-29 18:33:52,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4275 states to 4275 states and 6625 transitions. [2020-11-29 18:33:52,862 INFO L78 Accepts]: Start accepts. Automaton has 4275 states and 6625 transitions. Word has length 193 [2020-11-29 18:33:52,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 18:33:52,862 INFO L481 AbstractCegarLoop]: Abstraction has 4275 states and 6625 transitions. [2020-11-29 18:33:52,862 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-29 18:33:52,862 INFO L276 IsEmpty]: Start isEmpty. Operand 4275 states and 6625 transitions. [2020-11-29 18:33:52,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2020-11-29 18:33:52,865 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 18:33:52,865 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1] [2020-11-29 18:33:52,865 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2020-11-29 18:33:52,865 INFO L429 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 18:33:52,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 18:33:52,865 INFO L82 PathProgramCache]: Analyzing trace with hash -1815772062, now seen corresponding path program 1 times [2020-11-29 18:33:52,865 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 18:33:52,866 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993406005] [2020-11-29 18:33:52,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 18:33:52,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 18:33:52,949 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 18:33:53,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 18:33:53,042 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 18:33:53,170 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 18:33:53,170 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-11-29 18:33:53,170 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2020-11-29 18:33:53,392 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 06:33:53 BoogieIcfgContainer [2020-11-29 18:33:53,393 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-29 18:33:53,393 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-11-29 18:33:53,393 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-11-29 18:33:53,394 INFO L275 PluginConnector]: Witness Printer initialized [2020-11-29 18:33:53,394 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 06:31:27" (3/4) ... [2020-11-29 18:33:53,401 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-11-29 18:33:53,401 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-11-29 18:33:53,402 INFO L168 Benchmark]: Toolchain (without parser) took 148990.74 ms. Allocated memory was 90.2 MB in the beginning and 799.0 MB in the end (delta: 708.8 MB). Free memory was 70.7 MB in the beginning and 316.4 MB in the end (delta: -245.7 MB). Peak memory consumption was 461.4 MB. Max. memory is 16.1 GB. [2020-11-29 18:33:53,404 INFO L168 Benchmark]: CDTParser took 0.30 ms. Allocated memory is still 73.4 MB. Free memory was 53.0 MB in the beginning and 53.0 MB in the end (delta: 22.8 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-29 18:33:53,405 INFO L168 Benchmark]: CACSL2BoogieTranslator took 831.59 ms. Allocated memory is still 90.2 MB. Free memory was 70.4 MB in the beginning and 47.1 MB in the end (delta: 23.3 MB). Peak memory consumption was 23.3 MB. Max. memory is 16.1 GB. [2020-11-29 18:33:53,405 INFO L168 Benchmark]: Boogie Procedure Inliner took 202.00 ms. Allocated memory is still 90.2 MB. Free memory was 46.8 MB in the beginning and 64.9 MB in the end (delta: -18.1 MB). Peak memory consumption was 4.8 MB. Max. memory is 16.1 GB. [2020-11-29 18:33:53,405 INFO L168 Benchmark]: Boogie Preprocessor took 183.34 ms. Allocated memory is still 90.2 MB. Free memory was 64.9 MB in the beginning and 58.1 MB in the end (delta: 6.8 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. [2020-11-29 18:33:53,406 INFO L168 Benchmark]: RCFGBuilder took 1796.32 ms. Allocated memory was 90.2 MB in the beginning and 109.1 MB in the end (delta: 18.9 MB). Free memory was 57.6 MB in the beginning and 50.0 MB in the end (delta: 7.6 MB). Peak memory consumption was 37.7 MB. Max. memory is 16.1 GB. [2020-11-29 18:33:53,406 INFO L168 Benchmark]: TraceAbstraction took 145957.75 ms. Allocated memory was 109.1 MB in the beginning and 799.0 MB in the end (delta: 690.0 MB). Free memory was 50.0 MB in the beginning and 316.4 MB in the end (delta: -266.4 MB). Peak memory consumption was 422.8 MB. Max. memory is 16.1 GB. [2020-11-29 18:33:53,406 INFO L168 Benchmark]: Witness Printer took 7.77 ms. Allocated memory is still 799.0 MB. Free memory is still 316.4 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-11-29 18:33:53,409 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.30 ms. Allocated memory is still 73.4 MB. Free memory was 53.0 MB in the beginning and 53.0 MB in the end (delta: 22.8 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 831.59 ms. Allocated memory is still 90.2 MB. Free memory was 70.4 MB in the beginning and 47.1 MB in the end (delta: 23.3 MB). Peak memory consumption was 23.3 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 202.00 ms. Allocated memory is still 90.2 MB. Free memory was 46.8 MB in the beginning and 64.9 MB in the end (delta: -18.1 MB). Peak memory consumption was 4.8 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 183.34 ms. Allocated memory is still 90.2 MB. Free memory was 64.9 MB in the beginning and 58.1 MB in the end (delta: 6.8 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. * RCFGBuilder took 1796.32 ms. Allocated memory was 90.2 MB in the beginning and 109.1 MB in the end (delta: 18.9 MB). Free memory was 57.6 MB in the beginning and 50.0 MB in the end (delta: 7.6 MB). Peak memory consumption was 37.7 MB. Max. memory is 16.1 GB. * TraceAbstraction took 145957.75 ms. Allocated memory was 109.1 MB in the beginning and 799.0 MB in the end (delta: 690.0 MB). Free memory was 50.0 MB in the beginning and 316.4 MB in the end (delta: -266.4 MB). Peak memory consumption was 422.8 MB. Max. memory is 16.1 GB. * Witness Printer took 7.77 ms. Allocated memory is still 799.0 MB. Free memory is still 316.4 MB. There was no memory consumed. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 3]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of bitwiseAnd at line 1123. Possible FailurePath: [L1044] static int init = 1; [L1045] static SSL_METHOD SSLv3_server_data ; VAL [init=1, SSLv3_server_data={6:0}] [L1067] SSL *s ; [L1068] int tmp ; [L1072] s = malloc(sizeof(SSL)) [L1073] s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1074] s->ctx = malloc(sizeof(SSL_CTX)) [L1075] s->session = malloc(sizeof(SSL_SESSION)) [L1082] BUF_MEM *buf ; [L1083] unsigned long l ; [L1084] unsigned long Time ; [L1085] unsigned long tmp ; [L1086] void (*cb)() ; [L1087] long num1 ; [L1088] int ret ; [L1089] int new_state ; [L1090] int state ; [L1091] int skip ; [L1092] int got_new_session ; [L1093] int tmp___1 = __VERIFIER_nondet_int() ; [L1094] int tmp___2 = __VERIFIER_nondet_int() ; [L1095] int tmp___3 = __VERIFIER_nondet_int() ; [L1096] int tmp___4 = __VERIFIER_nondet_int() ; [L1097] int tmp___5 = __VERIFIER_nondet_int() ; [L1098] int tmp___6 = __VERIFIER_nondet_int() ; [L1099] int tmp___7 ; [L1100] long tmp___8 = __VERIFIER_nondet_long() ; [L1101] int tmp___9 = __VERIFIER_nondet_int() ; [L1102] int tmp___10 = __VERIFIER_nondet_int() ; [L1103] int blastFlag ; [L1107] s->state = 8464 [L1108] blastFlag = 0 [L1109] s->hit=__VERIFIER_nondet_int () [L1110] s->state = 8464 [L1111] tmp = __VERIFIER_nondet_int() [L1112] Time = tmp [L1113] cb = (void (*)())((void *)0) [L1114] ret = -1 [L1115] skip = 0 [L1116] got_new_session = 0 [L1117] EXPR s->info_callback VAL [init=1, SSLv3_server_data={6:0}] [L1117] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1118] EXPR s->info_callback [L1118] cb = s->info_callback [L1122] EXPR s->in_handshake [L1122] s->in_handshake += 1 [L1123] COND FALSE !(tmp___1 & 12288) VAL [init=1, SSLv3_server_data={6:0}] [L1132] EXPR s->cert VAL [init=1, SSLv3_server_data={6:0}] [L1132] COND FALSE !((unsigned long )s->cert == (unsigned long )((void *)0)) [L1138] COND TRUE 1 VAL [init=1, SSLv3_server_data={6:0}] [L1140] EXPR s->state [L1140] state = s->state [L1141] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1141] COND FALSE !(s->state == 12292) [L1144] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1144] COND FALSE !(s->state == 16384) [L1147] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1147] COND FALSE !(s->state == 8192) [L1150] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1150] COND FALSE !(s->state == 24576) [L1153] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1153] COND FALSE !(s->state == 8195) [L1156] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1156] COND FALSE !(s->state == 8480) [L1159] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1159] COND FALSE !(s->state == 8481) [L1162] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1162] COND FALSE !(s->state == 8482) [L1165] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1165] COND TRUE s->state == 8464 [L1325] s->shutdown = 0 [L1326] ret = __VERIFIER_nondet_int() [L1327] COND TRUE blastFlag == 0 [L1328] blastFlag = 1 VAL [init=1, SSLv3_server_data={6:0}] [L1332] COND FALSE !(ret <= 0) [L1337] got_new_session = 1 [L1338] s->state = 8496 [L1339] s->init_num = 0 VAL [init=1, SSLv3_server_data={6:0}] [L1687] EXPR s->s3 [L1687] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={6:0}] [L1687] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1716] skip = 0 VAL [init=1, SSLv3_server_data={6:0}] [L1138] COND TRUE 1 VAL [init=1, SSLv3_server_data={6:0}] [L1140] EXPR s->state [L1140] state = s->state [L1141] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1141] COND FALSE !(s->state == 12292) [L1144] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1144] COND FALSE !(s->state == 16384) [L1147] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1147] COND FALSE !(s->state == 8192) [L1150] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1150] COND FALSE !(s->state == 24576) [L1153] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1153] COND FALSE !(s->state == 8195) [L1156] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1156] COND FALSE !(s->state == 8480) [L1159] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1159] COND FALSE !(s->state == 8481) [L1162] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1162] COND FALSE !(s->state == 8482) [L1165] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1165] COND FALSE !(s->state == 8464) [L1168] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1168] COND FALSE !(s->state == 8465) [L1171] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1171] COND FALSE !(s->state == 8466) [L1174] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1174] COND TRUE s->state == 8496 [L1343] ret = __VERIFIER_nondet_int() [L1344] COND TRUE blastFlag == 1 [L1345] blastFlag = 2 VAL [init=1, SSLv3_server_data={6:0}] [L1349] COND FALSE !(ret <= 0) [L1354] s->hit VAL [init=1, SSLv3_server_data={6:0}] [L1354] COND TRUE s->hit [L1355] s->state = 8656 VAL [init=1, SSLv3_server_data={6:0}] [L1359] s->init_num = 0 VAL [init=1, SSLv3_server_data={6:0}] [L1687] EXPR s->s3 [L1687] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={6:0}] [L1687] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1716] skip = 0 VAL [init=1, SSLv3_server_data={6:0}] [L1138] COND TRUE 1 VAL [init=1, SSLv3_server_data={6:0}] [L1140] EXPR s->state [L1140] state = s->state [L1141] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1141] COND FALSE !(s->state == 12292) [L1144] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1144] COND FALSE !(s->state == 16384) [L1147] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1147] COND FALSE !(s->state == 8192) [L1150] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1150] COND FALSE !(s->state == 24576) [L1153] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1153] COND FALSE !(s->state == 8195) [L1156] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1156] COND FALSE !(s->state == 8480) [L1159] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1159] COND FALSE !(s->state == 8481) [L1162] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1162] COND FALSE !(s->state == 8482) [L1165] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1165] COND FALSE !(s->state == 8464) [L1168] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1168] COND FALSE !(s->state == 8465) [L1171] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1171] COND FALSE !(s->state == 8466) [L1174] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1174] COND FALSE !(s->state == 8496) [L1177] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1177] COND FALSE !(s->state == 8497) [L1180] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1180] COND FALSE !(s->state == 8512) [L1183] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1183] COND FALSE !(s->state == 8513) [L1186] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1186] COND FALSE !(s->state == 8528) [L1189] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1189] COND FALSE !(s->state == 8529) [L1192] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1192] COND FALSE !(s->state == 8544) [L1195] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1195] COND FALSE !(s->state == 8545) [L1198] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1198] COND FALSE !(s->state == 8560) [L1201] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1201] COND FALSE !(s->state == 8561) [L1204] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1204] COND FALSE !(s->state == 8448) [L1207] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1207] COND FALSE !(s->state == 8576) [L1210] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1210] COND FALSE !(s->state == 8577) [L1213] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1213] COND FALSE !(s->state == 8592) [L1216] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1216] COND FALSE !(s->state == 8593) [L1219] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1219] COND FALSE !(s->state == 8608) [L1222] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1222] COND FALSE !(s->state == 8609) [L1225] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1225] COND FALSE !(s->state == 8640) [L1228] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1228] COND FALSE !(s->state == 8641) [L1231] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1231] COND TRUE s->state == 8656 [L1572] EXPR s->session [L1572] EXPR s->s3 [L1572] EXPR (s->s3)->tmp.new_cipher [L1572] (s->session)->cipher = (s->s3)->tmp.new_cipher [L1573] COND FALSE !(! tmp___9) [L1579] ret = __VERIFIER_nondet_int() [L1580] COND TRUE blastFlag == 2 [L1581] blastFlag = 3 VAL [init=1, SSLv3_server_data={6:0}] [L1593] COND FALSE !(ret <= 0) [L1598] s->state = 8672 [L1599] s->init_num = 0 VAL [init=1, SSLv3_server_data={6:0}] [L1600] COND FALSE !(! tmp___10) VAL [init=1, SSLv3_server_data={6:0}] [L1687] EXPR s->s3 [L1687] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={6:0}] [L1687] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1716] skip = 0 VAL [init=1, SSLv3_server_data={6:0}] [L1138] COND TRUE 1 VAL [init=1, SSLv3_server_data={6:0}] [L1140] EXPR s->state [L1140] state = s->state [L1141] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1141] COND FALSE !(s->state == 12292) [L1144] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1144] COND FALSE !(s->state == 16384) [L1147] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1147] COND FALSE !(s->state == 8192) [L1150] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1150] COND FALSE !(s->state == 24576) [L1153] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1153] COND FALSE !(s->state == 8195) [L1156] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1156] COND FALSE !(s->state == 8480) [L1159] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1159] COND FALSE !(s->state == 8481) [L1162] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1162] COND FALSE !(s->state == 8482) [L1165] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1165] COND FALSE !(s->state == 8464) [L1168] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1168] COND FALSE !(s->state == 8465) [L1171] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1171] COND FALSE !(s->state == 8466) [L1174] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1174] COND FALSE !(s->state == 8496) [L1177] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1177] COND FALSE !(s->state == 8497) [L1180] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1180] COND FALSE !(s->state == 8512) [L1183] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1183] COND FALSE !(s->state == 8513) [L1186] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1186] COND FALSE !(s->state == 8528) [L1189] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1189] COND FALSE !(s->state == 8529) [L1192] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1192] COND FALSE !(s->state == 8544) [L1195] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1195] COND FALSE !(s->state == 8545) [L1198] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1198] COND FALSE !(s->state == 8560) [L1201] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1201] COND FALSE !(s->state == 8561) [L1204] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1204] COND FALSE !(s->state == 8448) [L1207] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1207] COND FALSE !(s->state == 8576) [L1210] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1210] COND FALSE !(s->state == 8577) [L1213] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1213] COND FALSE !(s->state == 8592) [L1216] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1216] COND FALSE !(s->state == 8593) [L1219] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1219] COND FALSE !(s->state == 8608) [L1222] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1222] COND FALSE !(s->state == 8609) [L1225] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1225] COND FALSE !(s->state == 8640) [L1228] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1228] COND FALSE !(s->state == 8641) [L1231] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1231] COND FALSE !(s->state == 8656) [L1234] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1234] COND FALSE !(s->state == 8657) [L1237] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1237] COND TRUE s->state == 8672 [L1609] ret = __VERIFIER_nondet_int() [L1610] COND TRUE blastFlag == 3 [L1611] blastFlag = 4 VAL [init=1, SSLv3_server_data={6:0}] [L1615] COND FALSE !(ret <= 0) [L1620] s->state = 8448 [L1621] s->hit VAL [init=1, SSLv3_server_data={6:0}] [L1621] COND TRUE s->hit [L1622] EXPR s->s3 [L1622] (s->s3)->tmp.next_state = 8640 [L1626] s->init_num = 0 VAL [init=1, SSLv3_server_data={6:0}] [L1687] EXPR s->s3 [L1687] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={6:0}] [L1687] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1716] skip = 0 VAL [init=1, SSLv3_server_data={6:0}] [L1138] COND TRUE 1 VAL [init=1, SSLv3_server_data={6:0}] [L1140] EXPR s->state [L1140] state = s->state [L1141] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1141] COND FALSE !(s->state == 12292) [L1144] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1144] COND FALSE !(s->state == 16384) [L1147] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1147] COND FALSE !(s->state == 8192) [L1150] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1150] COND FALSE !(s->state == 24576) [L1153] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1153] COND FALSE !(s->state == 8195) [L1156] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1156] COND FALSE !(s->state == 8480) [L1159] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1159] COND FALSE !(s->state == 8481) [L1162] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1162] COND FALSE !(s->state == 8482) [L1165] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1165] COND FALSE !(s->state == 8464) [L1168] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1168] COND FALSE !(s->state == 8465) [L1171] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1171] COND FALSE !(s->state == 8466) [L1174] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1174] COND FALSE !(s->state == 8496) [L1177] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1177] COND FALSE !(s->state == 8497) [L1180] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1180] COND FALSE !(s->state == 8512) [L1183] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1183] COND FALSE !(s->state == 8513) [L1186] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1186] COND FALSE !(s->state == 8528) [L1189] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1189] COND FALSE !(s->state == 8529) [L1192] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1192] COND FALSE !(s->state == 8544) [L1195] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1195] COND FALSE !(s->state == 8545) [L1198] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1198] COND FALSE !(s->state == 8560) [L1201] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1201] COND FALSE !(s->state == 8561) [L1204] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1204] COND TRUE s->state == 8448 [L1492] COND FALSE !(num1 > 0L) VAL [init=1, SSLv3_server_data={6:0}] [L1505] EXPR s->s3 [L1505] EXPR (s->s3)->tmp.next_state [L1505] s->state = (s->s3)->tmp.next_state [L1687] EXPR s->s3 [L1687] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={6:0}] [L1687] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1716] skip = 0 VAL [init=1, SSLv3_server_data={6:0}] [L1138] COND TRUE 1 VAL [init=1, SSLv3_server_data={6:0}] [L1140] EXPR s->state [L1140] state = s->state [L1141] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1141] COND FALSE !(s->state == 12292) [L1144] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1144] COND FALSE !(s->state == 16384) [L1147] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1147] COND FALSE !(s->state == 8192) [L1150] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1150] COND FALSE !(s->state == 24576) [L1153] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1153] COND FALSE !(s->state == 8195) [L1156] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1156] COND FALSE !(s->state == 8480) [L1159] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1159] COND FALSE !(s->state == 8481) [L1162] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1162] COND FALSE !(s->state == 8482) [L1165] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1165] COND FALSE !(s->state == 8464) [L1168] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1168] COND FALSE !(s->state == 8465) [L1171] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1171] COND FALSE !(s->state == 8466) [L1174] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1174] COND FALSE !(s->state == 8496) [L1177] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1177] COND FALSE !(s->state == 8497) [L1180] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1180] COND FALSE !(s->state == 8512) [L1183] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1183] COND FALSE !(s->state == 8513) [L1186] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1186] COND FALSE !(s->state == 8528) [L1189] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1189] COND FALSE !(s->state == 8529) [L1192] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1192] COND FALSE !(s->state == 8544) [L1195] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1195] COND FALSE !(s->state == 8545) [L1198] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1198] COND FALSE !(s->state == 8560) [L1201] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1201] COND FALSE !(s->state == 8561) [L1204] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1204] COND FALSE !(s->state == 8448) [L1207] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1207] COND FALSE !(s->state == 8576) [L1210] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1210] COND FALSE !(s->state == 8577) [L1213] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1213] COND FALSE !(s->state == 8592) [L1216] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1216] COND FALSE !(s->state == 8593) [L1219] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1219] COND FALSE !(s->state == 8608) [L1222] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1222] COND FALSE !(s->state == 8609) [L1225] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1225] COND TRUE s->state == 8640 [L1552] ret = __VERIFIER_nondet_int() [L1553] COND TRUE blastFlag == 4 VAL [init=1, SSLv3_server_data={6:0}] [L3] __assert_fail("0", "s3_srvr.blast.07.i.cil-2.c", 3, "reach_error") VAL [init=1, SSLv3_server_data={6:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 149 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 145.6s, OverallIterations: 68, TraceHistogramMax: 7, AutomataDifference: 39.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 14485 SDtfs, 5450 SDslu, 22455 SDs, 0 SdLazy, 14923 SolverSat, 872 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 28.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 540 GetRequests, 250 SyntacticMatches, 80 SemanticMatches, 210 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 92.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4275occurred in iteration=67, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.4s AutomataMinimizationTime, 67 MinimizatonAttempts, 15153 StatesRemovedByMinimization, 63 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 97.5s InterpolantComputationTime, 7682 NumberOfCodeBlocks, 7682 NumberOfCodeBlocksAsserted, 69 NumberOfCheckSat, 7421 ConstructedInterpolants, 80 QuantifiedInterpolants, 3544608 SizeOfPredicates, 16 NumberOfNonLiveVariables, 626 ConjunctsInSsa, 43 ConjunctsInUnsatCore, 68 InterpolantComputations, 66 PerfectInterpolantSequences, 7595/7940 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.2.0-a4ecdab [2020-11-29 18:33:55,807 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-29 18:33:55,809 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-29 18:33:55,854 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-29 18:33:55,855 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-29 18:33:55,861 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-29 18:33:55,863 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-29 18:33:55,868 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-29 18:33:55,871 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-29 18:33:55,879 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-29 18:33:55,880 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-29 18:33:55,889 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-29 18:33:55,889 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-29 18:33:55,892 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-29 18:33:55,894 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-29 18:33:55,895 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-29 18:33:55,896 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-29 18:33:55,899 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-29 18:33:55,904 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-29 18:33:55,908 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-29 18:33:55,912 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-29 18:33:55,916 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-29 18:33:55,917 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-29 18:33:55,919 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-29 18:33:55,923 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-29 18:33:55,925 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-29 18:33:55,925 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-29 18:33:55,928 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-29 18:33:55,928 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-29 18:33:55,930 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-29 18:33:55,930 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-29 18:33:55,931 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-29 18:33:55,933 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-29 18:33:55,933 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-29 18:33:55,934 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-29 18:33:55,935 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-29 18:33:55,936 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-29 18:33:55,936 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-29 18:33:55,937 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-29 18:33:55,939 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-29 18:33:55,939 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-29 18:33:55,940 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_42dd8acb-5f7c-4b36-90da-de8d148c03f2/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2020-11-29 18:33:55,981 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-29 18:33:55,982 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-29 18:33:55,985 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-29 18:33:55,985 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-29 18:33:55,986 INFO L138 SettingsManager]: * Use SBE=true [2020-11-29 18:33:55,986 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-29 18:33:55,986 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-29 18:33:55,986 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-29 18:33:55,986 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-29 18:33:55,987 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-29 18:33:55,988 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-29 18:33:55,988 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-29 18:33:55,988 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2020-11-29 18:33:55,989 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2020-11-29 18:33:55,989 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-29 18:33:55,990 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-29 18:33:55,990 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-29 18:33:55,990 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-29 18:33:55,990 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-29 18:33:55,991 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-29 18:33:55,991 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-29 18:33:55,991 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-29 18:33:55,991 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-29 18:33:55,992 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-29 18:33:55,992 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-29 18:33:55,992 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-29 18:33:55,992 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2020-11-29 18:33:56,011 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2020-11-29 18:33:56,011 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-29 18:33:56,011 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-29 18:33:56,011 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-11-29 18:33:56,011 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud-vcloud-master/worker/run_dir_42dd8acb-5f7c-4b36-90da-de8d148c03f2/bin/uautomizer/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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_42dd8acb-5f7c-4b36-90da-de8d148c03f2/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(reach_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 -> 067932990963acfd6ba0f96c79e6e2b99ade7977 [2020-11-29 18:33:56,338 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-29 18:33:56,370 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-29 18:33:56,373 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-29 18:33:56,375 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-29 18:33:56,376 INFO L275 PluginConnector]: CDTParser initialized [2020-11-29 18:33:56,377 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_42dd8acb-5f7c-4b36-90da-de8d148c03f2/bin/uautomizer/../../sv-benchmarks/c/openssl/s3_srvr.blast.07.i.cil-2.c [2020-11-29 18:33:56,462 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_42dd8acb-5f7c-4b36-90da-de8d148c03f2/bin/uautomizer/data/7b21a9004/64a65f34e723464194aacbc64e46f4c6/FLAG90ee889e7 [2020-11-29 18:33:57,131 INFO L306 CDTParser]: Found 1 translation units. [2020-11-29 18:33:57,132 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_42dd8acb-5f7c-4b36-90da-de8d148c03f2/sv-benchmarks/c/openssl/s3_srvr.blast.07.i.cil-2.c [2020-11-29 18:33:57,164 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_42dd8acb-5f7c-4b36-90da-de8d148c03f2/bin/uautomizer/data/7b21a9004/64a65f34e723464194aacbc64e46f4c6/FLAG90ee889e7 [2020-11-29 18:33:57,315 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_42dd8acb-5f7c-4b36-90da-de8d148c03f2/bin/uautomizer/data/7b21a9004/64a65f34e723464194aacbc64e46f4c6 [2020-11-29 18:33:57,317 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-29 18:33:57,319 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-11-29 18:33:57,321 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-29 18:33:57,321 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-29 18:33:57,325 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-29 18:33:57,326 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 06:33:57" (1/1) ... [2020-11-29 18:33:57,333 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@588e0621 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:33:57, skipping insertion in model container [2020-11-29 18:33:57,334 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 06:33:57" (1/1) ... [2020-11-29 18:33:57,341 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-29 18:33:57,419 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-29 18:33:57,946 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-29 18:33:57,975 INFO L203 MainTranslator]: Completed pre-run [2020-11-29 18:33:58,135 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-29 18:33:58,157 INFO L208 MainTranslator]: Completed translation [2020-11-29 18:33:58,158 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:33:58 WrapperNode [2020-11-29 18:33:58,158 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-29 18:33:58,159 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-29 18:33:58,159 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-29 18:33:58,159 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-29 18:33:58,167 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:33:58" (1/1) ... [2020-11-29 18:33:58,218 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:33:58" (1/1) ... [2020-11-29 18:33:58,284 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-29 18:33:58,290 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-29 18:33:58,291 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-29 18:33:58,292 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-29 18:33:58,300 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:33:58" (1/1) ... [2020-11-29 18:33:58,300 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:33:58" (1/1) ... [2020-11-29 18:33:58,317 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:33:58" (1/1) ... [2020-11-29 18:33:58,323 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:33:58" (1/1) ... [2020-11-29 18:33:58,381 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:33:58" (1/1) ... [2020-11-29 18:33:58,401 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:33:58" (1/1) ... [2020-11-29 18:33:58,405 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:33:58" (1/1) ... [2020-11-29 18:33:58,411 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-29 18:33:58,412 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-29 18:33:58,413 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-29 18:33:58,413 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-29 18:33:58,413 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:33:58" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_42dd8acb-5f7c-4b36-90da-de8d148c03f2/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 [2020-11-29 18:33:58,476 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2020-11-29 18:33:58,476 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-11-29 18:33:58,476 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-29 18:33:58,476 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2020-11-29 18:33:58,477 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-11-29 18:33:58,477 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-11-29 18:33:58,477 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-29 18:33:58,477 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-29 18:33:58,477 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2020-11-29 18:33:58,798 WARN L798 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2020-11-29 18:34:02,973 INFO L751 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2020-11-29 18:34:02,973 INFO L751 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2020-11-29 18:34:02,984 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-29 18:34:02,984 INFO L298 CfgBuilder]: Removed 9 assume(true) statements. [2020-11-29 18:34:02,986 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 06:34:02 BoogieIcfgContainer [2020-11-29 18:34:02,987 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-29 18:34:02,988 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-29 18:34:02,988 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-29 18:34:02,992 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-29 18:34:02,992 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 06:33:57" (1/3) ... [2020-11-29 18:34:02,993 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@684ae320 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 06:34:02, skipping insertion in model container [2020-11-29 18:34:02,993 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:33:58" (2/3) ... [2020-11-29 18:34:02,994 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@684ae320 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 06:34:02, skipping insertion in model container [2020-11-29 18:34:02,994 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 06:34:02" (3/3) ... [2020-11-29 18:34:02,995 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.07.i.cil-2.c [2020-11-29 18:34:03,008 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-29 18:34:03,013 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-11-29 18:34:03,026 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-11-29 18:34:03,051 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-29 18:34:03,051 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-29 18:34:03,051 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-29 18:34:03,052 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-29 18:34:03,052 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-29 18:34:03,052 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-29 18:34:03,052 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-29 18:34:03,052 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-29 18:34:03,068 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states. [2020-11-29 18:34:03,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-11-29 18:34:03,076 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 18:34:03,077 INFO L422 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] [2020-11-29 18:34:03,077 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 18:34:03,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 18:34:03,083 INFO L82 PathProgramCache]: Analyzing trace with hash -2031756973, now seen corresponding path program 1 times [2020-11-29 18:34:03,097 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-11-29 18:34:03,097 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [948100454] [2020-11-29 18:34:03,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_42dd8acb-5f7c-4b36-90da-de8d148c03f2/bin/uautomizer/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2020-11-29 18:34:03,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:34:03,295 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 2 conjunts are in the unsatisfiable core [2020-11-29 18:34:03,311 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 18:34:03,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 18:34:03,362 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-29 18:34:03,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 18:34:03,407 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [948100454] [2020-11-29 18:34:03,408 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-29 18:34:03,408 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2020-11-29 18:34:03,410 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824571688] [2020-11-29 18:34:03,417 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-29 18:34:03,418 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-11-29 18:34:03,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-29 18:34:03,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-11-29 18:34:03,439 INFO L87 Difference]: Start difference. First operand 149 states. Second operand 4 states. [2020-11-29 18:34:03,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 18:34:03,712 INFO L93 Difference]: Finished difference Result 565 states and 963 transitions. [2020-11-29 18:34:03,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-29 18:34:03,715 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2020-11-29 18:34:03,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 18:34:03,742 INFO L225 Difference]: With dead ends: 565 [2020-11-29 18:34:03,742 INFO L226 Difference]: Without dead ends: 385 [2020-11-29 18:34:03,747 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-11-29 18:34:03,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2020-11-29 18:34:03,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 383. [2020-11-29 18:34:03,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-11-29 18:34:03,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 584 transitions. [2020-11-29 18:34:03,862 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 584 transitions. Word has length 35 [2020-11-29 18:34:03,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 18:34:03,863 INFO L481 AbstractCegarLoop]: Abstraction has 383 states and 584 transitions. [2020-11-29 18:34:03,863 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-29 18:34:03,863 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 584 transitions. [2020-11-29 18:34:03,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2020-11-29 18:34:03,873 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 18:34:03,873 INFO L422 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] [2020-11-29 18:34:04,090 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2020-11-29 18:34:04,090 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 18:34:04,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 18:34:04,090 INFO L82 PathProgramCache]: Analyzing trace with hash -718881007, now seen corresponding path program 1 times [2020-11-29 18:34:04,091 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-11-29 18:34:04,092 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1733150183] [2020-11-29 18:34:04,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_42dd8acb-5f7c-4b36-90da-de8d148c03f2/bin/uautomizer/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2020-11-29 18:34:04,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:34:04,393 INFO L263 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 2 conjunts are in the unsatisfiable core [2020-11-29 18:34:04,397 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 18:34:04,424 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 18:34:04,424 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-29 18:34:04,449 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 18:34:04,450 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1733150183] [2020-11-29 18:34:04,450 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-29 18:34:04,450 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2020-11-29 18:34:04,450 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832614590] [2020-11-29 18:34:04,452 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-29 18:34:04,452 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-11-29 18:34:04,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-29 18:34:04,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-11-29 18:34:04,454 INFO L87 Difference]: Start difference. First operand 383 states and 584 transitions. Second operand 4 states. [2020-11-29 18:34:04,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 18:34:04,945 INFO L93 Difference]: Finished difference Result 877 states and 1350 transitions. [2020-11-29 18:34:04,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-29 18:34:04,947 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2020-11-29 18:34:04,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 18:34:04,953 INFO L225 Difference]: With dead ends: 877 [2020-11-29 18:34:04,953 INFO L226 Difference]: Without dead ends: 626 [2020-11-29 18:34:04,959 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-11-29 18:34:04,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2020-11-29 18:34:05,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 624. [2020-11-29 18:34:05,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 624 states. [2020-11-29 18:34:05,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 624 states to 624 states and 947 transitions. [2020-11-29 18:34:05,009 INFO L78 Accepts]: Start accepts. Automaton has 624 states and 947 transitions. Word has length 58 [2020-11-29 18:34:05,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 18:34:05,010 INFO L481 AbstractCegarLoop]: Abstraction has 624 states and 947 transitions. [2020-11-29 18:34:05,010 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-29 18:34:05,010 INFO L276 IsEmpty]: Start isEmpty. Operand 624 states and 947 transitions. [2020-11-29 18:34:05,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2020-11-29 18:34:05,016 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 18:34:05,017 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 18:34:05,238 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2020-11-29 18:34:05,239 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 18:34:05,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 18:34:05,240 INFO L82 PathProgramCache]: Analyzing trace with hash -222873622, now seen corresponding path program 1 times [2020-11-29 18:34:05,241 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-11-29 18:34:05,241 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [860897145] [2020-11-29 18:34:05,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_42dd8acb-5f7c-4b36-90da-de8d148c03f2/bin/uautomizer/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2020-11-29 18:34:05,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:34:05,550 INFO L263 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 2 conjunts are in the unsatisfiable core [2020-11-29 18:34:05,557 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 18:34:05,607 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-11-29 18:34:05,608 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-29 18:34:05,656 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-11-29 18:34:05,658 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [860897145] [2020-11-29 18:34:05,658 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-29 18:34:05,659 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-11-29 18:34:05,659 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979058324] [2020-11-29 18:34:05,661 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-29 18:34:05,661 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-11-29 18:34:05,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 18:34:05,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 18:34:05,663 INFO L87 Difference]: Start difference. First operand 624 states and 947 transitions. Second operand 3 states. [2020-11-29 18:34:06,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 18:34:06,423 INFO L93 Difference]: Finished difference Result 1236 states and 1885 transitions. [2020-11-29 18:34:06,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 18:34:06,424 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 117 [2020-11-29 18:34:06,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 18:34:06,430 INFO L225 Difference]: With dead ends: 1236 [2020-11-29 18:34:06,431 INFO L226 Difference]: Without dead ends: 744 [2020-11-29 18:34:06,432 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 231 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 18:34:06,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 744 states. [2020-11-29 18:34:06,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 744 to 744. [2020-11-29 18:34:06,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 744 states. [2020-11-29 18:34:06,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 744 states to 744 states and 1127 transitions. [2020-11-29 18:34:06,483 INFO L78 Accepts]: Start accepts. Automaton has 744 states and 1127 transitions. Word has length 117 [2020-11-29 18:34:06,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 18:34:06,484 INFO L481 AbstractCegarLoop]: Abstraction has 744 states and 1127 transitions. [2020-11-29 18:34:06,484 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-29 18:34:06,484 INFO L276 IsEmpty]: Start isEmpty. Operand 744 states and 1127 transitions. [2020-11-29 18:34:06,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2020-11-29 18:34:06,497 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 18:34:06,497 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 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] [2020-11-29 18:34:06,715 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2020-11-29 18:34:06,715 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 18:34:06,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 18:34:06,715 INFO L82 PathProgramCache]: Analyzing trace with hash 369635549, now seen corresponding path program 1 times [2020-11-29 18:34:06,716 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-11-29 18:34:06,717 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1974472535] [2020-11-29 18:34:06,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_42dd8acb-5f7c-4b36-90da-de8d148c03f2/bin/uautomizer/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2020-11-29 18:34:07,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:34:07,038 INFO L263 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 2 conjunts are in the unsatisfiable core [2020-11-29 18:34:07,045 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 18:34:07,098 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 117 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2020-11-29 18:34:07,098 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-29 18:34:07,152 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 117 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2020-11-29 18:34:07,152 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1974472535] [2020-11-29 18:34:07,153 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-29 18:34:07,153 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2020-11-29 18:34:07,153 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275336936] [2020-11-29 18:34:07,154 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-29 18:34:07,154 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-11-29 18:34:07,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-29 18:34:07,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-11-29 18:34:07,156 INFO L87 Difference]: Start difference. First operand 744 states and 1127 transitions. Second operand 4 states. [2020-11-29 18:34:07,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 18:34:07,797 INFO L93 Difference]: Finished difference Result 1603 states and 2440 transitions. [2020-11-29 18:34:07,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-29 18:34:07,798 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 141 [2020-11-29 18:34:07,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 18:34:07,806 INFO L225 Difference]: With dead ends: 1603 [2020-11-29 18:34:07,806 INFO L226 Difference]: Without dead ends: 991 [2020-11-29 18:34:07,808 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 280 GetRequests, 278 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-11-29 18:34:07,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 991 states. [2020-11-29 18:34:07,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 991 to 991. [2020-11-29 18:34:07,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 991 states. [2020-11-29 18:34:07,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 991 states to 991 states and 1499 transitions. [2020-11-29 18:34:07,861 INFO L78 Accepts]: Start accepts. Automaton has 991 states and 1499 transitions. Word has length 141 [2020-11-29 18:34:07,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 18:34:07,861 INFO L481 AbstractCegarLoop]: Abstraction has 991 states and 1499 transitions. [2020-11-29 18:34:07,861 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-29 18:34:07,862 INFO L276 IsEmpty]: Start isEmpty. Operand 991 states and 1499 transitions. [2020-11-29 18:34:07,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2020-11-29 18:34:07,865 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 18:34:07,866 INFO L422 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] [2020-11-29 18:34:08,081 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2020-11-29 18:34:08,084 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 18:34:08,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 18:34:08,085 INFO L82 PathProgramCache]: Analyzing trace with hash 990449606, now seen corresponding path program 1 times [2020-11-29 18:34:08,085 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-11-29 18:34:08,086 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [594390443] [2020-11-29 18:34:08,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_42dd8acb-5f7c-4b36-90da-de8d148c03f2/bin/uautomizer/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2020-11-29 18:34:08,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:34:08,656 INFO L263 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 41 conjunts are in the unsatisfiable core [2020-11-29 18:34:08,666 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 18:34:09,128 INFO L384 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 [2020-11-29 18:34:09,132 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 18:34:10,967 WARN L193 SmtUtils]: Spent 1.83 s on a formula simplification that was a NOOP. DAG size: 67 [2020-11-29 18:34:10,968 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 18:34:10,974 INFO L441 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_175|, |v_#memory_$Pointer$.base_175|], 2=[|v_#memory_$Pointer$.base_171|, |v_#memory_$Pointer$.base_172|, |v_#memory_$Pointer$.offset_172|, |v_#memory_$Pointer$.offset_171|]} [2020-11-29 18:34:11,196 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 18:34:11,258 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 18:34:11,397 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 18:34:11,564 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 18:34:11,592 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 18:34:11,657 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 18:34:11,755 INFO L244 Elim1Store]: Index analysis took 607 ms [2020-11-29 18:34:12,850 INFO L384 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 [2020-11-29 18:34:12,850 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-29 18:34:14,084 WARN L193 SmtUtils]: Spent 1.23 s on a formula simplification that was a NOOP. DAG size: 64 [2020-11-29 18:34:14,085 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 18:34:14,200 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 18:34:14,217 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 18:34:14,243 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 18:34:14,287 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 18:34:14,297 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 18:34:14,316 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 18:34:14,357 INFO L244 Elim1Store]: Index analysis took 172 ms [2020-11-29 18:34:14,552 INFO L384 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 [2020-11-29 18:34:14,552 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-11-29 18:34:15,325 WARN L193 SmtUtils]: Spent 771.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2020-11-29 18:34:15,325 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 18:34:15,343 INFO L545 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-29 18:34:15,756 WARN L193 SmtUtils]: Spent 411.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2020-11-29 18:34:15,756 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 18:34:15,819 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 18:34:15,828 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 18:34:15,839 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 18:34:15,854 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 18:34:15,868 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 18:34:15,881 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 18:34:15,892 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 18:34:15,906 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 18:34:15,914 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 18:34:15,922 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 18:34:15,922 INFO L244 Elim1Store]: Index analysis took 112 ms [2020-11-29 18:34:15,925 INFO L384 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 [2020-11-29 18:34:15,927 INFO L545 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2020-11-29 18:34:16,234 WARN L193 SmtUtils]: Spent 306.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2020-11-29 18:34:16,234 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 18:34:16,249 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 18:34:16,252 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 18:34:16,255 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 18:34:16,257 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 18:34:16,260 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 18:34:16,262 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 18:34:16,287 INFO L384 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 [2020-11-29 18:34:16,288 INFO L545 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2020-11-29 18:34:16,413 WARN L193 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2020-11-29 18:34:16,414 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 18:34:16,441 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 18:34:16,443 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 18:34:16,445 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 18:34:16,447 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 18:34:16,449 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 18:34:16,454 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 18:34:16,456 INFO L384 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 [2020-11-29 18:34:16,457 INFO L545 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2020-11-29 18:34:16,541 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 18:34:16,546 INFO L545 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 6 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 18:34:16,547 INFO L244 ElimStorePlain]: Needed 8 recursive calls to eliminate 11 variables, input treesize:156, output treesize:32 [2020-11-29 18:34:16,583 INFO L441 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_176|], 6=[|v_#memory_$Pointer$.offset_176|]} [2020-11-29 18:34:16,596 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 18:34:16,597 INFO L384 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 [2020-11-29 18:34:16,598 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 18:34:16,640 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 18:34:16,650 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 18:34:16,651 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 18:34:16,653 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 18:34:16,658 INFO L384 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 38 treesize of output 25 [2020-11-29 18:34:16,659 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-29 18:34:16,675 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 18:34:16,675 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 18:34:16,675 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:70, output treesize:32 [2020-11-29 18:34:16,685 INFO L441 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_177|], 6=[|v_#memory_$Pointer$.offset_177|]} [2020-11-29 18:34:16,696 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 18:34:16,697 INFO L384 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 [2020-11-29 18:34:16,698 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 18:34:16,736 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 18:34:16,741 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 18:34:16,743 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 18:34:16,744 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 18:34:16,745 INFO L384 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 38 treesize of output 25 [2020-11-29 18:34:16,746 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-29 18:34:16,764 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 18:34:16,764 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 18:34:16,764 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:70, output treesize:32 [2020-11-29 18:34:16,780 INFO L441 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_173|, |v_#memory_$Pointer$.base_178|, |v_#memory_$Pointer$.base_173|], 6=[|v_#memory_$Pointer$.offset_178|]} [2020-11-29 18:34:16,789 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-29 18:34:16,980 WARN L193 SmtUtils]: Spent 190.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2020-11-29 18:34:16,981 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 18:34:17,007 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 18:34:17,029 INFO L384 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 [2020-11-29 18:34:17,030 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-29 18:34:17,103 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 18:34:17,143 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 18:34:17,144 INFO L384 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 [2020-11-29 18:34:17,145 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-11-29 18:34:17,194 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 18:34:17,199 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 18:34:17,200 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 18:34:17,201 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 18:34:17,202 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 18:34:17,204 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 18:34:17,205 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 18:34:17,206 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 34 [2020-11-29 18:34:17,207 INFO L545 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-11-29 18:34:17,227 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 18:34:17,231 INFO L545 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 18:34:17,231 INFO L244 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:108, output treesize:32 [2020-11-29 18:34:17,265 INFO L441 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_179|], 6=[|v_#memory_$Pointer$.offset_179|]} [2020-11-29 18:34:17,274 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 18:34:17,275 INFO L384 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 [2020-11-29 18:34:17,276 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 18:34:17,313 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 18:34:17,318 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 18:34:17,319 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 18:34:17,320 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 18:34:17,321 INFO L384 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 38 treesize of output 25 [2020-11-29 18:34:17,322 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-29 18:34:17,338 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 18:34:17,338 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 18:34:17,338 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:70, output treesize:32 [2020-11-29 18:34:17,344 INFO L441 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_180|], 6=[|v_#memory_$Pointer$.offset_180|]} [2020-11-29 18:34:17,355 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 18:34:17,356 INFO L384 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 [2020-11-29 18:34:17,357 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 18:34:17,392 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 18:34:17,397 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 18:34:17,398 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 18:34:17,399 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 18:34:17,401 INFO L384 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 38 treesize of output 25 [2020-11-29 18:34:17,402 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-29 18:34:17,424 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 18:34:17,425 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 18:34:17,425 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:70, output treesize:32 [2020-11-29 18:34:17,458 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 18:34:17,673 WARN L193 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 39 [2020-11-29 18:34:17,674 INFO L350 Elim1Store]: treesize reduction 54, result has 68.2 percent of original size [2020-11-29 18:34:17,675 INFO L384 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 117 treesize of output 182 [2020-11-29 18:34:17,677 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 18:34:17,785 WARN L193 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 35 [2020-11-29 18:34:17,786 INFO L625 ElimStorePlain]: treesize reduction 104, result has 45.8 percent of original size [2020-11-29 18:34:17,806 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 18:34:17,809 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 18:34:17,810 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 18:34:17,814 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 18:34:17,815 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 18:34:17,816 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 18:34:17,816 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 67 treesize of output 54 [2020-11-29 18:34:17,817 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-29 18:34:17,838 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 18:34:17,838 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 18:34:17,839 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:130, output treesize:78 [2020-11-29 18:34:17,899 INFO L441 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_174|, |v_#memory_$Pointer$.base_174|], 18=[|v_#memory_$Pointer$.base_182|, |v_#memory_$Pointer$.offset_182|]} [2020-11-29 18:34:17,912 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-29 18:34:18,185 WARN L193 SmtUtils]: Spent 272.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2020-11-29 18:34:18,185 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 18:34:18,195 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-29 18:34:18,330 WARN L193 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2020-11-29 18:34:18,331 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 18:34:18,343 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 18:34:18,346 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 18:34:18,349 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 18:34:18,352 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 18:34:18,355 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 18:34:18,359 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 18:34:18,363 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 18:34:18,365 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 18:34:18,368 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 18:34:18,371 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 18:34:18,398 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 18:34:18,402 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 18:34:18,406 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 18:34:18,413 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 18:34:18,415 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 18:34:18,415 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 81 treesize of output 66 [2020-11-29 18:34:18,416 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-11-29 18:34:18,526 WARN L193 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2020-11-29 18:34:18,527 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 18:34:18,534 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 18:34:18,539 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 18:34:18,550 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 18:34:18,552 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 18:34:18,554 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 18:34:18,556 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 18:34:18,557 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 18:34:18,560 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 18:34:18,566 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 18:34:18,569 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 18:34:18,571 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 18:34:18,572 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 18:34:18,573 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 66 treesize of output 63 [2020-11-29 18:34:18,574 INFO L545 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-11-29 18:34:18,616 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 18:34:18,618 INFO L545 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 18:34:18,618 INFO L244 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:154, output treesize:78 [2020-11-29 18:34:18,643 INFO L441 ElimStorePlain]: Different costs {0=[|v_#memory_int_191|], 18=[|v_#memory_$Pointer$.base_183|, |v_#memory_$Pointer$.offset_183|]} [2020-11-29 18:34:18,675 INFO L384 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 [2020-11-29 18:34:18,675 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 18:34:18,776 WARN L193 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2020-11-29 18:34:18,776 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 18:34:18,806 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 18:34:18,808 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 18:34:18,809 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 18:34:18,812 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 18:34:18,814 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 18:34:18,816 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 18:34:18,818 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 18:34:18,820 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 18:34:18,822 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 18:34:18,823 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 18:34:18,824 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 76 treesize of output 57 [2020-11-29 18:34:18,825 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-29 18:34:18,882 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 18:34:18,892 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 18:34:18,895 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 18:34:18,898 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 18:34:18,908 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 18:34:18,910 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 18:34:18,911 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 18:34:18,912 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 18:34:18,914 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 18:34:18,914 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 61 treesize of output 54 [2020-11-29 18:34:18,915 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-11-29 18:34:18,944 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 18:34:18,944 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 18:34:18,944 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:129, output treesize:87 [2020-11-29 18:34:19,007 INFO L441 ElimStorePlain]: Different costs {2=[|v_#memory_int_192|], 10=[|v_#memory_$Pointer$.offset_184|, |v_#memory_$Pointer$.base_184|]} [2020-11-29 18:34:19,015 INFO L384 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 43 treesize of output 36 [2020-11-29 18:34:19,016 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 18:34:19,067 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 18:34:19,078 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 18:34:19,080 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 18:34:19,081 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 18:34:19,083 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 18:34:19,083 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 63 treesize of output 25 [2020-11-29 18:34:19,085 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-29 18:34:19,102 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 18:34:19,105 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 18:34:19,108 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 18:34:19,109 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 18:34:19,110 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 18:34:19,111 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 18:34:19,112 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 18:34:19,112 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 47 treesize of output 21 [2020-11-29 18:34:19,115 INFO L545 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-29 18:34:19,130 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 18:34:19,131 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-29 18:34:19,131 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:120, output treesize:26 [2020-11-29 18:34:19,179 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-29 18:34:19,180 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2020-11-29 18:34:19,181 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 18:34:19,200 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 18:34:19,201 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-29 18:34:19,201 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:37, output treesize:33 [2020-11-29 18:34:19,319 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2020-11-29 18:34:19,321 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 18:34:19,328 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 18:34:19,329 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 18:34:19,330 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:35, output treesize:5 [2020-11-29 18:34:19,579 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 78 proven. 82 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2020-11-29 18:34:19,580 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-29 18:34:19,685 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-29 18:34:19,713 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 18:34:19,715 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-29 18:34:19,722 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 18:34:19,723 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-11-29 18:34:19,732 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 18:34:19,733 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-29 18:34:19,733 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:98, output treesize:35 [2020-11-29 18:34:19,829 INFO L441 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_188|, |v_#memory_$Pointer$.offset_188|], 2=[|v_#memory_$Pointer$.offset_174|, |v_#memory_$Pointer$.base_174|]} [2020-11-29 18:34:19,839 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-29 18:34:19,945 WARN L193 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2020-11-29 18:34:19,946 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 18:34:19,970 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-29 18:34:20,025 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 18:34:20,030 INFO L545 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-29 18:34:20,062 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 18:34:20,065 INFO L545 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-29 18:34:20,076 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 18:34:20,077 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-2 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2020-11-29 18:34:20,077 INFO L244 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:113, output treesize:53 [2020-11-29 18:34:20,314 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-29 18:34:20,428 WARN L193 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2020-11-29 18:34:20,428 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 18:34:20,431 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-29 18:34:20,536 WARN L193 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2020-11-29 18:34:20,537 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 18:34:20,538 INFO L545 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. [2020-11-29 18:34:20,538 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:165, output treesize:235 [2020-11-29 18:34:21,239 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-29 18:34:21,393 WARN L193 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2020-11-29 18:34:21,393 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 18:34:21,395 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-29 18:34:21,495 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 18:34:21,497 INFO L545 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. [2020-11-29 18:34:21,497 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:275, output treesize:315 [2020-11-29 18:34:23,074 INFO L441 ElimStorePlain]: Different costs {1=[|v_#memory_$Pointer$.offset_192|, |v_#memory_$Pointer$.base_192|], 2=[|v_#memory_$Pointer$.offset_173|, |v_#memory_$Pointer$.base_173|]} [2020-11-29 18:34:23,085 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-29 18:34:24,040 WARN L193 SmtUtils]: Spent 955.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2020-11-29 18:34:24,041 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 18:34:24,047 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-29 18:34:24,787 WARN L193 SmtUtils]: Spent 739.00 ms on a formula simplification that was a NOOP. DAG size: 75 [2020-11-29 18:34:24,787 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 18:34:24,791 INFO L545 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-29 18:34:25,138 WARN L193 SmtUtils]: Spent 346.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2020-11-29 18:34:25,139 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 18:34:25,152 INFO L545 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-29 18:34:25,344 WARN L193 SmtUtils]: Spent 191.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2020-11-29 18:34:25,344 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 18:34:25,347 INFO L545 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. [2020-11-29 18:34:25,347 INFO L244 ElimStorePlain]: Needed 5 recursive calls to eliminate 10 variables, input treesize:395, output treesize:475 [2020-11-29 18:34:32,854 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-29 18:34:33,138 WARN L193 SmtUtils]: Spent 283.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2020-11-29 18:34:33,139 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 18:34:33,141 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-29 18:34:33,292 WARN L193 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2020-11-29 18:34:33,293 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 18:34:33,295 INFO L545 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-2 vars, End of recursive call: 8 dim-0 vars, and 1 xjuncts. [2020-11-29 18:34:33,295 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:355, output treesize:395 [2020-11-29 18:34:40,220 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-29 18:34:40,880 WARN L193 SmtUtils]: Spent 658.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2020-11-29 18:34:40,880 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 18:34:40,888 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-29 18:34:41,113 WARN L193 SmtUtils]: Spent 224.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2020-11-29 18:34:41,114 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 18:34:41,115 INFO L545 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 2 dim-2 vars, End of recursive call: 10 dim-0 vars, and 1 xjuncts. [2020-11-29 18:34:41,115 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 10 variables, input treesize:435, output treesize:475 [2020-11-29 18:34:50,997 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 14 proven. 185 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 18:34:50,998 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [594390443] [2020-11-29 18:34:50,998 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 18:34:50,998 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11] total 16 [2020-11-29 18:34:50,998 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046039064] [2020-11-29 18:34:50,999 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-11-29 18:34:50,999 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-11-29 18:34:50,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-11-29 18:34:50,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=173, Unknown=7, NotChecked=0, Total=240 [2020-11-29 18:34:50,999 INFO L87 Difference]: Start difference. First operand 991 states and 1499 transitions. Second operand 16 states. [2020-11-29 18:37:14,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 18:37:14,324 INFO L93 Difference]: Finished difference Result 6970 states and 10676 transitions. [2020-11-29 18:37:14,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-11-29 18:37:14,331 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 164 [2020-11-29 18:37:14,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 18:37:14,373 INFO L225 Difference]: With dead ends: 6970 [2020-11-29 18:37:14,374 INFO L226 Difference]: Without dead ends: 5987 [2020-11-29 18:37:14,377 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 309 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 26.9s TimeCoverageRelationStatistics Valid=214, Invalid=429, Unknown=7, NotChecked=0, Total=650 [2020-11-29 18:37:14,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5987 states. [2020-11-29 18:37:14,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5987 to 2396. [2020-11-29 18:37:14,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2396 states. [2020-11-29 18:37:14,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2396 states to 2396 states and 3802 transitions. [2020-11-29 18:37:14,563 INFO L78 Accepts]: Start accepts. Automaton has 2396 states and 3802 transitions. Word has length 164 [2020-11-29 18:37:14,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 18:37:14,564 INFO L481 AbstractCegarLoop]: Abstraction has 2396 states and 3802 transitions. [2020-11-29 18:37:14,564 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-11-29 18:37:14,564 INFO L276 IsEmpty]: Start isEmpty. Operand 2396 states and 3802 transitions. [2020-11-29 18:37:14,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2020-11-29 18:37:14,571 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 18:37:14,572 INFO L422 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, 1, 1, 1, 1, 1] [2020-11-29 18:37:14,794 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2020-11-29 18:37:14,794 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 18:37:14,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 18:37:14,795 INFO L82 PathProgramCache]: Analyzing trace with hash -329499811, now seen corresponding path program 1 times [2020-11-29 18:37:14,795 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-11-29 18:37:14,795 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [992716771] [2020-11-29 18:37:14,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_42dd8acb-5f7c-4b36-90da-de8d148c03f2/bin/uautomizer/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2020-11-29 18:37:15,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:37:15,241 INFO L263 TraceCheckSpWp]: Trace formula consists of 413 conjuncts, 4 conjunts are in the unsatisfiable core [2020-11-29 18:37:15,250 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 18:37:15,258 INFO L384 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 [2020-11-29 18:37:15,258 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 18:37:15,263 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 18:37:15,263 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 18:37:15,263 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2020-11-29 18:37:15,298 INFO L350 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2020-11-29 18:37:15,299 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2020-11-29 18:37:15,299 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 18:37:15,316 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 18:37:15,317 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 18:37:15,317 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2020-11-29 18:37:15,350 INFO L350 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2020-11-29 18:37:15,350 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 30 treesize of output 12 [2020-11-29 18:37:15,356 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 18:37:15,359 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 18:37:15,359 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 18:37:15,360 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:5 [2020-11-29 18:37:15,441 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 169 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2020-11-29 18:37:15,441 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-29 18:37:15,531 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 169 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2020-11-29 18:37:15,532 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [992716771] [2020-11-29 18:37:15,532 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-29 18:37:15,532 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [] total 7 [2020-11-29 18:37:15,532 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99641923] [2020-11-29 18:37:15,533 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-29 18:37:15,533 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-11-29 18:37:15,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-29 18:37:15,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-11-29 18:37:15,536 INFO L87 Difference]: Start difference. First operand 2396 states and 3802 transitions. Second operand 7 states. [2020-11-29 18:37:26,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 18:37:26,718 INFO L93 Difference]: Finished difference Result 8096 states and 12701 transitions. [2020-11-29 18:37:26,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-29 18:37:26,719 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 170 [2020-11-29 18:37:26,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 18:37:26,760 INFO L225 Difference]: With dead ends: 8096 [2020-11-29 18:37:26,760 INFO L226 Difference]: Without dead ends: 5708 [2020-11-29 18:37:26,765 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 340 GetRequests, 332 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-11-29 18:37:26,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5708 states. [2020-11-29 18:37:27,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5708 to 2794. [2020-11-29 18:37:27,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2794 states. [2020-11-29 18:37:27,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2794 states to 2794 states and 4472 transitions. [2020-11-29 18:37:27,014 INFO L78 Accepts]: Start accepts. Automaton has 2794 states and 4472 transitions. Word has length 170 [2020-11-29 18:37:27,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 18:37:27,014 INFO L481 AbstractCegarLoop]: Abstraction has 2794 states and 4472 transitions. [2020-11-29 18:37:27,014 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-29 18:37:27,014 INFO L276 IsEmpty]: Start isEmpty. Operand 2794 states and 4472 transitions. [2020-11-29 18:37:27,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2020-11-29 18:37:27,023 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 18:37:27,023 INFO L422 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, 1, 1, 1, 1, 1] [2020-11-29 18:37:27,236 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2020-11-29 18:37:27,239 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 18:37:27,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 18:37:27,240 INFO L82 PathProgramCache]: Analyzing trace with hash -1277551777, now seen corresponding path program 1 times [2020-11-29 18:37:27,241 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-11-29 18:37:27,242 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1286759895] [2020-11-29 18:37:27,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_42dd8acb-5f7c-4b36-90da-de8d148c03f2/bin/uautomizer/mathsat Starting monitored process 8 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2020-11-29 18:37:27,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:37:27,745 INFO L263 TraceCheckSpWp]: Trace formula consists of 413 conjuncts, 3 conjunts are in the unsatisfiable core [2020-11-29 18:37:27,750 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 18:37:27,797 INFO L350 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2020-11-29 18:37:27,797 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2020-11-29 18:37:27,798 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 18:37:27,808 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 18:37:27,809 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 18:37:27,809 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:19 [2020-11-29 18:37:27,834 INFO L350 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2020-11-29 18:37:27,834 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 30 treesize of output 12 [2020-11-29 18:37:27,836 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 18:37:27,844 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 18:37:27,845 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 18:37:27,845 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:3 [2020-11-29 18:37:27,896 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 159 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2020-11-29 18:37:27,896 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-29 18:37:27,993 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 159 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2020-11-29 18:37:27,993 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1286759895] [2020-11-29 18:37:27,994 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-29 18:37:27,994 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 5 [2020-11-29 18:37:27,994 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883025518] [2020-11-29 18:37:27,995 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-29 18:37:27,995 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-11-29 18:37:27,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-29 18:37:27,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-29 18:37:27,996 INFO L87 Difference]: Start difference. First operand 2794 states and 4472 transitions. Second operand 5 states. [2020-11-29 18:37:34,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 18:37:34,720 INFO L93 Difference]: Finished difference Result 6508 states and 10387 transitions. [2020-11-29 18:37:34,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-29 18:37:34,723 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 170 [2020-11-29 18:37:34,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 18:37:34,748 INFO L225 Difference]: With dead ends: 6508 [2020-11-29 18:37:34,749 INFO L226 Difference]: Without dead ends: 3722 [2020-11-29 18:37:34,754 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 339 GetRequests, 335 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-11-29 18:37:34,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3722 states. [2020-11-29 18:37:35,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3722 to 3242. [2020-11-29 18:37:35,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3242 states. [2020-11-29 18:37:35,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3242 states to 3242 states and 5256 transitions. [2020-11-29 18:37:35,018 INFO L78 Accepts]: Start accepts. Automaton has 3242 states and 5256 transitions. Word has length 170 [2020-11-29 18:37:35,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 18:37:35,019 INFO L481 AbstractCegarLoop]: Abstraction has 3242 states and 5256 transitions. [2020-11-29 18:37:35,019 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-29 18:37:35,019 INFO L276 IsEmpty]: Start isEmpty. Operand 3242 states and 5256 transitions. [2020-11-29 18:37:35,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2020-11-29 18:37:35,029 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 18:37:35,030 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 18:37:35,242 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2020-11-29 18:37:35,243 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 18:37:35,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 18:37:35,243 INFO L82 PathProgramCache]: Analyzing trace with hash 1627207883, now seen corresponding path program 1 times [2020-11-29 18:37:35,244 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-11-29 18:37:35,244 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [249358895] [2020-11-29 18:37:35,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_42dd8acb-5f7c-4b36-90da-de8d148c03f2/bin/uautomizer/mathsat Starting monitored process 9 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with mathsat -unsat_core_generation=3 [2020-11-29 18:37:35,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:37:35,556 INFO L263 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 3 conjunts are in the unsatisfiable core [2020-11-29 18:37:35,559 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 18:37:35,563 INFO L441 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_208|, |v_#memory_$Pointer$.base_208|], 4=[|v_#memory_int_220|]} [2020-11-29 18:37:35,568 INFO L384 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 85 [2020-11-29 18:37:35,568 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-29 18:37:35,580 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 18:37:35,583 INFO L384 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 85 treesize of output 49 [2020-11-29 18:37:35,583 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-29 18:37:35,596 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 18:37:35,643 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 18:37:35,643 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 55 [2020-11-29 18:37:35,644 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-11-29 18:37:43,745 WARN L193 SmtUtils]: Spent 8.10 s on a formula simplification that was a NOOP. DAG size: 22 [2020-11-29 18:37:43,745 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 18:37:43,748 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 18:37:43,748 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:109, output treesize:9 [2020-11-29 18:37:43,767 INFO L384 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 21 treesize of output 9 [2020-11-29 18:37:43,767 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 18:37:43,770 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 18:37:43,771 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 18:37:43,771 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:21, output treesize:3 [2020-11-29 18:37:43,818 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 167 trivial. 0 not checked. [2020-11-29 18:37:43,818 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-29 18:37:43,901 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 167 trivial. 0 not checked. [2020-11-29 18:37:43,901 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [249358895] [2020-11-29 18:37:43,901 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-29 18:37:43,902 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2020-11-29 18:37:43,902 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531910528] [2020-11-29 18:37:43,903 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-29 18:37:43,903 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-11-29 18:37:43,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-29 18:37:43,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-29 18:37:43,904 INFO L87 Difference]: Start difference. First operand 3242 states and 5256 transitions. Second operand 4 states. [2020-11-29 18:37:47,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 18:37:47,080 INFO L93 Difference]: Finished difference Result 5136 states and 8279 transitions. [2020-11-29 18:37:47,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-29 18:37:47,082 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 178 [2020-11-29 18:37:47,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 18:37:47,102 INFO L225 Difference]: With dead ends: 5136 [2020-11-29 18:37:47,102 INFO L226 Difference]: Without dead ends: 3474 [2020-11-29 18:37:47,106 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 355 GetRequests, 351 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-29 18:37:47,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3474 states. [2020-11-29 18:37:47,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3474 to 3370. [2020-11-29 18:37:47,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3370 states. [2020-11-29 18:37:47,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3370 states to 3370 states and 5464 transitions. [2020-11-29 18:37:47,377 INFO L78 Accepts]: Start accepts. Automaton has 3370 states and 5464 transitions. Word has length 178 [2020-11-29 18:37:47,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 18:37:47,378 INFO L481 AbstractCegarLoop]: Abstraction has 3370 states and 5464 transitions. [2020-11-29 18:37:47,378 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-29 18:37:47,378 INFO L276 IsEmpty]: Start isEmpty. Operand 3370 states and 5464 transitions. [2020-11-29 18:37:47,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2020-11-29 18:37:47,389 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 18:37:47,389 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 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, 1] [2020-11-29 18:37:47,613 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2020-11-29 18:37:47,613 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 18:37:47,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 18:37:47,614 INFO L82 PathProgramCache]: Analyzing trace with hash 1034431756, now seen corresponding path program 1 times [2020-11-29 18:37:47,615 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-11-29 18:37:47,615 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [752047973] [2020-11-29 18:37:47,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_42dd8acb-5f7c-4b36-90da-de8d148c03f2/bin/uautomizer/mathsat Starting monitored process 10 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with mathsat -unsat_core_generation=3 [2020-11-29 18:37:47,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:37:47,946 INFO L263 TraceCheckSpWp]: Trace formula consists of 423 conjuncts, 3 conjunts are in the unsatisfiable core [2020-11-29 18:37:47,951 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 18:37:47,961 INFO L384 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 [2020-11-29 18:37:47,962 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 18:37:47,968 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 18:37:47,969 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 18:37:47,969 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2020-11-29 18:37:47,988 INFO L384 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 21 treesize of output 9 [2020-11-29 18:37:47,988 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 18:37:47,993 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 18:37:47,993 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 18:37:47,993 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:21, output treesize:5 [2020-11-29 18:37:48,070 INFO L134 CoverageAnalysis]: Checked inductivity of 261 backedges. 109 proven. 0 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2020-11-29 18:37:48,070 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-29 18:37:48,172 INFO L134 CoverageAnalysis]: Checked inductivity of 261 backedges. 109 proven. 0 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2020-11-29 18:37:48,173 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [752047973] [2020-11-29 18:37:48,173 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-29 18:37:48,173 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2020-11-29 18:37:48,173 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956032297] [2020-11-29 18:37:48,174 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-29 18:37:48,174 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-11-29 18:37:48,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-29 18:37:48,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-11-29 18:37:48,175 INFO L87 Difference]: Start difference. First operand 3370 states and 5464 transitions. Second operand 6 states. [2020-11-29 18:37:59,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 18:37:59,707 INFO L93 Difference]: Finished difference Result 10610 states and 17025 transitions. [2020-11-29 18:37:59,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-29 18:37:59,708 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 178 [2020-11-29 18:37:59,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 18:37:59,740 INFO L225 Difference]: With dead ends: 10610 [2020-11-29 18:37:59,740 INFO L226 Difference]: Without dead ends: 7248 [2020-11-29 18:37:59,746 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 356 GetRequests, 350 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-11-29 18:37:59,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7248 states. [2020-11-29 18:38:00,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7248 to 4338. [2020-11-29 18:38:00,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4338 states. [2020-11-29 18:38:00,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4338 states to 4338 states and 7210 transitions. [2020-11-29 18:38:00,089 INFO L78 Accepts]: Start accepts. Automaton has 4338 states and 7210 transitions. Word has length 178 [2020-11-29 18:38:00,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 18:38:00,089 INFO L481 AbstractCegarLoop]: Abstraction has 4338 states and 7210 transitions. [2020-11-29 18:38:00,089 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-29 18:38:00,090 INFO L276 IsEmpty]: Start isEmpty. Operand 4338 states and 7210 transitions. [2020-11-29 18:38:00,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2020-11-29 18:38:00,101 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 18:38:00,101 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 18:38:00,324 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 mathsat -unsat_core_generation=3 [2020-11-29 18:38:00,324 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 18:38:00,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 18:38:00,324 INFO L82 PathProgramCache]: Analyzing trace with hash 1080186509, now seen corresponding path program 1 times [2020-11-29 18:38:00,325 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-11-29 18:38:00,325 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1269167206] [2020-11-29 18:38:00,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_42dd8acb-5f7c-4b36-90da-de8d148c03f2/bin/uautomizer/mathsat Starting monitored process 11 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with mathsat -unsat_core_generation=3 [2020-11-29 18:38:00,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:38:00,836 INFO L263 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 4 conjunts are in the unsatisfiable core [2020-11-29 18:38:00,841 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 18:38:00,868 INFO L350 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2020-11-29 18:38:00,868 INFO L384 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 1 case distinctions, treesize of input 23 treesize of output 19 [2020-11-29 18:38:00,868 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 18:38:00,878 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 18:38:00,879 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 18:38:00,879 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:9 [2020-11-29 18:38:00,915 INFO L350 Elim1Store]: treesize reduction 41, result has 18.0 percent of original size [2020-11-29 18:38:00,915 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 26 [2020-11-29 18:38:00,916 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 18:38:00,919 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 18:38:00,919 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 18:38:00,920 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:11 [2020-11-29 18:38:00,931 INFO L384 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 21 treesize of output 9 [2020-11-29 18:38:00,932 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 18:38:00,934 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 18:38:00,935 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 18:38:00,935 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:21, output treesize:5 [2020-11-29 18:38:00,965 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 211 trivial. 0 not checked. [2020-11-29 18:38:00,965 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-29 18:38:01,035 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 211 trivial. 0 not checked. [2020-11-29 18:38:01,036 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1269167206] [2020-11-29 18:38:01,036 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-29 18:38:01,036 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2020-11-29 18:38:01,036 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329259459] [2020-11-29 18:38:01,037 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-29 18:38:01,037 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-11-29 18:38:01,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-29 18:38:01,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-11-29 18:38:01,038 INFO L87 Difference]: Start difference. First operand 4338 states and 7210 transitions. Second operand 6 states. [2020-11-29 18:38:06,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 18:38:06,695 INFO L93 Difference]: Finished difference Result 8054 states and 13112 transitions. [2020-11-29 18:38:06,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-29 18:38:06,696 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 179 [2020-11-29 18:38:06,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 18:38:06,711 INFO L225 Difference]: With dead ends: 8054 [2020-11-29 18:38:06,711 INFO L226 Difference]: Without dead ends: 5776 [2020-11-29 18:38:06,715 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 358 GetRequests, 350 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-11-29 18:38:06,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5776 states. [2020-11-29 18:38:06,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5776 to 4338. [2020-11-29 18:38:06,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4338 states. [2020-11-29 18:38:06,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4338 states to 4338 states and 7124 transitions. [2020-11-29 18:38:06,961 INFO L78 Accepts]: Start accepts. Automaton has 4338 states and 7124 transitions. Word has length 179 [2020-11-29 18:38:06,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 18:38:06,961 INFO L481 AbstractCegarLoop]: Abstraction has 4338 states and 7124 transitions. [2020-11-29 18:38:06,962 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-29 18:38:06,962 INFO L276 IsEmpty]: Start isEmpty. Operand 4338 states and 7124 transitions. [2020-11-29 18:38:06,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2020-11-29 18:38:06,975 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 18:38:06,975 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 18:38:07,188 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 mathsat -unsat_core_generation=3 [2020-11-29 18:38:07,188 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 18:38:07,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 18:38:07,189 INFO L82 PathProgramCache]: Analyzing trace with hash 1995576182, now seen corresponding path program 1 times [2020-11-29 18:38:07,190 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-11-29 18:38:07,190 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [682047392] [2020-11-29 18:38:07,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_42dd8acb-5f7c-4b36-90da-de8d148c03f2/bin/uautomizer/mathsat Starting monitored process 12 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with mathsat -unsat_core_generation=3 [2020-11-29 18:38:07,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:38:07,525 INFO L263 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 3 conjunts are in the unsatisfiable core [2020-11-29 18:38:07,528 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 18:38:07,535 INFO L384 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 [2020-11-29 18:38:07,535 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 18:38:07,539 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 18:38:07,539 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 18:38:07,540 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2020-11-29 18:38:07,551 INFO L384 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 21 treesize of output 9 [2020-11-29 18:38:07,552 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 18:38:07,554 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 18:38:07,554 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 18:38:07,554 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:21, output treesize:5 [2020-11-29 18:38:07,617 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2020-11-29 18:38:07,617 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-29 18:38:07,673 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2020-11-29 18:38:07,674 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [682047392] [2020-11-29 18:38:07,674 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-29 18:38:07,674 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2020-11-29 18:38:07,674 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113889045] [2020-11-29 18:38:07,675 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-29 18:38:07,675 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-11-29 18:38:07,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-29 18:38:07,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-11-29 18:38:07,677 INFO L87 Difference]: Start difference. First operand 4338 states and 7124 transitions. Second operand 6 states. [2020-11-29 18:38:16,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 18:38:16,015 INFO L93 Difference]: Finished difference Result 11476 states and 18474 transitions. [2020-11-29 18:38:16,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-29 18:38:16,017 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 179 [2020-11-29 18:38:16,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 18:38:16,035 INFO L225 Difference]: With dead ends: 11476 [2020-11-29 18:38:16,035 INFO L226 Difference]: Without dead ends: 7146 [2020-11-29 18:38:16,041 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 358 GetRequests, 352 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-11-29 18:38:16,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7146 states. [2020-11-29 18:38:16,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7146 to 4594. [2020-11-29 18:38:16,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4594 states. [2020-11-29 18:38:16,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4594 states to 4594 states and 7620 transitions. [2020-11-29 18:38:16,340 INFO L78 Accepts]: Start accepts. Automaton has 4594 states and 7620 transitions. Word has length 179 [2020-11-29 18:38:16,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 18:38:16,340 INFO L481 AbstractCegarLoop]: Abstraction has 4594 states and 7620 transitions. [2020-11-29 18:38:16,340 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-29 18:38:16,340 INFO L276 IsEmpty]: Start isEmpty. Operand 4594 states and 7620 transitions. [2020-11-29 18:38:16,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2020-11-29 18:38:16,351 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 18:38:16,351 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 18:38:16,565 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 mathsat -unsat_core_generation=3 [2020-11-29 18:38:16,565 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 18:38:16,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 18:38:16,566 INFO L82 PathProgramCache]: Analyzing trace with hash -1455825383, now seen corresponding path program 1 times [2020-11-29 18:38:16,566 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-11-29 18:38:16,567 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2092217215] [2020-11-29 18:38:16,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_42dd8acb-5f7c-4b36-90da-de8d148c03f2/bin/uautomizer/mathsat Starting monitored process 13 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with mathsat -unsat_core_generation=3 [2020-11-29 18:38:16,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:38:16,998 INFO L263 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 3 conjunts are in the unsatisfiable core [2020-11-29 18:38:17,001 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 18:38:17,024 INFO L350 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2020-11-29 18:38:17,025 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2020-11-29 18:38:17,025 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 18:38:17,035 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 18:38:17,036 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 18:38:17,036 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:19 [2020-11-29 18:38:17,057 INFO L350 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2020-11-29 18:38:17,057 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 30 treesize of output 12 [2020-11-29 18:38:17,066 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 18:38:17,068 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 18:38:17,069 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 18:38:17,069 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:5 [2020-11-29 18:38:17,126 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 158 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2020-11-29 18:38:17,126 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-29 18:38:17,206 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 158 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2020-11-29 18:38:17,207 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2092217215] [2020-11-29 18:38:17,207 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-29 18:38:17,207 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2020-11-29 18:38:17,208 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634480650] [2020-11-29 18:38:17,208 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-29 18:38:17,209 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-11-29 18:38:17,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-29 18:38:17,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-11-29 18:38:17,210 INFO L87 Difference]: Start difference. First operand 4594 states and 7620 transitions. Second operand 6 states. [2020-11-29 18:38:25,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 18:38:25,751 INFO L93 Difference]: Finished difference Result 9000 states and 14455 transitions. [2020-11-29 18:38:25,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-29 18:38:25,753 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 179 [2020-11-29 18:38:25,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 18:38:25,766 INFO L225 Difference]: With dead ends: 9000 [2020-11-29 18:38:25,766 INFO L226 Difference]: Without dead ends: 6594 [2020-11-29 18:38:25,771 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 358 GetRequests, 352 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-11-29 18:38:25,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6594 states. [2020-11-29 18:38:26,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6594 to 4594. [2020-11-29 18:38:26,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4594 states. [2020-11-29 18:38:26,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4594 states to 4594 states and 7534 transitions. [2020-11-29 18:38:26,056 INFO L78 Accepts]: Start accepts. Automaton has 4594 states and 7534 transitions. Word has length 179 [2020-11-29 18:38:26,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 18:38:26,057 INFO L481 AbstractCegarLoop]: Abstraction has 4594 states and 7534 transitions. [2020-11-29 18:38:26,057 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-29 18:38:26,057 INFO L276 IsEmpty]: Start isEmpty. Operand 4594 states and 7534 transitions. [2020-11-29 18:38:26,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2020-11-29 18:38:26,069 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 18:38:26,069 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 18:38:26,288 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 mathsat -unsat_core_generation=3 [2020-11-29 18:38:26,289 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 18:38:26,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 18:38:26,289 INFO L82 PathProgramCache]: Analyzing trace with hash -1191303164, now seen corresponding path program 1 times [2020-11-29 18:38:26,290 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-11-29 18:38:26,290 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [596667178] [2020-11-29 18:38:26,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_42dd8acb-5f7c-4b36-90da-de8d148c03f2/bin/uautomizer/mathsat Starting monitored process 14 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with mathsat -unsat_core_generation=3 [2020-11-29 18:38:26,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:38:26,723 INFO L263 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 4 conjunts are in the unsatisfiable core [2020-11-29 18:38:26,727 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 18:38:26,766 INFO L350 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2020-11-29 18:38:26,766 INFO L384 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 1 case distinctions, treesize of input 23 treesize of output 19 [2020-11-29 18:38:26,766 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 18:38:26,795 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 18:38:26,796 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 18:38:26,796 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:9 [2020-11-29 18:38:26,834 INFO L350 Elim1Store]: treesize reduction 41, result has 18.0 percent of original size [2020-11-29 18:38:26,835 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 26 [2020-11-29 18:38:26,839 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 18:38:26,844 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 18:38:26,844 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 18:38:26,844 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:11 [2020-11-29 18:38:26,855 INFO L384 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 21 treesize of output 9 [2020-11-29 18:38:26,856 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 18:38:26,859 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 18:38:26,859 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 18:38:26,859 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:21, output treesize:3 [2020-11-29 18:38:26,899 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 211 trivial. 0 not checked. [2020-11-29 18:38:26,899 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-29 18:38:26,979 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 211 trivial. 0 not checked. [2020-11-29 18:38:26,980 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [596667178] [2020-11-29 18:38:26,980 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-29 18:38:26,980 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2020-11-29 18:38:26,980 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950673994] [2020-11-29 18:38:26,981 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-29 18:38:26,981 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-11-29 18:38:26,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-29 18:38:26,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-11-29 18:38:26,986 INFO L87 Difference]: Start difference. First operand 4594 states and 7534 transitions. Second operand 6 states. [2020-11-29 18:38:32,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 18:38:32,077 INFO L93 Difference]: Finished difference Result 8178 states and 13070 transitions. [2020-11-29 18:38:32,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-29 18:38:32,079 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 180 [2020-11-29 18:38:32,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 18:38:32,086 INFO L225 Difference]: With dead ends: 8178 [2020-11-29 18:38:32,086 INFO L226 Difference]: Without dead ends: 5772 [2020-11-29 18:38:32,088 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 360 GetRequests, 352 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-11-29 18:38:32,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5772 states. [2020-11-29 18:38:32,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5772 to 4594. [2020-11-29 18:38:32,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4594 states. [2020-11-29 18:38:32,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4594 states to 4594 states and 7448 transitions. [2020-11-29 18:38:32,398 INFO L78 Accepts]: Start accepts. Automaton has 4594 states and 7448 transitions. Word has length 180 [2020-11-29 18:38:32,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 18:38:32,398 INFO L481 AbstractCegarLoop]: Abstraction has 4594 states and 7448 transitions. [2020-11-29 18:38:32,398 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-29 18:38:32,398 INFO L276 IsEmpty]: Start isEmpty. Operand 4594 states and 7448 transitions. [2020-11-29 18:38:32,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2020-11-29 18:38:32,409 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 18:38:32,409 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 18:38:32,631 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 mathsat -unsat_core_generation=3 [2020-11-29 18:38:32,631 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 18:38:32,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 18:38:32,632 INFO L82 PathProgramCache]: Analyzing trace with hash -78301818, now seen corresponding path program 1 times [2020-11-29 18:38:32,632 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-11-29 18:38:32,632 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1628430875] [2020-11-29 18:38:32,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_42dd8acb-5f7c-4b36-90da-de8d148c03f2/bin/uautomizer/mathsat Starting monitored process 15 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with mathsat -unsat_core_generation=3 [2020-11-29 18:38:33,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:38:33,052 INFO L263 TraceCheckSpWp]: Trace formula consists of 436 conjuncts, 4 conjunts are in the unsatisfiable core [2020-11-29 18:38:33,056 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 18:38:33,109 INFO L350 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2020-11-29 18:38:33,109 INFO L384 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 1 case distinctions, treesize of input 23 treesize of output 19 [2020-11-29 18:38:33,109 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 18:38:33,126 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 18:38:33,127 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 18:38:33,127 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:9 [2020-11-29 18:38:33,169 INFO L350 Elim1Store]: treesize reduction 41, result has 18.0 percent of original size [2020-11-29 18:38:33,170 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 26 [2020-11-29 18:38:33,171 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 18:38:33,176 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 18:38:33,176 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 18:38:33,176 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:11 [2020-11-29 18:38:33,189 INFO L384 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 21 treesize of output 9 [2020-11-29 18:38:33,189 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 18:38:33,192 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 18:38:33,192 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 18:38:33,192 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:21, output treesize:3 [2020-11-29 18:38:33,234 INFO L134 CoverageAnalysis]: Checked inductivity of 241 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 211 trivial. 0 not checked. [2020-11-29 18:38:33,234 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-29 18:38:33,349 INFO L134 CoverageAnalysis]: Checked inductivity of 241 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 211 trivial. 0 not checked. [2020-11-29 18:38:33,350 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1628430875] [2020-11-29 18:38:33,350 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-29 18:38:33,350 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2020-11-29 18:38:33,350 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778419648] [2020-11-29 18:38:33,351 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-29 18:38:33,351 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-11-29 18:38:33,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-29 18:38:33,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-11-29 18:38:33,352 INFO L87 Difference]: Start difference. First operand 4594 states and 7448 transitions. Second operand 6 states. [2020-11-29 18:38:39,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 18:38:39,552 INFO L93 Difference]: Finished difference Result 8178 states and 12936 transitions. [2020-11-29 18:38:39,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-29 18:38:39,556 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 181 [2020-11-29 18:38:39,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 18:38:39,565 INFO L225 Difference]: With dead ends: 8178 [2020-11-29 18:38:39,565 INFO L226 Difference]: Without dead ends: 5772 [2020-11-29 18:38:39,569 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 362 GetRequests, 354 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-11-29 18:38:39,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5772 states. [2020-11-29 18:38:39,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5772 to 4594. [2020-11-29 18:38:39,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4594 states. [2020-11-29 18:38:39,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4594 states to 4594 states and 7362 transitions. [2020-11-29 18:38:39,898 INFO L78 Accepts]: Start accepts. Automaton has 4594 states and 7362 transitions. Word has length 181 [2020-11-29 18:38:39,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 18:38:39,898 INFO L481 AbstractCegarLoop]: Abstraction has 4594 states and 7362 transitions. [2020-11-29 18:38:39,898 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-29 18:38:39,898 INFO L276 IsEmpty]: Start isEmpty. Operand 4594 states and 7362 transitions. [2020-11-29 18:38:39,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2020-11-29 18:38:39,907 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 18:38:39,907 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 18:38:40,113 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 mathsat -unsat_core_generation=3 [2020-11-29 18:38:40,114 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 18:38:40,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 18:38:40,114 INFO L82 PathProgramCache]: Analyzing trace with hash -1857331383, now seen corresponding path program 1 times [2020-11-29 18:38:40,115 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-11-29 18:38:40,115 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1255275851] [2020-11-29 18:38:40,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_42dd8acb-5f7c-4b36-90da-de8d148c03f2/bin/uautomizer/mathsat Starting monitored process 16 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with mathsat -unsat_core_generation=3 [2020-11-29 18:38:40,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:38:40,520 INFO L263 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 4 conjunts are in the unsatisfiable core [2020-11-29 18:38:40,523 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 18:38:40,545 INFO L350 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2020-11-29 18:38:40,545 INFO L384 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 1 case distinctions, treesize of input 23 treesize of output 19 [2020-11-29 18:38:40,545 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 18:38:40,556 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 18:38:40,557 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 18:38:40,557 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:9 [2020-11-29 18:38:40,584 INFO L350 Elim1Store]: treesize reduction 41, result has 18.0 percent of original size [2020-11-29 18:38:40,585 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 26 [2020-11-29 18:38:40,586 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 18:38:40,590 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 18:38:40,590 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 18:38:40,590 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:11 [2020-11-29 18:38:40,599 INFO L384 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 21 treesize of output 9 [2020-11-29 18:38:40,600 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 18:38:40,602 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 18:38:40,602 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 18:38:40,603 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:21, output treesize:5 [2020-11-29 18:38:40,636 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 211 trivial. 0 not checked. [2020-11-29 18:38:40,637 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-29 18:38:40,754 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 211 trivial. 0 not checked. [2020-11-29 18:38:40,755 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1255275851] [2020-11-29 18:38:40,755 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-29 18:38:40,755 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2020-11-29 18:38:40,756 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096895789] [2020-11-29 18:38:40,756 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-29 18:38:40,756 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-11-29 18:38:40,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-29 18:38:40,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-11-29 18:38:40,757 INFO L87 Difference]: Start difference. First operand 4594 states and 7362 transitions. Second operand 6 states. [2020-11-29 18:38:46,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 18:38:46,806 INFO L93 Difference]: Finished difference Result 8088 states and 12685 transitions. [2020-11-29 18:38:46,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-29 18:38:46,808 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 182 [2020-11-29 18:38:46,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 18:38:46,813 INFO L225 Difference]: With dead ends: 8088 [2020-11-29 18:38:46,814 INFO L226 Difference]: Without dead ends: 5682 [2020-11-29 18:38:46,816 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 364 GetRequests, 356 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-11-29 18:38:46,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5682 states. [2020-11-29 18:38:47,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5682 to 4594. [2020-11-29 18:38:47,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4594 states. [2020-11-29 18:38:47,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4594 states to 4594 states and 7276 transitions. [2020-11-29 18:38:47,104 INFO L78 Accepts]: Start accepts. Automaton has 4594 states and 7276 transitions. Word has length 182 [2020-11-29 18:38:47,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 18:38:47,104 INFO L481 AbstractCegarLoop]: Abstraction has 4594 states and 7276 transitions. [2020-11-29 18:38:47,104 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-29 18:38:47,104 INFO L276 IsEmpty]: Start isEmpty. Operand 4594 states and 7276 transitions. [2020-11-29 18:38:47,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2020-11-29 18:38:47,111 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 18:38:47,111 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 18:38:47,329 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 mathsat -unsat_core_generation=3 [2020-11-29 18:38:47,333 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 18:38:47,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 18:38:47,333 INFO L82 PathProgramCache]: Analyzing trace with hash -983707367, now seen corresponding path program 1 times [2020-11-29 18:38:47,334 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-11-29 18:38:47,334 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1886344792] [2020-11-29 18:38:47,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_42dd8acb-5f7c-4b36-90da-de8d148c03f2/bin/uautomizer/mathsat Starting monitored process 17 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with mathsat -unsat_core_generation=3 [2020-11-29 18:38:47,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:38:47,628 INFO L263 TraceCheckSpWp]: Trace formula consists of 439 conjuncts, 3 conjunts are in the unsatisfiable core [2020-11-29 18:38:47,631 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 18:38:47,657 INFO L384 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 [2020-11-29 18:38:47,658 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 18:38:47,662 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 18:38:47,663 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 18:38:47,663 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2020-11-29 18:38:47,688 INFO L384 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 21 treesize of output 9 [2020-11-29 18:38:47,689 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 18:38:47,691 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 18:38:47,691 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 18:38:47,691 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:21, output treesize:5 [2020-11-29 18:38:47,739 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 185 proven. 0 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2020-11-29 18:38:47,739 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-29 18:38:47,841 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 185 proven. 0 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2020-11-29 18:38:47,842 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1886344792] [2020-11-29 18:38:47,842 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-29 18:38:47,842 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2020-11-29 18:38:47,842 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364048317] [2020-11-29 18:38:47,843 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-29 18:38:47,843 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-11-29 18:38:47,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-29 18:38:47,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-11-29 18:38:47,843 INFO L87 Difference]: Start difference. First operand 4594 states and 7276 transitions. Second operand 6 states. [2020-11-29 18:38:55,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 18:38:55,724 INFO L93 Difference]: Finished difference Result 12212 states and 19050 transitions. [2020-11-29 18:38:55,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-29 18:38:55,725 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 184 [2020-11-29 18:38:55,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 18:38:55,733 INFO L225 Difference]: With dead ends: 12212 [2020-11-29 18:38:55,733 INFO L226 Difference]: Without dead ends: 7626 [2020-11-29 18:38:55,738 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 368 GetRequests, 362 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-11-29 18:38:55,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7626 states. [2020-11-29 18:38:55,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7626 to 5264. [2020-11-29 18:38:55,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5264 states. [2020-11-29 18:38:55,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5264 states to 5264 states and 8378 transitions. [2020-11-29 18:38:55,996 INFO L78 Accepts]: Start accepts. Automaton has 5264 states and 8378 transitions. Word has length 184 [2020-11-29 18:38:55,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 18:38:55,997 INFO L481 AbstractCegarLoop]: Abstraction has 5264 states and 8378 transitions. [2020-11-29 18:38:55,997 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-29 18:38:55,997 INFO L276 IsEmpty]: Start isEmpty. Operand 5264 states and 8378 transitions. [2020-11-29 18:38:56,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2020-11-29 18:38:56,003 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 18:38:56,003 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 18:38:56,203 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 mathsat -unsat_core_generation=3 [2020-11-29 18:38:56,204 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 18:38:56,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 18:38:56,204 INFO L82 PathProgramCache]: Analyzing trace with hash 1644166725, now seen corresponding path program 1 times [2020-11-29 18:38:56,205 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-11-29 18:38:56,205 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1666032122] [2020-11-29 18:38:56,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_42dd8acb-5f7c-4b36-90da-de8d148c03f2/bin/uautomizer/mathsat Starting monitored process 18 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with mathsat -unsat_core_generation=3 [2020-11-29 18:38:56,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:38:56,505 INFO L263 TraceCheckSpWp]: Trace formula consists of 441 conjuncts, 3 conjunts are in the unsatisfiable core [2020-11-29 18:38:56,508 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 18:38:56,533 INFO L384 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 [2020-11-29 18:38:56,533 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 18:38:56,554 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 18:38:56,554 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 18:38:56,554 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2020-11-29 18:38:56,576 INFO L384 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 21 treesize of output 9 [2020-11-29 18:38:56,577 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 18:38:56,580 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 18:38:56,580 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 18:38:56,580 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:21, output treesize:3 [2020-11-29 18:38:56,678 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 185 proven. 0 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2020-11-29 18:38:56,679 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-29 18:38:56,765 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 185 proven. 0 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2020-11-29 18:38:56,766 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1666032122] [2020-11-29 18:38:56,766 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-29 18:38:56,766 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2020-11-29 18:38:56,766 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586118311] [2020-11-29 18:38:56,767 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-29 18:38:56,767 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-11-29 18:38:56,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-29 18:38:56,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-11-29 18:38:56,767 INFO L87 Difference]: Start difference. First operand 5264 states and 8378 transitions. Second operand 6 states. [2020-11-29 18:39:04,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 18:39:04,212 INFO L93 Difference]: Finished difference Result 12882 states and 20136 transitions. [2020-11-29 18:39:04,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-29 18:39:04,214 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 185 [2020-11-29 18:39:04,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 18:39:04,222 INFO L225 Difference]: With dead ends: 12882 [2020-11-29 18:39:04,222 INFO L226 Difference]: Without dead ends: 7626 [2020-11-29 18:39:04,228 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 370 GetRequests, 364 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-11-29 18:39:04,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7626 states. [2020-11-29 18:39:04,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7626 to 5296. [2020-11-29 18:39:04,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5296 states. [2020-11-29 18:39:04,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5296 states to 5296 states and 8426 transitions. [2020-11-29 18:39:04,487 INFO L78 Accepts]: Start accepts. Automaton has 5296 states and 8426 transitions. Word has length 185 [2020-11-29 18:39:04,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 18:39:04,487 INFO L481 AbstractCegarLoop]: Abstraction has 5296 states and 8426 transitions. [2020-11-29 18:39:04,487 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-29 18:39:04,487 INFO L276 IsEmpty]: Start isEmpty. Operand 5296 states and 8426 transitions. [2020-11-29 18:39:04,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2020-11-29 18:39:04,494 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 18:39:04,494 INFO L422 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 18:39:04,695 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 mathsat -unsat_core_generation=3 [2020-11-29 18:39:04,695 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 18:39:04,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 18:39:04,696 INFO L82 PathProgramCache]: Analyzing trace with hash 426346312, now seen corresponding path program 1 times [2020-11-29 18:39:04,697 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-11-29 18:39:04,697 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [316500121] [2020-11-29 18:39:04,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_42dd8acb-5f7c-4b36-90da-de8d148c03f2/bin/uautomizer/mathsat Starting monitored process 19 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with mathsat -unsat_core_generation=3 [2020-11-29 18:39:05,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:39:05,174 INFO L263 TraceCheckSpWp]: Trace formula consists of 455 conjuncts, 3 conjunts are in the unsatisfiable core [2020-11-29 18:39:05,178 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 18:39:05,210 INFO L350 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2020-11-29 18:39:05,210 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2020-11-29 18:39:05,211 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 18:39:05,226 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 18:39:05,226 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 18:39:05,226 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:19 [2020-11-29 18:39:05,294 INFO L350 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2020-11-29 18:39:05,294 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 30 treesize of output 12 [2020-11-29 18:39:05,296 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-29 18:39:05,298 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-29 18:39:05,298 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-29 18:39:05,298 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:3 [2020-11-29 18:39:05,381 INFO L134 CoverageAnalysis]: Checked inductivity of 346 backedges. 237 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2020-11-29 18:39:05,381 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-29 18:39:05,488 INFO L134 CoverageAnalysis]: Checked inductivity of 346 backedges. 237 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2020-11-29 18:39:05,489 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [316500121] [2020-11-29 18:39:05,489 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-29 18:39:05,489 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2020-11-29 18:39:05,489 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188957149] [2020-11-29 18:39:05,490 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-29 18:39:05,490 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-11-29 18:39:05,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-29 18:39:05,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-11-29 18:39:05,491 INFO L87 Difference]: Start difference. First operand 5296 states and 8426 transitions. Second operand 6 states. [2020-11-29 18:39:13,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 18:39:13,809 INFO L93 Difference]: Finished difference Result 12542 states and 19670 transitions. [2020-11-29 18:39:13,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-29 18:39:13,811 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 192 [2020-11-29 18:39:13,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 18:39:13,820 INFO L225 Difference]: With dead ends: 12542 [2020-11-29 18:39:13,820 INFO L226 Difference]: Without dead ends: 7254 [2020-11-29 18:39:13,826 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 384 GetRequests, 378 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-11-29 18:39:13,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7254 states. [2020-11-29 18:39:14,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7254 to 5604. [2020-11-29 18:39:14,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5604 states. [2020-11-29 18:39:14,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5604 states to 5604 states and 8808 transitions. [2020-11-29 18:39:14,141 INFO L78 Accepts]: Start accepts. Automaton has 5604 states and 8808 transitions. Word has length 192 [2020-11-29 18:39:14,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 18:39:14,141 INFO L481 AbstractCegarLoop]: Abstraction has 5604 states and 8808 transitions. [2020-11-29 18:39:14,142 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-29 18:39:14,142 INFO L276 IsEmpty]: Start isEmpty. Operand 5604 states and 8808 transitions. [2020-11-29 18:39:14,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2020-11-29 18:39:14,149 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 18:39:14,150 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1] [2020-11-29 18:39:14,350 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 mathsat -unsat_core_generation=3 [2020-11-29 18:39:14,350 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 18:39:14,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 18:39:14,351 INFO L82 PathProgramCache]: Analyzing trace with hash -1815772062, now seen corresponding path program 1 times [2020-11-29 18:39:14,352 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-11-29 18:39:14,352 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1011186186] [2020-11-29 18:39:14,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_42dd8acb-5f7c-4b36-90da-de8d148c03f2/bin/uautomizer/mathsat Starting monitored process 20 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with mathsat -unsat_core_generation=3 [2020-11-29 18:39:15,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 18:39:15,013 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 18:39:15,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 18:39:15,562 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 18:39:16,130 INFO L173 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2020-11-29 18:39:16,131 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-11-29 18:39:16,353 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 mathsat -unsat_core_generation=3 [2020-11-29 18:39:16,651 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 06:39:16 BoogieIcfgContainer [2020-11-29 18:39:16,652 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-29 18:39:16,652 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-11-29 18:39:16,652 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-11-29 18:39:16,653 INFO L275 PluginConnector]: Witness Printer initialized [2020-11-29 18:39:16,653 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 06:34:02" (3/4) ... [2020-11-29 18:39:16,656 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-11-29 18:39:16,945 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_42dd8acb-5f7c-4b36-90da-de8d148c03f2/bin/uautomizer/witness.graphml [2020-11-29 18:39:16,945 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-11-29 18:39:16,947 INFO L168 Benchmark]: Toolchain (without parser) took 319626.83 ms. Allocated memory was 69.2 MB in the beginning and 545.3 MB in the end (delta: 476.1 MB). Free memory was 51.6 MB in the beginning and 393.0 MB in the end (delta: -341.4 MB). Peak memory consumption was 423.5 MB. Max. memory is 16.1 GB. [2020-11-29 18:39:16,947 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 69.2 MB. Free memory was 52.0 MB in the beginning and 51.9 MB in the end (delta: 59.4 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-29 18:39:16,947 INFO L168 Benchmark]: CACSL2BoogieTranslator took 837.01 ms. Allocated memory is still 69.2 MB. Free memory was 51.5 MB in the beginning and 32.1 MB in the end (delta: 19.4 MB). Peak memory consumption was 20.0 MB. Max. memory is 16.1 GB. [2020-11-29 18:39:16,948 INFO L168 Benchmark]: Boogie Procedure Inliner took 130.68 ms. Allocated memory is still 69.2 MB. Free memory was 32.1 MB in the beginning and 48.2 MB in the end (delta: -16.2 MB). Peak memory consumption was 6.7 MB. Max. memory is 16.1 GB. [2020-11-29 18:39:16,948 INFO L168 Benchmark]: Boogie Preprocessor took 121.34 ms. Allocated memory is still 69.2 MB. Free memory was 47.9 MB in the beginning and 41.1 MB in the end (delta: 6.8 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. [2020-11-29 18:39:16,949 INFO L168 Benchmark]: RCFGBuilder took 4574.40 ms. Allocated memory was 69.2 MB in the beginning and 98.6 MB in the end (delta: 29.4 MB). Free memory was 41.1 MB in the beginning and 68.1 MB in the end (delta: -27.0 MB). Peak memory consumption was 33.9 MB. Max. memory is 16.1 GB. [2020-11-29 18:39:16,949 INFO L168 Benchmark]: TraceAbstraction took 313663.36 ms. Allocated memory was 98.6 MB in the beginning and 545.3 MB in the end (delta: 446.7 MB). Free memory was 67.4 MB in the beginning and 127.1 MB in the end (delta: -59.7 MB). Peak memory consumption was 385.6 MB. Max. memory is 16.1 GB. [2020-11-29 18:39:16,950 INFO L168 Benchmark]: Witness Printer took 293.04 ms. Allocated memory is still 545.3 MB. Free memory was 127.1 MB in the beginning and 393.0 MB in the end (delta: -265.9 MB). Peak memory consumption was 23.5 MB. Max. memory is 16.1 GB. [2020-11-29 18:39:16,953 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 69.2 MB. Free memory was 52.0 MB in the beginning and 51.9 MB in the end (delta: 59.4 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 837.01 ms. Allocated memory is still 69.2 MB. Free memory was 51.5 MB in the beginning and 32.1 MB in the end (delta: 19.4 MB). Peak memory consumption was 20.0 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 130.68 ms. Allocated memory is still 69.2 MB. Free memory was 32.1 MB in the beginning and 48.2 MB in the end (delta: -16.2 MB). Peak memory consumption was 6.7 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 121.34 ms. Allocated memory is still 69.2 MB. Free memory was 47.9 MB in the beginning and 41.1 MB in the end (delta: 6.8 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. * RCFGBuilder took 4574.40 ms. Allocated memory was 69.2 MB in the beginning and 98.6 MB in the end (delta: 29.4 MB). Free memory was 41.1 MB in the beginning and 68.1 MB in the end (delta: -27.0 MB). Peak memory consumption was 33.9 MB. Max. memory is 16.1 GB. * TraceAbstraction took 313663.36 ms. Allocated memory was 98.6 MB in the beginning and 545.3 MB in the end (delta: 446.7 MB). Free memory was 67.4 MB in the beginning and 127.1 MB in the end (delta: -59.7 MB). Peak memory consumption was 385.6 MB. Max. memory is 16.1 GB. * Witness Printer took 293.04 ms. Allocated memory is still 545.3 MB. Free memory was 127.1 MB in the beginning and 393.0 MB in the end (delta: -265.9 MB). Peak memory consumption was 23.5 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 3]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L1044] static int init = 1; [L1045] static SSL_METHOD SSLv3_server_data ; VAL [init=1, SSLv3_server_data={-2147483605:0}] [L1067] SSL *s ; [L1068] int tmp ; [L1072] s = malloc(sizeof(SSL)) [L1073] s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1074] s->ctx = malloc(sizeof(SSL_CTX)) [L1075] s->session = malloc(sizeof(SSL_SESSION)) [L1082] BUF_MEM *buf ; [L1083] unsigned long l ; [L1084] unsigned long Time ; [L1085] unsigned long tmp ; [L1086] void (*cb)() ; [L1087] long num1 ; [L1088] int ret ; [L1089] int new_state ; [L1090] int state ; [L1091] int skip ; [L1092] int got_new_session ; [L1093] int tmp___1 = __VERIFIER_nondet_int() ; [L1094] int tmp___2 = __VERIFIER_nondet_int() ; [L1095] int tmp___3 = __VERIFIER_nondet_int() ; [L1096] int tmp___4 = __VERIFIER_nondet_int() ; [L1097] int tmp___5 = __VERIFIER_nondet_int() ; [L1098] int tmp___6 = __VERIFIER_nondet_int() ; [L1099] int tmp___7 ; [L1100] long tmp___8 = __VERIFIER_nondet_long() ; [L1101] int tmp___9 = __VERIFIER_nondet_int() ; [L1102] int tmp___10 = __VERIFIER_nondet_int() ; [L1103] int blastFlag ; [L1107] s->state = 8464 [L1108] blastFlag = 0 [L1109] s->hit=__VERIFIER_nondet_int () [L1110] s->state = 8464 [L1111] tmp = __VERIFIER_nondet_int() [L1112] Time = tmp [L1113] cb = (void (*)())((void *)0) [L1114] ret = -1 [L1115] skip = 0 [L1116] got_new_session = 0 [L1117] EXPR s->info_callback VAL [init=1, SSLv3_server_data={-2147483605:0}] [L1117] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1118] EXPR s->info_callback [L1118] cb = s->info_callback [L1122] EXPR s->in_handshake [L1122] s->in_handshake += 1 [L1123] COND FALSE !(tmp___1 & 12288) VAL [init=1, SSLv3_server_data={-2147483605:0}] [L1132] EXPR s->cert VAL [init=1, SSLv3_server_data={-2147483605:0}] [L1132] COND FALSE !((unsigned long )s->cert == (unsigned long )((void *)0)) [L1138] COND TRUE 1 VAL [init=1, SSLv3_server_data={-2147483605:0}] [L1140] EXPR s->state [L1140] state = s->state [L1141] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483605:0}] [L1141] COND FALSE !(s->state == 12292) [L1144] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483605:0}] [L1144] COND FALSE !(s->state == 16384) [L1147] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483605:0}] [L1147] COND FALSE !(s->state == 8192) [L1150] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483605:0}] [L1150] COND FALSE !(s->state == 24576) [L1153] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483605:0}] [L1153] COND FALSE !(s->state == 8195) [L1156] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483605:0}] [L1156] COND FALSE !(s->state == 8480) [L1159] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483605:0}] [L1159] COND FALSE !(s->state == 8481) [L1162] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483605:0}] [L1162] COND FALSE !(s->state == 8482) [L1165] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483605:0}] [L1165] COND TRUE s->state == 8464 [L1325] s->shutdown = 0 [L1326] ret = __VERIFIER_nondet_int() [L1327] COND TRUE blastFlag == 0 [L1328] blastFlag = 1 VAL [init=1, SSLv3_server_data={-2147483605:0}] [L1332] COND FALSE !(ret <= 0) [L1337] got_new_session = 1 [L1338] s->state = 8496 [L1339] s->init_num = 0 VAL [init=1, SSLv3_server_data={-2147483605:0}] [L1687] EXPR s->s3 [L1687] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={-2147483605:0}] [L1687] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1716] skip = 0 VAL [init=1, SSLv3_server_data={-2147483605:0}] [L1138] COND TRUE 1 VAL [init=1, SSLv3_server_data={-2147483605:0}] [L1140] EXPR s->state [L1140] state = s->state [L1141] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483605:0}] [L1141] COND FALSE !(s->state == 12292) [L1144] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483605:0}] [L1144] COND FALSE !(s->state == 16384) [L1147] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483605:0}] [L1147] COND FALSE !(s->state == 8192) [L1150] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483605:0}] [L1150] COND FALSE !(s->state == 24576) [L1153] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483605:0}] [L1153] COND FALSE !(s->state == 8195) [L1156] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483605:0}] [L1156] COND FALSE !(s->state == 8480) [L1159] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483605:0}] [L1159] COND FALSE !(s->state == 8481) [L1162] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483605:0}] [L1162] COND FALSE !(s->state == 8482) [L1165] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483605:0}] [L1165] COND FALSE !(s->state == 8464) [L1168] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483605:0}] [L1168] COND FALSE !(s->state == 8465) [L1171] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483605:0}] [L1171] COND FALSE !(s->state == 8466) [L1174] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483605:0}] [L1174] COND TRUE s->state == 8496 [L1343] ret = __VERIFIER_nondet_int() [L1344] COND TRUE blastFlag == 1 [L1345] blastFlag = 2 VAL [init=1, SSLv3_server_data={-2147483605:0}] [L1349] COND FALSE !(ret <= 0) [L1354] s->hit VAL [init=1, SSLv3_server_data={-2147483605:0}] [L1354] COND TRUE s->hit [L1355] s->state = 8656 VAL [init=1, SSLv3_server_data={-2147483605:0}] [L1359] s->init_num = 0 VAL [init=1, SSLv3_server_data={-2147483605:0}] [L1687] EXPR s->s3 [L1687] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={-2147483605:0}] [L1687] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1716] skip = 0 VAL [init=1, SSLv3_server_data={-2147483605:0}] [L1138] COND TRUE 1 VAL [init=1, SSLv3_server_data={-2147483605:0}] [L1140] EXPR s->state [L1140] state = s->state [L1141] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483605:0}] [L1141] COND FALSE !(s->state == 12292) [L1144] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483605:0}] [L1144] COND FALSE !(s->state == 16384) [L1147] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483605:0}] [L1147] COND FALSE !(s->state == 8192) [L1150] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483605:0}] [L1150] COND FALSE !(s->state == 24576) [L1153] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483605:0}] [L1153] COND FALSE !(s->state == 8195) [L1156] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483605:0}] [L1156] COND FALSE !(s->state == 8480) [L1159] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483605:0}] [L1159] COND FALSE !(s->state == 8481) [L1162] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483605:0}] [L1162] COND FALSE !(s->state == 8482) [L1165] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483605:0}] [L1165] COND FALSE !(s->state == 8464) [L1168] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483605:0}] [L1168] COND FALSE !(s->state == 8465) [L1171] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483605:0}] [L1171] COND FALSE !(s->state == 8466) [L1174] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483605:0}] [L1174] COND FALSE !(s->state == 8496) [L1177] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483605:0}] [L1177] COND FALSE !(s->state == 8497) [L1180] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483605:0}] [L1180] COND FALSE !(s->state == 8512) [L1183] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483605:0}] [L1183] COND FALSE !(s->state == 8513) [L1186] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483605:0}] [L1186] COND FALSE !(s->state == 8528) [L1189] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483605:0}] [L1189] COND FALSE !(s->state == 8529) [L1192] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483605:0}] [L1192] COND FALSE !(s->state == 8544) [L1195] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483605:0}] [L1195] COND FALSE !(s->state == 8545) [L1198] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483605:0}] [L1198] COND FALSE !(s->state == 8560) [L1201] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483605:0}] [L1201] COND FALSE !(s->state == 8561) [L1204] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483605:0}] [L1204] COND FALSE !(s->state == 8448) [L1207] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483605:0}] [L1207] COND FALSE !(s->state == 8576) [L1210] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483605:0}] [L1210] COND FALSE !(s->state == 8577) [L1213] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483605:0}] [L1213] COND FALSE !(s->state == 8592) [L1216] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483605:0}] [L1216] COND FALSE !(s->state == 8593) [L1219] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483605:0}] [L1219] COND FALSE !(s->state == 8608) [L1222] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483605:0}] [L1222] COND FALSE !(s->state == 8609) [L1225] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483605:0}] [L1225] COND FALSE !(s->state == 8640) [L1228] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483605:0}] [L1228] COND FALSE !(s->state == 8641) [L1231] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483605:0}] [L1231] COND TRUE s->state == 8656 [L1572] EXPR s->session [L1572] EXPR s->s3 [L1572] EXPR (s->s3)->tmp.new_cipher [L1572] (s->session)->cipher = (s->s3)->tmp.new_cipher [L1573] COND FALSE !(! tmp___9) [L1579] ret = __VERIFIER_nondet_int() [L1580] COND TRUE blastFlag == 2 [L1581] blastFlag = 3 VAL [init=1, SSLv3_server_data={-2147483605:0}] [L1593] COND FALSE !(ret <= 0) [L1598] s->state = 8672 [L1599] s->init_num = 0 VAL [init=1, SSLv3_server_data={-2147483605:0}] [L1600] COND FALSE !(! tmp___10) VAL [init=1, SSLv3_server_data={-2147483605:0}] [L1687] EXPR s->s3 [L1687] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={-2147483605:0}] [L1687] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1716] skip = 0 VAL [init=1, SSLv3_server_data={-2147483605:0}] [L1138] COND TRUE 1 VAL [init=1, SSLv3_server_data={-2147483605:0}] [L1140] EXPR s->state [L1140] state = s->state [L1141] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483605:0}] [L1141] COND FALSE !(s->state == 12292) [L1144] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483605:0}] [L1144] COND FALSE !(s->state == 16384) [L1147] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483605:0}] [L1147] COND FALSE !(s->state == 8192) [L1150] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483605:0}] [L1150] COND FALSE !(s->state == 24576) [L1153] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483605:0}] [L1153] COND FALSE !(s->state == 8195) [L1156] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483605:0}] [L1156] COND FALSE !(s->state == 8480) [L1159] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483605:0}] [L1159] COND FALSE !(s->state == 8481) [L1162] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483605:0}] [L1162] COND FALSE !(s->state == 8482) [L1165] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483605:0}] [L1165] COND FALSE !(s->state == 8464) [L1168] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483605:0}] [L1168] COND FALSE !(s->state == 8465) [L1171] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483605:0}] [L1171] COND FALSE !(s->state == 8466) [L1174] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483605:0}] [L1174] COND FALSE !(s->state == 8496) [L1177] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483605:0}] [L1177] COND FALSE !(s->state == 8497) [L1180] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483605:0}] [L1180] COND FALSE !(s->state == 8512) [L1183] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483605:0}] [L1183] COND FALSE !(s->state == 8513) [L1186] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483605:0}] [L1186] COND FALSE !(s->state == 8528) [L1189] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483605:0}] [L1189] COND FALSE !(s->state == 8529) [L1192] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483605:0}] [L1192] COND FALSE !(s->state == 8544) [L1195] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483605:0}] [L1195] COND FALSE !(s->state == 8545) [L1198] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483605:0}] [L1198] COND FALSE !(s->state == 8560) [L1201] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483605:0}] [L1201] COND FALSE !(s->state == 8561) [L1204] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483605:0}] [L1204] COND FALSE !(s->state == 8448) [L1207] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483605:0}] [L1207] COND FALSE !(s->state == 8576) [L1210] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483605:0}] [L1210] COND FALSE !(s->state == 8577) [L1213] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483605:0}] [L1213] COND FALSE !(s->state == 8592) [L1216] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483605:0}] [L1216] COND FALSE !(s->state == 8593) [L1219] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483605:0}] [L1219] COND FALSE !(s->state == 8608) [L1222] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483605:0}] [L1222] COND FALSE !(s->state == 8609) [L1225] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483605:0}] [L1225] COND FALSE !(s->state == 8640) [L1228] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483605:0}] [L1228] COND FALSE !(s->state == 8641) [L1231] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483605:0}] [L1231] COND FALSE !(s->state == 8656) [L1234] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483605:0}] [L1234] COND FALSE !(s->state == 8657) [L1237] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483605:0}] [L1237] COND TRUE s->state == 8672 [L1609] ret = __VERIFIER_nondet_int() [L1610] COND TRUE blastFlag == 3 [L1611] blastFlag = 4 VAL [init=1, SSLv3_server_data={-2147483605:0}] [L1615] COND FALSE !(ret <= 0) [L1620] s->state = 8448 [L1621] s->hit VAL [init=1, SSLv3_server_data={-2147483605:0}] [L1621] COND TRUE s->hit [L1622] EXPR s->s3 [L1622] (s->s3)->tmp.next_state = 8640 [L1626] s->init_num = 0 VAL [init=1, SSLv3_server_data={-2147483605:0}] [L1687] EXPR s->s3 [L1687] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={-2147483605:0}] [L1687] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1716] skip = 0 VAL [init=1, SSLv3_server_data={-2147483605:0}] [L1138] COND TRUE 1 VAL [init=1, SSLv3_server_data={-2147483605:0}] [L1140] EXPR s->state [L1140] state = s->state [L1141] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483605:0}] [L1141] COND FALSE !(s->state == 12292) [L1144] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483605:0}] [L1144] COND FALSE !(s->state == 16384) [L1147] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483605:0}] [L1147] COND FALSE !(s->state == 8192) [L1150] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483605:0}] [L1150] COND FALSE !(s->state == 24576) [L1153] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483605:0}] [L1153] COND FALSE !(s->state == 8195) [L1156] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483605:0}] [L1156] COND FALSE !(s->state == 8480) [L1159] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483605:0}] [L1159] COND FALSE !(s->state == 8481) [L1162] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483605:0}] [L1162] COND FALSE !(s->state == 8482) [L1165] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483605:0}] [L1165] COND FALSE !(s->state == 8464) [L1168] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483605:0}] [L1168] COND FALSE !(s->state == 8465) [L1171] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483605:0}] [L1171] COND FALSE !(s->state == 8466) [L1174] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483605:0}] [L1174] COND FALSE !(s->state == 8496) [L1177] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483605:0}] [L1177] COND FALSE !(s->state == 8497) [L1180] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483605:0}] [L1180] COND FALSE !(s->state == 8512) [L1183] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483605:0}] [L1183] COND FALSE !(s->state == 8513) [L1186] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483605:0}] [L1186] COND FALSE !(s->state == 8528) [L1189] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483605:0}] [L1189] COND FALSE !(s->state == 8529) [L1192] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483605:0}] [L1192] COND FALSE !(s->state == 8544) [L1195] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483605:0}] [L1195] COND FALSE !(s->state == 8545) [L1198] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483605:0}] [L1198] COND FALSE !(s->state == 8560) [L1201] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483605:0}] [L1201] COND FALSE !(s->state == 8561) [L1204] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483605:0}] [L1204] COND TRUE s->state == 8448 [L1492] COND FALSE !(num1 > 0L) VAL [init=1, SSLv3_server_data={-2147483605:0}] [L1505] EXPR s->s3 [L1505] EXPR (s->s3)->tmp.next_state [L1505] s->state = (s->s3)->tmp.next_state [L1687] EXPR s->s3 [L1687] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={-2147483605:0}] [L1687] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1716] skip = 0 VAL [init=1, SSLv3_server_data={-2147483605:0}] [L1138] COND TRUE 1 VAL [init=1, SSLv3_server_data={-2147483605:0}] [L1140] EXPR s->state [L1140] state = s->state [L1141] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483605:0}] [L1141] COND FALSE !(s->state == 12292) [L1144] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483605:0}] [L1144] COND FALSE !(s->state == 16384) [L1147] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483605:0}] [L1147] COND FALSE !(s->state == 8192) [L1150] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483605:0}] [L1150] COND FALSE !(s->state == 24576) [L1153] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483605:0}] [L1153] COND FALSE !(s->state == 8195) [L1156] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483605:0}] [L1156] COND FALSE !(s->state == 8480) [L1159] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483605:0}] [L1159] COND FALSE !(s->state == 8481) [L1162] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483605:0}] [L1162] COND FALSE !(s->state == 8482) [L1165] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483605:0}] [L1165] COND FALSE !(s->state == 8464) [L1168] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483605:0}] [L1168] COND FALSE !(s->state == 8465) [L1171] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483605:0}] [L1171] COND FALSE !(s->state == 8466) [L1174] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483605:0}] [L1174] COND FALSE !(s->state == 8496) [L1177] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483605:0}] [L1177] COND FALSE !(s->state == 8497) [L1180] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483605:0}] [L1180] COND FALSE !(s->state == 8512) [L1183] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483605:0}] [L1183] COND FALSE !(s->state == 8513) [L1186] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483605:0}] [L1186] COND FALSE !(s->state == 8528) [L1189] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483605:0}] [L1189] COND FALSE !(s->state == 8529) [L1192] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483605:0}] [L1192] COND FALSE !(s->state == 8544) [L1195] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483605:0}] [L1195] COND FALSE !(s->state == 8545) [L1198] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483605:0}] [L1198] COND FALSE !(s->state == 8560) [L1201] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483605:0}] [L1201] COND FALSE !(s->state == 8561) [L1204] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483605:0}] [L1204] COND FALSE !(s->state == 8448) [L1207] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483605:0}] [L1207] COND FALSE !(s->state == 8576) [L1210] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483605:0}] [L1210] COND FALSE !(s->state == 8577) [L1213] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483605:0}] [L1213] COND FALSE !(s->state == 8592) [L1216] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483605:0}] [L1216] COND FALSE !(s->state == 8593) [L1219] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483605:0}] [L1219] COND FALSE !(s->state == 8608) [L1222] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483605:0}] [L1222] COND FALSE !(s->state == 8609) [L1225] EXPR s->state VAL [init=1, SSLv3_server_data={-2147483605:0}] [L1225] COND TRUE s->state == 8640 [L1552] ret = __VERIFIER_nondet_int() [L1553] COND TRUE blastFlag == 4 VAL [init=1, SSLv3_server_data={-2147483605:0}] [L3] __assert_fail("0", "s3_srvr.blast.07.i.cil-2.c", 3, "reach_error") VAL [init=1, SSLv3_server_data={-2147483605:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 149 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 313.3s, OverallIterations: 19, TraceHistogramMax: 7, AutomataDifference: 242.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 4053 SDtfs, 5054 SDslu, 9583 SDs, 0 SdLazy, 9494 SolverSat, 1204 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 221.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5702 GetRequests, 5584 SyntacticMatches, 13 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 28.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5604occurred in iteration=18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 4.1s AutomataMinimizationTime, 18 MinimizatonAttempts, 25779 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 1.2s SsaConstructionTime, 4.6s SatisfiabilityAnalysisTime, 54.3s InterpolantComputationTime, 3045 NumberOfCodeBlocks, 3045 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 5668 ConstructedInterpolants, 150 QuantifiedInterpolants, 6620127 SizeOfPredicates, 70 NumberOfNonLiveVariables, 6993 ConjunctsInSsa, 93 ConjunctsInUnsatCore, 36 InterpolantComputations, 34 PerfectInterpolantSequences, 7457/7724 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...