./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/openssl/s3_clnt.blast.01.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_bc02df54-026e-498d-97f5-0fa385b6c297/bin/uautomizer/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_bc02df54-026e-498d-97f5-0fa385b6c297/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_bc02df54-026e-498d-97f5-0fa385b6c297/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_bc02df54-026e-498d-97f5-0fa385b6c297/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/openssl/s3_clnt.blast.01.i.cil-2.c -s /tmp/vcloud-vcloud-master/worker/run_dir_bc02df54-026e-498d-97f5-0fa385b6c297/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_bc02df54-026e-498d-97f5-0fa385b6c297/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 782042467f0cb3a7476d3c48a134dfd084f9a32e ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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_bc02df54-026e-498d-97f5-0fa385b6c297/bin/uautomizer/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_bc02df54-026e-498d-97f5-0fa385b6c297/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_bc02df54-026e-498d-97f5-0fa385b6c297/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_bc02df54-026e-498d-97f5-0fa385b6c297/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/openssl/s3_clnt.blast.01.i.cil-2.c -s /tmp/vcloud-vcloud-master/worker/run_dir_bc02df54-026e-498d-97f5-0fa385b6c297/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_bc02df54-026e-498d-97f5-0fa385b6c297/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 782042467f0cb3a7476d3c48a134dfd084f9a32e .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-30 01:16:51,325 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-30 01:16:51,362 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-30 01:16:51,430 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-30 01:16:51,431 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-30 01:16:51,438 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-30 01:16:51,441 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-30 01:16:51,451 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-30 01:16:51,454 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-30 01:16:51,463 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-30 01:16:51,464 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-30 01:16:51,466 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-30 01:16:51,467 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-30 01:16:51,470 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-30 01:16:51,473 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-30 01:16:51,476 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-30 01:16:51,479 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-30 01:16:51,484 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-30 01:16:51,487 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-30 01:16:51,492 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-30 01:16:51,499 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-30 01:16:51,501 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-30 01:16:51,504 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-30 01:16:51,505 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-30 01:16:51,512 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-30 01:16:51,513 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-30 01:16:51,513 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-30 01:16:51,516 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-30 01:16:51,517 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-30 01:16:51,518 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-30 01:16:51,519 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-30 01:16:51,520 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-30 01:16:51,523 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-30 01:16:51,525 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-30 01:16:51,526 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-30 01:16:51,527 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-30 01:16:51,528 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-30 01:16:51,528 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-30 01:16:51,529 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-30 01:16:51,530 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-30 01:16:51,531 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-30 01:16:51,534 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_bc02df54-026e-498d-97f5-0fa385b6c297/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-11-30 01:16:51,584 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-30 01:16:51,584 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-30 01:16:51,587 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-30 01:16:51,587 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-30 01:16:51,587 INFO L138 SettingsManager]: * Use SBE=true [2020-11-30 01:16:51,588 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-30 01:16:51,588 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-30 01:16:51,589 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-30 01:16:51,589 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-30 01:16:51,589 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-30 01:16:51,591 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-30 01:16:51,591 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-30 01:16:51,592 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-30 01:16:51,592 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-30 01:16:51,592 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-30 01:16:51,592 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-30 01:16:51,593 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-30 01:16:51,593 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-30 01:16:51,593 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-30 01:16:51,594 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-30 01:16:51,594 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-30 01:16:51,594 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-30 01:16:51,595 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-30 01:16:51,595 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-30 01:16:51,595 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-30 01:16:51,596 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-30 01:16:51,596 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-30 01:16:51,596 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-30 01:16:51,597 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-30 01:16:51,597 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_bc02df54-026e-498d-97f5-0fa385b6c297/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_bc02df54-026e-498d-97f5-0fa385b6c297/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 -> 782042467f0cb3a7476d3c48a134dfd084f9a32e [2020-11-30 01:16:51,911 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-30 01:16:51,954 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-30 01:16:51,959 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-30 01:16:51,961 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-30 01:16:51,962 INFO L275 PluginConnector]: CDTParser initialized [2020-11-30 01:16:51,964 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_bc02df54-026e-498d-97f5-0fa385b6c297/bin/uautomizer/../../sv-benchmarks/c/openssl/s3_clnt.blast.01.i.cil-2.c [2020-11-30 01:16:52,074 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_bc02df54-026e-498d-97f5-0fa385b6c297/bin/uautomizer/data/c1a1bcce1/fffb0dc809e443aa950dfe45b044892a/FLAGbaf587b51 [2020-11-30 01:16:52,803 INFO L306 CDTParser]: Found 1 translation units. [2020-11-30 01:16:52,804 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_bc02df54-026e-498d-97f5-0fa385b6c297/sv-benchmarks/c/openssl/s3_clnt.blast.01.i.cil-2.c [2020-11-30 01:16:52,845 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_bc02df54-026e-498d-97f5-0fa385b6c297/bin/uautomizer/data/c1a1bcce1/fffb0dc809e443aa950dfe45b044892a/FLAGbaf587b51 [2020-11-30 01:16:52,977 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_bc02df54-026e-498d-97f5-0fa385b6c297/bin/uautomizer/data/c1a1bcce1/fffb0dc809e443aa950dfe45b044892a [2020-11-30 01:16:52,980 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-30 01:16:52,981 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-11-30 01:16:52,984 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-30 01:16:52,985 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-30 01:16:52,989 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-30 01:16:52,990 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 01:16:52" (1/1) ... [2020-11-30 01:16:52,993 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3797a854 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:16:52, skipping insertion in model container [2020-11-30 01:16:52,994 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 01:16:52" (1/1) ... [2020-11-30 01:16:53,003 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-30 01:16:53,096 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-30 01:16:53,617 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-30 01:16:53,640 INFO L203 MainTranslator]: Completed pre-run [2020-11-30 01:16:53,809 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-30 01:16:53,833 INFO L208 MainTranslator]: Completed translation [2020-11-30 01:16:53,834 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:16:53 WrapperNode [2020-11-30 01:16:53,834 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-30 01:16:53,835 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-30 01:16:53,835 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-30 01:16:53,836 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-30 01:16:53,844 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:16:53" (1/1) ... [2020-11-30 01:16:53,867 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:16:53" (1/1) ... [2020-11-30 01:16:53,947 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-30 01:16:53,948 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-30 01:16:53,948 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-30 01:16:53,948 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-30 01:16:53,959 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:16:53" (1/1) ... [2020-11-30 01:16:53,959 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:16:53" (1/1) ... [2020-11-30 01:16:53,969 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:16:53" (1/1) ... [2020-11-30 01:16:53,970 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:16:53" (1/1) ... [2020-11-30 01:16:54,023 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:16:53" (1/1) ... [2020-11-30 01:16:54,032 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:16:53" (1/1) ... [2020-11-30 01:16:54,044 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:16:53" (1/1) ... [2020-11-30 01:16:54,051 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-30 01:16:54,052 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-30 01:16:54,052 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-30 01:16:54,052 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-30 01:16:54,064 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:16:53" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_bc02df54-026e-498d-97f5-0fa385b6c297/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-30 01:16:54,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-11-30 01:16:54,157 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-30 01:16:54,157 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-30 01:16:54,158 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-11-30 01:16:54,158 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-11-30 01:16:54,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-30 01:16:54,159 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-11-30 01:16:54,159 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-30 01:16:54,159 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-30 01:16:54,534 WARN L798 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2020-11-30 01:16:55,861 INFO L751 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2020-11-30 01:16:55,861 INFO L751 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2020-11-30 01:16:55,879 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-30 01:16:55,879 INFO L298 CfgBuilder]: Removed 9 assume(true) statements. [2020-11-30 01:16:55,883 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 01:16:55 BoogieIcfgContainer [2020-11-30 01:16:55,883 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-30 01:16:55,885 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-30 01:16:55,885 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-30 01:16:55,889 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-30 01:16:55,889 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.11 01:16:52" (1/3) ... [2020-11-30 01:16:55,890 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8ab53e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 01:16:55, skipping insertion in model container [2020-11-30 01:16:55,891 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:16:53" (2/3) ... [2020-11-30 01:16:55,893 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8ab53e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 01:16:55, skipping insertion in model container [2020-11-30 01:16:55,893 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 01:16:55" (3/3) ... [2020-11-30 01:16:55,895 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_clnt.blast.01.i.cil-2.c [2020-11-30 01:16:55,915 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-30 01:16:55,921 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-11-30 01:16:55,938 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-11-30 01:16:56,005 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-30 01:16:56,005 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-30 01:16:56,006 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-30 01:16:56,006 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-30 01:16:56,006 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-30 01:16:56,006 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-30 01:16:56,006 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-30 01:16:56,007 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-30 01:16:56,027 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states. [2020-11-30 01:16:56,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-11-30 01:16:56,035 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:16:56,036 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] [2020-11-30 01:16:56,036 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:16:56,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:16:56,043 INFO L82 PathProgramCache]: Analyzing trace with hash -1457703967, now seen corresponding path program 1 times [2020-11-30 01:16:56,054 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:16:56,055 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618675765] [2020-11-30 01:16:56,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:16:56,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:16:56,520 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-30 01:16:56,520 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618675765] [2020-11-30 01:16:56,521 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:16:56,522 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-30 01:16:56,523 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899770830] [2020-11-30 01:16:56,528 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 01:16:56,528 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:16:56,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 01:16:56,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-30 01:16:56,546 INFO L87 Difference]: Start difference. First operand 132 states. Second operand 4 states. [2020-11-30 01:16:57,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:16:57,201 INFO L93 Difference]: Finished difference Result 260 states and 433 transitions. [2020-11-30 01:16:57,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-30 01:16:57,204 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2020-11-30 01:16:57,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:16:57,228 INFO L225 Difference]: With dead ends: 260 [2020-11-30 01:16:57,229 INFO L226 Difference]: Without dead ends: 118 [2020-11-30 01:16:57,237 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-30 01:16:57,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2020-11-30 01:16:57,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 117. [2020-11-30 01:16:57,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2020-11-30 01:16:57,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 174 transitions. [2020-11-30 01:16:57,314 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 174 transitions. Word has length 24 [2020-11-30 01:16:57,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:16:57,315 INFO L481 AbstractCegarLoop]: Abstraction has 117 states and 174 transitions. [2020-11-30 01:16:57,315 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 01:16:57,315 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 174 transitions. [2020-11-30 01:16:57,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-11-30 01:16:57,320 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:16:57,321 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] [2020-11-30 01:16:57,321 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-30 01:16:57,321 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:16:57,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:16:57,324 INFO L82 PathProgramCache]: Analyzing trace with hash 1411658380, now seen corresponding path program 1 times [2020-11-30 01:16:57,324 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:16:57,325 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529461934] [2020-11-30 01:16:57,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:16:57,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:16:57,556 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-11-30 01:16:57,557 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529461934] [2020-11-30 01:16:57,557 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:16:57,557 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 01:16:57,557 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850122327] [2020-11-30 01:16:57,559 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 01:16:57,559 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:16:57,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 01:16:57,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 01:16:57,560 INFO L87 Difference]: Start difference. First operand 117 states and 174 transitions. Second operand 3 states. [2020-11-30 01:16:57,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:16:57,644 INFO L93 Difference]: Finished difference Result 327 states and 490 transitions. [2020-11-30 01:16:57,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 01:16:57,649 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2020-11-30 01:16:57,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:16:57,653 INFO L225 Difference]: With dead ends: 327 [2020-11-30 01:16:57,653 INFO L226 Difference]: Without dead ends: 220 [2020-11-30 01:16:57,655 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-30 01:16:57,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2020-11-30 01:16:57,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 220. [2020-11-30 01:16:57,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2020-11-30 01:16:57,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 324 transitions. [2020-11-30 01:16:57,701 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 324 transitions. Word has length 39 [2020-11-30 01:16:57,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:16:57,702 INFO L481 AbstractCegarLoop]: Abstraction has 220 states and 324 transitions. [2020-11-30 01:16:57,702 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 01:16:57,703 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 324 transitions. [2020-11-30 01:16:57,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2020-11-30 01:16:57,712 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:16:57,713 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-11-30 01:16:57,713 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-30 01:16:57,713 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:16:57,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:16:57,714 INFO L82 PathProgramCache]: Analyzing trace with hash -1352249408, now seen corresponding path program 1 times [2020-11-30 01:16:57,714 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:16:57,714 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046803827] [2020-11-30 01:16:57,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:16:57,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:16:57,881 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-11-30 01:16:57,881 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046803827] [2020-11-30 01:16:57,881 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:16:57,882 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 01:16:57,882 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915540922] [2020-11-30 01:16:57,883 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 01:16:57,883 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:16:57,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 01:16:57,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 01:16:57,884 INFO L87 Difference]: Start difference. First operand 220 states and 324 transitions. Second operand 3 states. [2020-11-30 01:16:58,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:16:58,026 INFO L93 Difference]: Finished difference Result 429 states and 639 transitions. [2020-11-30 01:16:58,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 01:16:58,027 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2020-11-30 01:16:58,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:16:58,031 INFO L225 Difference]: With dead ends: 429 [2020-11-30 01:16:58,031 INFO L226 Difference]: Without dead ends: 322 [2020-11-30 01:16:58,032 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-30 01:16:58,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2020-11-30 01:16:58,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 322. [2020-11-30 01:16:58,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 322 states. [2020-11-30 01:16:58,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 473 transitions. [2020-11-30 01:16:58,057 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 473 transitions. Word has length 54 [2020-11-30 01:16:58,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:16:58,058 INFO L481 AbstractCegarLoop]: Abstraction has 322 states and 473 transitions. [2020-11-30 01:16:58,058 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 01:16:58,058 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 473 transitions. [2020-11-30 01:16:58,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2020-11-30 01:16:58,062 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:16:58,062 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 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] [2020-11-30 01:16:58,062 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-30 01:16:58,063 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:16:58,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:16:58,063 INFO L82 PathProgramCache]: Analyzing trace with hash 210697016, now seen corresponding path program 1 times [2020-11-30 01:16:58,064 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:16:58,064 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990031039] [2020-11-30 01:16:58,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:16:58,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:16:58,294 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2020-11-30 01:16:58,294 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990031039] [2020-11-30 01:16:58,294 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:16:58,294 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-30 01:16:58,295 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153456304] [2020-11-30 01:16:58,295 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 01:16:58,296 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:16:58,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 01:16:58,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-30 01:16:58,298 INFO L87 Difference]: Start difference. First operand 322 states and 473 transitions. Second operand 4 states. [2020-11-30 01:16:59,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:16:59,249 INFO L93 Difference]: Finished difference Result 822 states and 1213 transitions. [2020-11-30 01:16:59,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-30 01:16:59,250 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 72 [2020-11-30 01:16:59,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:16:59,257 INFO L225 Difference]: With dead ends: 822 [2020-11-30 01:16:59,257 INFO L226 Difference]: Without dead ends: 510 [2020-11-30 01:16:59,260 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-30 01:16:59,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2020-11-30 01:16:59,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 372. [2020-11-30 01:16:59,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2020-11-30 01:16:59,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 559 transitions. [2020-11-30 01:16:59,312 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 559 transitions. Word has length 72 [2020-11-30 01:16:59,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:16:59,312 INFO L481 AbstractCegarLoop]: Abstraction has 372 states and 559 transitions. [2020-11-30 01:16:59,313 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 01:16:59,313 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 559 transitions. [2020-11-30 01:16:59,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2020-11-30 01:16:59,320 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:16:59,320 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 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] [2020-11-30 01:16:59,321 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-30 01:16:59,321 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:16:59,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:16:59,325 INFO L82 PathProgramCache]: Analyzing trace with hash 76683510, now seen corresponding path program 1 times [2020-11-30 01:16:59,326 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:16:59,326 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520325962] [2020-11-30 01:16:59,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:16:59,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:16:59,485 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2020-11-30 01:16:59,486 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520325962] [2020-11-30 01:16:59,486 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:16:59,486 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-30 01:16:59,487 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751260616] [2020-11-30 01:16:59,489 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 01:16:59,489 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:16:59,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 01:16:59,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-30 01:16:59,490 INFO L87 Difference]: Start difference. First operand 372 states and 559 transitions. Second operand 4 states. [2020-11-30 01:17:00,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:17:00,117 INFO L93 Difference]: Finished difference Result 818 states and 1229 transitions. [2020-11-30 01:17:00,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-30 01:17:00,125 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 72 [2020-11-30 01:17:00,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:17:00,129 INFO L225 Difference]: With dead ends: 818 [2020-11-30 01:17:00,129 INFO L226 Difference]: Without dead ends: 456 [2020-11-30 01:17:00,131 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-30 01:17:00,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2020-11-30 01:17:00,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 412. [2020-11-30 01:17:00,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 412 states. [2020-11-30 01:17:00,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 627 transitions. [2020-11-30 01:17:00,153 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 627 transitions. Word has length 72 [2020-11-30 01:17:00,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:17:00,153 INFO L481 AbstractCegarLoop]: Abstraction has 412 states and 627 transitions. [2020-11-30 01:17:00,153 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 01:17:00,154 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 627 transitions. [2020-11-30 01:17:00,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2020-11-30 01:17:00,155 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:17:00,156 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 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-30 01:17:00,156 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-30 01:17:00,156 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:17:00,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:17:00,157 INFO L82 PathProgramCache]: Analyzing trace with hash -2062745025, now seen corresponding path program 1 times [2020-11-30 01:17:00,157 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:17:00,158 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545266201] [2020-11-30 01:17:00,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:17:00,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:17:00,353 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2020-11-30 01:17:00,353 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545266201] [2020-11-30 01:17:00,354 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:17:00,354 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-30 01:17:00,354 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971297632] [2020-11-30 01:17:00,355 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 01:17:00,355 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:17:00,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 01:17:00,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-30 01:17:00,356 INFO L87 Difference]: Start difference. First operand 412 states and 627 transitions. Second operand 4 states. [2020-11-30 01:17:01,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:17:01,167 INFO L93 Difference]: Finished difference Result 946 states and 1426 transitions. [2020-11-30 01:17:01,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-30 01:17:01,170 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 73 [2020-11-30 01:17:01,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:17:01,176 INFO L225 Difference]: With dead ends: 946 [2020-11-30 01:17:01,179 INFO L226 Difference]: Without dead ends: 544 [2020-11-30 01:17:01,181 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-30 01:17:01,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2020-11-30 01:17:01,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 414. [2020-11-30 01:17:01,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 414 states. [2020-11-30 01:17:01,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 629 transitions. [2020-11-30 01:17:01,198 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 629 transitions. Word has length 73 [2020-11-30 01:17:01,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:17:01,199 INFO L481 AbstractCegarLoop]: Abstraction has 414 states and 629 transitions. [2020-11-30 01:17:01,199 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 01:17:01,199 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 629 transitions. [2020-11-30 01:17:01,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2020-11-30 01:17:01,201 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:17:01,201 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 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] [2020-11-30 01:17:01,201 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-30 01:17:01,201 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:17:01,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:17:01,202 INFO L82 PathProgramCache]: Analyzing trace with hash 475156595, now seen corresponding path program 1 times [2020-11-30 01:17:01,202 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:17:01,202 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174898203] [2020-11-30 01:17:01,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:17:01,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:17:01,327 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2020-11-30 01:17:01,328 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174898203] [2020-11-30 01:17:01,328 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:17:01,328 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-30 01:17:01,328 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421930733] [2020-11-30 01:17:01,329 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 01:17:01,329 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:17:01,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 01:17:01,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-30 01:17:01,330 INFO L87 Difference]: Start difference. First operand 414 states and 629 transitions. Second operand 4 states. [2020-11-30 01:17:02,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:17:02,159 INFO L93 Difference]: Finished difference Result 948 states and 1426 transitions. [2020-11-30 01:17:02,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-30 01:17:02,160 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 74 [2020-11-30 01:17:02,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:17:02,165 INFO L225 Difference]: With dead ends: 948 [2020-11-30 01:17:02,166 INFO L226 Difference]: Without dead ends: 544 [2020-11-30 01:17:02,167 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-30 01:17:02,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2020-11-30 01:17:02,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 416. [2020-11-30 01:17:02,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 416 states. [2020-11-30 01:17:02,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 631 transitions. [2020-11-30 01:17:02,188 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 631 transitions. Word has length 74 [2020-11-30 01:17:02,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:17:02,188 INFO L481 AbstractCegarLoop]: Abstraction has 416 states and 631 transitions. [2020-11-30 01:17:02,189 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 01:17:02,189 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 631 transitions. [2020-11-30 01:17:02,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2020-11-30 01:17:02,190 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:17:02,191 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 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] [2020-11-30 01:17:02,191 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-30 01:17:02,191 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:17:02,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:17:02,191 INFO L82 PathProgramCache]: Analyzing trace with hash 1840475418, now seen corresponding path program 1 times [2020-11-30 01:17:02,192 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:17:02,192 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156948515] [2020-11-30 01:17:02,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:17:02,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:17:02,354 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2020-11-30 01:17:02,355 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156948515] [2020-11-30 01:17:02,355 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:17:02,355 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-30 01:17:02,355 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936295106] [2020-11-30 01:17:02,356 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 01:17:02,356 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:17:02,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 01:17:02,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-30 01:17:02,357 INFO L87 Difference]: Start difference. First operand 416 states and 631 transitions. Second operand 4 states. [2020-11-30 01:17:03,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:17:03,196 INFO L93 Difference]: Finished difference Result 940 states and 1414 transitions. [2020-11-30 01:17:03,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-30 01:17:03,197 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2020-11-30 01:17:03,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:17:03,201 INFO L225 Difference]: With dead ends: 940 [2020-11-30 01:17:03,201 INFO L226 Difference]: Without dead ends: 534 [2020-11-30 01:17:03,202 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-30 01:17:03,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2020-11-30 01:17:03,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 418. [2020-11-30 01:17:03,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418 states. [2020-11-30 01:17:03,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 633 transitions. [2020-11-30 01:17:03,220 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 633 transitions. Word has length 75 [2020-11-30 01:17:03,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:17:03,220 INFO L481 AbstractCegarLoop]: Abstraction has 418 states and 633 transitions. [2020-11-30 01:17:03,220 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 01:17:03,220 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 633 transitions. [2020-11-30 01:17:03,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2020-11-30 01:17:03,222 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:17:03,223 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 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] [2020-11-30 01:17:03,223 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-30 01:17:03,223 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:17:03,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:17:03,224 INFO L82 PathProgramCache]: Analyzing trace with hash -1935805867, now seen corresponding path program 2 times [2020-11-30 01:17:03,224 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:17:03,224 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038379078] [2020-11-30 01:17:03,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:17:03,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:17:03,350 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2020-11-30 01:17:03,351 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038379078] [2020-11-30 01:17:03,351 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:17:03,351 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-30 01:17:03,352 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613382194] [2020-11-30 01:17:03,352 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 01:17:03,352 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:17:03,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 01:17:03,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-30 01:17:03,355 INFO L87 Difference]: Start difference. First operand 418 states and 633 transitions. Second operand 4 states. [2020-11-30 01:17:04,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:17:04,142 INFO L93 Difference]: Finished difference Result 940 states and 1412 transitions. [2020-11-30 01:17:04,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-30 01:17:04,150 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2020-11-30 01:17:04,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:17:04,154 INFO L225 Difference]: With dead ends: 940 [2020-11-30 01:17:04,154 INFO L226 Difference]: Without dead ends: 532 [2020-11-30 01:17:04,155 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-30 01:17:04,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2020-11-30 01:17:04,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 418. [2020-11-30 01:17:04,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418 states. [2020-11-30 01:17:04,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 631 transitions. [2020-11-30 01:17:04,170 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 631 transitions. Word has length 87 [2020-11-30 01:17:04,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:17:04,170 INFO L481 AbstractCegarLoop]: Abstraction has 418 states and 631 transitions. [2020-11-30 01:17:04,170 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 01:17:04,171 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 631 transitions. [2020-11-30 01:17:04,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2020-11-30 01:17:04,172 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:17:04,172 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 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] [2020-11-30 01:17:04,173 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-30 01:17:04,173 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:17:04,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:17:04,173 INFO L82 PathProgramCache]: Analyzing trace with hash -1954461325, now seen corresponding path program 1 times [2020-11-30 01:17:04,174 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:17:04,174 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867294798] [2020-11-30 01:17:04,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:17:04,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:17:04,257 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2020-11-30 01:17:04,257 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867294798] [2020-11-30 01:17:04,257 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:17:04,257 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-30 01:17:04,257 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154717867] [2020-11-30 01:17:04,258 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 01:17:04,258 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:17:04,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 01:17:04,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-30 01:17:04,259 INFO L87 Difference]: Start difference. First operand 418 states and 631 transitions. Second operand 4 states. [2020-11-30 01:17:04,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:17:04,973 INFO L93 Difference]: Finished difference Result 940 states and 1408 transitions. [2020-11-30 01:17:04,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-30 01:17:04,974 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2020-11-30 01:17:04,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:17:04,978 INFO L225 Difference]: With dead ends: 940 [2020-11-30 01:17:04,978 INFO L226 Difference]: Without dead ends: 532 [2020-11-30 01:17:04,980 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-30 01:17:04,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2020-11-30 01:17:04,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 418. [2020-11-30 01:17:04,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418 states. [2020-11-30 01:17:04,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 629 transitions. [2020-11-30 01:17:04,997 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 629 transitions. Word has length 87 [2020-11-30 01:17:04,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:17:04,998 INFO L481 AbstractCegarLoop]: Abstraction has 418 states and 629 transitions. [2020-11-30 01:17:04,998 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 01:17:04,998 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 629 transitions. [2020-11-30 01:17:05,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2020-11-30 01:17:05,000 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:17:05,000 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 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-30 01:17:05,000 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-30 01:17:05,001 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:17:05,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:17:05,001 INFO L82 PathProgramCache]: Analyzing trace with hash 1635005334, now seen corresponding path program 1 times [2020-11-30 01:17:05,002 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:17:05,002 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289954981] [2020-11-30 01:17:05,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:17:05,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:17:05,109 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2020-11-30 01:17:05,110 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289954981] [2020-11-30 01:17:05,110 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:17:05,110 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-30 01:17:05,110 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570245995] [2020-11-30 01:17:05,111 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 01:17:05,111 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:17:05,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 01:17:05,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-30 01:17:05,112 INFO L87 Difference]: Start difference. First operand 418 states and 629 transitions. Second operand 4 states. [2020-11-30 01:17:05,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:17:05,745 INFO L93 Difference]: Finished difference Result 791 states and 1178 transitions. [2020-11-30 01:17:05,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-30 01:17:05,750 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2020-11-30 01:17:05,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:17:05,754 INFO L225 Difference]: With dead ends: 791 [2020-11-30 01:17:05,755 INFO L226 Difference]: Without dead ends: 532 [2020-11-30 01:17:05,756 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-30 01:17:05,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2020-11-30 01:17:05,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 418. [2020-11-30 01:17:05,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418 states. [2020-11-30 01:17:05,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 627 transitions. [2020-11-30 01:17:05,773 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 627 transitions. Word has length 87 [2020-11-30 01:17:05,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:17:05,774 INFO L481 AbstractCegarLoop]: Abstraction has 418 states and 627 transitions. [2020-11-30 01:17:05,774 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 01:17:05,774 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 627 transitions. [2020-11-30 01:17:05,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2020-11-30 01:17:05,776 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:17:05,777 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 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] [2020-11-30 01:17:05,777 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-30 01:17:05,777 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:17:05,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:17:05,778 INFO L82 PathProgramCache]: Analyzing trace with hash 513794263, now seen corresponding path program 2 times [2020-11-30 01:17:05,782 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:17:05,783 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727365224] [2020-11-30 01:17:05,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:17:05,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:17:05,900 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2020-11-30 01:17:05,901 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727365224] [2020-11-30 01:17:05,901 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:17:05,901 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-30 01:17:05,902 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484916016] [2020-11-30 01:17:05,902 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 01:17:05,902 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:17:05,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 01:17:05,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-30 01:17:05,903 INFO L87 Difference]: Start difference. First operand 418 states and 627 transitions. Second operand 4 states. [2020-11-30 01:17:06,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:17:06,568 INFO L93 Difference]: Finished difference Result 868 states and 1293 transitions. [2020-11-30 01:17:06,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-30 01:17:06,569 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2020-11-30 01:17:06,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:17:06,572 INFO L225 Difference]: With dead ends: 868 [2020-11-30 01:17:06,572 INFO L226 Difference]: Without dead ends: 460 [2020-11-30 01:17:06,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-30 01:17:06,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2020-11-30 01:17:06,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 418. [2020-11-30 01:17:06,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418 states. [2020-11-30 01:17:06,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 625 transitions. [2020-11-30 01:17:06,589 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 625 transitions. Word has length 87 [2020-11-30 01:17:06,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:17:06,590 INFO L481 AbstractCegarLoop]: Abstraction has 418 states and 625 transitions. [2020-11-30 01:17:06,590 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 01:17:06,590 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 625 transitions. [2020-11-30 01:17:06,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2020-11-30 01:17:06,592 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:17:06,592 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 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] [2020-11-30 01:17:06,593 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-11-30 01:17:06,593 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:17:06,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:17:06,593 INFO L82 PathProgramCache]: Analyzing trace with hash 495138805, now seen corresponding path program 1 times [2020-11-30 01:17:06,594 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:17:06,594 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290647175] [2020-11-30 01:17:06,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:17:06,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:17:06,707 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2020-11-30 01:17:06,707 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290647175] [2020-11-30 01:17:06,707 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:17:06,707 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-30 01:17:06,708 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686061213] [2020-11-30 01:17:06,708 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 01:17:06,708 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:17:06,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 01:17:06,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-30 01:17:06,710 INFO L87 Difference]: Start difference. First operand 418 states and 625 transitions. Second operand 4 states. [2020-11-30 01:17:07,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:17:07,344 INFO L93 Difference]: Finished difference Result 868 states and 1289 transitions. [2020-11-30 01:17:07,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-30 01:17:07,345 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2020-11-30 01:17:07,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:17:07,349 INFO L225 Difference]: With dead ends: 868 [2020-11-30 01:17:07,349 INFO L226 Difference]: Without dead ends: 460 [2020-11-30 01:17:07,351 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-30 01:17:07,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2020-11-30 01:17:07,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 418. [2020-11-30 01:17:07,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418 states. [2020-11-30 01:17:07,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 623 transitions. [2020-11-30 01:17:07,367 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 623 transitions. Word has length 87 [2020-11-30 01:17:07,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:17:07,367 INFO L481 AbstractCegarLoop]: Abstraction has 418 states and 623 transitions. [2020-11-30 01:17:07,367 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 01:17:07,367 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 623 transitions. [2020-11-30 01:17:07,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2020-11-30 01:17:07,369 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:17:07,370 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 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-30 01:17:07,370 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-11-30 01:17:07,370 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:17:07,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:17:07,371 INFO L82 PathProgramCache]: Analyzing trace with hash -210361832, now seen corresponding path program 1 times [2020-11-30 01:17:07,371 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:17:07,371 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369994925] [2020-11-30 01:17:07,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:17:07,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:17:07,476 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2020-11-30 01:17:07,477 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369994925] [2020-11-30 01:17:07,477 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:17:07,477 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-30 01:17:07,477 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120895482] [2020-11-30 01:17:07,478 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 01:17:07,478 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:17:07,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 01:17:07,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-30 01:17:07,480 INFO L87 Difference]: Start difference. First operand 418 states and 623 transitions. Second operand 4 states. [2020-11-30 01:17:08,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:17:08,019 INFO L93 Difference]: Finished difference Result 719 states and 1062 transitions. [2020-11-30 01:17:08,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-30 01:17:08,020 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2020-11-30 01:17:08,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:17:08,022 INFO L225 Difference]: With dead ends: 719 [2020-11-30 01:17:08,023 INFO L226 Difference]: Without dead ends: 460 [2020-11-30 01:17:08,024 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-30 01:17:08,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2020-11-30 01:17:08,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 418. [2020-11-30 01:17:08,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418 states. [2020-11-30 01:17:08,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 621 transitions. [2020-11-30 01:17:08,038 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 621 transitions. Word has length 87 [2020-11-30 01:17:08,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:17:08,039 INFO L481 AbstractCegarLoop]: Abstraction has 418 states and 621 transitions. [2020-11-30 01:17:08,039 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 01:17:08,039 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 621 transitions. [2020-11-30 01:17:08,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2020-11-30 01:17:08,041 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:17:08,041 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 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] [2020-11-30 01:17:08,042 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-11-30 01:17:08,042 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:17:08,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:17:08,042 INFO L82 PathProgramCache]: Analyzing trace with hash 1668397004, now seen corresponding path program 1 times [2020-11-30 01:17:08,043 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:17:08,043 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211006328] [2020-11-30 01:17:08,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:17:08,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:17:08,131 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2020-11-30 01:17:08,132 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211006328] [2020-11-30 01:17:08,132 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:17:08,132 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-30 01:17:08,132 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429658769] [2020-11-30 01:17:08,133 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 01:17:08,133 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:17:08,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 01:17:08,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-30 01:17:08,134 INFO L87 Difference]: Start difference. First operand 418 states and 621 transitions. Second operand 4 states. [2020-11-30 01:17:08,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:17:08,983 INFO L93 Difference]: Finished difference Result 940 states and 1388 transitions. [2020-11-30 01:17:08,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-30 01:17:08,985 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2020-11-30 01:17:08,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:17:08,988 INFO L225 Difference]: With dead ends: 940 [2020-11-30 01:17:08,988 INFO L226 Difference]: Without dead ends: 532 [2020-11-30 01:17:08,989 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-30 01:17:08,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2020-11-30 01:17:09,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 418. [2020-11-30 01:17:09,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418 states. [2020-11-30 01:17:09,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 619 transitions. [2020-11-30 01:17:09,005 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 619 transitions. Word has length 88 [2020-11-30 01:17:09,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:17:09,005 INFO L481 AbstractCegarLoop]: Abstraction has 418 states and 619 transitions. [2020-11-30 01:17:09,005 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 01:17:09,005 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 619 transitions. [2020-11-30 01:17:09,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2020-11-30 01:17:09,007 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:17:09,008 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2020-11-30 01:17:09,008 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-11-30 01:17:09,008 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:17:09,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:17:09,009 INFO L82 PathProgramCache]: Analyzing trace with hash -570561745, now seen corresponding path program 1 times [2020-11-30 01:17:09,009 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:17:09,009 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298340899] [2020-11-30 01:17:09,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:17:09,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:17:09,103 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2020-11-30 01:17:09,104 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298340899] [2020-11-30 01:17:09,104 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:17:09,104 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-30 01:17:09,104 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625756135] [2020-11-30 01:17:09,105 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 01:17:09,105 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:17:09,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 01:17:09,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-30 01:17:09,106 INFO L87 Difference]: Start difference. First operand 418 states and 619 transitions. Second operand 4 states. [2020-11-30 01:17:09,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:17:09,829 INFO L93 Difference]: Finished difference Result 785 states and 1156 transitions. [2020-11-30 01:17:09,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-30 01:17:09,829 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2020-11-30 01:17:09,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:17:09,833 INFO L225 Difference]: With dead ends: 785 [2020-11-30 01:17:09,833 INFO L226 Difference]: Without dead ends: 526 [2020-11-30 01:17:09,834 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-30 01:17:09,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2020-11-30 01:17:09,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 418. [2020-11-30 01:17:09,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418 states. [2020-11-30 01:17:09,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 617 transitions. [2020-11-30 01:17:09,851 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 617 transitions. Word has length 88 [2020-11-30 01:17:09,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:17:09,851 INFO L481 AbstractCegarLoop]: Abstraction has 418 states and 617 transitions. [2020-11-30 01:17:09,852 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 01:17:09,852 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 617 transitions. [2020-11-30 01:17:09,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2020-11-30 01:17:09,854 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:17:09,854 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 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] [2020-11-30 01:17:09,854 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-11-30 01:17:09,854 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:17:09,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:17:09,855 INFO L82 PathProgramCache]: Analyzing trace with hash 296589706, now seen corresponding path program 1 times [2020-11-30 01:17:09,855 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:17:09,856 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713151825] [2020-11-30 01:17:09,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:17:09,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:17:09,938 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2020-11-30 01:17:09,938 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713151825] [2020-11-30 01:17:09,938 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:17:09,939 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-30 01:17:09,939 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863554502] [2020-11-30 01:17:09,939 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 01:17:09,940 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:17:09,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 01:17:09,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-30 01:17:09,941 INFO L87 Difference]: Start difference. First operand 418 states and 617 transitions. Second operand 4 states. [2020-11-30 01:17:10,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:17:10,627 INFO L93 Difference]: Finished difference Result 868 states and 1273 transitions. [2020-11-30 01:17:10,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-30 01:17:10,628 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2020-11-30 01:17:10,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:17:10,631 INFO L225 Difference]: With dead ends: 868 [2020-11-30 01:17:10,631 INFO L226 Difference]: Without dead ends: 460 [2020-11-30 01:17:10,632 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-30 01:17:10,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2020-11-30 01:17:10,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 418. [2020-11-30 01:17:10,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418 states. [2020-11-30 01:17:10,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 615 transitions. [2020-11-30 01:17:10,647 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 615 transitions. Word has length 88 [2020-11-30 01:17:10,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:17:10,648 INFO L481 AbstractCegarLoop]: Abstraction has 418 states and 615 transitions. [2020-11-30 01:17:10,648 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 01:17:10,648 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 615 transitions. [2020-11-30 01:17:10,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2020-11-30 01:17:10,650 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:17:10,650 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2020-11-30 01:17:10,651 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-11-30 01:17:10,651 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:17:10,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:17:10,652 INFO L82 PathProgramCache]: Analyzing trace with hash -1942369043, now seen corresponding path program 1 times [2020-11-30 01:17:10,652 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:17:10,652 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139816430] [2020-11-30 01:17:10,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:17:10,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:17:10,734 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2020-11-30 01:17:10,734 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139816430] [2020-11-30 01:17:10,734 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:17:10,735 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-30 01:17:10,735 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307101717] [2020-11-30 01:17:10,737 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 01:17:10,737 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:17:10,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 01:17:10,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-30 01:17:10,738 INFO L87 Difference]: Start difference. First operand 418 states and 615 transitions. Second operand 4 states. [2020-11-30 01:17:11,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:17:11,397 INFO L93 Difference]: Finished difference Result 713 states and 1043 transitions. [2020-11-30 01:17:11,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-30 01:17:11,398 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2020-11-30 01:17:11,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:17:11,401 INFO L225 Difference]: With dead ends: 713 [2020-11-30 01:17:11,401 INFO L226 Difference]: Without dead ends: 454 [2020-11-30 01:17:11,403 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-30 01:17:11,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2020-11-30 01:17:11,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 418. [2020-11-30 01:17:11,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418 states. [2020-11-30 01:17:11,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 613 transitions. [2020-11-30 01:17:11,419 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 613 transitions. Word has length 88 [2020-11-30 01:17:11,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:17:11,419 INFO L481 AbstractCegarLoop]: Abstraction has 418 states and 613 transitions. [2020-11-30 01:17:11,419 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 01:17:11,420 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 613 transitions. [2020-11-30 01:17:11,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2020-11-30 01:17:11,422 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:17:11,422 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:17:11,422 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-11-30 01:17:11,422 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:17:11,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:17:11,423 INFO L82 PathProgramCache]: Analyzing trace with hash -233112104, now seen corresponding path program 1 times [2020-11-30 01:17:11,423 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:17:11,424 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233723167] [2020-11-30 01:17:11,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:17:11,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:17:11,525 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2020-11-30 01:17:11,525 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233723167] [2020-11-30 01:17:11,525 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:17:11,526 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-30 01:17:11,526 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002922639] [2020-11-30 01:17:11,526 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 01:17:11,527 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:17:11,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 01:17:11,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-30 01:17:11,528 INFO L87 Difference]: Start difference. First operand 418 states and 613 transitions. Second operand 4 states. [2020-11-30 01:17:12,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:17:12,192 INFO L93 Difference]: Finished difference Result 934 states and 1365 transitions. [2020-11-30 01:17:12,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-30 01:17:12,193 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 89 [2020-11-30 01:17:12,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:17:12,196 INFO L225 Difference]: With dead ends: 934 [2020-11-30 01:17:12,196 INFO L226 Difference]: Without dead ends: 526 [2020-11-30 01:17:12,197 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-30 01:17:12,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2020-11-30 01:17:12,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 418. [2020-11-30 01:17:12,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418 states. [2020-11-30 01:17:12,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 611 transitions. [2020-11-30 01:17:12,210 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 611 transitions. Word has length 89 [2020-11-30 01:17:12,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:17:12,210 INFO L481 AbstractCegarLoop]: Abstraction has 418 states and 611 transitions. [2020-11-30 01:17:12,211 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 01:17:12,211 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 611 transitions. [2020-11-30 01:17:12,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2020-11-30 01:17:12,212 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:17:12,213 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:17:12,213 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-11-30 01:17:12,213 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:17:12,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:17:12,213 INFO L82 PathProgramCache]: Analyzing trace with hash 190534618, now seen corresponding path program 1 times [2020-11-30 01:17:12,214 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:17:12,214 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181011637] [2020-11-30 01:17:12,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:17:12,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:17:12,291 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2020-11-30 01:17:12,291 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181011637] [2020-11-30 01:17:12,291 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:17:12,292 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-30 01:17:12,292 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060975420] [2020-11-30 01:17:12,292 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 01:17:12,292 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:17:12,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 01:17:12,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-30 01:17:12,293 INFO L87 Difference]: Start difference. First operand 418 states and 611 transitions. Second operand 4 states. [2020-11-30 01:17:12,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:17:12,707 INFO L93 Difference]: Finished difference Result 862 states and 1254 transitions. [2020-11-30 01:17:12,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-30 01:17:12,708 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 89 [2020-11-30 01:17:12,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:17:12,712 INFO L225 Difference]: With dead ends: 862 [2020-11-30 01:17:12,712 INFO L226 Difference]: Without dead ends: 454 [2020-11-30 01:17:12,713 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-30 01:17:12,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2020-11-30 01:17:12,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 418. [2020-11-30 01:17:12,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418 states. [2020-11-30 01:17:12,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 609 transitions. [2020-11-30 01:17:12,731 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 609 transitions. Word has length 89 [2020-11-30 01:17:12,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:17:12,731 INFO L481 AbstractCegarLoop]: Abstraction has 418 states and 609 transitions. [2020-11-30 01:17:12,732 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 01:17:12,732 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 609 transitions. [2020-11-30 01:17:12,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2020-11-30 01:17:12,734 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:17:12,734 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 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] [2020-11-30 01:17:12,735 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-11-30 01:17:12,735 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:17:12,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:17:12,736 INFO L82 PathProgramCache]: Analyzing trace with hash -1591319919, now seen corresponding path program 1 times [2020-11-30 01:17:12,736 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:17:12,736 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615377538] [2020-11-30 01:17:12,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:17:12,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:17:12,834 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2020-11-30 01:17:12,834 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615377538] [2020-11-30 01:17:12,834 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:17:12,835 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-30 01:17:12,835 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427820552] [2020-11-30 01:17:12,835 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 01:17:12,836 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:17:12,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 01:17:12,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-30 01:17:12,837 INFO L87 Difference]: Start difference. First operand 418 states and 609 transitions. Second operand 4 states. [2020-11-30 01:17:13,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:17:13,470 INFO L93 Difference]: Finished difference Result 916 states and 1335 transitions. [2020-11-30 01:17:13,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-30 01:17:13,471 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 90 [2020-11-30 01:17:13,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:17:13,474 INFO L225 Difference]: With dead ends: 916 [2020-11-30 01:17:13,475 INFO L226 Difference]: Without dead ends: 508 [2020-11-30 01:17:13,476 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-30 01:17:13,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2020-11-30 01:17:13,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 418. [2020-11-30 01:17:13,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418 states. [2020-11-30 01:17:13,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 607 transitions. [2020-11-30 01:17:13,490 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 607 transitions. Word has length 90 [2020-11-30 01:17:13,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:17:13,490 INFO L481 AbstractCegarLoop]: Abstraction has 418 states and 607 transitions. [2020-11-30 01:17:13,491 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 01:17:13,491 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 607 transitions. [2020-11-30 01:17:13,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2020-11-30 01:17:13,492 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:17:13,493 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 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] [2020-11-30 01:17:13,493 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-11-30 01:17:13,493 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:17:13,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:17:13,494 INFO L82 PathProgramCache]: Analyzing trace with hash 1012220386, now seen corresponding path program 1 times [2020-11-30 01:17:13,494 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:17:13,494 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314164805] [2020-11-30 01:17:13,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:17:13,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:17:13,579 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2020-11-30 01:17:13,580 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314164805] [2020-11-30 01:17:13,580 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:17:13,580 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-30 01:17:13,580 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313520783] [2020-11-30 01:17:13,581 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 01:17:13,581 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:17:13,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 01:17:13,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-30 01:17:13,582 INFO L87 Difference]: Start difference. First operand 418 states and 607 transitions. Second operand 4 states. [2020-11-30 01:17:14,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:17:14,273 INFO L93 Difference]: Finished difference Result 916 states and 1331 transitions. [2020-11-30 01:17:14,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-30 01:17:14,275 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 90 [2020-11-30 01:17:14,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:17:14,278 INFO L225 Difference]: With dead ends: 916 [2020-11-30 01:17:14,278 INFO L226 Difference]: Without dead ends: 508 [2020-11-30 01:17:14,279 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-30 01:17:14,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2020-11-30 01:17:14,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 418. [2020-11-30 01:17:14,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418 states. [2020-11-30 01:17:14,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 605 transitions. [2020-11-30 01:17:14,296 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 605 transitions. Word has length 90 [2020-11-30 01:17:14,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:17:14,296 INFO L481 AbstractCegarLoop]: Abstraction has 418 states and 605 transitions. [2020-11-30 01:17:14,296 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 01:17:14,297 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 605 transitions. [2020-11-30 01:17:14,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2020-11-30 01:17:14,298 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:17:14,298 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 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] [2020-11-30 01:17:14,299 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-11-30 01:17:14,299 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:17:14,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:17:14,299 INFO L82 PathProgramCache]: Analyzing trace with hash -1343173425, now seen corresponding path program 1 times [2020-11-30 01:17:14,300 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:17:14,300 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771196405] [2020-11-30 01:17:14,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:17:14,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:17:14,393 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2020-11-30 01:17:14,394 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771196405] [2020-11-30 01:17:14,394 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:17:14,394 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-30 01:17:14,394 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134300309] [2020-11-30 01:17:14,395 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 01:17:14,395 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:17:14,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 01:17:14,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-30 01:17:14,396 INFO L87 Difference]: Start difference. First operand 418 states and 605 transitions. Second operand 4 states. [2020-11-30 01:17:14,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:17:14,904 INFO L93 Difference]: Finished difference Result 844 states and 1220 transitions. [2020-11-30 01:17:14,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-30 01:17:14,905 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 90 [2020-11-30 01:17:14,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:17:14,908 INFO L225 Difference]: With dead ends: 844 [2020-11-30 01:17:14,908 INFO L226 Difference]: Without dead ends: 436 [2020-11-30 01:17:14,909 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-30 01:17:14,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2020-11-30 01:17:14,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 418. [2020-11-30 01:17:14,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418 states. [2020-11-30 01:17:14,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 603 transitions. [2020-11-30 01:17:14,924 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 603 transitions. Word has length 90 [2020-11-30 01:17:14,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:17:14,924 INFO L481 AbstractCegarLoop]: Abstraction has 418 states and 603 transitions. [2020-11-30 01:17:14,924 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 01:17:14,925 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 603 transitions. [2020-11-30 01:17:14,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2020-11-30 01:17:14,926 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:17:14,927 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 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] [2020-11-30 01:17:14,927 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-11-30 01:17:14,927 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:17:14,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:17:14,928 INFO L82 PathProgramCache]: Analyzing trace with hash 1260366880, now seen corresponding path program 1 times [2020-11-30 01:17:14,928 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:17:14,928 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817103868] [2020-11-30 01:17:14,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:17:14,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:17:15,004 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2020-11-30 01:17:15,004 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817103868] [2020-11-30 01:17:15,004 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:17:15,005 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 01:17:15,005 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959027346] [2020-11-30 01:17:15,005 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 01:17:15,005 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:17:15,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 01:17:15,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 01:17:15,009 INFO L87 Difference]: Start difference. First operand 418 states and 603 transitions. Second operand 3 states. [2020-11-30 01:17:15,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:17:15,138 INFO L93 Difference]: Finished difference Result 827 states and 1200 transitions. [2020-11-30 01:17:15,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 01:17:15,139 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 90 [2020-11-30 01:17:15,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:17:15,142 INFO L225 Difference]: With dead ends: 827 [2020-11-30 01:17:15,142 INFO L226 Difference]: Without dead ends: 570 [2020-11-30 01:17:15,145 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-30 01:17:15,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2020-11-30 01:17:15,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 570. [2020-11-30 01:17:15,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 570 states. [2020-11-30 01:17:15,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 820 transitions. [2020-11-30 01:17:15,162 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 820 transitions. Word has length 90 [2020-11-30 01:17:15,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:17:15,163 INFO L481 AbstractCegarLoop]: Abstraction has 570 states and 820 transitions. [2020-11-30 01:17:15,163 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 01:17:15,163 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 820 transitions. [2020-11-30 01:17:15,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2020-11-30 01:17:15,165 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:17:15,165 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 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] [2020-11-30 01:17:15,165 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-11-30 01:17:15,166 INFO L429 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:17:15,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:17:15,166 INFO L82 PathProgramCache]: Analyzing trace with hash -584407498, now seen corresponding path program 1 times [2020-11-30 01:17:15,166 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:17:15,167 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193174890] [2020-11-30 01:17:15,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:17:15,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:17:15,263 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2020-11-30 01:17:15,263 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193174890] [2020-11-30 01:17:15,263 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:17:15,264 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 01:17:15,264 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940537291] [2020-11-30 01:17:15,264 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 01:17:15,264 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:17:15,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 01:17:15,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 01:17:15,265 INFO L87 Difference]: Start difference. First operand 570 states and 820 transitions. Second operand 3 states. [2020-11-30 01:17:15,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:17:15,323 INFO L93 Difference]: Finished difference Result 725 states and 1045 transitions. [2020-11-30 01:17:15,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 01:17:15,323 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 92 [2020-11-30 01:17:15,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:17:15,328 INFO L225 Difference]: With dead ends: 725 [2020-11-30 01:17:15,328 INFO L226 Difference]: Without dead ends: 723 [2020-11-30 01:17:15,329 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-30 01:17:15,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 723 states. [2020-11-30 01:17:15,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 723 to 723. [2020-11-30 01:17:15,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 723 states. [2020-11-30 01:17:15,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 723 states to 723 states and 1042 transitions. [2020-11-30 01:17:15,351 INFO L78 Accepts]: Start accepts. Automaton has 723 states and 1042 transitions. Word has length 92 [2020-11-30 01:17:15,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:17:15,352 INFO L481 AbstractCegarLoop]: Abstraction has 723 states and 1042 transitions. [2020-11-30 01:17:15,352 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 01:17:15,352 INFO L276 IsEmpty]: Start isEmpty. Operand 723 states and 1042 transitions. [2020-11-30 01:17:15,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2020-11-30 01:17:15,354 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:17:15,354 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 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] [2020-11-30 01:17:15,355 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-11-30 01:17:15,355 INFO L429 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:17:15,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:17:15,355 INFO L82 PathProgramCache]: Analyzing trace with hash -782701753, now seen corresponding path program 1 times [2020-11-30 01:17:15,356 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:17:15,356 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115877016] [2020-11-30 01:17:15,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:17:15,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:17:15,451 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2020-11-30 01:17:15,451 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115877016] [2020-11-30 01:17:15,452 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:17:15,452 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 01:17:15,452 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306143425] [2020-11-30 01:17:15,453 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 01:17:15,453 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:17:15,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 01:17:15,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 01:17:15,454 INFO L87 Difference]: Start difference. First operand 723 states and 1042 transitions. Second operand 3 states. [2020-11-30 01:17:15,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:17:15,493 INFO L93 Difference]: Finished difference Result 725 states and 1043 transitions. [2020-11-30 01:17:15,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 01:17:15,494 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 113 [2020-11-30 01:17:15,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:17:15,498 INFO L225 Difference]: With dead ends: 725 [2020-11-30 01:17:15,498 INFO L226 Difference]: Without dead ends: 723 [2020-11-30 01:17:15,499 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-30 01:17:15,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 723 states. [2020-11-30 01:17:15,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 723 to 723. [2020-11-30 01:17:15,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 723 states. [2020-11-30 01:17:15,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 723 states to 723 states and 1041 transitions. [2020-11-30 01:17:15,524 INFO L78 Accepts]: Start accepts. Automaton has 723 states and 1041 transitions. Word has length 113 [2020-11-30 01:17:15,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:17:15,525 INFO L481 AbstractCegarLoop]: Abstraction has 723 states and 1041 transitions. [2020-11-30 01:17:15,525 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 01:17:15,525 INFO L276 IsEmpty]: Start isEmpty. Operand 723 states and 1041 transitions. [2020-11-30 01:17:15,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2020-11-30 01:17:15,527 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:17:15,528 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 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] [2020-11-30 01:17:15,528 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2020-11-30 01:17:15,528 INFO L429 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:17:15,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:17:15,530 INFO L82 PathProgramCache]: Analyzing trace with hash -698320702, now seen corresponding path program 1 times [2020-11-30 01:17:15,530 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:17:15,530 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580292373] [2020-11-30 01:17:15,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:17:15,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:17:15,657 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2020-11-30 01:17:15,658 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580292373] [2020-11-30 01:17:15,658 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:17:15,658 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-30 01:17:15,658 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27771286] [2020-11-30 01:17:15,659 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 01:17:15,659 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:17:15,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 01:17:15,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-30 01:17:15,660 INFO L87 Difference]: Start difference. First operand 723 states and 1041 transitions. Second operand 4 states. [2020-11-30 01:17:16,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:17:16,307 INFO L93 Difference]: Finished difference Result 1692 states and 2446 transitions. [2020-11-30 01:17:16,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-30 01:17:16,307 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 115 [2020-11-30 01:17:16,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:17:16,312 INFO L225 Difference]: With dead ends: 1692 [2020-11-30 01:17:16,312 INFO L226 Difference]: Without dead ends: 979 [2020-11-30 01:17:16,314 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-30 01:17:16,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 979 states. [2020-11-30 01:17:16,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 979 to 843. [2020-11-30 01:17:16,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 843 states. [2020-11-30 01:17:16,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 843 states to 843 states and 1251 transitions. [2020-11-30 01:17:16,346 INFO L78 Accepts]: Start accepts. Automaton has 843 states and 1251 transitions. Word has length 115 [2020-11-30 01:17:16,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:17:16,346 INFO L481 AbstractCegarLoop]: Abstraction has 843 states and 1251 transitions. [2020-11-30 01:17:16,346 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 01:17:16,346 INFO L276 IsEmpty]: Start isEmpty. Operand 843 states and 1251 transitions. [2020-11-30 01:17:16,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2020-11-30 01:17:16,349 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:17:16,349 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:17:16,350 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2020-11-30 01:17:16,350 INFO L429 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:17:16,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:17:16,350 INFO L82 PathProgramCache]: Analyzing trace with hash 1667253281, now seen corresponding path program 2 times [2020-11-30 01:17:16,351 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:17:16,351 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56366030] [2020-11-30 01:17:16,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:17:16,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:17:16,446 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2020-11-30 01:17:16,447 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56366030] [2020-11-30 01:17:16,447 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:17:16,447 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-30 01:17:16,447 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442438049] [2020-11-30 01:17:16,448 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 01:17:16,448 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:17:16,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 01:17:16,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-30 01:17:16,449 INFO L87 Difference]: Start difference. First operand 843 states and 1251 transitions. Second operand 4 states. [2020-11-30 01:17:17,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:17:17,152 INFO L93 Difference]: Finished difference Result 1807 states and 2646 transitions. [2020-11-30 01:17:17,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-30 01:17:17,153 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 130 [2020-11-30 01:17:17,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:17:17,160 INFO L225 Difference]: With dead ends: 1807 [2020-11-30 01:17:17,160 INFO L226 Difference]: Without dead ends: 974 [2020-11-30 01:17:17,161 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-30 01:17:17,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 974 states. [2020-11-30 01:17:17,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 974 to 843. [2020-11-30 01:17:17,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 843 states. [2020-11-30 01:17:17,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 843 states to 843 states and 1246 transitions. [2020-11-30 01:17:17,191 INFO L78 Accepts]: Start accepts. Automaton has 843 states and 1246 transitions. Word has length 130 [2020-11-30 01:17:17,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:17:17,192 INFO L481 AbstractCegarLoop]: Abstraction has 843 states and 1246 transitions. [2020-11-30 01:17:17,192 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 01:17:17,192 INFO L276 IsEmpty]: Start isEmpty. Operand 843 states and 1246 transitions. [2020-11-30 01:17:17,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2020-11-30 01:17:17,195 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:17:17,195 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:17:17,195 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2020-11-30 01:17:17,196 INFO L429 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:17:17,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:17:17,196 INFO L82 PathProgramCache]: Analyzing trace with hash 919227327, now seen corresponding path program 1 times [2020-11-30 01:17:17,196 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:17:17,197 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585042980] [2020-11-30 01:17:17,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:17:17,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:17:17,318 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2020-11-30 01:17:17,319 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585042980] [2020-11-30 01:17:17,319 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:17:17,319 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-30 01:17:17,319 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560777736] [2020-11-30 01:17:17,320 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 01:17:17,320 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:17:17,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 01:17:17,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-30 01:17:17,321 INFO L87 Difference]: Start difference. First operand 843 states and 1246 transitions. Second operand 4 states. [2020-11-30 01:17:17,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:17:17,843 INFO L93 Difference]: Finished difference Result 1807 states and 2636 transitions. [2020-11-30 01:17:17,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-30 01:17:17,846 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 130 [2020-11-30 01:17:17,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:17:17,852 INFO L225 Difference]: With dead ends: 1807 [2020-11-30 01:17:17,852 INFO L226 Difference]: Without dead ends: 974 [2020-11-30 01:17:17,853 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-30 01:17:17,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 974 states. [2020-11-30 01:17:17,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 974 to 843. [2020-11-30 01:17:17,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 843 states. [2020-11-30 01:17:17,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 843 states to 843 states and 1241 transitions. [2020-11-30 01:17:17,882 INFO L78 Accepts]: Start accepts. Automaton has 843 states and 1241 transitions. Word has length 130 [2020-11-30 01:17:17,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:17:17,883 INFO L481 AbstractCegarLoop]: Abstraction has 843 states and 1241 transitions. [2020-11-30 01:17:17,883 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 01:17:17,883 INFO L276 IsEmpty]: Start isEmpty. Operand 843 states and 1241 transitions. [2020-11-30 01:17:17,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2020-11-30 01:17:17,886 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:17:17,886 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 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] [2020-11-30 01:17:17,886 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2020-11-30 01:17:17,886 INFO L429 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:17:17,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:17:17,887 INFO L82 PathProgramCache]: Analyzing trace with hash 1537947938, now seen corresponding path program 1 times [2020-11-30 01:17:17,887 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:17:17,887 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315699401] [2020-11-30 01:17:17,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:17:17,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:17:17,987 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2020-11-30 01:17:17,987 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315699401] [2020-11-30 01:17:17,988 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:17:17,988 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-30 01:17:17,988 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822952459] [2020-11-30 01:17:17,988 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 01:17:17,989 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:17:17,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 01:17:17,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-30 01:17:17,990 INFO L87 Difference]: Start difference. First operand 843 states and 1241 transitions. Second operand 4 states. [2020-11-30 01:17:18,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:17:18,562 INFO L93 Difference]: Finished difference Result 1639 states and 2418 transitions. [2020-11-30 01:17:18,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-30 01:17:18,563 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 130 [2020-11-30 01:17:18,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:17:18,568 INFO L225 Difference]: With dead ends: 1639 [2020-11-30 01:17:18,568 INFO L226 Difference]: Without dead ends: 981 [2020-11-30 01:17:18,569 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-30 01:17:18,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 981 states. [2020-11-30 01:17:18,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 981 to 915. [2020-11-30 01:17:18,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 915 states. [2020-11-30 01:17:18,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 915 states to 915 states and 1361 transitions. [2020-11-30 01:17:18,600 INFO L78 Accepts]: Start accepts. Automaton has 915 states and 1361 transitions. Word has length 130 [2020-11-30 01:17:18,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:17:18,600 INFO L481 AbstractCegarLoop]: Abstraction has 915 states and 1361 transitions. [2020-11-30 01:17:18,600 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 01:17:18,601 INFO L276 IsEmpty]: Start isEmpty. Operand 915 states and 1361 transitions. [2020-11-30 01:17:18,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2020-11-30 01:17:18,603 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:17:18,604 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:17:18,604 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2020-11-30 01:17:18,604 INFO L429 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:17:18,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:17:18,605 INFO L82 PathProgramCache]: Analyzing trace with hash -1834884522, now seen corresponding path program 1 times [2020-11-30 01:17:18,605 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:17:18,605 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797221921] [2020-11-30 01:17:18,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:17:18,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:17:18,708 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2020-11-30 01:17:18,708 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797221921] [2020-11-30 01:17:18,708 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:17:18,709 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-30 01:17:18,709 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147208547] [2020-11-30 01:17:18,709 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 01:17:18,709 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:17:18,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 01:17:18,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-30 01:17:18,710 INFO L87 Difference]: Start difference. First operand 915 states and 1361 transitions. Second operand 4 states. [2020-11-30 01:17:19,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:17:19,246 INFO L93 Difference]: Finished difference Result 1951 states and 2866 transitions. [2020-11-30 01:17:19,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-30 01:17:19,247 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 131 [2020-11-30 01:17:19,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:17:19,253 INFO L225 Difference]: With dead ends: 1951 [2020-11-30 01:17:19,254 INFO L226 Difference]: Without dead ends: 1046 [2020-11-30 01:17:19,255 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-30 01:17:19,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1046 states. [2020-11-30 01:17:19,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1046 to 915. [2020-11-30 01:17:19,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 915 states. [2020-11-30 01:17:19,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 915 states to 915 states and 1356 transitions. [2020-11-30 01:17:19,286 INFO L78 Accepts]: Start accepts. Automaton has 915 states and 1356 transitions. Word has length 131 [2020-11-30 01:17:19,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:17:19,287 INFO L481 AbstractCegarLoop]: Abstraction has 915 states and 1356 transitions. [2020-11-30 01:17:19,287 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 01:17:19,287 INFO L276 IsEmpty]: Start isEmpty. Operand 915 states and 1356 transitions. [2020-11-30 01:17:19,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2020-11-30 01:17:19,290 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:17:19,290 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:17:19,291 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2020-11-30 01:17:19,291 INFO L429 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:17:19,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:17:19,292 INFO L82 PathProgramCache]: Analyzing trace with hash 653511332, now seen corresponding path program 1 times [2020-11-30 01:17:19,292 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:17:19,292 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906028270] [2020-11-30 01:17:19,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:17:19,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:17:19,441 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2020-11-30 01:17:19,442 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906028270] [2020-11-30 01:17:19,442 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:17:19,442 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-30 01:17:19,442 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471116621] [2020-11-30 01:17:19,443 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 01:17:19,443 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:17:19,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 01:17:19,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-30 01:17:19,445 INFO L87 Difference]: Start difference. First operand 915 states and 1356 transitions. Second operand 4 states. [2020-11-30 01:17:19,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:17:19,995 INFO L93 Difference]: Finished difference Result 1951 states and 2856 transitions. [2020-11-30 01:17:19,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-30 01:17:19,997 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 132 [2020-11-30 01:17:19,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:17:20,003 INFO L225 Difference]: With dead ends: 1951 [2020-11-30 01:17:20,004 INFO L226 Difference]: Without dead ends: 1046 [2020-11-30 01:17:20,007 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-30 01:17:20,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1046 states. [2020-11-30 01:17:20,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1046 to 915. [2020-11-30 01:17:20,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 915 states. [2020-11-30 01:17:20,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 915 states to 915 states and 1351 transitions. [2020-11-30 01:17:20,038 INFO L78 Accepts]: Start accepts. Automaton has 915 states and 1351 transitions. Word has length 132 [2020-11-30 01:17:20,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:17:20,039 INFO L481 AbstractCegarLoop]: Abstraction has 915 states and 1351 transitions. [2020-11-30 01:17:20,039 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 01:17:20,039 INFO L276 IsEmpty]: Start isEmpty. Operand 915 states and 1351 transitions. [2020-11-30 01:17:20,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2020-11-30 01:17:20,042 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:17:20,043 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:17:20,043 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2020-11-30 01:17:20,043 INFO L429 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:17:20,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:17:20,044 INFO L82 PathProgramCache]: Analyzing trace with hash -1844078565, now seen corresponding path program 1 times [2020-11-30 01:17:20,044 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:17:20,045 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526437172] [2020-11-30 01:17:20,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:17:20,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:17:20,142 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2020-11-30 01:17:20,142 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526437172] [2020-11-30 01:17:20,142 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:17:20,143 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-30 01:17:20,143 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279578874] [2020-11-30 01:17:20,143 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 01:17:20,143 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:17:20,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 01:17:20,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-30 01:17:20,144 INFO L87 Difference]: Start difference. First operand 915 states and 1351 transitions. Second operand 4 states. [2020-11-30 01:17:20,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:17:20,601 INFO L93 Difference]: Finished difference Result 1906 states and 2791 transitions. [2020-11-30 01:17:20,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-30 01:17:20,603 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 133 [2020-11-30 01:17:20,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:17:20,609 INFO L225 Difference]: With dead ends: 1906 [2020-11-30 01:17:20,609 INFO L226 Difference]: Without dead ends: 1001 [2020-11-30 01:17:20,613 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-30 01:17:20,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1001 states. [2020-11-30 01:17:20,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1001 to 915. [2020-11-30 01:17:20,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 915 states. [2020-11-30 01:17:20,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 915 states to 915 states and 1346 transitions. [2020-11-30 01:17:20,644 INFO L78 Accepts]: Start accepts. Automaton has 915 states and 1346 transitions. Word has length 133 [2020-11-30 01:17:20,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:17:20,645 INFO L481 AbstractCegarLoop]: Abstraction has 915 states and 1346 transitions. [2020-11-30 01:17:20,645 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 01:17:20,645 INFO L276 IsEmpty]: Start isEmpty. Operand 915 states and 1346 transitions. [2020-11-30 01:17:20,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2020-11-30 01:17:20,648 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:17:20,649 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:17:20,649 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2020-11-30 01:17:20,649 INFO L429 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:17:20,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:17:20,650 INFO L82 PathProgramCache]: Analyzing trace with hash 487188268, now seen corresponding path program 1 times [2020-11-30 01:17:20,650 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:17:20,650 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305827573] [2020-11-30 01:17:20,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:17:20,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:17:20,758 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2020-11-30 01:17:20,758 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305827573] [2020-11-30 01:17:20,758 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:17:20,758 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-30 01:17:20,758 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389811356] [2020-11-30 01:17:20,759 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 01:17:20,759 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:17:20,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 01:17:20,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-30 01:17:20,760 INFO L87 Difference]: Start difference. First operand 915 states and 1346 transitions. Second operand 4 states. [2020-11-30 01:17:21,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:17:21,330 INFO L93 Difference]: Finished difference Result 2051 states and 3021 transitions. [2020-11-30 01:17:21,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-30 01:17:21,331 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 133 [2020-11-30 01:17:21,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:17:21,339 INFO L225 Difference]: With dead ends: 2051 [2020-11-30 01:17:21,339 INFO L226 Difference]: Without dead ends: 1146 [2020-11-30 01:17:21,340 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-30 01:17:21,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1146 states. [2020-11-30 01:17:21,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1146 to 1025. [2020-11-30 01:17:21,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1025 states. [2020-11-30 01:17:21,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1025 states to 1025 states and 1536 transitions. [2020-11-30 01:17:21,374 INFO L78 Accepts]: Start accepts. Automaton has 1025 states and 1536 transitions. Word has length 133 [2020-11-30 01:17:21,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:17:21,375 INFO L481 AbstractCegarLoop]: Abstraction has 1025 states and 1536 transitions. [2020-11-30 01:17:21,375 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 01:17:21,375 INFO L276 IsEmpty]: Start isEmpty. Operand 1025 states and 1536 transitions. [2020-11-30 01:17:21,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2020-11-30 01:17:21,378 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:17:21,379 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:17:21,379 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2020-11-30 01:17:21,379 INFO L429 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:17:21,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:17:21,380 INFO L82 PathProgramCache]: Analyzing trace with hash -272550210, now seen corresponding path program 1 times [2020-11-30 01:17:21,380 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:17:21,380 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915353396] [2020-11-30 01:17:21,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:17:21,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 01:17:21,621 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 01:17:21,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 01:17:21,865 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 01:17:22,000 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 01:17:22,000 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-11-30 01:17:22,001 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2020-11-30 01:17:22,232 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.11 01:17:22 BoogieIcfgContainer [2020-11-30 01:17:22,232 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-30 01:17:22,233 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-11-30 01:17:22,233 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-11-30 01:17:22,233 INFO L275 PluginConnector]: Witness Printer initialized [2020-11-30 01:17:22,234 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 01:16:55" (3/4) ... [2020-11-30 01:17:22,237 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-11-30 01:17:22,237 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-11-30 01:17:22,239 INFO L168 Benchmark]: Toolchain (without parser) took 29257.17 ms. Allocated memory was 88.1 MB in the beginning and 270.5 MB in the end (delta: 182.5 MB). Free memory was 53.9 MB in the beginning and 202.6 MB in the end (delta: -148.6 MB). Peak memory consumption was 33.5 MB. Max. memory is 16.1 GB. [2020-11-30 01:17:22,240 INFO L168 Benchmark]: CDTParser took 0.34 ms. Allocated memory is still 88.1 MB. Free memory was 44.8 MB in the beginning and 44.8 MB in the end (delta: 75.5 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-30 01:17:22,240 INFO L168 Benchmark]: CACSL2BoogieTranslator took 849.87 ms. Allocated memory was 88.1 MB in the beginning and 127.9 MB in the end (delta: 39.8 MB). Free memory was 53.9 MB in the beginning and 84.9 MB in the end (delta: -31.0 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2020-11-30 01:17:22,241 INFO L168 Benchmark]: Boogie Procedure Inliner took 112.39 ms. Allocated memory is still 127.9 MB. Free memory was 84.9 MB in the beginning and 80.1 MB in the end (delta: 4.8 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2020-11-30 01:17:22,241 INFO L168 Benchmark]: Boogie Preprocessor took 103.16 ms. Allocated memory is still 127.9 MB. Free memory was 80.1 MB in the beginning and 73.8 MB in the end (delta: 6.3 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. [2020-11-30 01:17:22,242 INFO L168 Benchmark]: RCFGBuilder took 1831.01 ms. Allocated memory is still 127.9 MB. Free memory was 73.8 MB in the beginning and 53.9 MB in the end (delta: 20.0 MB). Peak memory consumption was 43.7 MB. Max. memory is 16.1 GB. [2020-11-30 01:17:22,242 INFO L168 Benchmark]: TraceAbstraction took 26347.61 ms. Allocated memory was 127.9 MB in the beginning and 270.5 MB in the end (delta: 142.6 MB). Free memory was 53.9 MB in the beginning and 202.6 MB in the end (delta: -148.7 MB). Peak memory consumption was 120.1 MB. Max. memory is 16.1 GB. [2020-11-30 01:17:22,243 INFO L168 Benchmark]: Witness Printer took 4.67 ms. Allocated memory is still 270.5 MB. Free memory is still 202.6 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-11-30 01:17:22,246 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.34 ms. Allocated memory is still 88.1 MB. Free memory was 44.8 MB in the beginning and 44.8 MB in the end (delta: 75.5 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 849.87 ms. Allocated memory was 88.1 MB in the beginning and 127.9 MB in the end (delta: 39.8 MB). Free memory was 53.9 MB in the beginning and 84.9 MB in the end (delta: -31.0 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 112.39 ms. Allocated memory is still 127.9 MB. Free memory was 84.9 MB in the beginning and 80.1 MB in the end (delta: 4.8 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 103.16 ms. Allocated memory is still 127.9 MB. Free memory was 80.1 MB in the beginning and 73.8 MB in the end (delta: 6.3 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. * RCFGBuilder took 1831.01 ms. Allocated memory is still 127.9 MB. Free memory was 73.8 MB in the beginning and 53.9 MB in the end (delta: 20.0 MB). Peak memory consumption was 43.7 MB. Max. memory is 16.1 GB. * TraceAbstraction took 26347.61 ms. Allocated memory was 127.9 MB in the beginning and 270.5 MB in the end (delta: 142.6 MB). Free memory was 53.9 MB in the beginning and 202.6 MB in the end (delta: -148.7 MB). Peak memory consumption was 120.1 MB. Max. memory is 16.1 GB. * Witness Printer took 4.67 ms. Allocated memory is still 270.5 MB. Free memory is still 202.6 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 1331. Possible FailurePath: [L1044] static int init = 1; [L1045] static SSL_METHOD SSLv3_client_data ; VAL [init=1, SSLv3_client_data={5:0}] [L1067] SSL *s = (SSL*)malloc(sizeof(SSL)) ; [L1071] s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1072] s->ctx = malloc(sizeof(SSL_CTX)) [L1073] s->session = malloc(sizeof(SSL_SESSION)) [L1074] s->state = 12292 [L1075] s->version = __VERIFIER_nondet_int() [L1082] BUF_MEM *buf = (BUF_MEM *)__VERIFIER_nondet_ulong(); [L1083] unsigned long tmp ; [L1084] unsigned long l ; [L1085] long num1 ; [L1086] void (*cb)() ; [L1087] int ret ; [L1088] int new_state ; [L1089] int state ; [L1090] int skip ; [L1091] int tmp___1 = __VERIFIER_nondet_int() ; [L1092] int tmp___2 = __VERIFIER_nondet_int() ; [L1093] int tmp___3 ; [L1094] int tmp___4 ; [L1095] int tmp___5 ; [L1096] int tmp___6 ; [L1097] int tmp___7 ; [L1098] int tmp___8 ; [L1099] long tmp___9 ; [L1101] int blastFlag ; [L1104] blastFlag = 0 [L1105] s->hit=__VERIFIER_nondet_int () [L1106] s->state = 12292 [L1107] tmp = __VERIFIER_nondet_int() [L1108] cb = (void (*)())((void *)0) [L1109] ret = -1 [L1110] skip = 0 [L1111] EXPR s->info_callback VAL [init=1, SSLv3_client_data={5:0}] [L1111] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1112] EXPR s->info_callback [L1112] cb = s->info_callback [L1120] EXPR s->in_handshake [L1120] s->in_handshake += 1 [L1121] COND FALSE !(tmp___1 & 12288) VAL [init=1, SSLv3_client_data={5:0}] [L1131] COND TRUE 1 VAL [init=1, SSLv3_client_data={5:0}] [L1133] EXPR s->state [L1133] state = s->state [L1134] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1134] COND TRUE s->state == 12292 [L1237] s->new_session = 1 [L1238] s->state = 4096 [L1239] EXPR s->ctx [L1239] EXPR (s->ctx)->stats.sess_connect_renegotiate [L1239] (s->ctx)->stats.sess_connect_renegotiate += 1 [L1244] s->server = 0 VAL [init=1, SSLv3_client_data={5:0}] [L1245] COND TRUE (unsigned long )cb != (unsigned long )((void *)0) VAL [init=1, SSLv3_client_data={5:0}] [L1250] EXPR s->version VAL [init=1, SSLv3_client_data={5:0}] [L1250] COND FALSE !((s->version & 65280) != 768) [L1256] s->type = 4096 [L1257] EXPR s->init_buf VAL [init=1, SSLv3_client_data={5:0}] [L1257] COND FALSE !((unsigned long )s->init_buf == (unsigned long )((void *)0)) [L1269] tmp___4 = __VERIFIER_nondet_int() [L1270] COND FALSE !(! tmp___4) [L1276] tmp___5 = __VERIFIER_nondet_int() [L1277] COND FALSE !(! tmp___5) [L1283] s->state = 4368 [L1284] EXPR s->ctx [L1284] EXPR (s->ctx)->stats.sess_connect [L1284] (s->ctx)->stats.sess_connect += 1 [L1285] s->init_num = 0 VAL [init=1, SSLv3_client_data={5:0}] [L1605] EXPR s->s3 [L1605] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_client_data={5:0}] [L1605] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1634] skip = 0 VAL [init=1, SSLv3_client_data={5:0}] [L1131] COND TRUE 1 VAL [init=1, SSLv3_client_data={5:0}] [L1133] EXPR s->state [L1133] state = s->state [L1134] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1134] COND FALSE !(s->state == 12292) [L1137] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1137] COND FALSE !(s->state == 16384) [L1140] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1140] COND FALSE !(s->state == 4096) [L1143] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1143] COND FALSE !(s->state == 20480) [L1146] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1146] COND FALSE !(s->state == 4099) [L1149] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1149] COND TRUE s->state == 4368 [L1289] s->shutdown = 0 [L1290] ret = __VERIFIER_nondet_int() [L1291] COND TRUE blastFlag == 0 [L1292] blastFlag = 1 VAL [init=1, SSLv3_client_data={5:0}] [L1296] COND FALSE !(ret <= 0) [L1301] s->state = 4384 [L1302] s->init_num = 0 [L1303] EXPR s->bbio [L1303] EXPR s->wbio VAL [init=1, SSLv3_client_data={5:0}] [L1303] COND TRUE (unsigned long )s->bbio != (unsigned long )s->wbio [L1605] EXPR s->s3 [L1605] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_client_data={5:0}] [L1605] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1634] skip = 0 VAL [init=1, SSLv3_client_data={5:0}] [L1131] COND TRUE 1 VAL [init=1, SSLv3_client_data={5:0}] [L1133] EXPR s->state [L1133] state = s->state [L1134] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1134] COND FALSE !(s->state == 12292) [L1137] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1137] COND FALSE !(s->state == 16384) [L1140] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1140] COND FALSE !(s->state == 4096) [L1143] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1143] COND FALSE !(s->state == 20480) [L1146] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1146] COND FALSE !(s->state == 4099) [L1149] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1149] COND FALSE !(s->state == 4368) [L1152] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1152] COND FALSE !(s->state == 4369) [L1155] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1155] COND TRUE s->state == 4384 [L1311] ret = __VERIFIER_nondet_int() [L1312] COND TRUE blastFlag == 1 [L1313] blastFlag = 2 VAL [init=1, SSLv3_client_data={5:0}] [L1317] COND FALSE !(ret <= 0) [L1322] s->hit VAL [init=1, SSLv3_client_data={5:0}] [L1322] COND FALSE !(s->hit) [L1325] s->state = 4400 VAL [init=1, SSLv3_client_data={5:0}] [L1327] s->init_num = 0 VAL [init=1, SSLv3_client_data={5:0}] [L1605] EXPR s->s3 [L1605] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_client_data={5:0}] [L1605] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1634] skip = 0 VAL [init=1, SSLv3_client_data={5:0}] [L1131] COND TRUE 1 VAL [init=1, SSLv3_client_data={5:0}] [L1133] EXPR s->state [L1133] state = s->state [L1134] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1134] COND FALSE !(s->state == 12292) [L1137] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1137] COND FALSE !(s->state == 16384) [L1140] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1140] COND FALSE !(s->state == 4096) [L1143] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1143] COND FALSE !(s->state == 20480) [L1146] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1146] COND FALSE !(s->state == 4099) [L1149] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1149] COND FALSE !(s->state == 4368) [L1152] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1152] COND FALSE !(s->state == 4369) [L1155] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1155] COND FALSE !(s->state == 4384) [L1158] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1158] COND FALSE !(s->state == 4385) [L1161] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1161] COND TRUE s->state == 4400 [L1331] EXPR s->s3 [L1331] EXPR (s->s3)->tmp.new_cipher [L1331] EXPR ((s->s3)->tmp.new_cipher)->algorithms VAL [init=1, SSLv3_client_data={5:0}] [L1331] COND FALSE !(((s->s3)->tmp.new_cipher)->algorithms & 256UL) [L1334] ret = __VERIFIER_nondet_int() [L1335] COND TRUE blastFlag == 2 [L1336] blastFlag = 3 VAL [init=1, SSLv3_client_data={5:0}] [L1340] COND FALSE !(ret <= 0) VAL [init=1, SSLv3_client_data={5:0}] [L1346] s->state = 4416 [L1347] s->init_num = 0 VAL [init=1, SSLv3_client_data={5:0}] [L1605] EXPR s->s3 [L1605] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_client_data={5:0}] [L1605] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1634] skip = 0 VAL [init=1, SSLv3_client_data={5:0}] [L1131] COND TRUE 1 VAL [init=1, SSLv3_client_data={5:0}] [L1133] EXPR s->state [L1133] state = s->state [L1134] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1134] COND FALSE !(s->state == 12292) [L1137] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1137] COND FALSE !(s->state == 16384) [L1140] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1140] COND FALSE !(s->state == 4096) [L1143] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1143] COND FALSE !(s->state == 20480) [L1146] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1146] COND FALSE !(s->state == 4099) [L1149] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1149] COND FALSE !(s->state == 4368) [L1152] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1152] COND FALSE !(s->state == 4369) [L1155] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1155] COND FALSE !(s->state == 4384) [L1158] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1158] COND FALSE !(s->state == 4385) [L1161] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1161] COND FALSE !(s->state == 4400) [L1164] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1164] COND FALSE !(s->state == 4401) [L1167] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1167] COND TRUE s->state == 4416 [L1351] ret = __VERIFIER_nondet_int() [L1352] COND TRUE blastFlag == 3 [L1353] blastFlag = 4 VAL [init=1, SSLv3_client_data={5:0}] [L1357] COND FALSE !(ret <= 0) [L1362] s->state = 4432 [L1363] s->init_num = 0 [L1364] tmp___6 = __VERIFIER_nondet_int() [L1365] COND FALSE !(! tmp___6) VAL [init=1, SSLv3_client_data={5:0}] [L1605] EXPR s->s3 [L1605] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_client_data={5:0}] [L1605] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1634] skip = 0 VAL [init=1, SSLv3_client_data={5:0}] [L1131] COND TRUE 1 VAL [init=1, SSLv3_client_data={5:0}] [L1133] EXPR s->state [L1133] state = s->state [L1134] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1134] COND FALSE !(s->state == 12292) [L1137] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1137] COND FALSE !(s->state == 16384) [L1140] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1140] COND FALSE !(s->state == 4096) [L1143] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1143] COND FALSE !(s->state == 20480) [L1146] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1146] COND FALSE !(s->state == 4099) [L1149] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1149] COND FALSE !(s->state == 4368) [L1152] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1152] COND FALSE !(s->state == 4369) [L1155] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1155] COND FALSE !(s->state == 4384) [L1158] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1158] COND FALSE !(s->state == 4385) [L1161] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1161] COND FALSE !(s->state == 4400) [L1164] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1164] COND FALSE !(s->state == 4401) [L1167] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1167] COND FALSE !(s->state == 4416) [L1170] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1170] COND FALSE !(s->state == 4417) [L1173] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1173] COND TRUE s->state == 4432 [L1374] ret = __VERIFIER_nondet_int() [L1375] COND FALSE !(blastFlag == 5) VAL [init=1, SSLv3_client_data={5:0}] [L1380] COND FALSE !(ret <= 0) [L1385] s->state = 4448 [L1386] s->init_num = 0 VAL [init=1, SSLv3_client_data={5:0}] [L1605] EXPR s->s3 [L1605] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_client_data={5:0}] [L1605] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1634] skip = 0 VAL [init=1, SSLv3_client_data={5:0}] [L1131] COND TRUE 1 VAL [init=1, SSLv3_client_data={5:0}] [L1133] EXPR s->state [L1133] state = s->state [L1134] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1134] COND FALSE !(s->state == 12292) [L1137] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1137] COND FALSE !(s->state == 16384) [L1140] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1140] COND FALSE !(s->state == 4096) [L1143] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1143] COND FALSE !(s->state == 20480) [L1146] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1146] COND FALSE !(s->state == 4099) [L1149] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1149] COND FALSE !(s->state == 4368) [L1152] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1152] COND FALSE !(s->state == 4369) [L1155] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1155] COND FALSE !(s->state == 4384) [L1158] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1158] COND FALSE !(s->state == 4385) [L1161] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1161] COND FALSE !(s->state == 4400) [L1164] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1164] COND FALSE !(s->state == 4401) [L1167] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1167] COND FALSE !(s->state == 4416) [L1170] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1170] COND FALSE !(s->state == 4417) [L1173] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1173] COND FALSE !(s->state == 4432) [L1176] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1176] COND FALSE !(s->state == 4433) [L1179] EXPR s->state VAL [init=1, SSLv3_client_data={5:0}] [L1179] COND TRUE s->state == 4448 [L1390] ret = __VERIFIER_nondet_int() [L1391] COND TRUE blastFlag == 4 VAL [init=1, SSLv3_client_data={5:0}] [L3] __assert_fail("0", "s3_clnt.blast.01.i.cil-2.c", 3, "reach_error") VAL [init=1, SSLv3_client_data={5:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 132 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 25.9s, OverallIterations: 35, TraceHistogramMax: 7, AutomataDifference: 19.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 7362 SDtfs, 2436 SDslu, 9320 SDs, 0 SdLazy, 5220 SolverSat, 199 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 15.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 181 GetRequests, 68 SyntacticMatches, 21 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1025occurred in iteration=34, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 34 MinimizatonAttempts, 2600 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 3271 NumberOfCodeBlocks, 3271 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 3100 ConstructedInterpolants, 0 QuantifiedInterpolants, 675721 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 34 InterpolantComputations, 34 PerfectInterpolantSequences, 3328/3328 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-30 01:17:25,061 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-30 01:17:25,063 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-30 01:17:25,110 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-30 01:17:25,111 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-30 01:17:25,113 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-30 01:17:25,115 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-30 01:17:25,118 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-30 01:17:25,121 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-30 01:17:25,123 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-30 01:17:25,124 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-30 01:17:25,126 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-30 01:17:25,127 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-30 01:17:25,128 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-30 01:17:25,130 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-30 01:17:25,132 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-30 01:17:25,133 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-30 01:17:25,135 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-30 01:17:25,137 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-30 01:17:25,145 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-30 01:17:25,147 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-30 01:17:25,163 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-30 01:17:25,165 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-30 01:17:25,167 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-30 01:17:25,172 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-30 01:17:25,177 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-30 01:17:25,178 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-30 01:17:25,179 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-30 01:17:25,181 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-30 01:17:25,183 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-30 01:17:25,183 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-30 01:17:25,184 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-30 01:17:25,186 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-30 01:17:25,187 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-30 01:17:25,189 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-30 01:17:25,190 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-30 01:17:25,191 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-30 01:17:25,191 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-30 01:17:25,192 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-30 01:17:25,194 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-30 01:17:25,195 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-30 01:17:25,196 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_bc02df54-026e-498d-97f5-0fa385b6c297/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2020-11-30 01:17:25,245 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-30 01:17:25,245 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-30 01:17:25,249 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-30 01:17:25,249 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-30 01:17:25,250 INFO L138 SettingsManager]: * Use SBE=true [2020-11-30 01:17:25,250 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-30 01:17:25,250 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-30 01:17:25,251 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-30 01:17:25,251 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-30 01:17:25,251 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-30 01:17:25,252 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-30 01:17:25,253 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-30 01:17:25,253 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2020-11-30 01:17:25,253 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2020-11-30 01:17:25,254 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-30 01:17:25,254 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-30 01:17:25,254 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-30 01:17:25,254 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-30 01:17:25,255 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-30 01:17:25,255 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-30 01:17:25,255 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-30 01:17:25,256 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-30 01:17:25,256 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-30 01:17:25,256 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-30 01:17:25,257 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-30 01:17:25,257 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-30 01:17:25,257 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2020-11-30 01:17:25,257 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2020-11-30 01:17:25,258 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-30 01:17:25,258 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-30 01:17:25,258 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-11-30 01:17:25,258 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_bc02df54-026e-498d-97f5-0fa385b6c297/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_bc02df54-026e-498d-97f5-0fa385b6c297/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 -> 782042467f0cb3a7476d3c48a134dfd084f9a32e [2020-11-30 01:17:25,656 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-30 01:17:25,695 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-30 01:17:25,701 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-30 01:17:25,703 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-30 01:17:25,704 INFO L275 PluginConnector]: CDTParser initialized [2020-11-30 01:17:25,706 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_bc02df54-026e-498d-97f5-0fa385b6c297/bin/uautomizer/../../sv-benchmarks/c/openssl/s3_clnt.blast.01.i.cil-2.c [2020-11-30 01:17:25,806 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_bc02df54-026e-498d-97f5-0fa385b6c297/bin/uautomizer/data/5d19a3911/603c7b6083eb4df38540c8374eec5653/FLAGb8fba8ce2 [2020-11-30 01:17:26,722 INFO L306 CDTParser]: Found 1 translation units. [2020-11-30 01:17:26,723 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_bc02df54-026e-498d-97f5-0fa385b6c297/sv-benchmarks/c/openssl/s3_clnt.blast.01.i.cil-2.c [2020-11-30 01:17:26,768 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_bc02df54-026e-498d-97f5-0fa385b6c297/bin/uautomizer/data/5d19a3911/603c7b6083eb4df38540c8374eec5653/FLAGb8fba8ce2 [2020-11-30 01:17:26,922 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_bc02df54-026e-498d-97f5-0fa385b6c297/bin/uautomizer/data/5d19a3911/603c7b6083eb4df38540c8374eec5653 [2020-11-30 01:17:26,925 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-30 01:17:26,927 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-11-30 01:17:26,929 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-30 01:17:26,929 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-30 01:17:26,933 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-30 01:17:26,935 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 01:17:26" (1/1) ... [2020-11-30 01:17:26,937 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e0d000f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:17:26, skipping insertion in model container [2020-11-30 01:17:26,937 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 01:17:26" (1/1) ... [2020-11-30 01:17:26,947 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-30 01:17:27,075 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-30 01:17:27,524 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-30 01:17:27,547 INFO L203 MainTranslator]: Completed pre-run [2020-11-30 01:17:27,714 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-30 01:17:27,753 INFO L208 MainTranslator]: Completed translation [2020-11-30 01:17:27,756 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:17:27 WrapperNode [2020-11-30 01:17:27,756 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-30 01:17:27,757 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-30 01:17:27,758 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-30 01:17:27,760 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-30 01:17:27,769 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:17:27" (1/1) ... [2020-11-30 01:17:27,819 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:17:27" (1/1) ... [2020-11-30 01:17:27,888 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-30 01:17:27,900 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-30 01:17:27,901 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-30 01:17:27,901 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-30 01:17:27,910 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:17:27" (1/1) ... [2020-11-30 01:17:27,910 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:17:27" (1/1) ... [2020-11-30 01:17:27,954 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:17:27" (1/1) ... [2020-11-30 01:17:27,955 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:17:27" (1/1) ... [2020-11-30 01:17:28,025 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:17:27" (1/1) ... [2020-11-30 01:17:28,038 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:17:27" (1/1) ... [2020-11-30 01:17:28,057 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:17:27" (1/1) ... [2020-11-30 01:17:28,064 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-30 01:17:28,074 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-30 01:17:28,074 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-30 01:17:28,075 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-30 01:17:28,078 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:17:27" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_bc02df54-026e-498d-97f5-0fa385b6c297/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-30 01:17:28,172 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2020-11-30 01:17:28,173 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-11-30 01:17:28,173 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-30 01:17:28,174 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2020-11-30 01:17:28,174 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-11-30 01:17:28,174 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-11-30 01:17:28,174 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-30 01:17:28,175 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-30 01:17:28,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2020-11-30 01:17:28,671 WARN L798 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2020-11-30 01:17:33,261 INFO L751 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2020-11-30 01:17:33,261 INFO L751 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2020-11-30 01:17:33,280 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-30 01:17:33,281 INFO L298 CfgBuilder]: Removed 9 assume(true) statements. [2020-11-30 01:17:33,284 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 01:17:33 BoogieIcfgContainer [2020-11-30 01:17:33,284 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-30 01:17:33,287 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-30 01:17:33,288 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-30 01:17:33,291 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-30 01:17:33,292 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.11 01:17:26" (1/3) ... [2020-11-30 01:17:33,293 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e8d4da2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 01:17:33, skipping insertion in model container [2020-11-30 01:17:33,293 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:17:27" (2/3) ... [2020-11-30 01:17:33,293 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e8d4da2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 01:17:33, skipping insertion in model container [2020-11-30 01:17:33,293 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 01:17:33" (3/3) ... [2020-11-30 01:17:33,298 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_clnt.blast.01.i.cil-2.c [2020-11-30 01:17:33,319 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-30 01:17:33,324 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-11-30 01:17:33,339 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-11-30 01:17:33,372 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-30 01:17:33,373 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-30 01:17:33,373 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-30 01:17:33,373 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-30 01:17:33,373 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-30 01:17:33,374 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-30 01:17:33,375 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-30 01:17:33,375 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-30 01:17:33,394 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states. [2020-11-30 01:17:33,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-11-30 01:17:33,410 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:17:33,410 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] [2020-11-30 01:17:33,411 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:17:33,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:17:33,418 INFO L82 PathProgramCache]: Analyzing trace with hash -1457703967, now seen corresponding path program 1 times [2020-11-30 01:17:33,433 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-11-30 01:17:33,433 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1676548722] [2020-11-30 01:17:33,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_bc02df54-026e-498d-97f5-0fa385b6c297/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-30 01:17:33,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:17:33,665 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 2 conjunts are in the unsatisfiable core [2020-11-30 01:17:33,672 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 01:17:33,757 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-30 01:17:33,757 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 01:17:33,806 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-30 01:17:33,807 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1676548722] [2020-11-30 01:17:33,808 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:17:33,808 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2020-11-30 01:17:33,809 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879265663] [2020-11-30 01:17:33,819 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 01:17:33,819 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-11-30 01:17:33,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 01:17:33,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-11-30 01:17:33,841 INFO L87 Difference]: Start difference. First operand 132 states. Second operand 4 states. [2020-11-30 01:17:34,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:17:34,012 INFO L93 Difference]: Finished difference Result 376 states and 627 transitions. [2020-11-30 01:17:34,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-30 01:17:34,018 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2020-11-30 01:17:34,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:17:34,044 INFO L225 Difference]: With dead ends: 376 [2020-11-30 01:17:34,045 INFO L226 Difference]: Without dead ends: 217 [2020-11-30 01:17:34,051 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 44 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-30 01:17:34,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2020-11-30 01:17:34,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2020-11-30 01:17:34,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2020-11-30 01:17:34,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 320 transitions. [2020-11-30 01:17:34,130 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 320 transitions. Word has length 24 [2020-11-30 01:17:34,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:17:34,131 INFO L481 AbstractCegarLoop]: Abstraction has 217 states and 320 transitions. [2020-11-30 01:17:34,131 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 01:17:34,132 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 320 transitions. [2020-11-30 01:17:34,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-11-30 01:17:34,136 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:17:34,136 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] [2020-11-30 01:17:34,346 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2020-11-30 01:17:34,346 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:17:34,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:17:34,347 INFO L82 PathProgramCache]: Analyzing trace with hash 1495258694, now seen corresponding path program 1 times [2020-11-30 01:17:34,348 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-11-30 01:17:34,348 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1316024208] [2020-11-30 01:17:34,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_bc02df54-026e-498d-97f5-0fa385b6c297/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-30 01:17:34,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:17:34,593 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 2 conjunts are in the unsatisfiable core [2020-11-30 01:17:34,598 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 01:17:34,620 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-30 01:17:34,620 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 01:17:34,641 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-30 01:17:34,642 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1316024208] [2020-11-30 01:17:34,642 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:17:34,642 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2020-11-30 01:17:34,642 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478580624] [2020-11-30 01:17:34,644 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 01:17:34,645 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-11-30 01:17:34,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 01:17:34,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-11-30 01:17:34,646 INFO L87 Difference]: Start difference. First operand 217 states and 320 transitions. Second operand 4 states. [2020-11-30 01:17:36,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:17:36,049 INFO L93 Difference]: Finished difference Result 528 states and 787 transitions. [2020-11-30 01:17:36,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-30 01:17:36,051 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 41 [2020-11-30 01:17:36,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:17:36,056 INFO L225 Difference]: With dead ends: 528 [2020-11-30 01:17:36,057 INFO L226 Difference]: Without dead ends: 421 [2020-11-30 01:17:36,064 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 78 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-30 01:17:36,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2020-11-30 01:17:36,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 421. [2020-11-30 01:17:36,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2020-11-30 01:17:36,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 622 transitions. [2020-11-30 01:17:36,152 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 622 transitions. Word has length 41 [2020-11-30 01:17:36,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:17:36,154 INFO L481 AbstractCegarLoop]: Abstraction has 421 states and 622 transitions. [2020-11-30 01:17:36,155 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 01:17:36,155 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 622 transitions. [2020-11-30 01:17:36,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2020-11-30 01:17:36,164 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:17:36,165 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 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] [2020-11-30 01:17:36,383 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2020-11-30 01:17:36,383 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:17:36,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:17:36,384 INFO L82 PathProgramCache]: Analyzing trace with hash 924360661, now seen corresponding path program 1 times [2020-11-30 01:17:36,385 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-11-30 01:17:36,386 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1802492074] [2020-11-30 01:17:36,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_bc02df54-026e-498d-97f5-0fa385b6c297/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-30 01:17:36,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:17:36,659 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 2 conjunts are in the unsatisfiable core [2020-11-30 01:17:36,664 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 01:17:36,716 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-11-30 01:17:36,716 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 01:17:36,756 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-11-30 01:17:36,758 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1802492074] [2020-11-30 01:17:36,758 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:17:36,758 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2020-11-30 01:17:36,759 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721999051] [2020-11-30 01:17:36,761 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 01:17:36,761 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-11-30 01:17:36,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 01:17:36,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-11-30 01:17:36,764 INFO L87 Difference]: Start difference. First operand 421 states and 622 transitions. Second operand 4 states. [2020-11-30 01:17:39,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:17:39,075 INFO L93 Difference]: Finished difference Result 939 states and 1394 transitions. [2020-11-30 01:17:39,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-30 01:17:39,077 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2020-11-30 01:17:39,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:17:39,083 INFO L225 Difference]: With dead ends: 939 [2020-11-30 01:17:39,083 INFO L226 Difference]: Without dead ends: 628 [2020-11-30 01:17:39,089 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 156 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-30 01:17:39,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 628 states. [2020-11-30 01:17:39,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 628 to 628. [2020-11-30 01:17:39,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 628 states. [2020-11-30 01:17:39,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 628 states to 628 states and 927 transitions. [2020-11-30 01:17:39,148 INFO L78 Accepts]: Start accepts. Automaton has 628 states and 927 transitions. Word has length 80 [2020-11-30 01:17:39,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:17:39,151 INFO L481 AbstractCegarLoop]: Abstraction has 628 states and 927 transitions. [2020-11-30 01:17:39,151 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 01:17:39,151 INFO L276 IsEmpty]: Start isEmpty. Operand 628 states and 927 transitions. [2020-11-30 01:17:39,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2020-11-30 01:17:39,162 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:17:39,162 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:17:39,377 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2020-11-30 01:17:39,377 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:17:39,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:17:39,378 INFO L82 PathProgramCache]: Analyzing trace with hash -1855651051, now seen corresponding path program 1 times [2020-11-30 01:17:39,379 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-11-30 01:17:39,379 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1188919289] [2020-11-30 01:17:39,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_bc02df54-026e-498d-97f5-0fa385b6c297/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-30 01:17:39,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:17:39,833 INFO L263 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 4 conjunts are in the unsatisfiable core [2020-11-30 01:17:39,840 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 01:18:16,635 WARN L193 SmtUtils]: Spent 36.73 s on a formula simplification. DAG size of input: 54 DAG size of output: 41 [2020-11-30 01:18:16,636 INFO L350 Elim1Store]: treesize reduction 122, result has 48.5 percent of original size [2020-11-30 01:18:16,637 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 3 case distinctions, treesize of input 44 treesize of output 124 [2020-11-30 01:18:16,638 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:18:49,135 WARN L193 SmtUtils]: Spent 32.50 s on a formula simplification. DAG size of input: 43 DAG size of output: 40 [2020-11-30 01:18:49,142 INFO L625 ElimStorePlain]: treesize reduction 18, result has 85.5 percent of original size [2020-11-30 01:18:49,158 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-11-30 01:18:49,163 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 01:18:49,165 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-11-30 01:18:49,177 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 01:18:49,180 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 01:18:49,185 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-11-30 01:18:49,195 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 01:18:49,196 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-11-30 01:18:49,199 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-11-30 01:18:49,206 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-11-30 01:18:49,208 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 01:18:49,210 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-11-30 01:18:49,215 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 01:18:49,218 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 01:18:49,239 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-11-30 01:18:49,247 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 01:18:49,248 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-11-30 01:18:49,251 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-11-30 01:18:49,255 INFO L545 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-30 01:18:49,255 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:44, output treesize:83 [2020-11-30 01:18:49,257 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-11-30 01:18:49,260 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 01:18:49,262 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-11-30 01:18:49,265 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 01:18:49,272 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 01:18:49,275 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-11-30 01:18:49,290 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 01:18:49,291 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-11-30 01:18:49,300 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-11-30 01:18:49,396 INFO L350 Elim1Store]: treesize reduction 41, result has 18.0 percent of original size [2020-11-30 01:18:49,397 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 31 treesize of output 24 [2020-11-30 01:18:49,402 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:18:49,407 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:18:49,407 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 01:18:49,407 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:9 [2020-11-30 01:18:49,421 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 19 treesize of output 7 [2020-11-30 01:18:49,422 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:18:49,425 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:18:49,426 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-30 01:18:49,426 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2020-11-30 01:18:49,461 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2020-11-30 01:18:49,461 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 01:18:49,499 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2020-11-30 01:18:49,499 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1188919289] [2020-11-30 01:18:49,502 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:18:49,502 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2020-11-30 01:18:49,502 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637578900] [2020-11-30 01:18:49,503 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 01:18:49,504 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-11-30 01:18:49,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 01:18:49,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-30 01:18:49,506 INFO L87 Difference]: Start difference. First operand 628 states and 927 transitions. Second operand 4 states. [2020-11-30 01:18:51,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:18:51,460 INFO L93 Difference]: Finished difference Result 1253 states and 1848 transitions. [2020-11-30 01:18:51,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-30 01:18:51,463 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2020-11-30 01:18:51,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:18:51,467 INFO L225 Difference]: With dead ends: 1253 [2020-11-30 01:18:51,467 INFO L226 Difference]: Without dead ends: 632 [2020-11-30 01:18:51,469 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 194 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-30 01:18:51,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2020-11-30 01:18:51,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 631. [2020-11-30 01:18:51,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 631 states. [2020-11-30 01:18:51,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 631 states to 631 states and 930 transitions. [2020-11-30 01:18:51,504 INFO L78 Accepts]: Start accepts. Automaton has 631 states and 930 transitions. Word has length 100 [2020-11-30 01:18:51,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:18:51,504 INFO L481 AbstractCegarLoop]: Abstraction has 631 states and 930 transitions. [2020-11-30 01:18:51,505 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 01:18:51,505 INFO L276 IsEmpty]: Start isEmpty. Operand 631 states and 930 transitions. [2020-11-30 01:18:51,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2020-11-30 01:18:51,508 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:18:51,508 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 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] [2020-11-30 01:18:51,724 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2020-11-30 01:18:51,725 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:18:51,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:18:51,726 INFO L82 PathProgramCache]: Analyzing trace with hash 517833024, now seen corresponding path program 1 times [2020-11-30 01:18:51,728 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-11-30 01:18:51,728 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1496551612] [2020-11-30 01:18:51,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_bc02df54-026e-498d-97f5-0fa385b6c297/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-30 01:18:52,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:18:52,171 INFO L263 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 4 conjunts are in the unsatisfiable core [2020-11-30 01:18:52,188 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 01:18:52,209 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-30 01:18:52,209 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:18:52,213 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:18:52,213 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 01:18:52,213 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2020-11-30 01:18:52,241 INFO L350 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2020-11-30 01:18:52,241 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 23 treesize of output 22 [2020-11-30 01:18:52,242 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:18:52,257 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:18:52,257 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 01:18:52,257 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2020-11-30 01:18:52,319 INFO L350 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2020-11-30 01:18:52,320 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 28 treesize of output 10 [2020-11-30 01:18:52,321 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:18:52,323 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:18:52,323 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-30 01:18:52,324 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2020-11-30 01:18:52,362 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2020-11-30 01:18:52,362 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 01:18:52,433 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2020-11-30 01:18:52,434 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1496551612] [2020-11-30 01:18:52,434 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:18:52,434 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [] total 7 [2020-11-30 01:18:52,434 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527549475] [2020-11-30 01:18:52,435 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-30 01:18:52,435 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-11-30 01:18:52,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-30 01:18:52,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-11-30 01:18:52,436 INFO L87 Difference]: Start difference. First operand 631 states and 930 transitions. Second operand 7 states. [2020-11-30 01:19:01,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:19:01,249 INFO L93 Difference]: Finished difference Result 2267 states and 3362 transitions. [2020-11-30 01:19:01,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-30 01:19:01,251 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 115 [2020-11-30 01:19:01,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:19:01,264 INFO L225 Difference]: With dead ends: 2267 [2020-11-30 01:19:01,264 INFO L226 Difference]: Without dead ends: 1646 [2020-11-30 01:19:01,266 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 222 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-30 01:19:01,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1646 states. [2020-11-30 01:19:01,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1646 to 756. [2020-11-30 01:19:01,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 756 states. [2020-11-30 01:19:01,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 756 states to 756 states and 1139 transitions. [2020-11-30 01:19:01,314 INFO L78 Accepts]: Start accepts. Automaton has 756 states and 1139 transitions. Word has length 115 [2020-11-30 01:19:01,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:19:01,317 INFO L481 AbstractCegarLoop]: Abstraction has 756 states and 1139 transitions. [2020-11-30 01:19:01,317 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-30 01:19:01,317 INFO L276 IsEmpty]: Start isEmpty. Operand 756 states and 1139 transitions. [2020-11-30 01:19:01,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2020-11-30 01:19:01,325 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:19:01,326 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 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] [2020-11-30 01:19:01,543 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2020-11-30 01:19:01,543 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:19:01,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:19:01,544 INFO L82 PathProgramCache]: Analyzing trace with hash -698320702, now seen corresponding path program 1 times [2020-11-30 01:19:01,544 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-11-30 01:19:01,544 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1293569749] [2020-11-30 01:19:01,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_bc02df54-026e-498d-97f5-0fa385b6c297/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-30 01:19:02,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:19:02,034 INFO L263 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 3 conjunts are in the unsatisfiable core [2020-11-30 01:19:02,038 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 01:19:02,077 INFO L350 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2020-11-30 01:19:02,077 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-30 01:19:02,077 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:19:02,087 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:19:02,087 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 01:19:02,087 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:19 [2020-11-30 01:19:02,120 INFO L350 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2020-11-30 01:19:02,121 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 28 treesize of output 10 [2020-11-30 01:19:02,122 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:19:02,125 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:19:02,125 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-30 01:19:02,125 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2020-11-30 01:19:02,167 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2020-11-30 01:19:02,167 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 01:19:02,211 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2020-11-30 01:19:02,211 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1293569749] [2020-11-30 01:19:02,212 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:19:02,212 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 5 [2020-11-30 01:19:02,212 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099832881] [2020-11-30 01:19:02,213 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-30 01:19:02,213 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-11-30 01:19:02,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-30 01:19:02,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-30 01:19:02,214 INFO L87 Difference]: Start difference. First operand 756 states and 1139 transitions. Second operand 5 states. [2020-11-30 01:19:04,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:19:04,713 INFO L93 Difference]: Finished difference Result 1760 states and 2637 transitions. [2020-11-30 01:19:04,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-30 01:19:04,716 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 115 [2020-11-30 01:19:04,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:19:04,731 INFO L225 Difference]: With dead ends: 1760 [2020-11-30 01:19:04,731 INFO L226 Difference]: Without dead ends: 1014 [2020-11-30 01:19:04,733 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 225 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-30 01:19:04,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1014 states. [2020-11-30 01:19:04,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1014 to 876. [2020-11-30 01:19:04,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 876 states. [2020-11-30 01:19:04,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 876 states to 876 states and 1344 transitions. [2020-11-30 01:19:04,777 INFO L78 Accepts]: Start accepts. Automaton has 876 states and 1344 transitions. Word has length 115 [2020-11-30 01:19:04,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:19:04,778 INFO L481 AbstractCegarLoop]: Abstraction has 876 states and 1344 transitions. [2020-11-30 01:19:04,779 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-30 01:19:04,780 INFO L276 IsEmpty]: Start isEmpty. Operand 876 states and 1344 transitions. [2020-11-30 01:19:04,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2020-11-30 01:19:04,783 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:19:04,783 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:19:04,998 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2020-11-30 01:19:05,001 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:19:05,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:19:05,002 INFO L82 PathProgramCache]: Analyzing trace with hash 1667253281, now seen corresponding path program 2 times [2020-11-30 01:19:05,002 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-11-30 01:19:05,003 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [108845677] [2020-11-30 01:19:05,003 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_bc02df54-026e-498d-97f5-0fa385b6c297/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-30 01:19:05,516 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-11-30 01:19:05,516 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-30 01:19:05,545 INFO L263 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 3 conjunts are in the unsatisfiable core [2020-11-30 01:19:05,549 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 01:19:05,593 INFO L350 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2020-11-30 01:19:05,594 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-30 01:19:05,594 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:19:05,606 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:19:05,607 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 01:19:05,607 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:19 [2020-11-30 01:19:05,649 INFO L350 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2020-11-30 01:19:05,650 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 28 treesize of output 10 [2020-11-30 01:19:05,651 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:19:05,654 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:19:05,654 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-30 01:19:05,654 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2020-11-30 01:19:05,691 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2020-11-30 01:19:05,692 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 01:19:05,759 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2020-11-30 01:19:05,761 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [108845677] [2020-11-30 01:19:05,762 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:19:05,762 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2020-11-30 01:19:05,763 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866798628] [2020-11-30 01:19:05,764 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-30 01:19:05,764 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-11-30 01:19:05,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-30 01:19:05,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-11-30 01:19:05,765 INFO L87 Difference]: Start difference. First operand 876 states and 1344 transitions. Second operand 6 states. [2020-11-30 01:19:13,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:19:13,184 INFO L93 Difference]: Finished difference Result 2396 states and 3610 transitions. [2020-11-30 01:19:13,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-30 01:19:13,185 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 130 [2020-11-30 01:19:13,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:19:13,194 INFO L225 Difference]: With dead ends: 2396 [2020-11-30 01:19:13,194 INFO L226 Difference]: Without dead ends: 1530 [2020-11-30 01:19:13,197 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 254 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-30 01:19:13,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1530 states. [2020-11-30 01:19:13,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1530 to 931. [2020-11-30 01:19:13,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 931 states. [2020-11-30 01:19:13,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 931 states to 931 states and 1413 transitions. [2020-11-30 01:19:13,244 INFO L78 Accepts]: Start accepts. Automaton has 931 states and 1413 transitions. Word has length 130 [2020-11-30 01:19:13,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:19:13,245 INFO L481 AbstractCegarLoop]: Abstraction has 931 states and 1413 transitions. [2020-11-30 01:19:13,245 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-30 01:19:13,245 INFO L276 IsEmpty]: Start isEmpty. Operand 931 states and 1413 transitions. [2020-11-30 01:19:13,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2020-11-30 01:19:13,248 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:19:13,248 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:19:13,461 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2020-11-30 01:19:13,461 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:19:13,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:19:13,462 INFO L82 PathProgramCache]: Analyzing trace with hash 919227327, now seen corresponding path program 1 times [2020-11-30 01:19:13,462 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-11-30 01:19:13,462 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1392059219] [2020-11-30 01:19:13,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_bc02df54-026e-498d-97f5-0fa385b6c297/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-30 01:19:13,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:19:13,945 INFO L263 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 3 conjunts are in the unsatisfiable core [2020-11-30 01:19:13,948 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 01:19:13,994 INFO L350 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2020-11-30 01:19:13,994 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-30 01:19:13,994 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:19:14,011 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:19:14,011 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 01:19:14,011 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:19 [2020-11-30 01:19:14,040 INFO L350 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2020-11-30 01:19:14,040 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 28 treesize of output 10 [2020-11-30 01:19:14,042 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:19:14,044 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:19:14,044 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-30 01:19:14,045 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2020-11-30 01:19:14,072 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2020-11-30 01:19:14,072 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 01:19:14,131 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2020-11-30 01:19:14,132 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1392059219] [2020-11-30 01:19:14,132 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:19:14,132 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2020-11-30 01:19:14,132 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657728340] [2020-11-30 01:19:14,133 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-30 01:19:14,133 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-11-30 01:19:14,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-30 01:19:14,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-11-30 01:19:14,135 INFO L87 Difference]: Start difference. First operand 931 states and 1413 transitions. Second operand 6 states. [2020-11-30 01:19:20,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:19:20,396 INFO L93 Difference]: Finished difference Result 2452 states and 3664 transitions. [2020-11-30 01:19:20,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-30 01:19:20,398 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 130 [2020-11-30 01:19:20,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:19:20,408 INFO L225 Difference]: With dead ends: 2452 [2020-11-30 01:19:20,408 INFO L226 Difference]: Without dead ends: 1531 [2020-11-30 01:19:20,410 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 254 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-30 01:19:20,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1531 states. [2020-11-30 01:19:20,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1531 to 936. [2020-11-30 01:19:20,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 936 states. [2020-11-30 01:19:20,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 936 states to 936 states and 1407 transitions. [2020-11-30 01:19:20,461 INFO L78 Accepts]: Start accepts. Automaton has 936 states and 1407 transitions. Word has length 130 [2020-11-30 01:19:20,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:19:20,462 INFO L481 AbstractCegarLoop]: Abstraction has 936 states and 1407 transitions. [2020-11-30 01:19:20,462 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-30 01:19:20,462 INFO L276 IsEmpty]: Start isEmpty. Operand 936 states and 1407 transitions. [2020-11-30 01:19:20,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2020-11-30 01:19:20,465 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:19:20,466 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 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] [2020-11-30 01:19:20,707 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2020-11-30 01:19:20,707 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:19:20,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:19:20,708 INFO L82 PathProgramCache]: Analyzing trace with hash 1537947938, now seen corresponding path program 1 times [2020-11-30 01:19:20,709 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-11-30 01:19:20,709 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1804372720] [2020-11-30 01:19:20,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_bc02df54-026e-498d-97f5-0fa385b6c297/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-30 01:19:21,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:19:21,133 INFO L263 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 3 conjunts are in the unsatisfiable core [2020-11-30 01:19:21,136 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 01:19:21,165 INFO L350 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2020-11-30 01:19:21,166 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-30 01:19:21,166 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:19:21,177 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:19:21,177 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 01:19:21,177 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:19 [2020-11-30 01:19:21,208 INFO L350 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2020-11-30 01:19:21,209 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 28 treesize of output 10 [2020-11-30 01:19:21,213 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:19:21,216 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:19:21,216 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-30 01:19:21,216 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2020-11-30 01:19:21,254 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2020-11-30 01:19:21,258 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 01:19:21,315 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2020-11-30 01:19:21,316 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1804372720] [2020-11-30 01:19:21,317 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:19:21,317 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2020-11-30 01:19:21,317 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456153536] [2020-11-30 01:19:21,318 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-30 01:19:21,318 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-11-30 01:19:21,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-30 01:19:21,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-11-30 01:19:21,319 INFO L87 Difference]: Start difference. First operand 936 states and 1407 transitions. Second operand 6 states. [2020-11-30 01:19:30,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:19:30,035 INFO L93 Difference]: Finished difference Result 2419 states and 3597 transitions. [2020-11-30 01:19:30,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-30 01:19:30,037 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 130 [2020-11-30 01:19:30,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:19:30,047 INFO L225 Difference]: With dead ends: 2419 [2020-11-30 01:19:30,048 INFO L226 Difference]: Without dead ends: 1651 [2020-11-30 01:19:30,050 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 254 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-30 01:19:30,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1651 states. [2020-11-30 01:19:30,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1651 to 1052. [2020-11-30 01:19:30,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1052 states. [2020-11-30 01:19:30,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1052 states to 1052 states and 1581 transitions. [2020-11-30 01:19:30,117 INFO L78 Accepts]: Start accepts. Automaton has 1052 states and 1581 transitions. Word has length 130 [2020-11-30 01:19:30,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:19:30,118 INFO L481 AbstractCegarLoop]: Abstraction has 1052 states and 1581 transitions. [2020-11-30 01:19:30,118 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-30 01:19:30,118 INFO L276 IsEmpty]: Start isEmpty. Operand 1052 states and 1581 transitions. [2020-11-30 01:19:30,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2020-11-30 01:19:30,121 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:19:30,121 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:19:30,343 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 mathsat -unsat_core_generation=3 [2020-11-30 01:19:30,343 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:19:30,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:19:30,344 INFO L82 PathProgramCache]: Analyzing trace with hash -1834884522, now seen corresponding path program 1 times [2020-11-30 01:19:30,344 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-11-30 01:19:30,344 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1197864317] [2020-11-30 01:19:30,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_bc02df54-026e-498d-97f5-0fa385b6c297/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-30 01:19:30,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:19:30,823 INFO L263 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 3 conjunts are in the unsatisfiable core [2020-11-30 01:19:30,827 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 01:19:30,867 INFO L350 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2020-11-30 01:19:30,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, 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-30 01:19:30,868 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:19:30,885 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:19:30,885 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 01:19:30,885 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:19 [2020-11-30 01:19:30,917 INFO L350 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2020-11-30 01:19:30,918 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 28 treesize of output 10 [2020-11-30 01:19:30,919 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:19:30,922 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:19:30,922 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-30 01:19:30,923 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2020-11-30 01:19:30,951 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2020-11-30 01:19:30,952 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 01:19:31,008 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2020-11-30 01:19:31,009 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1197864317] [2020-11-30 01:19:31,009 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:19:31,009 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2020-11-30 01:19:31,009 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145960527] [2020-11-30 01:19:31,010 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-30 01:19:31,010 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-11-30 01:19:31,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-30 01:19:31,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-11-30 01:19:31,011 INFO L87 Difference]: Start difference. First operand 1052 states and 1581 transitions. Second operand 6 states. [2020-11-30 01:19:36,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:19:36,563 INFO L93 Difference]: Finished difference Result 2669 states and 3950 transitions. [2020-11-30 01:19:36,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-30 01:19:36,565 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 131 [2020-11-30 01:19:36,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:19:36,575 INFO L225 Difference]: With dead ends: 2669 [2020-11-30 01:19:36,575 INFO L226 Difference]: Without dead ends: 1627 [2020-11-30 01:19:36,578 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 256 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-30 01:19:36,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1627 states. [2020-11-30 01:19:36,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1627 to 1052. [2020-11-30 01:19:36,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1052 states. [2020-11-30 01:19:36,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1052 states to 1052 states and 1559 transitions. [2020-11-30 01:19:36,646 INFO L78 Accepts]: Start accepts. Automaton has 1052 states and 1559 transitions. Word has length 131 [2020-11-30 01:19:36,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:19:36,647 INFO L481 AbstractCegarLoop]: Abstraction has 1052 states and 1559 transitions. [2020-11-30 01:19:36,647 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-30 01:19:36,647 INFO L276 IsEmpty]: Start isEmpty. Operand 1052 states and 1559 transitions. [2020-11-30 01:19:36,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2020-11-30 01:19:36,651 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:19:36,651 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:19:36,866 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 mathsat -unsat_core_generation=3 [2020-11-30 01:19:36,866 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:19:36,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:19:36,867 INFO L82 PathProgramCache]: Analyzing trace with hash -1695627015, now seen corresponding path program 1 times [2020-11-30 01:19:36,868 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-11-30 01:19:36,868 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2003132831] [2020-11-30 01:19:36,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_bc02df54-026e-498d-97f5-0fa385b6c297/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-30 01:19:37,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:19:37,347 INFO L263 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 3 conjunts are in the unsatisfiable core [2020-11-30 01:19:37,351 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 01:19:37,405 INFO L350 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2020-11-30 01:19:37,406 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-30 01:19:37,406 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:19:37,420 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:19:37,420 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 01:19:37,421 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:19 [2020-11-30 01:19:37,449 INFO L350 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2020-11-30 01:19:37,449 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 28 treesize of output 10 [2020-11-30 01:19:37,451 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:19:37,454 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:19:37,454 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-30 01:19:37,454 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2020-11-30 01:19:37,489 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2020-11-30 01:19:37,489 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 01:19:37,564 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2020-11-30 01:19:37,564 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2003132831] [2020-11-30 01:19:37,565 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:19:37,565 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2020-11-30 01:19:37,565 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929913677] [2020-11-30 01:19:37,568 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-30 01:19:37,568 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-11-30 01:19:37,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-30 01:19:37,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-11-30 01:19:37,570 INFO L87 Difference]: Start difference. First operand 1052 states and 1559 transitions. Second operand 6 states. [2020-11-30 01:19:42,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:19:42,274 INFO L93 Difference]: Finished difference Result 2484 states and 3649 transitions. [2020-11-30 01:19:42,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-30 01:19:42,276 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 131 [2020-11-30 01:19:42,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:19:42,284 INFO L225 Difference]: With dead ends: 2484 [2020-11-30 01:19:42,284 INFO L226 Difference]: Without dead ends: 1620 [2020-11-30 01:19:42,286 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 256 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-30 01:19:42,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1620 states. [2020-11-30 01:19:42,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1620 to 1063. [2020-11-30 01:19:42,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1063 states. [2020-11-30 01:19:42,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1063 states to 1063 states and 1565 transitions. [2020-11-30 01:19:42,345 INFO L78 Accepts]: Start accepts. Automaton has 1063 states and 1565 transitions. Word has length 131 [2020-11-30 01:19:42,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:19:42,345 INFO L481 AbstractCegarLoop]: Abstraction has 1063 states and 1565 transitions. [2020-11-30 01:19:42,345 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-30 01:19:42,345 INFO L276 IsEmpty]: Start isEmpty. Operand 1063 states and 1565 transitions. [2020-11-30 01:19:42,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2020-11-30 01:19:42,349 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:19:42,349 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:19:42,571 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 mathsat -unsat_core_generation=3 [2020-11-30 01:19:42,571 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:19:42,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:19:42,572 INFO L82 PathProgramCache]: Analyzing trace with hash 653511332, now seen corresponding path program 1 times [2020-11-30 01:19:42,572 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-11-30 01:19:42,573 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [299208435] [2020-11-30 01:19:42,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_bc02df54-026e-498d-97f5-0fa385b6c297/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-30 01:19:43,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:19:43,113 INFO L263 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 3 conjunts are in the unsatisfiable core [2020-11-30 01:19:43,115 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 01:19:43,146 INFO L350 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2020-11-30 01:19:43,146 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-30 01:19:43,146 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:19:43,160 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:19:43,160 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 01:19:43,160 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:19 [2020-11-30 01:19:43,183 INFO L350 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2020-11-30 01:19:43,183 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 28 treesize of output 10 [2020-11-30 01:19:43,184 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:19:43,192 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:19:43,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-30 01:19:43,192 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2020-11-30 01:19:43,223 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2020-11-30 01:19:43,223 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 01:19:43,277 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2020-11-30 01:19:43,277 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [299208435] [2020-11-30 01:19:43,277 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:19:43,278 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2020-11-30 01:19:43,278 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93498592] [2020-11-30 01:19:43,278 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-30 01:19:43,278 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-11-30 01:19:43,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-30 01:19:43,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-11-30 01:19:43,279 INFO L87 Difference]: Start difference. First operand 1063 states and 1565 transitions. Second operand 6 states. [2020-11-30 01:19:50,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:19:50,021 INFO L93 Difference]: Finished difference Result 2672 states and 3892 transitions. [2020-11-30 01:19:50,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-30 01:19:50,022 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 132 [2020-11-30 01:19:50,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:19:50,030 INFO L225 Difference]: With dead ends: 2672 [2020-11-30 01:19:50,030 INFO L226 Difference]: Without dead ends: 1619 [2020-11-30 01:19:50,031 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 258 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-30 01:19:50,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1619 states. [2020-11-30 01:19:50,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1619 to 1063. [2020-11-30 01:19:50,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1063 states. [2020-11-30 01:19:50,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1063 states to 1063 states and 1543 transitions. [2020-11-30 01:19:50,105 INFO L78 Accepts]: Start accepts. Automaton has 1063 states and 1543 transitions. Word has length 132 [2020-11-30 01:19:50,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:19:50,105 INFO L481 AbstractCegarLoop]: Abstraction has 1063 states and 1543 transitions. [2020-11-30 01:19:50,106 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-30 01:19:50,106 INFO L276 IsEmpty]: Start isEmpty. Operand 1063 states and 1543 transitions. [2020-11-30 01:19:50,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2020-11-30 01:19:50,109 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:19:50,109 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:19:50,332 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 mathsat -unsat_core_generation=3 [2020-11-30 01:19:50,332 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:19:50,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:19:50,333 INFO L82 PathProgramCache]: Analyzing trace with hash -1844078565, now seen corresponding path program 1 times [2020-11-30 01:19:50,333 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-11-30 01:19:50,334 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1079837166] [2020-11-30 01:19:50,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_bc02df54-026e-498d-97f5-0fa385b6c297/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-30 01:19:50,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:19:50,883 INFO L263 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 3 conjunts are in the unsatisfiable core [2020-11-30 01:19:50,885 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 01:19:50,912 INFO L350 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2020-11-30 01:19:50,913 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-30 01:19:50,913 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:19:50,923 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:19:50,923 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 01:19:50,923 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:19 [2020-11-30 01:19:50,952 INFO L350 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2020-11-30 01:19:50,952 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 28 treesize of output 10 [2020-11-30 01:19:50,953 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:19:50,955 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:19:50,956 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-30 01:19:50,956 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2020-11-30 01:19:51,009 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2020-11-30 01:19:51,009 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 01:19:51,059 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2020-11-30 01:19:51,059 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1079837166] [2020-11-30 01:19:51,060 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:19:51,060 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2020-11-30 01:19:51,060 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666467087] [2020-11-30 01:19:51,061 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-30 01:19:51,061 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-11-30 01:19:51,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-30 01:19:51,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-11-30 01:19:51,062 INFO L87 Difference]: Start difference. First operand 1063 states and 1543 transitions. Second operand 6 states. [2020-11-30 01:19:57,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:19:57,452 INFO L93 Difference]: Finished difference Result 2627 states and 3793 transitions. [2020-11-30 01:19:57,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-30 01:19:57,454 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 133 [2020-11-30 01:19:57,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:19:57,462 INFO L225 Difference]: With dead ends: 2627 [2020-11-30 01:19:57,462 INFO L226 Difference]: Without dead ends: 1574 [2020-11-30 01:19:57,464 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 260 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-30 01:19:57,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1574 states. [2020-11-30 01:19:57,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1574 to 1063. [2020-11-30 01:19:57,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1063 states. [2020-11-30 01:19:57,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1063 states to 1063 states and 1521 transitions. [2020-11-30 01:19:57,517 INFO L78 Accepts]: Start accepts. Automaton has 1063 states and 1521 transitions. Word has length 133 [2020-11-30 01:19:57,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:19:57,517 INFO L481 AbstractCegarLoop]: Abstraction has 1063 states and 1521 transitions. [2020-11-30 01:19:57,518 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-30 01:19:57,518 INFO L276 IsEmpty]: Start isEmpty. Operand 1063 states and 1521 transitions. [2020-11-30 01:19:57,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2020-11-30 01:19:57,521 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:19:57,521 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 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] [2020-11-30 01:19:57,743 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 mathsat -unsat_core_generation=3 [2020-11-30 01:19:57,744 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:19:57,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:19:57,745 INFO L82 PathProgramCache]: Analyzing trace with hash -197856968, now seen corresponding path program 1 times [2020-11-30 01:19:57,746 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-11-30 01:19:57,746 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [337714810] [2020-11-30 01:19:57,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_bc02df54-026e-498d-97f5-0fa385b6c297/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-30 01:19:58,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:19:58,118 INFO L263 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 3 conjunts are in the unsatisfiable core [2020-11-30 01:19:58,121 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 01:19:58,145 INFO L350 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2020-11-30 01:19:58,145 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-30 01:19:58,146 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:19:58,155 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:19:58,155 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 01:19:58,155 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:19 [2020-11-30 01:19:58,190 INFO L350 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2020-11-30 01:19:58,190 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 28 treesize of output 10 [2020-11-30 01:19:58,192 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:19:58,196 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:19:58,196 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-30 01:19:58,196 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2020-11-30 01:19:58,223 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2020-11-30 01:19:58,223 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 01:19:58,283 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2020-11-30 01:19:58,283 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [337714810] [2020-11-30 01:19:58,283 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:19:58,283 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2020-11-30 01:19:58,284 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835667597] [2020-11-30 01:19:58,284 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-30 01:19:58,284 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-11-30 01:19:58,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-30 01:19:58,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-11-30 01:19:58,285 INFO L87 Difference]: Start difference. First operand 1063 states and 1521 transitions. Second operand 6 states. [2020-11-30 01:20:02,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:20:02,649 INFO L93 Difference]: Finished difference Result 2727 states and 3884 transitions. [2020-11-30 01:20:02,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-30 01:20:02,651 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 133 [2020-11-30 01:20:02,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:20:02,658 INFO L225 Difference]: With dead ends: 2727 [2020-11-30 01:20:02,659 INFO L226 Difference]: Without dead ends: 1674 [2020-11-30 01:20:02,660 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 260 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-30 01:20:02,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1674 states. [2020-11-30 01:20:02,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1674 to 1158. [2020-11-30 01:20:02,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1158 states. [2020-11-30 01:20:02,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1158 states to 1158 states and 1635 transitions. [2020-11-30 01:20:02,742 INFO L78 Accepts]: Start accepts. Automaton has 1158 states and 1635 transitions. Word has length 133 [2020-11-30 01:20:02,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:20:02,745 INFO L481 AbstractCegarLoop]: Abstraction has 1158 states and 1635 transitions. [2020-11-30 01:20:02,745 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-30 01:20:02,745 INFO L276 IsEmpty]: Start isEmpty. Operand 1158 states and 1635 transitions. [2020-11-30 01:20:02,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2020-11-30 01:20:02,757 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:20:02,757 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:20:02,970 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 mathsat -unsat_core_generation=3 [2020-11-30 01:20:02,970 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:20:02,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:20:02,970 INFO L82 PathProgramCache]: Analyzing trace with hash 584684213, now seen corresponding path program 1 times [2020-11-30 01:20:02,971 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-11-30 01:20:02,971 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [849994918] [2020-11-30 01:20:02,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_bc02df54-026e-498d-97f5-0fa385b6c297/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-30 01:20:03,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:20:03,370 INFO L263 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 3 conjunts are in the unsatisfiable core [2020-11-30 01:20:03,372 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 01:20:03,407 INFO L350 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2020-11-30 01:20:03,408 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-30 01:20:03,408 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:20:03,418 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:20:03,418 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 01:20:03,418 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:19 [2020-11-30 01:20:03,459 INFO L350 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2020-11-30 01:20:03,459 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 28 treesize of output 10 [2020-11-30 01:20:03,464 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:20:03,467 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:20:03,467 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-30 01:20:03,467 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2020-11-30 01:20:03,502 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 136 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2020-11-30 01:20:03,502 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 01:20:03,543 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 136 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2020-11-30 01:20:03,543 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [849994918] [2020-11-30 01:20:03,544 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:20:03,544 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2020-11-30 01:20:03,544 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325035484] [2020-11-30 01:20:03,545 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-30 01:20:03,545 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-11-30 01:20:03,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-30 01:20:03,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-11-30 01:20:03,556 INFO L87 Difference]: Start difference. First operand 1158 states and 1635 transitions. Second operand 6 states. [2020-11-30 01:20:11,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:20:11,080 INFO L93 Difference]: Finished difference Result 2781 states and 3928 transitions. [2020-11-30 01:20:11,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-30 01:20:11,082 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 134 [2020-11-30 01:20:11,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:20:11,089 INFO L225 Difference]: With dead ends: 2781 [2020-11-30 01:20:11,089 INFO L226 Difference]: Without dead ends: 1633 [2020-11-30 01:20:11,091 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 262 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-30 01:20:11,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1633 states. [2020-11-30 01:20:11,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1633 to 1174. [2020-11-30 01:20:11,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1174 states. [2020-11-30 01:20:11,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1174 states to 1174 states and 1656 transitions. [2020-11-30 01:20:11,155 INFO L78 Accepts]: Start accepts. Automaton has 1174 states and 1656 transitions. Word has length 134 [2020-11-30 01:20:11,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:20:11,155 INFO L481 AbstractCegarLoop]: Abstraction has 1174 states and 1656 transitions. [2020-11-30 01:20:11,155 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-30 01:20:11,155 INFO L276 IsEmpty]: Start isEmpty. Operand 1174 states and 1656 transitions. [2020-11-30 01:20:11,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2020-11-30 01:20:11,159 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:20:11,159 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 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] [2020-11-30 01:20:11,377 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 mathsat -unsat_core_generation=3 [2020-11-30 01:20:11,378 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:20:11,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:20:11,378 INFO L82 PathProgramCache]: Analyzing trace with hash 2002780513, now seen corresponding path program 1 times [2020-11-30 01:20:11,378 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-11-30 01:20:11,379 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [452694611] [2020-11-30 01:20:11,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_bc02df54-026e-498d-97f5-0fa385b6c297/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-30 01:20:11,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:20:11,770 INFO L263 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 3 conjunts are in the unsatisfiable core [2020-11-30 01:20:11,772 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 01:20:11,803 INFO L350 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2020-11-30 01:20:11,803 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-30 01:20:11,803 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:20:11,815 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:20:11,815 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 01:20:11,816 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:19 [2020-11-30 01:20:11,835 INFO L350 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2020-11-30 01:20:11,836 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 28 treesize of output 10 [2020-11-30 01:20:11,837 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:20:11,842 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:20:11,842 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-30 01:20:11,842 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2020-11-30 01:20:11,888 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 133 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2020-11-30 01:20:11,888 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 01:20:11,925 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 133 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2020-11-30 01:20:11,926 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [452694611] [2020-11-30 01:20:11,926 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:20:11,926 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2020-11-30 01:20:11,926 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738500490] [2020-11-30 01:20:11,927 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-30 01:20:11,927 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-11-30 01:20:11,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-30 01:20:11,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-11-30 01:20:11,928 INFO L87 Difference]: Start difference. First operand 1174 states and 1656 transitions. Second operand 6 states. [2020-11-30 01:20:17,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:20:17,150 INFO L93 Difference]: Finished difference Result 2775 states and 3909 transitions. [2020-11-30 01:20:17,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-30 01:20:17,152 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 134 [2020-11-30 01:20:17,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:20:17,159 INFO L225 Difference]: With dead ends: 2775 [2020-11-30 01:20:17,159 INFO L226 Difference]: Without dead ends: 1611 [2020-11-30 01:20:17,160 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 262 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-30 01:20:17,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1611 states. [2020-11-30 01:20:17,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1611 to 1174. [2020-11-30 01:20:17,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1174 states. [2020-11-30 01:20:17,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1174 states to 1174 states and 1640 transitions. [2020-11-30 01:20:17,209 INFO L78 Accepts]: Start accepts. Automaton has 1174 states and 1640 transitions. Word has length 134 [2020-11-30 01:20:17,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:20:17,210 INFO L481 AbstractCegarLoop]: Abstraction has 1174 states and 1640 transitions. [2020-11-30 01:20:17,210 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-30 01:20:17,210 INFO L276 IsEmpty]: Start isEmpty. Operand 1174 states and 1640 transitions. [2020-11-30 01:20:17,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2020-11-30 01:20:17,212 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:20:17,212 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:20:17,426 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 mathsat -unsat_core_generation=3 [2020-11-30 01:20:17,427 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:20:17,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:20:17,427 INFO L82 PathProgramCache]: Analyzing trace with hash -272550210, now seen corresponding path program 1 times [2020-11-30 01:20:17,428 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-11-30 01:20:17,428 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [10813800] [2020-11-30 01:20:17,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_bc02df54-026e-498d-97f5-0fa385b6c297/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-30 01:20:18,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 01:20:18,006 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 01:20:18,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 01:20:18,515 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 01:20:18,931 INFO L173 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2020-11-30 01:20:18,931 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-11-30 01:20:19,152 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 mathsat -unsat_core_generation=3 [2020-11-30 01:20:19,406 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.11 01:20:19 BoogieIcfgContainer [2020-11-30 01:20:19,407 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-30 01:20:19,407 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-11-30 01:20:19,408 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-11-30 01:20:19,408 INFO L275 PluginConnector]: Witness Printer initialized [2020-11-30 01:20:19,409 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 01:17:33" (3/4) ... [2020-11-30 01:20:19,418 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-11-30 01:20:19,549 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_bc02df54-026e-498d-97f5-0fa385b6c297/bin/uautomizer/witness.graphml [2020-11-30 01:20:19,549 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-11-30 01:20:19,551 INFO L168 Benchmark]: Toolchain (without parser) took 172623.67 ms. Allocated memory was 54.5 MB in the beginning and 134.2 MB in the end (delta: 79.7 MB). Free memory was 30.1 MB in the beginning and 62.3 MB in the end (delta: -32.2 MB). Peak memory consumption was 48.7 MB. Max. memory is 16.1 GB. [2020-11-30 01:20:19,551 INFO L168 Benchmark]: CDTParser took 0.33 ms. Allocated memory is still 54.5 MB. Free memory was 37.2 MB in the beginning and 37.1 MB in the end (delta: 37.1 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-30 01:20:19,552 INFO L168 Benchmark]: CACSL2BoogieTranslator took 827.85 ms. Allocated memory was 54.5 MB in the beginning and 73.4 MB in the end (delta: 18.9 MB). Free memory was 29.9 MB in the beginning and 42.0 MB in the end (delta: -12.1 MB). Peak memory consumption was 10.2 MB. Max. memory is 16.1 GB. [2020-11-30 01:20:19,552 INFO L168 Benchmark]: Boogie Procedure Inliner took 141.71 ms. Allocated memory is still 73.4 MB. Free memory was 41.7 MB in the beginning and 37.6 MB in the end (delta: 4.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2020-11-30 01:20:19,553 INFO L168 Benchmark]: Boogie Preprocessor took 173.60 ms. Allocated memory is still 73.4 MB. Free memory was 37.6 MB in the beginning and 47.6 MB in the end (delta: -10.0 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2020-11-30 01:20:19,553 INFO L168 Benchmark]: RCFGBuilder took 5210.02 ms. Allocated memory was 73.4 MB in the beginning and 92.3 MB in the end (delta: 18.9 MB). Free memory was 47.6 MB in the beginning and 43.2 MB in the end (delta: 4.4 MB). Peak memory consumption was 26.1 MB. Max. memory is 16.1 GB. [2020-11-30 01:20:19,554 INFO L168 Benchmark]: TraceAbstraction took 166119.79 ms. Allocated memory was 92.3 MB in the beginning and 134.2 MB in the end (delta: 41.9 MB). Free memory was 42.7 MB in the beginning and 81.2 MB in the end (delta: -38.5 MB). Peak memory consumption was 59.1 MB. Max. memory is 16.1 GB. [2020-11-30 01:20:19,554 INFO L168 Benchmark]: Witness Printer took 141.92 ms. Allocated memory is still 134.2 MB. Free memory was 81.2 MB in the beginning and 62.3 MB in the end (delta: 18.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.1 GB. [2020-11-30 01:20:19,559 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.33 ms. Allocated memory is still 54.5 MB. Free memory was 37.2 MB in the beginning and 37.1 MB in the end (delta: 37.1 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 827.85 ms. Allocated memory was 54.5 MB in the beginning and 73.4 MB in the end (delta: 18.9 MB). Free memory was 29.9 MB in the beginning and 42.0 MB in the end (delta: -12.1 MB). Peak memory consumption was 10.2 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 141.71 ms. Allocated memory is still 73.4 MB. Free memory was 41.7 MB in the beginning and 37.6 MB in the end (delta: 4.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 173.60 ms. Allocated memory is still 73.4 MB. Free memory was 37.6 MB in the beginning and 47.6 MB in the end (delta: -10.0 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * RCFGBuilder took 5210.02 ms. Allocated memory was 73.4 MB in the beginning and 92.3 MB in the end (delta: 18.9 MB). Free memory was 47.6 MB in the beginning and 43.2 MB in the end (delta: 4.4 MB). Peak memory consumption was 26.1 MB. Max. memory is 16.1 GB. * TraceAbstraction took 166119.79 ms. Allocated memory was 92.3 MB in the beginning and 134.2 MB in the end (delta: 41.9 MB). Free memory was 42.7 MB in the beginning and 81.2 MB in the end (delta: -38.5 MB). Peak memory consumption was 59.1 MB. Max. memory is 16.1 GB. * Witness Printer took 141.92 ms. Allocated memory is still 134.2 MB. Free memory was 81.2 MB in the beginning and 62.3 MB in the end (delta: 18.9 MB). Peak memory consumption was 18.9 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_client_data ; VAL [init=1, SSLv3_client_data={-2147483617:0}] [L1067] SSL *s = (SSL*)malloc(sizeof(SSL)) ; [L1071] s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1072] s->ctx = malloc(sizeof(SSL_CTX)) [L1073] s->session = malloc(sizeof(SSL_SESSION)) [L1074] s->state = 12292 [L1075] s->version = __VERIFIER_nondet_int() [L1082] BUF_MEM *buf = (BUF_MEM *)__VERIFIER_nondet_ulong(); [L1083] unsigned long tmp ; [L1084] unsigned long l ; [L1085] long num1 ; [L1086] void (*cb)() ; [L1087] int ret ; [L1088] int new_state ; [L1089] int state ; [L1090] int skip ; [L1091] int tmp___1 = __VERIFIER_nondet_int() ; [L1092] int tmp___2 = __VERIFIER_nondet_int() ; [L1093] int tmp___3 ; [L1094] int tmp___4 ; [L1095] int tmp___5 ; [L1096] int tmp___6 ; [L1097] int tmp___7 ; [L1098] int tmp___8 ; [L1099] long tmp___9 ; [L1101] int blastFlag ; [L1104] blastFlag = 0 [L1105] s->hit=__VERIFIER_nondet_int () [L1106] s->state = 12292 [L1107] tmp = __VERIFIER_nondet_int() [L1108] cb = (void (*)())((void *)0) [L1109] ret = -1 [L1110] skip = 0 [L1111] EXPR s->info_callback VAL [init=1, SSLv3_client_data={-2147483617:0}] [L1111] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1112] EXPR s->info_callback [L1112] cb = s->info_callback [L1120] EXPR s->in_handshake [L1120] s->in_handshake += 1 [L1121] COND FALSE !(tmp___1 & 12288) VAL [init=1, SSLv3_client_data={-2147483617:0}] [L1131] COND TRUE 1 VAL [init=1, SSLv3_client_data={-2147483617:0}] [L1133] EXPR s->state [L1133] state = s->state [L1134] EXPR s->state VAL [init=1, SSLv3_client_data={-2147483617:0}] [L1134] COND TRUE s->state == 12292 [L1237] s->new_session = 1 [L1238] s->state = 4096 [L1239] EXPR s->ctx [L1239] EXPR (s->ctx)->stats.sess_connect_renegotiate [L1239] (s->ctx)->stats.sess_connect_renegotiate += 1 [L1244] s->server = 0 VAL [init=1, SSLv3_client_data={-2147483617:0}] [L1245] COND TRUE (unsigned long )cb != (unsigned long )((void *)0) VAL [init=1, SSLv3_client_data={-2147483617:0}] [L1250] EXPR s->version VAL [init=1, SSLv3_client_data={-2147483617:0}] [L1250] COND FALSE !((s->version & 65280) != 768) [L1256] s->type = 4096 [L1257] EXPR s->init_buf VAL [init=1, SSLv3_client_data={-2147483617:0}] [L1257] COND FALSE !((unsigned long )s->init_buf == (unsigned long )((void *)0)) [L1269] tmp___4 = __VERIFIER_nondet_int() [L1270] COND FALSE !(! tmp___4) [L1276] tmp___5 = __VERIFIER_nondet_int() [L1277] COND FALSE !(! tmp___5) [L1283] s->state = 4368 [L1284] EXPR s->ctx [L1284] EXPR (s->ctx)->stats.sess_connect [L1284] (s->ctx)->stats.sess_connect += 1 [L1285] s->init_num = 0 VAL [init=1, SSLv3_client_data={-2147483617:0}] [L1605] EXPR s->s3 [L1605] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_client_data={-2147483617:0}] [L1605] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1634] skip = 0 VAL [init=1, SSLv3_client_data={-2147483617:0}] [L1131] COND TRUE 1 VAL [init=1, SSLv3_client_data={-2147483617:0}] [L1133] EXPR s->state [L1133] state = s->state [L1134] EXPR s->state VAL [init=1, SSLv3_client_data={-2147483617:0}] [L1134] COND FALSE !(s->state == 12292) [L1137] EXPR s->state VAL [init=1, SSLv3_client_data={-2147483617:0}] [L1137] COND FALSE !(s->state == 16384) [L1140] EXPR s->state VAL [init=1, SSLv3_client_data={-2147483617:0}] [L1140] COND FALSE !(s->state == 4096) [L1143] EXPR s->state VAL [init=1, SSLv3_client_data={-2147483617:0}] [L1143] COND FALSE !(s->state == 20480) [L1146] EXPR s->state VAL [init=1, SSLv3_client_data={-2147483617:0}] [L1146] COND FALSE !(s->state == 4099) [L1149] EXPR s->state VAL [init=1, SSLv3_client_data={-2147483617:0}] [L1149] COND TRUE s->state == 4368 [L1289] s->shutdown = 0 [L1290] ret = __VERIFIER_nondet_int() [L1291] COND TRUE blastFlag == 0 [L1292] blastFlag = 1 VAL [init=1, SSLv3_client_data={-2147483617:0}] [L1296] COND FALSE !(ret <= 0) [L1301] s->state = 4384 [L1302] s->init_num = 0 [L1303] EXPR s->bbio [L1303] EXPR s->wbio VAL [init=1, SSLv3_client_data={-2147483617:0}] [L1303] COND TRUE (unsigned long )s->bbio != (unsigned long )s->wbio [L1605] EXPR s->s3 [L1605] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_client_data={-2147483617:0}] [L1605] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1634] skip = 0 VAL [init=1, SSLv3_client_data={-2147483617:0}] [L1131] COND TRUE 1 VAL [init=1, SSLv3_client_data={-2147483617:0}] [L1133] EXPR s->state [L1133] state = s->state [L1134] EXPR s->state VAL [init=1, SSLv3_client_data={-2147483617:0}] [L1134] COND FALSE !(s->state == 12292) [L1137] EXPR s->state VAL [init=1, SSLv3_client_data={-2147483617:0}] [L1137] COND FALSE !(s->state == 16384) [L1140] EXPR s->state VAL [init=1, SSLv3_client_data={-2147483617:0}] [L1140] COND FALSE !(s->state == 4096) [L1143] EXPR s->state VAL [init=1, SSLv3_client_data={-2147483617:0}] [L1143] COND FALSE !(s->state == 20480) [L1146] EXPR s->state VAL [init=1, SSLv3_client_data={-2147483617:0}] [L1146] COND FALSE !(s->state == 4099) [L1149] EXPR s->state VAL [init=1, SSLv3_client_data={-2147483617:0}] [L1149] COND FALSE !(s->state == 4368) [L1152] EXPR s->state VAL [init=1, SSLv3_client_data={-2147483617:0}] [L1152] COND FALSE !(s->state == 4369) [L1155] EXPR s->state VAL [init=1, SSLv3_client_data={-2147483617:0}] [L1155] COND TRUE s->state == 4384 [L1311] ret = __VERIFIER_nondet_int() [L1312] COND TRUE blastFlag == 1 [L1313] blastFlag = 2 VAL [init=1, SSLv3_client_data={-2147483617:0}] [L1317] COND FALSE !(ret <= 0) [L1322] s->hit VAL [init=1, SSLv3_client_data={-2147483617:0}] [L1322] COND FALSE !(s->hit) [L1325] s->state = 4400 VAL [init=1, SSLv3_client_data={-2147483617:0}] [L1327] s->init_num = 0 VAL [init=1, SSLv3_client_data={-2147483617:0}] [L1605] EXPR s->s3 [L1605] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_client_data={-2147483617:0}] [L1605] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1634] skip = 0 VAL [init=1, SSLv3_client_data={-2147483617:0}] [L1131] COND TRUE 1 VAL [init=1, SSLv3_client_data={-2147483617:0}] [L1133] EXPR s->state [L1133] state = s->state [L1134] EXPR s->state VAL [init=1, SSLv3_client_data={-2147483617:0}] [L1134] COND FALSE !(s->state == 12292) [L1137] EXPR s->state VAL [init=1, SSLv3_client_data={-2147483617:0}] [L1137] COND FALSE !(s->state == 16384) [L1140] EXPR s->state VAL [init=1, SSLv3_client_data={-2147483617:0}] [L1140] COND FALSE !(s->state == 4096) [L1143] EXPR s->state VAL [init=1, SSLv3_client_data={-2147483617:0}] [L1143] COND FALSE !(s->state == 20480) [L1146] EXPR s->state VAL [init=1, SSLv3_client_data={-2147483617:0}] [L1146] COND FALSE !(s->state == 4099) [L1149] EXPR s->state VAL [init=1, SSLv3_client_data={-2147483617:0}] [L1149] COND FALSE !(s->state == 4368) [L1152] EXPR s->state VAL [init=1, SSLv3_client_data={-2147483617:0}] [L1152] COND FALSE !(s->state == 4369) [L1155] EXPR s->state VAL [init=1, SSLv3_client_data={-2147483617:0}] [L1155] COND FALSE !(s->state == 4384) [L1158] EXPR s->state VAL [init=1, SSLv3_client_data={-2147483617:0}] [L1158] COND FALSE !(s->state == 4385) [L1161] EXPR s->state VAL [init=1, SSLv3_client_data={-2147483617:0}] [L1161] COND TRUE s->state == 4400 [L1331] EXPR s->s3 [L1331] EXPR (s->s3)->tmp.new_cipher [L1331] EXPR ((s->s3)->tmp.new_cipher)->algorithms VAL [init=1, SSLv3_client_data={-2147483617:0}] [L1331] COND FALSE !(((s->s3)->tmp.new_cipher)->algorithms & 256UL) [L1334] ret = __VERIFIER_nondet_int() [L1335] COND TRUE blastFlag == 2 [L1336] blastFlag = 3 VAL [init=1, SSLv3_client_data={-2147483617:0}] [L1340] COND FALSE !(ret <= 0) VAL [init=1, SSLv3_client_data={-2147483617:0}] [L1346] s->state = 4416 [L1347] s->init_num = 0 VAL [init=1, SSLv3_client_data={-2147483617:0}] [L1605] EXPR s->s3 [L1605] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_client_data={-2147483617:0}] [L1605] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1634] skip = 0 VAL [init=1, SSLv3_client_data={-2147483617:0}] [L1131] COND TRUE 1 VAL [init=1, SSLv3_client_data={-2147483617:0}] [L1133] EXPR s->state [L1133] state = s->state [L1134] EXPR s->state VAL [init=1, SSLv3_client_data={-2147483617:0}] [L1134] COND FALSE !(s->state == 12292) [L1137] EXPR s->state VAL [init=1, SSLv3_client_data={-2147483617:0}] [L1137] COND FALSE !(s->state == 16384) [L1140] EXPR s->state VAL [init=1, SSLv3_client_data={-2147483617:0}] [L1140] COND FALSE !(s->state == 4096) [L1143] EXPR s->state VAL [init=1, SSLv3_client_data={-2147483617:0}] [L1143] COND FALSE !(s->state == 20480) [L1146] EXPR s->state VAL [init=1, SSLv3_client_data={-2147483617:0}] [L1146] COND FALSE !(s->state == 4099) [L1149] EXPR s->state VAL [init=1, SSLv3_client_data={-2147483617:0}] [L1149] COND FALSE !(s->state == 4368) [L1152] EXPR s->state VAL [init=1, SSLv3_client_data={-2147483617:0}] [L1152] COND FALSE !(s->state == 4369) [L1155] EXPR s->state VAL [init=1, SSLv3_client_data={-2147483617:0}] [L1155] COND FALSE !(s->state == 4384) [L1158] EXPR s->state VAL [init=1, SSLv3_client_data={-2147483617:0}] [L1158] COND FALSE !(s->state == 4385) [L1161] EXPR s->state VAL [init=1, SSLv3_client_data={-2147483617:0}] [L1161] COND FALSE !(s->state == 4400) [L1164] EXPR s->state VAL [init=1, SSLv3_client_data={-2147483617:0}] [L1164] COND FALSE !(s->state == 4401) [L1167] EXPR s->state VAL [init=1, SSLv3_client_data={-2147483617:0}] [L1167] COND TRUE s->state == 4416 [L1351] ret = __VERIFIER_nondet_int() [L1352] COND TRUE blastFlag == 3 [L1353] blastFlag = 4 VAL [init=1, SSLv3_client_data={-2147483617:0}] [L1357] COND FALSE !(ret <= 0) [L1362] s->state = 4432 [L1363] s->init_num = 0 [L1364] tmp___6 = __VERIFIER_nondet_int() [L1365] COND FALSE !(! tmp___6) VAL [init=1, SSLv3_client_data={-2147483617:0}] [L1605] EXPR s->s3 [L1605] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_client_data={-2147483617:0}] [L1605] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1634] skip = 0 VAL [init=1, SSLv3_client_data={-2147483617:0}] [L1131] COND TRUE 1 VAL [init=1, SSLv3_client_data={-2147483617:0}] [L1133] EXPR s->state [L1133] state = s->state [L1134] EXPR s->state VAL [init=1, SSLv3_client_data={-2147483617:0}] [L1134] COND FALSE !(s->state == 12292) [L1137] EXPR s->state VAL [init=1, SSLv3_client_data={-2147483617:0}] [L1137] COND FALSE !(s->state == 16384) [L1140] EXPR s->state VAL [init=1, SSLv3_client_data={-2147483617:0}] [L1140] COND FALSE !(s->state == 4096) [L1143] EXPR s->state VAL [init=1, SSLv3_client_data={-2147483617:0}] [L1143] COND FALSE !(s->state == 20480) [L1146] EXPR s->state VAL [init=1, SSLv3_client_data={-2147483617:0}] [L1146] COND FALSE !(s->state == 4099) [L1149] EXPR s->state VAL [init=1, SSLv3_client_data={-2147483617:0}] [L1149] COND FALSE !(s->state == 4368) [L1152] EXPR s->state VAL [init=1, SSLv3_client_data={-2147483617:0}] [L1152] COND FALSE !(s->state == 4369) [L1155] EXPR s->state VAL [init=1, SSLv3_client_data={-2147483617:0}] [L1155] COND FALSE !(s->state == 4384) [L1158] EXPR s->state VAL [init=1, SSLv3_client_data={-2147483617:0}] [L1158] COND FALSE !(s->state == 4385) [L1161] EXPR s->state VAL [init=1, SSLv3_client_data={-2147483617:0}] [L1161] COND FALSE !(s->state == 4400) [L1164] EXPR s->state VAL [init=1, SSLv3_client_data={-2147483617:0}] [L1164] COND FALSE !(s->state == 4401) [L1167] EXPR s->state VAL [init=1, SSLv3_client_data={-2147483617:0}] [L1167] COND FALSE !(s->state == 4416) [L1170] EXPR s->state VAL [init=1, SSLv3_client_data={-2147483617:0}] [L1170] COND FALSE !(s->state == 4417) [L1173] EXPR s->state VAL [init=1, SSLv3_client_data={-2147483617:0}] [L1173] COND TRUE s->state == 4432 [L1374] ret = __VERIFIER_nondet_int() [L1375] COND FALSE !(blastFlag == 5) VAL [init=1, SSLv3_client_data={-2147483617:0}] [L1380] COND FALSE !(ret <= 0) [L1385] s->state = 4448 [L1386] s->init_num = 0 VAL [init=1, SSLv3_client_data={-2147483617:0}] [L1605] EXPR s->s3 [L1605] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_client_data={-2147483617:0}] [L1605] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1634] skip = 0 VAL [init=1, SSLv3_client_data={-2147483617:0}] [L1131] COND TRUE 1 VAL [init=1, SSLv3_client_data={-2147483617:0}] [L1133] EXPR s->state [L1133] state = s->state [L1134] EXPR s->state VAL [init=1, SSLv3_client_data={-2147483617:0}] [L1134] COND FALSE !(s->state == 12292) [L1137] EXPR s->state VAL [init=1, SSLv3_client_data={-2147483617:0}] [L1137] COND FALSE !(s->state == 16384) [L1140] EXPR s->state VAL [init=1, SSLv3_client_data={-2147483617:0}] [L1140] COND FALSE !(s->state == 4096) [L1143] EXPR s->state VAL [init=1, SSLv3_client_data={-2147483617:0}] [L1143] COND FALSE !(s->state == 20480) [L1146] EXPR s->state VAL [init=1, SSLv3_client_data={-2147483617:0}] [L1146] COND FALSE !(s->state == 4099) [L1149] EXPR s->state VAL [init=1, SSLv3_client_data={-2147483617:0}] [L1149] COND FALSE !(s->state == 4368) [L1152] EXPR s->state VAL [init=1, SSLv3_client_data={-2147483617:0}] [L1152] COND FALSE !(s->state == 4369) [L1155] EXPR s->state VAL [init=1, SSLv3_client_data={-2147483617:0}] [L1155] COND FALSE !(s->state == 4384) [L1158] EXPR s->state VAL [init=1, SSLv3_client_data={-2147483617:0}] [L1158] COND FALSE !(s->state == 4385) [L1161] EXPR s->state VAL [init=1, SSLv3_client_data={-2147483617:0}] [L1161] COND FALSE !(s->state == 4400) [L1164] EXPR s->state VAL [init=1, SSLv3_client_data={-2147483617:0}] [L1164] COND FALSE !(s->state == 4401) [L1167] EXPR s->state VAL [init=1, SSLv3_client_data={-2147483617:0}] [L1167] COND FALSE !(s->state == 4416) [L1170] EXPR s->state VAL [init=1, SSLv3_client_data={-2147483617:0}] [L1170] COND FALSE !(s->state == 4417) [L1173] EXPR s->state VAL [init=1, SSLv3_client_data={-2147483617:0}] [L1173] COND FALSE !(s->state == 4432) [L1176] EXPR s->state VAL [init=1, SSLv3_client_data={-2147483617:0}] [L1176] COND FALSE !(s->state == 4433) [L1179] EXPR s->state VAL [init=1, SSLv3_client_data={-2147483617:0}] [L1179] COND TRUE s->state == 4448 [L1390] ret = __VERIFIER_nondet_int() [L1391] COND TRUE blastFlag == 4 VAL [init=1, SSLv3_client_data={-2147483617:0}] [L3] __assert_fail("0", "s3_clnt.blast.01.i.cil-2.c", 3, "reach_error") VAL [init=1, SSLv3_client_data={-2147483617:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 132 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 165.7s, OverallIterations: 17, TraceHistogramMax: 7, AutomataDifference: 80.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 2847 SDtfs, 3056 SDslu, 6161 SDs, 0 SdLazy, 5458 SolverSat, 608 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 72.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3578 GetRequests, 3495 SyntacticMatches, 3 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1174occurred in iteration=15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 16 MinimizatonAttempts, 6433 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 1.0s SsaConstructionTime, 4.6s SatisfiabilityAnalysisTime, 72.5s InterpolantComputationTime, 1930 NumberOfCodeBlocks, 1930 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 3554 ConstructedInterpolants, 0 QuantifiedInterpolants, 954062 SizeOfPredicates, 76 NumberOfNonLiveVariables, 4870 ConjunctsInSsa, 47 ConjunctsInUnsatCore, 32 InterpolantComputations, 32 PerfectInterpolantSequences, 5078/5078 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...