./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ssh/s3_srvr.blast.14_false-unreach-call.i.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_6b342074-af84-4fe5-a218-0680d1cd191a/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_6b342074-af84-4fe5-a218-0680d1cd191a/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_6b342074-af84-4fe5-a218-0680d1cd191a/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_6b342074-af84-4fe5-a218-0680d1cd191a/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/ssh/s3_srvr.blast.14_false-unreach-call.i.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_6b342074-af84-4fe5-a218-0680d1cd191a/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_6b342074-af84-4fe5-a218-0680d1cd191a/bin-2019/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d06f77684af1a50a152dd1d7247c10847b7d2ace .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_6b342074-af84-4fe5-a218-0680d1cd191a/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_6b342074-af84-4fe5-a218-0680d1cd191a/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_6b342074-af84-4fe5-a218-0680d1cd191a/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_6b342074-af84-4fe5-a218-0680d1cd191a/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/ssh/s3_srvr.blast.14_false-unreach-call.i.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_6b342074-af84-4fe5-a218-0680d1cd191a/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_6b342074-af84-4fe5-a218-0680d1cd191a/bin-2019/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d06f77684af1a50a152dd1d7247c10847b7d2ace ............................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: null --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-08 18:19:05,493 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-08 18:19:05,494 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-08 18:19:05,499 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-08 18:19:05,500 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-08 18:19:05,500 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-08 18:19:05,501 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-08 18:19:05,502 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-08 18:19:05,503 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-08 18:19:05,504 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-08 18:19:05,504 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-08 18:19:05,504 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-08 18:19:05,505 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-08 18:19:05,506 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-08 18:19:05,507 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-08 18:19:05,507 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-08 18:19:05,508 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-08 18:19:05,509 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-08 18:19:05,510 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-08 18:19:05,511 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-08 18:19:05,512 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-08 18:19:05,513 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-08 18:19:05,515 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-08 18:19:05,515 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-08 18:19:05,515 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-08 18:19:05,515 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-08 18:19:05,516 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-08 18:19:05,517 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-08 18:19:05,517 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-08 18:19:05,518 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-08 18:19:05,518 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-08 18:19:05,519 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-08 18:19:05,519 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-08 18:19:05,519 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-08 18:19:05,519 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-08 18:19:05,520 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-08 18:19:05,520 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_6b342074-af84-4fe5-a218-0680d1cd191a/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-08 18:19:05,530 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-08 18:19:05,530 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-08 18:19:05,531 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-08 18:19:05,531 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-08 18:19:05,531 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-08 18:19:05,531 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-08 18:19:05,532 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-08 18:19:05,532 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-08 18:19:05,532 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-08 18:19:05,532 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-08 18:19:05,532 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-08 18:19:05,532 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-08 18:19:05,532 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-08 18:19:05,533 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-08 18:19:05,533 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-08 18:19:05,533 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-08 18:19:05,533 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-08 18:19:05,533 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-08 18:19:05,533 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-08 18:19:05,533 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-08 18:19:05,534 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-08 18:19:05,534 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-08 18:19:05,534 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-08 18:19:05,534 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-08 18:19:05,534 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-08 18:19:05,534 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-08 18:19:05,534 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-08 18:19:05,534 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-08 18:19:05,534 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-08 18:19:05,535 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-08 18:19:05,535 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-08 18:19:05,535 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-08 18:19:05,535 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-08 18:19:05,535 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-08 18:19:05,535 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-08 18:19:05,535 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-08 18:19:05,535 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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/working_dir_6b342074-af84-4fe5-a218-0680d1cd191a/bin-2019/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan 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 -> d06f77684af1a50a152dd1d7247c10847b7d2ace [2018-12-08 18:19:05,558 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-08 18:19:05,567 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-08 18:19:05,570 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-08 18:19:05,571 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-08 18:19:05,571 INFO L276 PluginConnector]: CDTParser initialized [2018-12-08 18:19:05,572 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_6b342074-af84-4fe5-a218-0680d1cd191a/bin-2019/utaipan/../../sv-benchmarks/c/ssh/s3_srvr.blast.14_false-unreach-call.i.cil.c [2018-12-08 18:19:05,612 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_6b342074-af84-4fe5-a218-0680d1cd191a/bin-2019/utaipan/data/cadd0a329/334df8808c90450e9a275739f57b57bf/FLAG0a3cd76ea [2018-12-08 18:19:05,971 INFO L307 CDTParser]: Found 1 translation units. [2018-12-08 18:19:05,972 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_6b342074-af84-4fe5-a218-0680d1cd191a/sv-benchmarks/c/ssh/s3_srvr.blast.14_false-unreach-call.i.cil.c [2018-12-08 18:19:05,980 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_6b342074-af84-4fe5-a218-0680d1cd191a/bin-2019/utaipan/data/cadd0a329/334df8808c90450e9a275739f57b57bf/FLAG0a3cd76ea [2018-12-08 18:19:05,989 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_6b342074-af84-4fe5-a218-0680d1cd191a/bin-2019/utaipan/data/cadd0a329/334df8808c90450e9a275739f57b57bf [2018-12-08 18:19:05,991 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-08 18:19:05,992 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-08 18:19:05,992 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-08 18:19:05,992 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-08 18:19:05,995 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-08 18:19:05,995 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 06:19:05" (1/1) ... [2018-12-08 18:19:05,997 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@761adb7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 06:19:05, skipping insertion in model container [2018-12-08 18:19:05,997 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 06:19:05" (1/1) ... [2018-12-08 18:19:06,001 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-08 18:19:06,027 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-08 18:19:06,262 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 18:19:06,271 INFO L191 MainTranslator]: Completed pre-run [2018-12-08 18:19:06,323 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 18:19:06,334 INFO L195 MainTranslator]: Completed translation [2018-12-08 18:19:06,335 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 06:19:06 WrapperNode [2018-12-08 18:19:06,335 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-08 18:19:06,335 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-08 18:19:06,335 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-08 18:19:06,335 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-08 18:19:06,340 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 06:19:06" (1/1) ... [2018-12-08 18:19:06,352 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 06:19:06" (1/1) ... [2018-12-08 18:19:06,357 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-08 18:19:06,358 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-08 18:19:06,358 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-08 18:19:06,358 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-08 18:19:06,364 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 06:19:06" (1/1) ... [2018-12-08 18:19:06,364 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 06:19:06" (1/1) ... [2018-12-08 18:19:06,369 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 06:19:06" (1/1) ... [2018-12-08 18:19:06,369 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 06:19:06" (1/1) ... [2018-12-08 18:19:06,395 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 06:19:06" (1/1) ... [2018-12-08 18:19:06,400 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 06:19:06" (1/1) ... [2018-12-08 18:19:06,402 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 06:19:06" (1/1) ... [2018-12-08 18:19:06,405 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-08 18:19:06,405 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-08 18:19:06,405 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-08 18:19:06,406 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-08 18:19:06,406 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 06:19:06" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6b342074-af84-4fe5-a218-0680d1cd191a/bin-2019/utaipan/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 [2018-12-08 18:19:06,447 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-12-08 18:19:06,447 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-08 18:19:06,447 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-08 18:19:06,447 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-08 18:19:06,447 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-08 18:19:06,447 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-08 18:19:06,447 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-08 18:19:06,447 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-08 18:19:06,448 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2018-12-08 18:19:06,448 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_accept [2018-12-08 18:19:06,448 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_accept [2018-12-08 18:19:06,448 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-08 18:19:06,448 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-08 18:19:06,448 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-08 18:19:06,448 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-08 18:19:06,652 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-08 18:19:06,653 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-08 18:19:07,014 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-08 18:19:07,015 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-08 18:19:07,015 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 06:19:07 BoogieIcfgContainer [2018-12-08 18:19:07,015 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-08 18:19:07,015 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-08 18:19:07,015 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-08 18:19:07,017 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-08 18:19:07,017 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.12 06:19:05" (1/3) ... [2018-12-08 18:19:07,018 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@636c4ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 06:19:07, skipping insertion in model container [2018-12-08 18:19:07,018 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 06:19:06" (2/3) ... [2018-12-08 18:19:07,018 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@636c4ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 06:19:07, skipping insertion in model container [2018-12-08 18:19:07,018 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 06:19:07" (3/3) ... [2018-12-08 18:19:07,019 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.14_false-unreach-call.i.cil.c [2018-12-08 18:19:07,026 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-08 18:19:07,031 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-08 18:19:07,040 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-08 18:19:07,059 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-08 18:19:07,059 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-08 18:19:07,059 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-08 18:19:07,059 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-08 18:19:07,059 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-08 18:19:07,060 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-08 18:19:07,060 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-08 18:19:07,060 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-08 18:19:07,071 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states. [2018-12-08 18:19:07,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-08 18:19:07,076 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:19:07,077 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 18:19:07,078 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:19:07,082 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:19:07,082 INFO L82 PathProgramCache]: Analyzing trace with hash 437631585, now seen corresponding path program 1 times [2018-12-08 18:19:07,083 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:19:07,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:19:07,116 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:19:07,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:19:07,116 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:19:07,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:19:07,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 18:19:07,271 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:19:07,271 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 18:19:07,271 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:19:07,274 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 18:19:07,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 18:19:07,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 18:19:07,284 INFO L87 Difference]: Start difference. First operand 162 states. Second operand 4 states. [2018-12-08 18:19:07,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:19:07,521 INFO L93 Difference]: Finished difference Result 343 states and 578 transitions. [2018-12-08 18:19:07,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 18:19:07,522 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 48 [2018-12-08 18:19:07,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:19:07,529 INFO L225 Difference]: With dead ends: 343 [2018-12-08 18:19:07,529 INFO L226 Difference]: Without dead ends: 174 [2018-12-08 18:19:07,531 INFO L631 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 [2018-12-08 18:19:07,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-12-08 18:19:07,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 157. [2018-12-08 18:19:07,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-12-08 18:19:07,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 242 transitions. [2018-12-08 18:19:07,560 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 242 transitions. Word has length 48 [2018-12-08 18:19:07,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:19:07,560 INFO L480 AbstractCegarLoop]: Abstraction has 157 states and 242 transitions. [2018-12-08 18:19:07,560 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 18:19:07,560 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 242 transitions. [2018-12-08 18:19:07,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-12-08 18:19:07,561 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:19:07,562 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 18:19:07,562 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:19:07,562 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:19:07,562 INFO L82 PathProgramCache]: Analyzing trace with hash -1695133812, now seen corresponding path program 1 times [2018-12-08 18:19:07,562 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:19:07,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:19:07,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:19:07,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:19:07,563 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:19:07,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:19:07,634 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 18:19:07,635 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:19:07,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 18:19:07,635 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:19:07,636 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 18:19:07,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 18:19:07,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 18:19:07,636 INFO L87 Difference]: Start difference. First operand 157 states and 242 transitions. Second operand 4 states. [2018-12-08 18:19:07,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:19:07,799 INFO L93 Difference]: Finished difference Result 306 states and 469 transitions. [2018-12-08 18:19:07,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 18:19:07,800 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2018-12-08 18:19:07,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:19:07,801 INFO L225 Difference]: With dead ends: 306 [2018-12-08 18:19:07,801 INFO L226 Difference]: Without dead ends: 174 [2018-12-08 18:19:07,802 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-08 18:19:07,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-12-08 18:19:07,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 157. [2018-12-08 18:19:07,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-12-08 18:19:07,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 241 transitions. [2018-12-08 18:19:07,808 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 241 transitions. Word has length 61 [2018-12-08 18:19:07,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:19:07,808 INFO L480 AbstractCegarLoop]: Abstraction has 157 states and 241 transitions. [2018-12-08 18:19:07,808 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 18:19:07,808 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 241 transitions. [2018-12-08 18:19:07,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-12-08 18:19:07,809 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:19:07,809 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 18:19:07,809 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:19:07,810 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:19:07,810 INFO L82 PathProgramCache]: Analyzing trace with hash -85583116, now seen corresponding path program 1 times [2018-12-08 18:19:07,810 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:19:07,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:19:07,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:19:07,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:19:07,811 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:19:07,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:19:07,882 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 18:19:07,883 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:19:07,883 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 18:19:07,883 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:19:07,883 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 18:19:07,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 18:19:07,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 18:19:07,883 INFO L87 Difference]: Start difference. First operand 157 states and 241 transitions. Second operand 5 states. [2018-12-08 18:19:08,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:19:08,191 INFO L93 Difference]: Finished difference Result 310 states and 477 transitions. [2018-12-08 18:19:08,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 18:19:08,191 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 62 [2018-12-08 18:19:08,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:19:08,192 INFO L225 Difference]: With dead ends: 310 [2018-12-08 18:19:08,192 INFO L226 Difference]: Without dead ends: 178 [2018-12-08 18:19:08,193 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-08 18:19:08,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-12-08 18:19:08,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 177. [2018-12-08 18:19:08,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-12-08 18:19:08,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 267 transitions. [2018-12-08 18:19:08,203 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 267 transitions. Word has length 62 [2018-12-08 18:19:08,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:19:08,204 INFO L480 AbstractCegarLoop]: Abstraction has 177 states and 267 transitions. [2018-12-08 18:19:08,204 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 18:19:08,204 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 267 transitions. [2018-12-08 18:19:08,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-12-08 18:19:08,205 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:19:08,206 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 18:19:08,206 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:19:08,206 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:19:08,206 INFO L82 PathProgramCache]: Analyzing trace with hash -1712183139, now seen corresponding path program 1 times [2018-12-08 18:19:08,206 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:19:08,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:19:08,207 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:19:08,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:19:08,208 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:19:08,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:19:08,276 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 18:19:08,276 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:19:08,277 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 18:19:08,277 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:19:08,277 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 18:19:08,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 18:19:08,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 18:19:08,278 INFO L87 Difference]: Start difference. First operand 177 states and 267 transitions. Second operand 4 states. [2018-12-08 18:19:08,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:19:08,453 INFO L93 Difference]: Finished difference Result 343 states and 517 transitions. [2018-12-08 18:19:08,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 18:19:08,453 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2018-12-08 18:19:08,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:19:08,454 INFO L225 Difference]: With dead ends: 343 [2018-12-08 18:19:08,454 INFO L226 Difference]: Without dead ends: 191 [2018-12-08 18:19:08,455 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-08 18:19:08,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2018-12-08 18:19:08,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 177. [2018-12-08 18:19:08,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-12-08 18:19:08,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 266 transitions. [2018-12-08 18:19:08,463 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 266 transitions. Word has length 62 [2018-12-08 18:19:08,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:19:08,464 INFO L480 AbstractCegarLoop]: Abstraction has 177 states and 266 transitions. [2018-12-08 18:19:08,464 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 18:19:08,464 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 266 transitions. [2018-12-08 18:19:08,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-12-08 18:19:08,465 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:19:08,465 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 18:19:08,465 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:19:08,466 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:19:08,466 INFO L82 PathProgramCache]: Analyzing trace with hash -1571456452, now seen corresponding path program 1 times [2018-12-08 18:19:08,466 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:19:08,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:19:08,467 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:19:08,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:19:08,467 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:19:08,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:19:08,538 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 18:19:08,538 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:19:08,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 18:19:08,538 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:19:08,539 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 18:19:08,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 18:19:08,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 18:19:08,539 INFO L87 Difference]: Start difference. First operand 177 states and 266 transitions. Second operand 4 states. [2018-12-08 18:19:08,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:19:08,697 INFO L93 Difference]: Finished difference Result 342 states and 515 transitions. [2018-12-08 18:19:08,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 18:19:08,698 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2018-12-08 18:19:08,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:19:08,698 INFO L225 Difference]: With dead ends: 342 [2018-12-08 18:19:08,698 INFO L226 Difference]: Without dead ends: 190 [2018-12-08 18:19:08,699 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-08 18:19:08,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2018-12-08 18:19:08,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 177. [2018-12-08 18:19:08,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-12-08 18:19:08,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 265 transitions. [2018-12-08 18:19:08,703 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 265 transitions. Word has length 62 [2018-12-08 18:19:08,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:19:08,703 INFO L480 AbstractCegarLoop]: Abstraction has 177 states and 265 transitions. [2018-12-08 18:19:08,703 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 18:19:08,703 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 265 transitions. [2018-12-08 18:19:08,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-08 18:19:08,704 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:19:08,704 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 18:19:08,704 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:19:08,704 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:19:08,704 INFO L82 PathProgramCache]: Analyzing trace with hash 420222575, now seen corresponding path program 1 times [2018-12-08 18:19:08,704 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:19:08,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:19:08,705 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:19:08,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:19:08,705 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:19:08,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:19:08,739 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 18:19:08,740 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:19:08,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 18:19:08,740 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:19:08,740 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 18:19:08,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 18:19:08,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 18:19:08,741 INFO L87 Difference]: Start difference. First operand 177 states and 265 transitions. Second operand 4 states. [2018-12-08 18:19:08,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:19:08,891 INFO L93 Difference]: Finished difference Result 342 states and 514 transitions. [2018-12-08 18:19:08,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 18:19:08,891 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2018-12-08 18:19:08,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:19:08,892 INFO L225 Difference]: With dead ends: 342 [2018-12-08 18:19:08,892 INFO L226 Difference]: Without dead ends: 190 [2018-12-08 18:19:08,892 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-08 18:19:08,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2018-12-08 18:19:08,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 177. [2018-12-08 18:19:08,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-12-08 18:19:08,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 264 transitions. [2018-12-08 18:19:08,897 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 264 transitions. Word has length 63 [2018-12-08 18:19:08,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:19:08,897 INFO L480 AbstractCegarLoop]: Abstraction has 177 states and 264 transitions. [2018-12-08 18:19:08,897 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 18:19:08,897 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 264 transitions. [2018-12-08 18:19:08,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-08 18:19:08,898 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:19:08,898 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 18:19:08,898 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:19:08,898 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:19:08,898 INFO L82 PathProgramCache]: Analyzing trace with hash 1528243712, now seen corresponding path program 1 times [2018-12-08 18:19:08,898 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:19:08,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:19:08,899 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:19:08,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:19:08,899 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:19:08,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:19:08,942 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 18:19:08,942 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:19:08,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 18:19:08,942 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:19:08,943 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 18:19:08,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 18:19:08,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 18:19:08,943 INFO L87 Difference]: Start difference. First operand 177 states and 264 transitions. Second operand 4 states. [2018-12-08 18:19:09,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:19:09,085 INFO L93 Difference]: Finished difference Result 342 states and 513 transitions. [2018-12-08 18:19:09,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 18:19:09,086 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2018-12-08 18:19:09,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:19:09,087 INFO L225 Difference]: With dead ends: 342 [2018-12-08 18:19:09,087 INFO L226 Difference]: Without dead ends: 190 [2018-12-08 18:19:09,087 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-08 18:19:09,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2018-12-08 18:19:09,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 177. [2018-12-08 18:19:09,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-12-08 18:19:09,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 263 transitions. [2018-12-08 18:19:09,091 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 263 transitions. Word has length 64 [2018-12-08 18:19:09,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:19:09,091 INFO L480 AbstractCegarLoop]: Abstraction has 177 states and 263 transitions. [2018-12-08 18:19:09,091 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 18:19:09,091 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 263 transitions. [2018-12-08 18:19:09,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-08 18:19:09,092 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:19:09,092 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 18:19:09,092 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:19:09,092 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:19:09,092 INFO L82 PathProgramCache]: Analyzing trace with hash 1666509205, now seen corresponding path program 1 times [2018-12-08 18:19:09,092 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:19:09,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:19:09,093 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:19:09,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:19:09,093 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:19:09,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:19:09,137 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 18:19:09,137 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:19:09,137 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 18:19:09,137 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:19:09,138 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 18:19:09,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 18:19:09,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 18:19:09,138 INFO L87 Difference]: Start difference. First operand 177 states and 263 transitions. Second operand 4 states. [2018-12-08 18:19:09,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:19:09,308 INFO L93 Difference]: Finished difference Result 371 states and 559 transitions. [2018-12-08 18:19:09,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 18:19:09,308 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2018-12-08 18:19:09,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:19:09,309 INFO L225 Difference]: With dead ends: 371 [2018-12-08 18:19:09,309 INFO L226 Difference]: Without dead ends: 219 [2018-12-08 18:19:09,310 INFO L631 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 [2018-12-08 18:19:09,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2018-12-08 18:19:09,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 199. [2018-12-08 18:19:09,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-12-08 18:19:09,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 300 transitions. [2018-12-08 18:19:09,315 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 300 transitions. Word has length 65 [2018-12-08 18:19:09,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:19:09,315 INFO L480 AbstractCegarLoop]: Abstraction has 199 states and 300 transitions. [2018-12-08 18:19:09,315 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 18:19:09,315 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 300 transitions. [2018-12-08 18:19:09,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-08 18:19:09,316 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:19:09,316 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 18:19:09,316 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:19:09,316 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:19:09,316 INFO L82 PathProgramCache]: Analyzing trace with hash -1513044012, now seen corresponding path program 1 times [2018-12-08 18:19:09,316 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:19:09,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:19:09,317 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:19:09,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:19:09,317 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:19:09,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:19:09,363 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 18:19:09,363 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:19:09,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 18:19:09,363 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:19:09,363 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 18:19:09,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 18:19:09,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 18:19:09,363 INFO L87 Difference]: Start difference. First operand 199 states and 300 transitions. Second operand 4 states. [2018-12-08 18:19:09,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:19:09,494 INFO L93 Difference]: Finished difference Result 386 states and 586 transitions. [2018-12-08 18:19:09,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 18:19:09,494 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2018-12-08 18:19:09,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:19:09,495 INFO L225 Difference]: With dead ends: 386 [2018-12-08 18:19:09,495 INFO L226 Difference]: Without dead ends: 212 [2018-12-08 18:19:09,495 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-08 18:19:09,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2018-12-08 18:19:09,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 199. [2018-12-08 18:19:09,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-12-08 18:19:09,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 299 transitions. [2018-12-08 18:19:09,500 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 299 transitions. Word has length 65 [2018-12-08 18:19:09,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:19:09,500 INFO L480 AbstractCegarLoop]: Abstraction has 199 states and 299 transitions. [2018-12-08 18:19:09,500 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 18:19:09,500 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 299 transitions. [2018-12-08 18:19:09,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-08 18:19:09,501 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:19:09,501 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 18:19:09,501 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:19:09,501 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:19:09,502 INFO L82 PathProgramCache]: Analyzing trace with hash -38920251, now seen corresponding path program 1 times [2018-12-08 18:19:09,502 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:19:09,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:19:09,502 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:19:09,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:19:09,503 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:19:09,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:19:09,534 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 18:19:09,534 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:19:09,534 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 18:19:09,534 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:19:09,535 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 18:19:09,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 18:19:09,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 18:19:09,535 INFO L87 Difference]: Start difference. First operand 199 states and 299 transitions. Second operand 4 states. [2018-12-08 18:19:09,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:19:09,671 INFO L93 Difference]: Finished difference Result 376 states and 573 transitions. [2018-12-08 18:19:09,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 18:19:09,671 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2018-12-08 18:19:09,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:19:09,672 INFO L225 Difference]: With dead ends: 376 [2018-12-08 18:19:09,672 INFO L226 Difference]: Without dead ends: 202 [2018-12-08 18:19:09,672 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-08 18:19:09,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2018-12-08 18:19:09,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 199. [2018-12-08 18:19:09,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-12-08 18:19:09,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 298 transitions. [2018-12-08 18:19:09,676 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 298 transitions. Word has length 66 [2018-12-08 18:19:09,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:19:09,676 INFO L480 AbstractCegarLoop]: Abstraction has 199 states and 298 transitions. [2018-12-08 18:19:09,676 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 18:19:09,676 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 298 transitions. [2018-12-08 18:19:09,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-08 18:19:09,677 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:19:09,677 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 18:19:09,677 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:19:09,677 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:19:09,677 INFO L82 PathProgramCache]: Analyzing trace with hash 690517208, now seen corresponding path program 1 times [2018-12-08 18:19:09,677 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:19:09,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:19:09,678 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:19:09,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:19:09,678 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:19:09,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:19:09,706 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 18:19:09,706 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:19:09,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 18:19:09,706 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:19:09,707 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 18:19:09,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 18:19:09,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 18:19:09,707 INFO L87 Difference]: Start difference. First operand 199 states and 298 transitions. Second operand 4 states. [2018-12-08 18:19:09,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:19:09,850 INFO L93 Difference]: Finished difference Result 393 states and 593 transitions. [2018-12-08 18:19:09,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 18:19:09,851 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2018-12-08 18:19:09,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:19:09,851 INFO L225 Difference]: With dead ends: 393 [2018-12-08 18:19:09,852 INFO L226 Difference]: Without dead ends: 219 [2018-12-08 18:19:09,852 INFO L631 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 [2018-12-08 18:19:09,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2018-12-08 18:19:09,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 199. [2018-12-08 18:19:09,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-12-08 18:19:09,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 297 transitions. [2018-12-08 18:19:09,857 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 297 transitions. Word has length 78 [2018-12-08 18:19:09,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:19:09,857 INFO L480 AbstractCegarLoop]: Abstraction has 199 states and 297 transitions. [2018-12-08 18:19:09,857 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 18:19:09,857 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 297 transitions. [2018-12-08 18:19:09,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-12-08 18:19:09,858 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:19:09,858 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 18:19:09,858 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:19:09,858 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:19:09,858 INFO L82 PathProgramCache]: Analyzing trace with hash -771445551, now seen corresponding path program 1 times [2018-12-08 18:19:09,858 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:19:09,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:19:09,859 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:19:09,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:19:09,859 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:19:09,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:19:09,899 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 18:19:09,899 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:19:09,899 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 18:19:09,899 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:19:09,900 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 18:19:09,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 18:19:09,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 18:19:09,900 INFO L87 Difference]: Start difference. First operand 199 states and 297 transitions. Second operand 4 states. [2018-12-08 18:19:10,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:19:10,085 INFO L93 Difference]: Finished difference Result 391 states and 589 transitions. [2018-12-08 18:19:10,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 18:19:10,086 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2018-12-08 18:19:10,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:19:10,086 INFO L225 Difference]: With dead ends: 391 [2018-12-08 18:19:10,087 INFO L226 Difference]: Without dead ends: 217 [2018-12-08 18:19:10,087 INFO L631 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 [2018-12-08 18:19:10,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2018-12-08 18:19:10,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 199. [2018-12-08 18:19:10,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-12-08 18:19:10,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 296 transitions. [2018-12-08 18:19:10,093 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 296 transitions. Word has length 79 [2018-12-08 18:19:10,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:19:10,093 INFO L480 AbstractCegarLoop]: Abstraction has 199 states and 296 transitions. [2018-12-08 18:19:10,093 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 18:19:10,093 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 296 transitions. [2018-12-08 18:19:10,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-12-08 18:19:10,094 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:19:10,094 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 18:19:10,094 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:19:10,094 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:19:10,094 INFO L82 PathProgramCache]: Analyzing trace with hash -630718864, now seen corresponding path program 1 times [2018-12-08 18:19:10,094 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:19:10,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:19:10,095 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:19:10,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:19:10,095 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:19:10,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:19:10,137 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 18:19:10,138 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:19:10,138 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 18:19:10,138 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:19:10,138 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 18:19:10,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 18:19:10,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 18:19:10,139 INFO L87 Difference]: Start difference. First operand 199 states and 296 transitions. Second operand 4 states. [2018-12-08 18:19:10,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:19:10,329 INFO L93 Difference]: Finished difference Result 390 states and 586 transitions. [2018-12-08 18:19:10,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 18:19:10,330 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2018-12-08 18:19:10,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:19:10,331 INFO L225 Difference]: With dead ends: 390 [2018-12-08 18:19:10,331 INFO L226 Difference]: Without dead ends: 216 [2018-12-08 18:19:10,331 INFO L631 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 [2018-12-08 18:19:10,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2018-12-08 18:19:10,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 199. [2018-12-08 18:19:10,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-12-08 18:19:10,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 295 transitions. [2018-12-08 18:19:10,338 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 295 transitions. Word has length 79 [2018-12-08 18:19:10,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:19:10,338 INFO L480 AbstractCegarLoop]: Abstraction has 199 states and 295 transitions. [2018-12-08 18:19:10,338 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 18:19:10,338 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 295 transitions. [2018-12-08 18:19:10,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-12-08 18:19:10,339 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:19:10,339 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 18:19:10,339 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:19:10,340 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:19:10,340 INFO L82 PathProgramCache]: Analyzing trace with hash -481683269, now seen corresponding path program 1 times [2018-12-08 18:19:10,340 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:19:10,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:19:10,341 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:19:10,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:19:10,341 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:19:10,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:19:10,391 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 18:19:10,391 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:19:10,392 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 18:19:10,392 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:19:10,392 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 18:19:10,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 18:19:10,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-08 18:19:10,392 INFO L87 Difference]: Start difference. First operand 199 states and 295 transitions. Second operand 4 states. [2018-12-08 18:19:10,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:19:10,557 INFO L93 Difference]: Finished difference Result 390 states and 584 transitions. [2018-12-08 18:19:10,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 18:19:10,557 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2018-12-08 18:19:10,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:19:10,558 INFO L225 Difference]: With dead ends: 390 [2018-12-08 18:19:10,558 INFO L226 Difference]: Without dead ends: 216 [2018-12-08 18:19:10,558 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-08 18:19:10,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2018-12-08 18:19:10,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 199. [2018-12-08 18:19:10,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-12-08 18:19:10,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 294 transitions. [2018-12-08 18:19:10,562 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 294 transitions. Word has length 80 [2018-12-08 18:19:10,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:19:10,562 INFO L480 AbstractCegarLoop]: Abstraction has 199 states and 294 transitions. [2018-12-08 18:19:10,563 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 18:19:10,563 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 294 transitions. [2018-12-08 18:19:10,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-12-08 18:19:10,563 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:19:10,563 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 18:19:10,563 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:19:10,563 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:19:10,563 INFO L82 PathProgramCache]: Analyzing trace with hash -661033676, now seen corresponding path program 1 times [2018-12-08 18:19:10,563 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:19:10,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:19:10,564 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:19:10,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:19:10,564 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:19:10,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:19:10,603 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 18:19:10,603 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:19:10,604 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 18:19:10,604 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:19:10,604 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 18:19:10,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 18:19:10,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-08 18:19:10,604 INFO L87 Difference]: Start difference. First operand 199 states and 294 transitions. Second operand 4 states. [2018-12-08 18:19:10,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:19:10,758 INFO L93 Difference]: Finished difference Result 390 states and 582 transitions. [2018-12-08 18:19:10,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 18:19:10,758 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2018-12-08 18:19:10,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:19:10,759 INFO L225 Difference]: With dead ends: 390 [2018-12-08 18:19:10,759 INFO L226 Difference]: Without dead ends: 216 [2018-12-08 18:19:10,759 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-08 18:19:10,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2018-12-08 18:19:10,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 199. [2018-12-08 18:19:10,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-12-08 18:19:10,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 293 transitions. [2018-12-08 18:19:10,765 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 293 transitions. Word has length 81 [2018-12-08 18:19:10,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:19:10,765 INFO L480 AbstractCegarLoop]: Abstraction has 199 states and 293 transitions. [2018-12-08 18:19:10,765 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 18:19:10,765 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 293 transitions. [2018-12-08 18:19:10,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-08 18:19:10,766 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:19:10,766 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 18:19:10,766 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:19:10,766 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:19:10,767 INFO L82 PathProgramCache]: Analyzing trace with hash -661166304, now seen corresponding path program 1 times [2018-12-08 18:19:10,767 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:19:10,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:19:10,768 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:19:10,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:19:10,768 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:19:10,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:19:10,806 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 18:19:10,806 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:19:10,806 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 18:19:10,806 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:19:10,806 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 18:19:10,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 18:19:10,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 18:19:10,807 INFO L87 Difference]: Start difference. First operand 199 states and 293 transitions. Second operand 4 states. [2018-12-08 18:19:10,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:19:10,995 INFO L93 Difference]: Finished difference Result 390 states and 580 transitions. [2018-12-08 18:19:10,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 18:19:10,996 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 82 [2018-12-08 18:19:10,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:19:10,997 INFO L225 Difference]: With dead ends: 390 [2018-12-08 18:19:10,997 INFO L226 Difference]: Without dead ends: 216 [2018-12-08 18:19:10,997 INFO L631 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 [2018-12-08 18:19:10,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2018-12-08 18:19:11,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 199. [2018-12-08 18:19:11,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-12-08 18:19:11,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 292 transitions. [2018-12-08 18:19:11,004 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 292 transitions. Word has length 82 [2018-12-08 18:19:11,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:19:11,004 INFO L480 AbstractCegarLoop]: Abstraction has 199 states and 292 transitions. [2018-12-08 18:19:11,004 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 18:19:11,004 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 292 transitions. [2018-12-08 18:19:11,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-12-08 18:19:11,005 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:19:11,005 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 18:19:11,005 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:19:11,006 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:19:11,006 INFO L82 PathProgramCache]: Analyzing trace with hash 599484921, now seen corresponding path program 1 times [2018-12-08 18:19:11,006 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:19:11,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:19:11,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:19:11,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:19:11,007 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:19:11,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:19:11,057 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 18:19:11,057 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:19:11,057 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 18:19:11,057 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:19:11,058 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 18:19:11,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 18:19:11,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-08 18:19:11,058 INFO L87 Difference]: Start difference. First operand 199 states and 292 transitions. Second operand 4 states. [2018-12-08 18:19:11,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:19:11,191 INFO L93 Difference]: Finished difference Result 380 states and 566 transitions. [2018-12-08 18:19:11,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 18:19:11,192 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 83 [2018-12-08 18:19:11,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:19:11,193 INFO L225 Difference]: With dead ends: 380 [2018-12-08 18:19:11,193 INFO L226 Difference]: Without dead ends: 206 [2018-12-08 18:19:11,193 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-08 18:19:11,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2018-12-08 18:19:11,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 199. [2018-12-08 18:19:11,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-12-08 18:19:11,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 291 transitions. [2018-12-08 18:19:11,198 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 291 transitions. Word has length 83 [2018-12-08 18:19:11,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:19:11,198 INFO L480 AbstractCegarLoop]: Abstraction has 199 states and 291 transitions. [2018-12-08 18:19:11,198 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 18:19:11,198 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 291 transitions. [2018-12-08 18:19:11,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-12-08 18:19:11,199 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:19:11,199 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 18:19:11,199 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:19:11,200 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:19:11,200 INFO L82 PathProgramCache]: Analyzing trace with hash -401384415, now seen corresponding path program 1 times [2018-12-08 18:19:11,200 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:19:11,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:19:11,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:19:11,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:19:11,201 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:19:11,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:19:11,247 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-08 18:19:11,247 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:19:11,247 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 18:19:11,247 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:19:11,247 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 18:19:11,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 18:19:11,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 18:19:11,248 INFO L87 Difference]: Start difference. First operand 199 states and 291 transitions. Second operand 4 states. [2018-12-08 18:19:11,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:19:11,490 INFO L93 Difference]: Finished difference Result 483 states and 724 transitions. [2018-12-08 18:19:11,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 18:19:11,490 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2018-12-08 18:19:11,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:19:11,491 INFO L225 Difference]: With dead ends: 483 [2018-12-08 18:19:11,492 INFO L226 Difference]: Without dead ends: 309 [2018-12-08 18:19:11,492 INFO L631 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 [2018-12-08 18:19:11,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2018-12-08 18:19:11,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 240. [2018-12-08 18:19:11,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2018-12-08 18:19:11,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 364 transitions. [2018-12-08 18:19:11,500 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 364 transitions. Word has length 87 [2018-12-08 18:19:11,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:19:11,500 INFO L480 AbstractCegarLoop]: Abstraction has 240 states and 364 transitions. [2018-12-08 18:19:11,500 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 18:19:11,500 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 364 transitions. [2018-12-08 18:19:11,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-12-08 18:19:11,501 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:19:11,501 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 18:19:11,501 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:19:11,502 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:19:11,502 INFO L82 PathProgramCache]: Analyzing trace with hash -1773191713, now seen corresponding path program 1 times [2018-12-08 18:19:11,502 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:19:11,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:19:11,502 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:19:11,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:19:11,503 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:19:11,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:19:11,546 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-08 18:19:11,546 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:19:11,546 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 18:19:11,546 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:19:11,546 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 18:19:11,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 18:19:11,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 18:19:11,547 INFO L87 Difference]: Start difference. First operand 240 states and 364 transitions. Second operand 4 states. [2018-12-08 18:19:11,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:19:11,743 INFO L93 Difference]: Finished difference Result 504 states and 774 transitions. [2018-12-08 18:19:11,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 18:19:11,743 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2018-12-08 18:19:11,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:19:11,744 INFO L225 Difference]: With dead ends: 504 [2018-12-08 18:19:11,744 INFO L226 Difference]: Without dead ends: 289 [2018-12-08 18:19:11,744 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-08 18:19:11,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2018-12-08 18:19:11,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 264. [2018-12-08 18:19:11,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2018-12-08 18:19:11,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 405 transitions. [2018-12-08 18:19:11,749 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 405 transitions. Word has length 87 [2018-12-08 18:19:11,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:19:11,749 INFO L480 AbstractCegarLoop]: Abstraction has 264 states and 405 transitions. [2018-12-08 18:19:11,749 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 18:19:11,749 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 405 transitions. [2018-12-08 18:19:11,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-12-08 18:19:11,750 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:19:11,750 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 18:19:11,750 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:19:11,750 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:19:11,750 INFO L82 PathProgramCache]: Analyzing trace with hash 201712277, now seen corresponding path program 1 times [2018-12-08 18:19:11,750 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:19:11,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:19:11,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:19:11,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:19:11,751 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:19:11,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:19:11,782 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-08 18:19:11,782 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:19:11,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 18:19:11,782 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:19:11,782 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 18:19:11,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 18:19:11,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 18:19:11,782 INFO L87 Difference]: Start difference. First operand 264 states and 405 transitions. Second operand 4 states. [2018-12-08 18:19:12,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:19:12,017 INFO L93 Difference]: Finished difference Result 565 states and 869 transitions. [2018-12-08 18:19:12,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 18:19:12,017 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2018-12-08 18:19:12,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:19:12,018 INFO L225 Difference]: With dead ends: 565 [2018-12-08 18:19:12,018 INFO L226 Difference]: Without dead ends: 326 [2018-12-08 18:19:12,019 INFO L631 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 [2018-12-08 18:19:12,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2018-12-08 18:19:12,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 265. [2018-12-08 18:19:12,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2018-12-08 18:19:12,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 406 transitions. [2018-12-08 18:19:12,033 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 406 transitions. Word has length 88 [2018-12-08 18:19:12,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:19:12,033 INFO L480 AbstractCegarLoop]: Abstraction has 265 states and 406 transitions. [2018-12-08 18:19:12,033 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 18:19:12,033 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 406 transitions. [2018-12-08 18:19:12,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-08 18:19:12,033 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:19:12,034 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 18:19:12,034 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:19:12,034 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:19:12,034 INFO L82 PathProgramCache]: Analyzing trace with hash 306021836, now seen corresponding path program 1 times [2018-12-08 18:19:12,034 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:19:12,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:19:12,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:19:12,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:19:12,035 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:19:12,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:19:12,067 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-08 18:19:12,067 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:19:12,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 18:19:12,067 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:19:12,067 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 18:19:12,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 18:19:12,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 18:19:12,067 INFO L87 Difference]: Start difference. First operand 265 states and 406 transitions. Second operand 4 states. [2018-12-08 18:19:12,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:19:12,293 INFO L93 Difference]: Finished difference Result 566 states and 869 transitions. [2018-12-08 18:19:12,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 18:19:12,294 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2018-12-08 18:19:12,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:19:12,295 INFO L225 Difference]: With dead ends: 566 [2018-12-08 18:19:12,295 INFO L226 Difference]: Without dead ends: 326 [2018-12-08 18:19:12,295 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-08 18:19:12,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2018-12-08 18:19:12,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 265. [2018-12-08 18:19:12,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2018-12-08 18:19:12,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 405 transitions. [2018-12-08 18:19:12,301 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 405 transitions. Word has length 100 [2018-12-08 18:19:12,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:19:12,301 INFO L480 AbstractCegarLoop]: Abstraction has 265 states and 405 transitions. [2018-12-08 18:19:12,301 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 18:19:12,301 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 405 transitions. [2018-12-08 18:19:12,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-08 18:19:12,302 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:19:12,302 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 18:19:12,302 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:19:12,302 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:19:12,302 INFO L82 PathProgramCache]: Analyzing trace with hash 749922510, now seen corresponding path program 1 times [2018-12-08 18:19:12,302 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:19:12,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:19:12,303 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:19:12,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:19:12,303 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:19:12,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:19:12,334 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-08 18:19:12,334 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:19:12,334 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 18:19:12,334 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:19:12,334 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 18:19:12,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 18:19:12,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 18:19:12,335 INFO L87 Difference]: Start difference. First operand 265 states and 405 transitions. Second operand 4 states. [2018-12-08 18:19:12,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:19:12,493 INFO L93 Difference]: Finished difference Result 530 states and 814 transitions. [2018-12-08 18:19:12,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 18:19:12,493 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2018-12-08 18:19:12,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:19:12,494 INFO L225 Difference]: With dead ends: 530 [2018-12-08 18:19:12,494 INFO L226 Difference]: Without dead ends: 290 [2018-12-08 18:19:12,495 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-08 18:19:12,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2018-12-08 18:19:12,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 265. [2018-12-08 18:19:12,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2018-12-08 18:19:12,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 404 transitions. [2018-12-08 18:19:12,501 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 404 transitions. Word has length 100 [2018-12-08 18:19:12,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:19:12,501 INFO L480 AbstractCegarLoop]: Abstraction has 265 states and 404 transitions. [2018-12-08 18:19:12,501 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 18:19:12,501 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 404 transitions. [2018-12-08 18:19:12,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-12-08 18:19:12,502 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:19:12,502 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 18:19:12,502 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:19:12,502 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:19:12,502 INFO L82 PathProgramCache]: Analyzing trace with hash 194099805, now seen corresponding path program 1 times [2018-12-08 18:19:12,502 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:19:12,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:19:12,503 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:19:12,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:19:12,503 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:19:12,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:19:12,538 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-08 18:19:12,538 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:19:12,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 18:19:12,538 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:19:12,538 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 18:19:12,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 18:19:12,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 18:19:12,539 INFO L87 Difference]: Start difference. First operand 265 states and 404 transitions. Second operand 4 states. [2018-12-08 18:19:12,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:19:12,767 INFO L93 Difference]: Finished difference Result 564 states and 863 transitions. [2018-12-08 18:19:12,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 18:19:12,768 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2018-12-08 18:19:12,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:19:12,769 INFO L225 Difference]: With dead ends: 564 [2018-12-08 18:19:12,769 INFO L226 Difference]: Without dead ends: 324 [2018-12-08 18:19:12,769 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-08 18:19:12,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2018-12-08 18:19:12,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 265. [2018-12-08 18:19:12,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2018-12-08 18:19:12,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 403 transitions. [2018-12-08 18:19:12,776 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 403 transitions. Word has length 101 [2018-12-08 18:19:12,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:19:12,776 INFO L480 AbstractCegarLoop]: Abstraction has 265 states and 403 transitions. [2018-12-08 18:19:12,776 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 18:19:12,777 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 403 transitions. [2018-12-08 18:19:12,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-12-08 18:19:12,777 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:19:12,777 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 18:19:12,778 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:19:12,778 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:19:12,778 INFO L82 PathProgramCache]: Analyzing trace with hash 334826492, now seen corresponding path program 1 times [2018-12-08 18:19:12,778 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:19:12,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:19:12,779 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:19:12,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:19:12,779 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:19:12,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:19:12,810 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-08 18:19:12,811 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:19:12,811 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 18:19:12,811 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:19:12,811 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 18:19:12,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 18:19:12,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 18:19:12,811 INFO L87 Difference]: Start difference. First operand 265 states and 403 transitions. Second operand 4 states. [2018-12-08 18:19:13,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:19:13,037 INFO L93 Difference]: Finished difference Result 563 states and 860 transitions. [2018-12-08 18:19:13,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 18:19:13,037 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2018-12-08 18:19:13,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:19:13,038 INFO L225 Difference]: With dead ends: 563 [2018-12-08 18:19:13,038 INFO L226 Difference]: Without dead ends: 323 [2018-12-08 18:19:13,039 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-08 18:19:13,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2018-12-08 18:19:13,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 265. [2018-12-08 18:19:13,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2018-12-08 18:19:13,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 402 transitions. [2018-12-08 18:19:13,046 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 402 transitions. Word has length 101 [2018-12-08 18:19:13,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:19:13,046 INFO L480 AbstractCegarLoop]: Abstraction has 265 states and 402 transitions. [2018-12-08 18:19:13,046 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 18:19:13,046 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 402 transitions. [2018-12-08 18:19:13,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-12-08 18:19:13,047 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:19:13,047 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 18:19:13,047 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:19:13,047 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:19:13,047 INFO L82 PathProgramCache]: Analyzing trace with hash 1070118811, now seen corresponding path program 1 times [2018-12-08 18:19:13,047 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:19:13,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:19:13,048 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:19:13,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:19:13,048 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:19:13,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:19:13,090 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-08 18:19:13,090 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:19:13,090 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 18:19:13,090 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:19:13,090 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 18:19:13,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 18:19:13,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 18:19:13,091 INFO L87 Difference]: Start difference. First operand 265 states and 402 transitions. Second operand 4 states. [2018-12-08 18:19:13,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:19:13,273 INFO L93 Difference]: Finished difference Result 528 states and 806 transitions. [2018-12-08 18:19:13,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 18:19:13,273 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2018-12-08 18:19:13,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:19:13,273 INFO L225 Difference]: With dead ends: 528 [2018-12-08 18:19:13,274 INFO L226 Difference]: Without dead ends: 288 [2018-12-08 18:19:13,274 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-08 18:19:13,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2018-12-08 18:19:13,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 265. [2018-12-08 18:19:13,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2018-12-08 18:19:13,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 401 transitions. [2018-12-08 18:19:13,280 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 401 transitions. Word has length 101 [2018-12-08 18:19:13,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:19:13,280 INFO L480 AbstractCegarLoop]: Abstraction has 265 states and 401 transitions. [2018-12-08 18:19:13,280 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 18:19:13,280 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 401 transitions. [2018-12-08 18:19:13,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-12-08 18:19:13,280 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:19:13,280 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 18:19:13,281 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:19:13,281 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:19:13,281 INFO L82 PathProgramCache]: Analyzing trace with hash 1210845498, now seen corresponding path program 1 times [2018-12-08 18:19:13,281 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:19:13,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:19:13,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:19:13,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:19:13,281 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:19:13,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:19:13,312 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-08 18:19:13,313 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:19:13,313 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 18:19:13,313 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:19:13,313 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 18:19:13,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 18:19:13,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 18:19:13,314 INFO L87 Difference]: Start difference. First operand 265 states and 401 transitions. Second operand 4 states. [2018-12-08 18:19:13,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:19:13,475 INFO L93 Difference]: Finished difference Result 527 states and 803 transitions. [2018-12-08 18:19:13,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 18:19:13,475 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2018-12-08 18:19:13,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:19:13,476 INFO L225 Difference]: With dead ends: 527 [2018-12-08 18:19:13,476 INFO L226 Difference]: Without dead ends: 287 [2018-12-08 18:19:13,477 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-08 18:19:13,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2018-12-08 18:19:13,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 265. [2018-12-08 18:19:13,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2018-12-08 18:19:13,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 400 transitions. [2018-12-08 18:19:13,482 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 400 transitions. Word has length 101 [2018-12-08 18:19:13,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:19:13,482 INFO L480 AbstractCegarLoop]: Abstraction has 265 states and 400 transitions. [2018-12-08 18:19:13,482 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 18:19:13,482 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 400 transitions. [2018-12-08 18:19:13,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-08 18:19:13,483 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:19:13,483 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 18:19:13,483 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:19:13,483 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:19:13,483 INFO L82 PathProgramCache]: Analyzing trace with hash -614548305, now seen corresponding path program 1 times [2018-12-08 18:19:13,483 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:19:13,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:19:13,484 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:19:13,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:19:13,484 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:19:13,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:19:13,509 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-08 18:19:13,509 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:19:13,509 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 18:19:13,509 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:19:13,509 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 18:19:13,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 18:19:13,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 18:19:13,510 INFO L87 Difference]: Start difference. First operand 265 states and 400 transitions. Second operand 4 states. [2018-12-08 18:19:13,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:19:13,729 INFO L93 Difference]: Finished difference Result 563 states and 854 transitions. [2018-12-08 18:19:13,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 18:19:13,730 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2018-12-08 18:19:13,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:19:13,731 INFO L225 Difference]: With dead ends: 563 [2018-12-08 18:19:13,731 INFO L226 Difference]: Without dead ends: 323 [2018-12-08 18:19:13,731 INFO L631 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 [2018-12-08 18:19:13,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2018-12-08 18:19:13,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 265. [2018-12-08 18:19:13,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2018-12-08 18:19:13,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 399 transitions. [2018-12-08 18:19:13,743 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 399 transitions. Word has length 102 [2018-12-08 18:19:13,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:19:13,743 INFO L480 AbstractCegarLoop]: Abstraction has 265 states and 399 transitions. [2018-12-08 18:19:13,743 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 18:19:13,744 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 399 transitions. [2018-12-08 18:19:13,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-08 18:19:13,744 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:19:13,745 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 18:19:13,745 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:19:13,745 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:19:13,745 INFO L82 PathProgramCache]: Analyzing trace with hash 772237105, now seen corresponding path program 1 times [2018-12-08 18:19:13,745 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:19:13,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:19:13,746 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:19:13,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:19:13,746 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:19:13,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:19:13,783 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-08 18:19:13,783 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:19:13,784 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 18:19:13,784 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:19:13,784 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 18:19:13,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 18:19:13,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 18:19:13,784 INFO L87 Difference]: Start difference. First operand 265 states and 399 transitions. Second operand 4 states. [2018-12-08 18:19:13,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:19:13,954 INFO L93 Difference]: Finished difference Result 527 states and 799 transitions. [2018-12-08 18:19:13,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 18:19:13,954 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2018-12-08 18:19:13,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:19:13,955 INFO L225 Difference]: With dead ends: 527 [2018-12-08 18:19:13,955 INFO L226 Difference]: Without dead ends: 287 [2018-12-08 18:19:13,956 INFO L631 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 [2018-12-08 18:19:13,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2018-12-08 18:19:13,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 265. [2018-12-08 18:19:13,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2018-12-08 18:19:13,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 398 transitions. [2018-12-08 18:19:13,961 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 398 transitions. Word has length 102 [2018-12-08 18:19:13,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:19:13,962 INFO L480 AbstractCegarLoop]: Abstraction has 265 states and 398 transitions. [2018-12-08 18:19:13,962 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 18:19:13,962 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 398 transitions. [2018-12-08 18:19:13,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-12-08 18:19:13,962 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:19:13,962 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 18:19:13,962 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:19:13,963 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:19:13,963 INFO L82 PathProgramCache]: Analyzing trace with hash -484882496, now seen corresponding path program 1 times [2018-12-08 18:19:13,963 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:19:13,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:19:13,963 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:19:13,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:19:13,963 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:19:13,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:19:13,995 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-08 18:19:13,995 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:19:13,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 18:19:13,995 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:19:13,996 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 18:19:13,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 18:19:13,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 18:19:13,996 INFO L87 Difference]: Start difference. First operand 265 states and 398 transitions. Second operand 4 states. [2018-12-08 18:19:14,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:19:14,193 INFO L93 Difference]: Finished difference Result 563 states and 850 transitions. [2018-12-08 18:19:14,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 18:19:14,193 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2018-12-08 18:19:14,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:19:14,194 INFO L225 Difference]: With dead ends: 563 [2018-12-08 18:19:14,194 INFO L226 Difference]: Without dead ends: 323 [2018-12-08 18:19:14,194 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-08 18:19:14,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2018-12-08 18:19:14,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 265. [2018-12-08 18:19:14,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2018-12-08 18:19:14,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 397 transitions. [2018-12-08 18:19:14,200 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 397 transitions. Word has length 103 [2018-12-08 18:19:14,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:19:14,200 INFO L480 AbstractCegarLoop]: Abstraction has 265 states and 397 transitions. [2018-12-08 18:19:14,200 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 18:19:14,200 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 397 transitions. [2018-12-08 18:19:14,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-12-08 18:19:14,201 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:19:14,201 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 18:19:14,201 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:19:14,201 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:19:14,201 INFO L82 PathProgramCache]: Analyzing trace with hash -444207746, now seen corresponding path program 1 times [2018-12-08 18:19:14,201 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:19:14,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:19:14,202 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:19:14,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:19:14,202 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:19:14,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:19:14,239 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-08 18:19:14,240 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:19:14,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 18:19:14,240 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:19:14,240 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 18:19:14,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 18:19:14,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 18:19:14,241 INFO L87 Difference]: Start difference. First operand 265 states and 397 transitions. Second operand 4 states. [2018-12-08 18:19:14,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:19:14,393 INFO L93 Difference]: Finished difference Result 527 states and 795 transitions. [2018-12-08 18:19:14,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 18:19:14,394 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2018-12-08 18:19:14,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:19:14,394 INFO L225 Difference]: With dead ends: 527 [2018-12-08 18:19:14,394 INFO L226 Difference]: Without dead ends: 287 [2018-12-08 18:19:14,395 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-08 18:19:14,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2018-12-08 18:19:14,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 265. [2018-12-08 18:19:14,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2018-12-08 18:19:14,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 396 transitions. [2018-12-08 18:19:14,401 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 396 transitions. Word has length 103 [2018-12-08 18:19:14,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:19:14,401 INFO L480 AbstractCegarLoop]: Abstraction has 265 states and 396 transitions. [2018-12-08 18:19:14,401 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 18:19:14,401 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 396 transitions. [2018-12-08 18:19:14,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-08 18:19:14,401 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:19:14,402 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 18:19:14,402 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:19:14,402 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:19:14,402 INFO L82 PathProgramCache]: Analyzing trace with hash 504552980, now seen corresponding path program 1 times [2018-12-08 18:19:14,402 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:19:14,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:19:14,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:19:14,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:19:14,403 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:19:14,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:19:14,431 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-08 18:19:14,432 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:19:14,432 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 18:19:14,432 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:19:14,432 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 18:19:14,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 18:19:14,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 18:19:14,432 INFO L87 Difference]: Start difference. First operand 265 states and 396 transitions. Second operand 4 states. [2018-12-08 18:19:14,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:19:14,635 INFO L93 Difference]: Finished difference Result 563 states and 846 transitions. [2018-12-08 18:19:14,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 18:19:14,635 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 104 [2018-12-08 18:19:14,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:19:14,636 INFO L225 Difference]: With dead ends: 563 [2018-12-08 18:19:14,636 INFO L226 Difference]: Without dead ends: 323 [2018-12-08 18:19:14,636 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-08 18:19:14,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2018-12-08 18:19:14,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 265. [2018-12-08 18:19:14,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2018-12-08 18:19:14,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 395 transitions. [2018-12-08 18:19:14,645 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 395 transitions. Word has length 104 [2018-12-08 18:19:14,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:19:14,645 INFO L480 AbstractCegarLoop]: Abstraction has 265 states and 395 transitions. [2018-12-08 18:19:14,645 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 18:19:14,645 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 395 transitions. [2018-12-08 18:19:14,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-08 18:19:14,646 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:19:14,646 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 18:19:14,646 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:19:14,646 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:19:14,647 INFO L82 PathProgramCache]: Analyzing trace with hash 1765470230, now seen corresponding path program 1 times [2018-12-08 18:19:14,647 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:19:14,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:19:14,647 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:19:14,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:19:14,648 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:19:14,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:19:14,689 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-08 18:19:14,689 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:19:14,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 18:19:14,689 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:19:14,690 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 18:19:14,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 18:19:14,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 18:19:14,690 INFO L87 Difference]: Start difference. First operand 265 states and 395 transitions. Second operand 4 states. [2018-12-08 18:19:14,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:19:14,842 INFO L93 Difference]: Finished difference Result 527 states and 791 transitions. [2018-12-08 18:19:14,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 18:19:14,842 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 104 [2018-12-08 18:19:14,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:19:14,843 INFO L225 Difference]: With dead ends: 527 [2018-12-08 18:19:14,843 INFO L226 Difference]: Without dead ends: 287 [2018-12-08 18:19:14,843 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-08 18:19:14,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2018-12-08 18:19:14,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 265. [2018-12-08 18:19:14,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2018-12-08 18:19:14,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 394 transitions. [2018-12-08 18:19:14,849 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 394 transitions. Word has length 104 [2018-12-08 18:19:14,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:19:14,850 INFO L480 AbstractCegarLoop]: Abstraction has 265 states and 394 transitions. [2018-12-08 18:19:14,850 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 18:19:14,850 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 394 transitions. [2018-12-08 18:19:14,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-12-08 18:19:14,850 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:19:14,850 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 18:19:14,850 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:19:14,850 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:19:14,850 INFO L82 PathProgramCache]: Analyzing trace with hash -1917922939, now seen corresponding path program 1 times [2018-12-08 18:19:14,851 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:19:14,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:19:14,851 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:19:14,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:19:14,851 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:19:14,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:19:14,880 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-08 18:19:14,880 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:19:14,881 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 18:19:14,881 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:19:14,881 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 18:19:14,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 18:19:14,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 18:19:14,881 INFO L87 Difference]: Start difference. First operand 265 states and 394 transitions. Second operand 4 states. [2018-12-08 18:19:15,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:19:15,139 INFO L93 Difference]: Finished difference Result 553 states and 830 transitions. [2018-12-08 18:19:15,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 18:19:15,140 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 105 [2018-12-08 18:19:15,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:19:15,141 INFO L225 Difference]: With dead ends: 553 [2018-12-08 18:19:15,141 INFO L226 Difference]: Without dead ends: 313 [2018-12-08 18:19:15,141 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-08 18:19:15,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2018-12-08 18:19:15,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 265. [2018-12-08 18:19:15,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2018-12-08 18:19:15,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 393 transitions. [2018-12-08 18:19:15,149 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 393 transitions. Word has length 105 [2018-12-08 18:19:15,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:19:15,149 INFO L480 AbstractCegarLoop]: Abstraction has 265 states and 393 transitions. [2018-12-08 18:19:15,149 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 18:19:15,149 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 393 transitions. [2018-12-08 18:19:15,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-12-08 18:19:15,150 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:19:15,150 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 18:19:15,150 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:19:15,150 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:19:15,150 INFO L82 PathProgramCache]: Analyzing trace with hash -1484193853, now seen corresponding path program 1 times [2018-12-08 18:19:15,150 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:19:15,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:19:15,151 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:19:15,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:19:15,151 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:19:15,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:19:15,182 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-08 18:19:15,183 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:19:15,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 18:19:15,183 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:19:15,183 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 18:19:15,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 18:19:15,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 18:19:15,183 INFO L87 Difference]: Start difference. First operand 265 states and 393 transitions. Second operand 4 states. [2018-12-08 18:19:15,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:19:15,340 INFO L93 Difference]: Finished difference Result 517 states and 775 transitions. [2018-12-08 18:19:15,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 18:19:15,340 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 105 [2018-12-08 18:19:15,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:19:15,341 INFO L225 Difference]: With dead ends: 517 [2018-12-08 18:19:15,341 INFO L226 Difference]: Without dead ends: 277 [2018-12-08 18:19:15,341 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-08 18:19:15,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2018-12-08 18:19:15,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 265. [2018-12-08 18:19:15,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2018-12-08 18:19:15,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 392 transitions. [2018-12-08 18:19:15,348 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 392 transitions. Word has length 105 [2018-12-08 18:19:15,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:19:15,349 INFO L480 AbstractCegarLoop]: Abstraction has 265 states and 392 transitions. [2018-12-08 18:19:15,349 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 18:19:15,349 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 392 transitions. [2018-12-08 18:19:15,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-12-08 18:19:15,349 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:19:15,350 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 18:19:15,350 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:19:15,350 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:19:15,350 INFO L82 PathProgramCache]: Analyzing trace with hash -791495905, now seen corresponding path program 1 times [2018-12-08 18:19:15,350 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:19:15,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:19:15,351 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:19:15,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:19:15,351 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:19:15,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:19:15,385 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-08 18:19:15,386 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:19:15,386 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 18:19:15,386 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:19:15,386 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 18:19:15,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 18:19:15,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 18:19:15,386 INFO L87 Difference]: Start difference. First operand 265 states and 392 transitions. Second operand 4 states. [2018-12-08 18:19:15,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:19:15,586 INFO L93 Difference]: Finished difference Result 553 states and 826 transitions. [2018-12-08 18:19:15,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 18:19:15,587 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 109 [2018-12-08 18:19:15,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:19:15,587 INFO L225 Difference]: With dead ends: 553 [2018-12-08 18:19:15,587 INFO L226 Difference]: Without dead ends: 313 [2018-12-08 18:19:15,588 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-08 18:19:15,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2018-12-08 18:19:15,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 265. [2018-12-08 18:19:15,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2018-12-08 18:19:15,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 391 transitions. [2018-12-08 18:19:15,596 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 391 transitions. Word has length 109 [2018-12-08 18:19:15,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:19:15,596 INFO L480 AbstractCegarLoop]: Abstraction has 265 states and 391 transitions. [2018-12-08 18:19:15,596 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 18:19:15,596 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 391 transitions. [2018-12-08 18:19:15,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-12-08 18:19:15,596 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:19:15,597 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 18:19:15,597 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:19:15,597 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:19:15,597 INFO L82 PathProgramCache]: Analyzing trace with hash -112223651, now seen corresponding path program 1 times [2018-12-08 18:19:15,597 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:19:15,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:19:15,598 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:19:15,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:19:15,598 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:19:15,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:19:15,632 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-12-08 18:19:15,632 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:19:15,632 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 18:19:15,632 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:19:15,632 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 18:19:15,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 18:19:15,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 18:19:15,632 INFO L87 Difference]: Start difference. First operand 265 states and 391 transitions. Second operand 4 states. [2018-12-08 18:19:15,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:19:15,797 INFO L93 Difference]: Finished difference Result 558 states and 835 transitions. [2018-12-08 18:19:15,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 18:19:15,797 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 109 [2018-12-08 18:19:15,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:19:15,798 INFO L225 Difference]: With dead ends: 558 [2018-12-08 18:19:15,798 INFO L226 Difference]: Without dead ends: 318 [2018-12-08 18:19:15,798 INFO L631 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 [2018-12-08 18:19:15,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2018-12-08 18:19:15,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 291. [2018-12-08 18:19:15,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2018-12-08 18:19:15,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 436 transitions. [2018-12-08 18:19:15,805 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 436 transitions. Word has length 109 [2018-12-08 18:19:15,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:19:15,805 INFO L480 AbstractCegarLoop]: Abstraction has 291 states and 436 transitions. [2018-12-08 18:19:15,805 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 18:19:15,805 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 436 transitions. [2018-12-08 18:19:15,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-12-08 18:19:15,806 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:19:15,806 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 18:19:15,806 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:19:15,806 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:19:15,806 INFO L82 PathProgramCache]: Analyzing trace with hash -1291133809, now seen corresponding path program 1 times [2018-12-08 18:19:15,806 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:19:15,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:19:15,806 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:19:15,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:19:15,807 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:19:15,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:19:15,847 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-08 18:19:15,847 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:19:15,847 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 18:19:15,847 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:19:15,848 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 18:19:15,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 18:19:15,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 18:19:15,848 INFO L87 Difference]: Start difference. First operand 291 states and 436 transitions. Second operand 4 states. [2018-12-08 18:19:16,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:19:16,036 INFO L93 Difference]: Finished difference Result 605 states and 914 transitions. [2018-12-08 18:19:16,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 18:19:16,036 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 112 [2018-12-08 18:19:16,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:19:16,037 INFO L225 Difference]: With dead ends: 605 [2018-12-08 18:19:16,037 INFO L226 Difference]: Without dead ends: 339 [2018-12-08 18:19:16,038 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-08 18:19:16,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2018-12-08 18:19:16,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 291. [2018-12-08 18:19:16,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2018-12-08 18:19:16,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 435 transitions. [2018-12-08 18:19:16,045 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 435 transitions. Word has length 112 [2018-12-08 18:19:16,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:19:16,045 INFO L480 AbstractCegarLoop]: Abstraction has 291 states and 435 transitions. [2018-12-08 18:19:16,045 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 18:19:16,045 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 435 transitions. [2018-12-08 18:19:16,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-08 18:19:16,046 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:19:16,046 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 18:19:16,046 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:19:16,046 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:19:16,046 INFO L82 PathProgramCache]: Analyzing trace with hash 783035232, now seen corresponding path program 1 times [2018-12-08 18:19:16,046 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:19:16,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:19:16,047 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:19:16,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:19:16,047 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:19:16,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:19:16,091 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-08 18:19:16,092 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:19:16,092 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 18:19:16,092 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:19:16,092 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 18:19:16,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 18:19:16,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 18:19:16,092 INFO L87 Difference]: Start difference. First operand 291 states and 435 transitions. Second operand 4 states. [2018-12-08 18:19:16,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:19:16,266 INFO L93 Difference]: Finished difference Result 597 states and 899 transitions. [2018-12-08 18:19:16,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 18:19:16,266 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 113 [2018-12-08 18:19:16,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:19:16,266 INFO L225 Difference]: With dead ends: 597 [2018-12-08 18:19:16,267 INFO L226 Difference]: Without dead ends: 331 [2018-12-08 18:19:16,267 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-08 18:19:16,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2018-12-08 18:19:16,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 291. [2018-12-08 18:19:16,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2018-12-08 18:19:16,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 434 transitions. [2018-12-08 18:19:16,274 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 434 transitions. Word has length 113 [2018-12-08 18:19:16,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:19:16,275 INFO L480 AbstractCegarLoop]: Abstraction has 291 states and 434 transitions. [2018-12-08 18:19:16,275 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 18:19:16,275 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 434 transitions. [2018-12-08 18:19:16,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-12-08 18:19:16,275 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:19:16,275 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 18:19:16,275 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:19:16,275 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:19:16,275 INFO L82 PathProgramCache]: Analyzing trace with hash 2124455663, now seen corresponding path program 1 times [2018-12-08 18:19:16,275 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:19:16,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:19:16,276 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:19:16,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:19:16,276 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:19:16,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:19:16,307 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-08 18:19:16,307 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:19:16,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 18:19:16,307 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:19:16,307 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 18:19:16,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 18:19:16,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 18:19:16,307 INFO L87 Difference]: Start difference. First operand 291 states and 434 transitions. Second operand 4 states. [2018-12-08 18:19:16,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:19:16,502 INFO L93 Difference]: Finished difference Result 597 states and 897 transitions. [2018-12-08 18:19:16,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 18:19:16,502 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 114 [2018-12-08 18:19:16,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:19:16,503 INFO L225 Difference]: With dead ends: 597 [2018-12-08 18:19:16,503 INFO L226 Difference]: Without dead ends: 331 [2018-12-08 18:19:16,504 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-08 18:19:16,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2018-12-08 18:19:16,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 291. [2018-12-08 18:19:16,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2018-12-08 18:19:16,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 433 transitions. [2018-12-08 18:19:16,513 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 433 transitions. Word has length 114 [2018-12-08 18:19:16,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:19:16,513 INFO L480 AbstractCegarLoop]: Abstraction has 291 states and 433 transitions. [2018-12-08 18:19:16,513 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 18:19:16,513 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 433 transitions. [2018-12-08 18:19:16,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-12-08 18:19:16,514 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:19:16,514 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 18:19:16,514 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:19:16,514 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:19:16,514 INFO L82 PathProgramCache]: Analyzing trace with hash -1206405976, now seen corresponding path program 1 times [2018-12-08 18:19:16,514 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:19:16,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:19:16,515 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:19:16,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:19:16,515 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:19:16,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:19:16,555 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-08 18:19:16,556 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:19:16,556 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 18:19:16,556 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:19:16,556 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 18:19:16,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 18:19:16,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 18:19:16,556 INFO L87 Difference]: Start difference. First operand 291 states and 433 transitions. Second operand 4 states. [2018-12-08 18:19:16,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:19:16,760 INFO L93 Difference]: Finished difference Result 597 states and 895 transitions. [2018-12-08 18:19:16,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 18:19:16,760 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 115 [2018-12-08 18:19:16,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:19:16,761 INFO L225 Difference]: With dead ends: 597 [2018-12-08 18:19:16,761 INFO L226 Difference]: Without dead ends: 331 [2018-12-08 18:19:16,761 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-08 18:19:16,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2018-12-08 18:19:16,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 291. [2018-12-08 18:19:16,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2018-12-08 18:19:16,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 432 transitions. [2018-12-08 18:19:16,770 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 432 transitions. Word has length 115 [2018-12-08 18:19:16,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:19:16,770 INFO L480 AbstractCegarLoop]: Abstraction has 291 states and 432 transitions. [2018-12-08 18:19:16,770 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 18:19:16,770 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 432 transitions. [2018-12-08 18:19:16,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-12-08 18:19:16,770 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:19:16,770 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 18:19:16,770 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:19:16,771 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:19:16,771 INFO L82 PathProgramCache]: Analyzing trace with hash 2068078112, now seen corresponding path program 1 times [2018-12-08 18:19:16,771 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:19:16,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:19:16,771 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:19:16,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:19:16,771 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:19:16,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:19:16,811 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-08 18:19:16,811 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:19:16,811 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 18:19:16,811 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:19:16,812 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 18:19:16,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 18:19:16,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 18:19:16,812 INFO L87 Difference]: Start difference. First operand 291 states and 432 transitions. Second operand 4 states. [2018-12-08 18:19:17,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:19:17,009 INFO L93 Difference]: Finished difference Result 595 states and 891 transitions. [2018-12-08 18:19:17,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 18:19:17,010 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 115 [2018-12-08 18:19:17,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:19:17,010 INFO L225 Difference]: With dead ends: 595 [2018-12-08 18:19:17,010 INFO L226 Difference]: Without dead ends: 329 [2018-12-08 18:19:17,011 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-08 18:19:17,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2018-12-08 18:19:17,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 291. [2018-12-08 18:19:17,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2018-12-08 18:19:17,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 431 transitions. [2018-12-08 18:19:17,021 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 431 transitions. Word has length 115 [2018-12-08 18:19:17,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:19:17,022 INFO L480 AbstractCegarLoop]: Abstraction has 291 states and 431 transitions. [2018-12-08 18:19:17,022 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 18:19:17,022 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 431 transitions. [2018-12-08 18:19:17,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-12-08 18:19:17,022 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:19:17,022 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 18:19:17,023 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:19:17,023 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:19:17,023 INFO L82 PathProgramCache]: Analyzing trace with hash 2032466001, now seen corresponding path program 1 times [2018-12-08 18:19:17,023 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:19:17,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:19:17,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:19:17,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:19:17,024 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:19:17,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:19:17,062 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-08 18:19:17,062 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:19:17,062 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 18:19:17,063 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:19:17,063 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 18:19:17,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 18:19:17,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 18:19:17,063 INFO L87 Difference]: Start difference. First operand 291 states and 431 transitions. Second operand 4 states. [2018-12-08 18:19:17,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:19:17,239 INFO L93 Difference]: Finished difference Result 592 states and 885 transitions. [2018-12-08 18:19:17,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 18:19:17,239 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 116 [2018-12-08 18:19:17,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:19:17,240 INFO L225 Difference]: With dead ends: 592 [2018-12-08 18:19:17,241 INFO L226 Difference]: Without dead ends: 326 [2018-12-08 18:19:17,241 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-08 18:19:17,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2018-12-08 18:19:17,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 291. [2018-12-08 18:19:17,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2018-12-08 18:19:17,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 430 transitions. [2018-12-08 18:19:17,250 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 430 transitions. Word has length 116 [2018-12-08 18:19:17,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:19:17,250 INFO L480 AbstractCegarLoop]: Abstraction has 291 states and 430 transitions. [2018-12-08 18:19:17,250 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 18:19:17,250 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 430 transitions. [2018-12-08 18:19:17,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-12-08 18:19:17,251 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:19:17,251 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 18:19:17,251 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:19:17,251 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:19:17,251 INFO L82 PathProgramCache]: Analyzing trace with hash -588722985, now seen corresponding path program 1 times [2018-12-08 18:19:17,251 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:19:17,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:19:17,252 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:19:17,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:19:17,252 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:19:17,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:19:17,294 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-08 18:19:17,294 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:19:17,294 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 18:19:17,294 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:19:17,294 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 18:19:17,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 18:19:17,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 18:19:17,295 INFO L87 Difference]: Start difference. First operand 291 states and 430 transitions. Second operand 4 states. [2018-12-08 18:19:17,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:19:17,464 INFO L93 Difference]: Finished difference Result 590 states and 880 transitions. [2018-12-08 18:19:17,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 18:19:17,464 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 116 [2018-12-08 18:19:17,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:19:17,465 INFO L225 Difference]: With dead ends: 590 [2018-12-08 18:19:17,465 INFO L226 Difference]: Without dead ends: 324 [2018-12-08 18:19:17,465 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-08 18:19:17,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2018-12-08 18:19:17,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 291. [2018-12-08 18:19:17,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2018-12-08 18:19:17,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 429 transitions. [2018-12-08 18:19:17,474 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 429 transitions. Word has length 116 [2018-12-08 18:19:17,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:19:17,474 INFO L480 AbstractCegarLoop]: Abstraction has 291 states and 429 transitions. [2018-12-08 18:19:17,474 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 18:19:17,474 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 429 transitions. [2018-12-08 18:19:17,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-12-08 18:19:17,475 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:19:17,475 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 18:19:17,475 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:19:17,475 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:19:17,475 INFO L82 PathProgramCache]: Analyzing trace with hash -1768836666, now seen corresponding path program 1 times [2018-12-08 18:19:17,475 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:19:17,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:19:17,475 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:19:17,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:19:17,476 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:19:17,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:19:17,509 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-08 18:19:17,510 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:19:17,510 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 18:19:17,510 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:19:17,510 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 18:19:17,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 18:19:17,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 18:19:17,510 INFO L87 Difference]: Start difference. First operand 291 states and 429 transitions. Second operand 4 states. [2018-12-08 18:19:17,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:19:17,678 INFO L93 Difference]: Finished difference Result 590 states and 878 transitions. [2018-12-08 18:19:17,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 18:19:17,679 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 119 [2018-12-08 18:19:17,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:19:17,679 INFO L225 Difference]: With dead ends: 590 [2018-12-08 18:19:17,679 INFO L226 Difference]: Without dead ends: 324 [2018-12-08 18:19:17,680 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-08 18:19:17,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2018-12-08 18:19:17,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 291. [2018-12-08 18:19:17,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2018-12-08 18:19:17,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 428 transitions. [2018-12-08 18:19:17,688 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 428 transitions. Word has length 119 [2018-12-08 18:19:17,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:19:17,688 INFO L480 AbstractCegarLoop]: Abstraction has 291 states and 428 transitions. [2018-12-08 18:19:17,688 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 18:19:17,688 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 428 transitions. [2018-12-08 18:19:17,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-12-08 18:19:17,689 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:19:17,689 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 18:19:17,689 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:19:17,689 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:19:17,689 INFO L82 PathProgramCache]: Analyzing trace with hash -1760309670, now seen corresponding path program 1 times [2018-12-08 18:19:17,689 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:19:17,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:19:17,690 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:19:17,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:19:17,690 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:19:17,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:19:17,730 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-08 18:19:17,730 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:19:17,730 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 18:19:17,730 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:19:17,730 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 18:19:17,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 18:19:17,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 18:19:17,730 INFO L87 Difference]: Start difference. First operand 291 states and 428 transitions. Second operand 4 states. [2018-12-08 18:19:17,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:19:17,881 INFO L93 Difference]: Finished difference Result 584 states and 867 transitions. [2018-12-08 18:19:17,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 18:19:17,882 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 120 [2018-12-08 18:19:17,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:19:17,882 INFO L225 Difference]: With dead ends: 584 [2018-12-08 18:19:17,882 INFO L226 Difference]: Without dead ends: 318 [2018-12-08 18:19:17,883 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-08 18:19:17,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2018-12-08 18:19:17,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 291. [2018-12-08 18:19:17,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2018-12-08 18:19:17,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 427 transitions. [2018-12-08 18:19:17,891 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 427 transitions. Word has length 120 [2018-12-08 18:19:17,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:19:17,891 INFO L480 AbstractCegarLoop]: Abstraction has 291 states and 427 transitions. [2018-12-08 18:19:17,891 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 18:19:17,891 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 427 transitions. [2018-12-08 18:19:17,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-12-08 18:19:17,892 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:19:17,892 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 18:19:17,892 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:19:17,892 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:19:17,892 INFO L82 PathProgramCache]: Analyzing trace with hash 2115803583, now seen corresponding path program 1 times [2018-12-08 18:19:17,892 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:19:17,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:19:17,893 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:19:17,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:19:17,893 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:19:17,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:19:17,928 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-08 18:19:17,928 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:19:17,928 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 18:19:17,928 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:19:17,928 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 18:19:17,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 18:19:17,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 18:19:17,929 INFO L87 Difference]: Start difference. First operand 291 states and 427 transitions. Second operand 4 states. [2018-12-08 18:19:18,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:19:18,092 INFO L93 Difference]: Finished difference Result 584 states and 865 transitions. [2018-12-08 18:19:18,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 18:19:18,093 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 120 [2018-12-08 18:19:18,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:19:18,093 INFO L225 Difference]: With dead ends: 584 [2018-12-08 18:19:18,093 INFO L226 Difference]: Without dead ends: 318 [2018-12-08 18:19:18,094 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-08 18:19:18,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2018-12-08 18:19:18,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 291. [2018-12-08 18:19:18,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2018-12-08 18:19:18,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 426 transitions. [2018-12-08 18:19:18,102 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 426 transitions. Word has length 120 [2018-12-08 18:19:18,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:19:18,102 INFO L480 AbstractCegarLoop]: Abstraction has 291 states and 426 transitions. [2018-12-08 18:19:18,102 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 18:19:18,102 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 426 transitions. [2018-12-08 18:19:18,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-12-08 18:19:18,103 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:19:18,103 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 18:19:18,103 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:19:18,103 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:19:18,103 INFO L82 PathProgramCache]: Analyzing trace with hash 757023499, now seen corresponding path program 1 times [2018-12-08 18:19:18,103 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:19:18,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:19:18,104 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:19:18,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:19:18,104 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:19:18,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:19:18,141 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-08 18:19:18,141 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:19:18,141 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 18:19:18,141 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:19:18,141 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 18:19:18,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 18:19:18,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 18:19:18,141 INFO L87 Difference]: Start difference. First operand 291 states and 426 transitions. Second operand 4 states. [2018-12-08 18:19:18,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:19:18,307 INFO L93 Difference]: Finished difference Result 581 states and 859 transitions. [2018-12-08 18:19:18,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 18:19:18,308 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 121 [2018-12-08 18:19:18,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:19:18,309 INFO L225 Difference]: With dead ends: 581 [2018-12-08 18:19:18,309 INFO L226 Difference]: Without dead ends: 315 [2018-12-08 18:19:18,310 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-08 18:19:18,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2018-12-08 18:19:18,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 291. [2018-12-08 18:19:18,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2018-12-08 18:19:18,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 425 transitions. [2018-12-08 18:19:18,320 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 425 transitions. Word has length 121 [2018-12-08 18:19:18,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:19:18,320 INFO L480 AbstractCegarLoop]: Abstraction has 291 states and 425 transitions. [2018-12-08 18:19:18,320 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 18:19:18,320 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 425 transitions. [2018-12-08 18:19:18,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-12-08 18:19:18,321 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:19:18,321 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 18:19:18,321 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:19:18,322 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:19:18,322 INFO L82 PathProgramCache]: Analyzing trace with hash 1226818951, now seen corresponding path program 1 times [2018-12-08 18:19:18,322 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:19:18,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:19:18,322 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:19:18,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:19:18,323 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:19:18,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:19:18,366 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-08 18:19:18,366 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:19:18,366 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 18:19:18,367 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:19:18,367 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 18:19:18,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 18:19:18,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 18:19:18,367 INFO L87 Difference]: Start difference. First operand 291 states and 425 transitions. Second operand 4 states. [2018-12-08 18:19:18,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:19:18,563 INFO L93 Difference]: Finished difference Result 581 states and 857 transitions. [2018-12-08 18:19:18,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 18:19:18,564 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 122 [2018-12-08 18:19:18,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:19:18,564 INFO L225 Difference]: With dead ends: 581 [2018-12-08 18:19:18,564 INFO L226 Difference]: Without dead ends: 315 [2018-12-08 18:19:18,565 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-08 18:19:18,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2018-12-08 18:19:18,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 291. [2018-12-08 18:19:18,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2018-12-08 18:19:18,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 424 transitions. [2018-12-08 18:19:18,574 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 424 transitions. Word has length 122 [2018-12-08 18:19:18,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:19:18,574 INFO L480 AbstractCegarLoop]: Abstraction has 291 states and 424 transitions. [2018-12-08 18:19:18,574 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 18:19:18,574 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 424 transitions. [2018-12-08 18:19:18,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-12-08 18:19:18,575 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:19:18,575 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 18:19:18,575 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:19:18,575 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:19:18,575 INFO L82 PathProgramCache]: Analyzing trace with hash -1991161584, now seen corresponding path program 1 times [2018-12-08 18:19:18,575 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:19:18,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:19:18,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:19:18,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:19:18,576 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:19:18,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:19:18,606 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2018-12-08 18:19:18,607 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:19:18,607 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 18:19:18,607 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:19:18,607 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 18:19:18,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 18:19:18,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 18:19:18,607 INFO L87 Difference]: Start difference. First operand 291 states and 424 transitions. Second operand 4 states. [2018-12-08 18:19:18,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:19:18,820 INFO L93 Difference]: Finished difference Result 629 states and 932 transitions. [2018-12-08 18:19:18,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 18:19:18,821 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 122 [2018-12-08 18:19:18,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:19:18,822 INFO L225 Difference]: With dead ends: 629 [2018-12-08 18:19:18,822 INFO L226 Difference]: Without dead ends: 363 [2018-12-08 18:19:18,822 INFO L631 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 [2018-12-08 18:19:18,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2018-12-08 18:19:18,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 323. [2018-12-08 18:19:18,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2018-12-08 18:19:18,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 481 transitions. [2018-12-08 18:19:18,832 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 481 transitions. Word has length 122 [2018-12-08 18:19:18,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:19:18,832 INFO L480 AbstractCegarLoop]: Abstraction has 323 states and 481 transitions. [2018-12-08 18:19:18,832 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 18:19:18,832 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 481 transitions. [2018-12-08 18:19:18,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-12-08 18:19:18,833 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:19:18,833 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 18:19:18,833 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:19:18,833 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:19:18,833 INFO L82 PathProgramCache]: Analyzing trace with hash -513900749, now seen corresponding path program 1 times [2018-12-08 18:19:18,833 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:19:18,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:19:18,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:19:18,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:19:18,834 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:19:18,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:19:18,878 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-08 18:19:18,878 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:19:18,878 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 18:19:18,878 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:19:18,879 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 18:19:18,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 18:19:18,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 18:19:18,879 INFO L87 Difference]: Start difference. First operand 323 states and 481 transitions. Second operand 4 states. [2018-12-08 18:19:19,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:19:19,042 INFO L93 Difference]: Finished difference Result 642 states and 965 transitions. [2018-12-08 18:19:19,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 18:19:19,043 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 123 [2018-12-08 18:19:19,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:19:19,043 INFO L225 Difference]: With dead ends: 642 [2018-12-08 18:19:19,043 INFO L226 Difference]: Without dead ends: 344 [2018-12-08 18:19:19,044 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-08 18:19:19,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2018-12-08 18:19:19,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 323. [2018-12-08 18:19:19,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2018-12-08 18:19:19,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 480 transitions. [2018-12-08 18:19:19,053 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 480 transitions. Word has length 123 [2018-12-08 18:19:19,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:19:19,053 INFO L480 AbstractCegarLoop]: Abstraction has 323 states and 480 transitions. [2018-12-08 18:19:19,053 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 18:19:19,053 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 480 transitions. [2018-12-08 18:19:19,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-12-08 18:19:19,054 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:19:19,054 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 18:19:19,054 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:19:19,054 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:19:19,054 INFO L82 PathProgramCache]: Analyzing trace with hash 2136584504, now seen corresponding path program 1 times [2018-12-08 18:19:19,054 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:19:19,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:19:19,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:19:19,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:19:19,055 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:19:19,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:19:19,088 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-12-08 18:19:19,088 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:19:19,088 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 18:19:19,088 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:19:19,088 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 18:19:19,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 18:19:19,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 18:19:19,088 INFO L87 Difference]: Start difference. First operand 323 states and 480 transitions. Second operand 4 states. [2018-12-08 18:19:19,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:19:19,335 INFO L93 Difference]: Finished difference Result 729 states and 1100 transitions. [2018-12-08 18:19:19,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 18:19:19,335 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 123 [2018-12-08 18:19:19,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:19:19,336 INFO L225 Difference]: With dead ends: 729 [2018-12-08 18:19:19,336 INFO L226 Difference]: Without dead ends: 431 [2018-12-08 18:19:19,337 INFO L631 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 [2018-12-08 18:19:19,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2018-12-08 18:19:19,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 362. [2018-12-08 18:19:19,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 362 states. [2018-12-08 18:19:19,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 551 transitions. [2018-12-08 18:19:19,349 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 551 transitions. Word has length 123 [2018-12-08 18:19:19,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:19:19,349 INFO L480 AbstractCegarLoop]: Abstraction has 362 states and 551 transitions. [2018-12-08 18:19:19,349 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 18:19:19,349 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 551 transitions. [2018-12-08 18:19:19,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-12-08 18:19:19,350 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:19:19,350 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 18:19:19,350 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:19:19,350 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:19:19,350 INFO L82 PathProgramCache]: Analyzing trace with hash -594624781, now seen corresponding path program 1 times [2018-12-08 18:19:19,350 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:19:19,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:19:19,351 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:19:19,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:19:19,351 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:19:19,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:19:19,382 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-12-08 18:19:19,382 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:19:19,382 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 18:19:19,382 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:19:19,382 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 18:19:19,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 18:19:19,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 18:19:19,383 INFO L87 Difference]: Start difference. First operand 362 states and 551 transitions. Second operand 4 states. [2018-12-08 18:19:19,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:19:19,561 INFO L93 Difference]: Finished difference Result 726 states and 1109 transitions. [2018-12-08 18:19:19,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 18:19:19,562 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 124 [2018-12-08 18:19:19,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:19:19,562 INFO L225 Difference]: With dead ends: 726 [2018-12-08 18:19:19,562 INFO L226 Difference]: Without dead ends: 389 [2018-12-08 18:19:19,563 INFO L631 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 [2018-12-08 18:19:19,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2018-12-08 18:19:19,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 362. [2018-12-08 18:19:19,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 362 states. [2018-12-08 18:19:19,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 550 transitions. [2018-12-08 18:19:19,573 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 550 transitions. Word has length 124 [2018-12-08 18:19:19,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:19:19,573 INFO L480 AbstractCegarLoop]: Abstraction has 362 states and 550 transitions. [2018-12-08 18:19:19,573 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 18:19:19,573 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 550 transitions. [2018-12-08 18:19:19,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-12-08 18:19:19,574 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:19:19,574 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 18:19:19,574 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:19:19,574 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:19:19,574 INFO L82 PathProgramCache]: Analyzing trace with hash 1569337438, now seen corresponding path program 1 times [2018-12-08 18:19:19,574 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:19:19,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:19:19,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:19:19,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:19:19,575 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:19:19,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:19:19,604 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-12-08 18:19:19,604 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:19:19,604 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 18:19:19,604 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:19:19,604 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 18:19:19,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 18:19:19,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 18:19:19,604 INFO L87 Difference]: Start difference. First operand 362 states and 550 transitions. Second operand 4 states. [2018-12-08 18:19:19,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:19:19,831 INFO L93 Difference]: Finished difference Result 761 states and 1159 transitions. [2018-12-08 18:19:19,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 18:19:19,831 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 124 [2018-12-08 18:19:19,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:19:19,832 INFO L225 Difference]: With dead ends: 761 [2018-12-08 18:19:19,832 INFO L226 Difference]: Without dead ends: 424 [2018-12-08 18:19:19,833 INFO L631 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 [2018-12-08 18:19:19,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2018-12-08 18:19:19,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 361. [2018-12-08 18:19:19,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2018-12-08 18:19:19,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 549 transitions. [2018-12-08 18:19:19,844 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 549 transitions. Word has length 124 [2018-12-08 18:19:19,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:19:19,844 INFO L480 AbstractCegarLoop]: Abstraction has 361 states and 549 transitions. [2018-12-08 18:19:19,845 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 18:19:19,845 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 549 transitions. [2018-12-08 18:19:19,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-12-08 18:19:19,845 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:19:19,845 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 18:19:19,845 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:19:19,845 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:19:19,845 INFO L82 PathProgramCache]: Analyzing trace with hash 132746748, now seen corresponding path program 1 times [2018-12-08 18:19:19,845 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:19:19,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:19:19,846 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:19:19,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:19:19,846 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:19:19,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:19:19,888 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-12-08 18:19:19,888 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:19:19,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 18:19:19,888 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:19:19,888 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 18:19:19,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 18:19:19,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 18:19:19,888 INFO L87 Difference]: Start difference. First operand 361 states and 549 transitions. Second operand 4 states. [2018-12-08 18:19:20,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:19:20,059 INFO L93 Difference]: Finished difference Result 724 states and 1105 transitions. [2018-12-08 18:19:20,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 18:19:20,060 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 125 [2018-12-08 18:19:20,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:19:20,060 INFO L225 Difference]: With dead ends: 724 [2018-12-08 18:19:20,060 INFO L226 Difference]: Without dead ends: 388 [2018-12-08 18:19:20,061 INFO L631 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 [2018-12-08 18:19:20,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2018-12-08 18:19:20,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 361. [2018-12-08 18:19:20,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2018-12-08 18:19:20,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 548 transitions. [2018-12-08 18:19:20,072 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 548 transitions. Word has length 125 [2018-12-08 18:19:20,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:19:20,072 INFO L480 AbstractCegarLoop]: Abstraction has 361 states and 548 transitions. [2018-12-08 18:19:20,072 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 18:19:20,072 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 548 transitions. [2018-12-08 18:19:20,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-12-08 18:19:20,072 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:19:20,073 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 18:19:20,073 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:19:20,073 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:19:20,073 INFO L82 PathProgramCache]: Analyzing trace with hash -1823776936, now seen corresponding path program 1 times [2018-12-08 18:19:20,073 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:19:20,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:19:20,073 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:19:20,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:19:20,073 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:19:20,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:19:20,101 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-12-08 18:19:20,101 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:19:20,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 18:19:20,101 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:19:20,102 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 18:19:20,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 18:19:20,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 18:19:20,102 INFO L87 Difference]: Start difference. First operand 361 states and 548 transitions. Second operand 4 states. [2018-12-08 18:19:20,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:19:20,272 INFO L93 Difference]: Finished difference Result 724 states and 1103 transitions. [2018-12-08 18:19:20,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 18:19:20,272 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 126 [2018-12-08 18:19:20,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:19:20,273 INFO L225 Difference]: With dead ends: 724 [2018-12-08 18:19:20,273 INFO L226 Difference]: Without dead ends: 388 [2018-12-08 18:19:20,273 INFO L631 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 [2018-12-08 18:19:20,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2018-12-08 18:19:20,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 361. [2018-12-08 18:19:20,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2018-12-08 18:19:20,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 547 transitions. [2018-12-08 18:19:20,284 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 547 transitions. Word has length 126 [2018-12-08 18:19:20,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:19:20,284 INFO L480 AbstractCegarLoop]: Abstraction has 361 states and 547 transitions. [2018-12-08 18:19:20,284 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 18:19:20,284 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 547 transitions. [2018-12-08 18:19:20,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-12-08 18:19:20,285 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:19:20,285 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 18:19:20,285 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:19:20,285 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:19:20,285 INFO L82 PathProgramCache]: Analyzing trace with hash -1081706303, now seen corresponding path program 1 times [2018-12-08 18:19:20,285 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:19:20,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:19:20,286 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:19:20,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:19:20,286 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:19:20,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:19:20,328 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-12-08 18:19:20,328 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:19:20,328 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 18:19:20,328 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:19:20,328 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 18:19:20,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 18:19:20,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 18:19:20,329 INFO L87 Difference]: Start difference. First operand 361 states and 547 transitions. Second operand 4 states. [2018-12-08 18:19:20,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:19:20,484 INFO L93 Difference]: Finished difference Result 714 states and 1089 transitions. [2018-12-08 18:19:20,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 18:19:20,485 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 127 [2018-12-08 18:19:20,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:19:20,485 INFO L225 Difference]: With dead ends: 714 [2018-12-08 18:19:20,485 INFO L226 Difference]: Without dead ends: 378 [2018-12-08 18:19:20,486 INFO L631 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 [2018-12-08 18:19:20,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2018-12-08 18:19:20,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 361. [2018-12-08 18:19:20,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2018-12-08 18:19:20,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 546 transitions. [2018-12-08 18:19:20,497 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 546 transitions. Word has length 127 [2018-12-08 18:19:20,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:19:20,497 INFO L480 AbstractCegarLoop]: Abstraction has 361 states and 546 transitions. [2018-12-08 18:19:20,497 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 18:19:20,497 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 546 transitions. [2018-12-08 18:19:20,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-12-08 18:19:20,497 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:19:20,497 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 18:19:20,497 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:19:20,497 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:19:20,498 INFO L82 PathProgramCache]: Analyzing trace with hash -719893533, now seen corresponding path program 1 times [2018-12-08 18:19:20,498 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:19:20,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:19:20,498 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:19:20,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:19:20,498 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:19:20,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:19:20,527 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-08 18:19:20,527 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:19:20,527 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 18:19:20,527 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:19:20,528 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 18:19:20,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 18:19:20,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 18:19:20,528 INFO L87 Difference]: Start difference. First operand 361 states and 546 transitions. Second operand 3 states. [2018-12-08 18:19:20,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:19:20,583 INFO L93 Difference]: Finished difference Result 1029 states and 1577 transitions. [2018-12-08 18:19:20,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 18:19:20,583 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 128 [2018-12-08 18:19:20,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:19:20,584 INFO L225 Difference]: With dead ends: 1029 [2018-12-08 18:19:20,584 INFO L226 Difference]: Without dead ends: 693 [2018-12-08 18:19:20,585 INFO L631 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 [2018-12-08 18:19:20,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 693 states. [2018-12-08 18:19:20,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 693 to 691. [2018-12-08 18:19:20,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 691 states. [2018-12-08 18:19:20,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 691 states to 691 states and 1046 transitions. [2018-12-08 18:19:20,606 INFO L78 Accepts]: Start accepts. Automaton has 691 states and 1046 transitions. Word has length 128 [2018-12-08 18:19:20,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:19:20,606 INFO L480 AbstractCegarLoop]: Abstraction has 691 states and 1046 transitions. [2018-12-08 18:19:20,606 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 18:19:20,607 INFO L276 IsEmpty]: Start isEmpty. Operand 691 states and 1046 transitions. [2018-12-08 18:19:20,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-12-08 18:19:20,607 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:19:20,607 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 18:19:20,607 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:19:20,607 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:19:20,607 INFO L82 PathProgramCache]: Analyzing trace with hash 1281950915, now seen corresponding path program 1 times [2018-12-08 18:19:20,608 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:19:20,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:19:20,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:19:20,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:19:20,608 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:19:20,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:19:20,639 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-12-08 18:19:20,639 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:19:20,639 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 18:19:20,639 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:19:20,639 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 18:19:20,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 18:19:20,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 18:19:20,639 INFO L87 Difference]: Start difference. First operand 691 states and 1046 transitions. Second operand 4 states. [2018-12-08 18:19:20,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:19:20,911 INFO L93 Difference]: Finished difference Result 1569 states and 2388 transitions. [2018-12-08 18:19:20,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 18:19:20,911 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 129 [2018-12-08 18:19:20,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:19:20,913 INFO L225 Difference]: With dead ends: 1569 [2018-12-08 18:19:20,913 INFO L226 Difference]: Without dead ends: 903 [2018-12-08 18:19:20,913 INFO L631 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 [2018-12-08 18:19:20,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 903 states. [2018-12-08 18:19:20,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 903 to 769. [2018-12-08 18:19:20,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 769 states. [2018-12-08 18:19:20,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 769 states to 769 states and 1188 transitions. [2018-12-08 18:19:20,937 INFO L78 Accepts]: Start accepts. Automaton has 769 states and 1188 transitions. Word has length 129 [2018-12-08 18:19:20,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:19:20,937 INFO L480 AbstractCegarLoop]: Abstraction has 769 states and 1188 transitions. [2018-12-08 18:19:20,937 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 18:19:20,937 INFO L276 IsEmpty]: Start isEmpty. Operand 769 states and 1188 transitions. [2018-12-08 18:19:20,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-12-08 18:19:20,937 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:19:20,937 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 18:19:20,938 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:19:20,938 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:19:20,938 INFO L82 PathProgramCache]: Analyzing trace with hash 845499955, now seen corresponding path program 1 times [2018-12-08 18:19:20,938 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:19:20,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:19:20,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:19:20,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:19:20,938 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:19:20,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:19:20,976 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-12-08 18:19:20,976 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:19:20,976 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 18:19:20,976 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:19:20,976 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 18:19:20,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 18:19:20,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 18:19:20,977 INFO L87 Difference]: Start difference. First operand 769 states and 1188 transitions. Second operand 4 states. [2018-12-08 18:19:21,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:19:21,260 INFO L93 Difference]: Finished difference Result 1637 states and 2516 transitions. [2018-12-08 18:19:21,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 18:19:21,260 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 130 [2018-12-08 18:19:21,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:19:21,262 INFO L225 Difference]: With dead ends: 1637 [2018-12-08 18:19:21,262 INFO L226 Difference]: Without dead ends: 893 [2018-12-08 18:19:21,262 INFO L631 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 [2018-12-08 18:19:21,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 893 states. [2018-12-08 18:19:21,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 893 to 691. [2018-12-08 18:19:21,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 691 states. [2018-12-08 18:19:21,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 691 states to 691 states and 1046 transitions. [2018-12-08 18:19:21,286 INFO L78 Accepts]: Start accepts. Automaton has 691 states and 1046 transitions. Word has length 130 [2018-12-08 18:19:21,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:19:21,286 INFO L480 AbstractCegarLoop]: Abstraction has 691 states and 1046 transitions. [2018-12-08 18:19:21,286 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 18:19:21,286 INFO L276 IsEmpty]: Start isEmpty. Operand 691 states and 1046 transitions. [2018-12-08 18:19:21,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-12-08 18:19:21,287 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:19:21,287 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 18:19:21,287 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:19:21,287 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:19:21,287 INFO L82 PathProgramCache]: Analyzing trace with hash 1598194120, now seen corresponding path program 1 times [2018-12-08 18:19:21,287 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:19:21,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:19:21,288 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:19:21,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:19:21,288 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:19:21,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:19:21,330 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-08 18:19:21,330 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:19:21,330 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 18:19:21,330 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:19:21,330 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 18:19:21,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 18:19:21,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 18:19:21,331 INFO L87 Difference]: Start difference. First operand 691 states and 1046 transitions. Second operand 4 states. [2018-12-08 18:19:21,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:19:21,514 INFO L93 Difference]: Finished difference Result 1389 states and 2108 transitions. [2018-12-08 18:19:21,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 18:19:21,514 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 131 [2018-12-08 18:19:21,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:19:21,516 INFO L225 Difference]: With dead ends: 1389 [2018-12-08 18:19:21,516 INFO L226 Difference]: Without dead ends: 723 [2018-12-08 18:19:21,516 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-08 18:19:21,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 723 states. [2018-12-08 18:19:21,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 723 to 697. [2018-12-08 18:19:21,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 697 states. [2018-12-08 18:19:21,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 697 states and 1052 transitions. [2018-12-08 18:19:21,539 INFO L78 Accepts]: Start accepts. Automaton has 697 states and 1052 transitions. Word has length 131 [2018-12-08 18:19:21,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:19:21,539 INFO L480 AbstractCegarLoop]: Abstraction has 697 states and 1052 transitions. [2018-12-08 18:19:21,539 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 18:19:21,539 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 1052 transitions. [2018-12-08 18:19:21,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-12-08 18:19:21,539 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:19:21,540 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 18:19:21,540 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:19:21,540 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:19:21,540 INFO L82 PathProgramCache]: Analyzing trace with hash 137982944, now seen corresponding path program 1 times [2018-12-08 18:19:21,540 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:19:21,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:19:21,541 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:19:21,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:19:21,541 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:19:21,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:19:21,570 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-12-08 18:19:21,570 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:19:21,570 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 18:19:21,570 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:19:21,570 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 18:19:21,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 18:19:21,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 18:19:21,570 INFO L87 Difference]: Start difference. First operand 697 states and 1052 transitions. Second operand 4 states. [2018-12-08 18:19:21,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:19:21,745 INFO L93 Difference]: Finished difference Result 1403 states and 2122 transitions. [2018-12-08 18:19:21,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 18:19:21,745 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 137 [2018-12-08 18:19:21,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:19:21,746 INFO L225 Difference]: With dead ends: 1403 [2018-12-08 18:19:21,746 INFO L226 Difference]: Without dead ends: 731 [2018-12-08 18:19:21,747 INFO L631 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 [2018-12-08 18:19:21,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 731 states. [2018-12-08 18:19:21,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 731 to 697. [2018-12-08 18:19:21,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 697 states. [2018-12-08 18:19:21,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 697 states and 1050 transitions. [2018-12-08 18:19:21,772 INFO L78 Accepts]: Start accepts. Automaton has 697 states and 1050 transitions. Word has length 137 [2018-12-08 18:19:21,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:19:21,772 INFO L480 AbstractCegarLoop]: Abstraction has 697 states and 1050 transitions. [2018-12-08 18:19:21,772 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 18:19:21,772 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 1050 transitions. [2018-12-08 18:19:21,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-12-08 18:19:21,773 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:19:21,773 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 18:19:21,773 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:19:21,773 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:19:21,773 INFO L82 PathProgramCache]: Analyzing trace with hash -547061532, now seen corresponding path program 1 times [2018-12-08 18:19:21,773 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:19:21,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:19:21,774 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:19:21,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:19:21,774 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:19:21,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:19:21,818 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2018-12-08 18:19:21,818 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:19:21,819 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 18:19:21,819 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:19:21,819 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 18:19:21,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 18:19:21,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 18:19:21,819 INFO L87 Difference]: Start difference. First operand 697 states and 1050 transitions. Second operand 4 states. [2018-12-08 18:19:22,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:19:22,047 INFO L93 Difference]: Finished difference Result 1495 states and 2268 transitions. [2018-12-08 18:19:22,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 18:19:22,047 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 137 [2018-12-08 18:19:22,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:19:22,049 INFO L225 Difference]: With dead ends: 1495 [2018-12-08 18:19:22,049 INFO L226 Difference]: Without dead ends: 823 [2018-12-08 18:19:22,049 INFO L631 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 [2018-12-08 18:19:22,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 823 states. [2018-12-08 18:19:22,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 823 to 753. [2018-12-08 18:19:22,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 753 states. [2018-12-08 18:19:22,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 753 states to 753 states and 1148 transitions. [2018-12-08 18:19:22,075 INFO L78 Accepts]: Start accepts. Automaton has 753 states and 1148 transitions. Word has length 137 [2018-12-08 18:19:22,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:19:22,076 INFO L480 AbstractCegarLoop]: Abstraction has 753 states and 1148 transitions. [2018-12-08 18:19:22,076 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 18:19:22,076 INFO L276 IsEmpty]: Start isEmpty. Operand 753 states and 1148 transitions. [2018-12-08 18:19:22,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-12-08 18:19:22,076 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:19:22,076 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 18:19:22,076 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:19:22,077 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:19:22,077 INFO L82 PathProgramCache]: Analyzing trace with hash -1139451337, now seen corresponding path program 1 times [2018-12-08 18:19:22,077 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:19:22,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:19:22,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:19:22,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:19:22,077 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:19:22,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:19:22,111 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 117 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-12-08 18:19:22,112 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:19:22,112 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 18:19:22,112 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:19:22,112 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 18:19:22,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 18:19:22,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 18:19:22,112 INFO L87 Difference]: Start difference. First operand 753 states and 1148 transitions. Second operand 4 states. [2018-12-08 18:19:22,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:19:22,306 INFO L93 Difference]: Finished difference Result 1511 states and 2310 transitions. [2018-12-08 18:19:22,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 18:19:22,306 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 138 [2018-12-08 18:19:22,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:19:22,309 INFO L225 Difference]: With dead ends: 1511 [2018-12-08 18:19:22,309 INFO L226 Difference]: Without dead ends: 783 [2018-12-08 18:19:22,310 INFO L631 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 [2018-12-08 18:19:22,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 783 states. [2018-12-08 18:19:22,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 783 to 753. [2018-12-08 18:19:22,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 753 states. [2018-12-08 18:19:22,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 753 states to 753 states and 1146 transitions. [2018-12-08 18:19:22,338 INFO L78 Accepts]: Start accepts. Automaton has 753 states and 1146 transitions. Word has length 138 [2018-12-08 18:19:22,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:19:22,338 INFO L480 AbstractCegarLoop]: Abstraction has 753 states and 1146 transitions. [2018-12-08 18:19:22,338 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 18:19:22,338 INFO L276 IsEmpty]: Start isEmpty. Operand 753 states and 1146 transitions. [2018-12-08 18:19:22,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-12-08 18:19:22,339 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:19:22,339 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 18:19:22,339 INFO L423 AbstractCegarLoop]: === Iteration 64 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:19:22,339 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:19:22,340 INFO L82 PathProgramCache]: Analyzing trace with hash -1038174536, now seen corresponding path program 1 times [2018-12-08 18:19:22,340 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:19:22,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:19:22,340 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:19:22,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:19:22,340 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:19:22,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:19:22,378 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-12-08 18:19:22,378 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:19:22,379 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 18:19:22,379 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:19:22,379 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 18:19:22,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 18:19:22,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 18:19:22,379 INFO L87 Difference]: Start difference. First operand 753 states and 1146 transitions. Second operand 4 states. [2018-12-08 18:19:22,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:19:22,620 INFO L93 Difference]: Finished difference Result 1683 states and 2572 transitions. [2018-12-08 18:19:22,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 18:19:22,620 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 138 [2018-12-08 18:19:22,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:19:22,622 INFO L225 Difference]: With dead ends: 1683 [2018-12-08 18:19:22,622 INFO L226 Difference]: Without dead ends: 955 [2018-12-08 18:19:22,623 INFO L631 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 [2018-12-08 18:19:22,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 955 states. [2018-12-08 18:19:22,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 955 to 777. [2018-12-08 18:19:22,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2018-12-08 18:19:22,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 1180 transitions. [2018-12-08 18:19:22,650 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 1180 transitions. Word has length 138 [2018-12-08 18:19:22,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:19:22,650 INFO L480 AbstractCegarLoop]: Abstraction has 777 states and 1180 transitions. [2018-12-08 18:19:22,650 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 18:19:22,650 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 1180 transitions. [2018-12-08 18:19:22,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-12-08 18:19:22,651 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:19:22,651 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 18:19:22,651 INFO L423 AbstractCegarLoop]: === Iteration 65 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:19:22,651 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:19:22,651 INFO L82 PathProgramCache]: Analyzing trace with hash -732393769, now seen corresponding path program 1 times [2018-12-08 18:19:22,651 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:19:22,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:19:22,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:19:22,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:19:22,652 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:19:22,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:19:22,682 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-12-08 18:19:22,682 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:19:22,682 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 18:19:22,682 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:19:22,683 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 18:19:22,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 18:19:22,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 18:19:22,683 INFO L87 Difference]: Start difference. First operand 777 states and 1180 transitions. Second operand 4 states. [2018-12-08 18:19:22,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:19:22,941 INFO L93 Difference]: Finished difference Result 1707 states and 2604 transitions. [2018-12-08 18:19:22,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 18:19:22,941 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 139 [2018-12-08 18:19:22,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:19:22,944 INFO L225 Difference]: With dead ends: 1707 [2018-12-08 18:19:22,944 INFO L226 Difference]: Without dead ends: 955 [2018-12-08 18:19:22,945 INFO L631 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 [2018-12-08 18:19:22,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 955 states. [2018-12-08 18:19:22,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 955 to 779. [2018-12-08 18:19:22,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2018-12-08 18:19:22,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 1182 transitions. [2018-12-08 18:19:22,974 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 1182 transitions. Word has length 139 [2018-12-08 18:19:22,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:19:22,974 INFO L480 AbstractCegarLoop]: Abstraction has 779 states and 1182 transitions. [2018-12-08 18:19:22,974 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 18:19:22,974 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 1182 transitions. [2018-12-08 18:19:22,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-12-08 18:19:22,975 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:19:22,975 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 18:19:22,976 INFO L423 AbstractCegarLoop]: === Iteration 66 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:19:22,976 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:19:22,976 INFO L82 PathProgramCache]: Analyzing trace with hash 1421638109, now seen corresponding path program 1 times [2018-12-08 18:19:22,976 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:19:22,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:19:22,977 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:19:22,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:19:22,977 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:19:22,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:19:23,006 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 102 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-12-08 18:19:23,007 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:19:23,007 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 18:19:23,007 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:19:23,007 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 18:19:23,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 18:19:23,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 18:19:23,007 INFO L87 Difference]: Start difference. First operand 779 states and 1182 transitions. Second operand 4 states. [2018-12-08 18:19:23,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:19:23,267 INFO L93 Difference]: Finished difference Result 1709 states and 2604 transitions. [2018-12-08 18:19:23,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 18:19:23,267 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 140 [2018-12-08 18:19:23,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:19:23,269 INFO L225 Difference]: With dead ends: 1709 [2018-12-08 18:19:23,269 INFO L226 Difference]: Without dead ends: 955 [2018-12-08 18:19:23,269 INFO L631 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 [2018-12-08 18:19:23,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 955 states. [2018-12-08 18:19:23,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 955 to 781. [2018-12-08 18:19:23,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2018-12-08 18:19:23,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 1184 transitions. [2018-12-08 18:19:23,296 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 1184 transitions. Word has length 140 [2018-12-08 18:19:23,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:19:23,296 INFO L480 AbstractCegarLoop]: Abstraction has 781 states and 1184 transitions. [2018-12-08 18:19:23,296 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 18:19:23,296 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 1184 transitions. [2018-12-08 18:19:23,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-12-08 18:19:23,297 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:19:23,297 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 18:19:23,297 INFO L423 AbstractCegarLoop]: === Iteration 67 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:19:23,297 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:19:23,297 INFO L82 PathProgramCache]: Analyzing trace with hash 741912284, now seen corresponding path program 1 times [2018-12-08 18:19:23,297 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:19:23,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:19:23,298 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:19:23,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:19:23,298 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:19:23,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:19:23,326 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-12-08 18:19:23,327 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:19:23,327 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 18:19:23,327 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:19:23,327 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 18:19:23,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 18:19:23,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 18:19:23,327 INFO L87 Difference]: Start difference. First operand 781 states and 1184 transitions. Second operand 4 states. [2018-12-08 18:19:23,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:19:23,583 INFO L93 Difference]: Finished difference Result 1691 states and 2580 transitions. [2018-12-08 18:19:23,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 18:19:23,583 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 141 [2018-12-08 18:19:23,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:19:23,585 INFO L225 Difference]: With dead ends: 1691 [2018-12-08 18:19:23,585 INFO L226 Difference]: Without dead ends: 935 [2018-12-08 18:19:23,586 INFO L631 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 [2018-12-08 18:19:23,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 935 states. [2018-12-08 18:19:23,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 935 to 783. [2018-12-08 18:19:23,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2018-12-08 18:19:23,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 1186 transitions. [2018-12-08 18:19:23,622 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 1186 transitions. Word has length 141 [2018-12-08 18:19:23,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:19:23,622 INFO L480 AbstractCegarLoop]: Abstraction has 783 states and 1186 transitions. [2018-12-08 18:19:23,622 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 18:19:23,622 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 1186 transitions. [2018-12-08 18:19:23,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-12-08 18:19:23,623 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:19:23,623 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 18:19:23,623 INFO L423 AbstractCegarLoop]: === Iteration 68 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:19:23,624 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:19:23,624 INFO L82 PathProgramCache]: Analyzing trace with hash 441613261, now seen corresponding path program 1 times [2018-12-08 18:19:23,624 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:19:23,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:19:23,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:19:23,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:19:23,624 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:19:23,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:19:23,653 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-12-08 18:19:23,653 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:19:23,653 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 18:19:23,653 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:19:23,653 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 18:19:23,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 18:19:23,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 18:19:23,653 INFO L87 Difference]: Start difference. First operand 783 states and 1186 transitions. Second operand 4 states. [2018-12-08 18:19:23,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:19:23,930 INFO L93 Difference]: Finished difference Result 1713 states and 2604 transitions. [2018-12-08 18:19:23,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 18:19:23,931 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 144 [2018-12-08 18:19:23,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:19:23,932 INFO L225 Difference]: With dead ends: 1713 [2018-12-08 18:19:23,932 INFO L226 Difference]: Without dead ends: 955 [2018-12-08 18:19:23,933 INFO L631 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 [2018-12-08 18:19:23,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 955 states. [2018-12-08 18:19:23,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 955 to 783. [2018-12-08 18:19:23,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2018-12-08 18:19:23,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 1184 transitions. [2018-12-08 18:19:23,962 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 1184 transitions. Word has length 144 [2018-12-08 18:19:23,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:19:23,962 INFO L480 AbstractCegarLoop]: Abstraction has 783 states and 1184 transitions. [2018-12-08 18:19:23,963 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 18:19:23,963 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 1184 transitions. [2018-12-08 18:19:23,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-12-08 18:19:23,963 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:19:23,963 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 18:19:23,963 INFO L423 AbstractCegarLoop]: === Iteration 69 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:19:23,964 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:19:23,964 INFO L82 PathProgramCache]: Analyzing trace with hash -2103612318, now seen corresponding path program 1 times [2018-12-08 18:19:23,964 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:19:23,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:19:23,964 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:19:23,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:19:23,964 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:19:23,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:19:23,994 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-12-08 18:19:23,995 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:19:23,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 18:19:23,995 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:19:23,995 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 18:19:23,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 18:19:23,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 18:19:23,995 INFO L87 Difference]: Start difference. First operand 783 states and 1184 transitions. Second operand 4 states. [2018-12-08 18:19:24,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:19:24,267 INFO L93 Difference]: Finished difference Result 1713 states and 2600 transitions. [2018-12-08 18:19:24,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 18:19:24,267 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 145 [2018-12-08 18:19:24,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:19:24,269 INFO L225 Difference]: With dead ends: 1713 [2018-12-08 18:19:24,269 INFO L226 Difference]: Without dead ends: 955 [2018-12-08 18:19:24,269 INFO L631 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 [2018-12-08 18:19:24,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 955 states. [2018-12-08 18:19:24,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 955 to 783. [2018-12-08 18:19:24,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2018-12-08 18:19:24,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 1182 transitions. [2018-12-08 18:19:24,298 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 1182 transitions. Word has length 145 [2018-12-08 18:19:24,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:19:24,298 INFO L480 AbstractCegarLoop]: Abstraction has 783 states and 1182 transitions. [2018-12-08 18:19:24,298 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 18:19:24,298 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 1182 transitions. [2018-12-08 18:19:24,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-12-08 18:19:24,299 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:19:24,299 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 18:19:24,299 INFO L423 AbstractCegarLoop]: === Iteration 70 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:19:24,299 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:19:24,299 INFO L82 PathProgramCache]: Analyzing trace with hash 1863536050, now seen corresponding path program 1 times [2018-12-08 18:19:24,299 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:19:24,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:19:24,300 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:19:24,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:19:24,300 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:19:24,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:19:24,329 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-12-08 18:19:24,330 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:19:24,330 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 18:19:24,330 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:19:24,330 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 18:19:24,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 18:19:24,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 18:19:24,330 INFO L87 Difference]: Start difference. First operand 783 states and 1182 transitions. Second operand 4 states. [2018-12-08 18:19:24,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:19:24,598 INFO L93 Difference]: Finished difference Result 1713 states and 2596 transitions. [2018-12-08 18:19:24,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 18:19:24,598 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 146 [2018-12-08 18:19:24,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:19:24,599 INFO L225 Difference]: With dead ends: 1713 [2018-12-08 18:19:24,599 INFO L226 Difference]: Without dead ends: 955 [2018-12-08 18:19:24,600 INFO L631 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 [2018-12-08 18:19:24,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 955 states. [2018-12-08 18:19:24,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 955 to 783. [2018-12-08 18:19:24,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2018-12-08 18:19:24,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 1180 transitions. [2018-12-08 18:19:24,630 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 1180 transitions. Word has length 146 [2018-12-08 18:19:24,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:19:24,630 INFO L480 AbstractCegarLoop]: Abstraction has 783 states and 1180 transitions. [2018-12-08 18:19:24,631 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 18:19:24,631 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 1180 transitions. [2018-12-08 18:19:24,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-12-08 18:19:24,631 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:19:24,631 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 18:19:24,631 INFO L423 AbstractCegarLoop]: === Iteration 71 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:19:24,631 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:19:24,632 INFO L82 PathProgramCache]: Analyzing trace with hash 1555846567, now seen corresponding path program 1 times [2018-12-08 18:19:24,632 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:19:24,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:19:24,632 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:19:24,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:19:24,632 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:19:24,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:19:24,665 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-12-08 18:19:24,665 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:19:24,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 18:19:24,665 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:19:24,665 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 18:19:24,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 18:19:24,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 18:19:24,666 INFO L87 Difference]: Start difference. First operand 783 states and 1180 transitions. Second operand 4 states. [2018-12-08 18:19:24,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:19:24,927 INFO L93 Difference]: Finished difference Result 1693 states and 2568 transitions. [2018-12-08 18:19:24,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 18:19:24,927 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 147 [2018-12-08 18:19:24,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:19:24,928 INFO L225 Difference]: With dead ends: 1693 [2018-12-08 18:19:24,928 INFO L226 Difference]: Without dead ends: 935 [2018-12-08 18:19:24,929 INFO L631 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 [2018-12-08 18:19:24,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 935 states. [2018-12-08 18:19:24,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 935 to 753. [2018-12-08 18:19:24,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 753 states. [2018-12-08 18:19:24,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 753 states to 753 states and 1138 transitions. [2018-12-08 18:19:24,959 INFO L78 Accepts]: Start accepts. Automaton has 753 states and 1138 transitions. Word has length 147 [2018-12-08 18:19:24,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:19:24,959 INFO L480 AbstractCegarLoop]: Abstraction has 753 states and 1138 transitions. [2018-12-08 18:19:24,959 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 18:19:24,959 INFO L276 IsEmpty]: Start isEmpty. Operand 753 states and 1138 transitions. [2018-12-08 18:19:24,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-12-08 18:19:24,960 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:19:24,960 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 18:19:24,960 INFO L423 AbstractCegarLoop]: === Iteration 72 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:19:24,960 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:19:24,960 INFO L82 PathProgramCache]: Analyzing trace with hash 161783640, now seen corresponding path program 1 times [2018-12-08 18:19:24,960 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:19:24,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:19:24,961 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:19:24,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:19:24,961 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:19:24,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:19:24,996 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 143 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-12-08 18:19:24,996 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:19:24,996 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 18:19:24,996 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:19:24,996 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 18:19:24,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 18:19:24,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 18:19:24,997 INFO L87 Difference]: Start difference. First operand 753 states and 1138 transitions. Second operand 4 states. [2018-12-08 18:19:25,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:19:25,305 INFO L93 Difference]: Finished difference Result 1663 states and 2524 transitions. [2018-12-08 18:19:25,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 18:19:25,306 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 148 [2018-12-08 18:19:25,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:19:25,307 INFO L225 Difference]: With dead ends: 1663 [2018-12-08 18:19:25,307 INFO L226 Difference]: Without dead ends: 935 [2018-12-08 18:19:25,308 INFO L631 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 [2018-12-08 18:19:25,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 935 states. [2018-12-08 18:19:25,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 935 to 809. [2018-12-08 18:19:25,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 809 states. [2018-12-08 18:19:25,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 809 states to 809 states and 1228 transitions. [2018-12-08 18:19:25,347 INFO L78 Accepts]: Start accepts. Automaton has 809 states and 1228 transitions. Word has length 148 [2018-12-08 18:19:25,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:19:25,347 INFO L480 AbstractCegarLoop]: Abstraction has 809 states and 1228 transitions. [2018-12-08 18:19:25,347 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 18:19:25,347 INFO L276 IsEmpty]: Start isEmpty. Operand 809 states and 1228 transitions. [2018-12-08 18:19:25,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-12-08 18:19:25,348 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:19:25,348 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 18:19:25,348 INFO L423 AbstractCegarLoop]: === Iteration 73 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:19:25,348 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:19:25,349 INFO L82 PathProgramCache]: Analyzing trace with hash -1421164105, now seen corresponding path program 1 times [2018-12-08 18:19:25,349 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:19:25,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:19:25,349 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:19:25,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:19:25,349 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:19:25,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:19:25,400 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-12-08 18:19:25,400 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:19:25,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 18:19:25,400 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:19:25,401 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 18:19:25,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 18:19:25,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 18:19:25,401 INFO L87 Difference]: Start difference. First operand 809 states and 1228 transitions. Second operand 4 states. [2018-12-08 18:19:25,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:19:25,650 INFO L93 Difference]: Finished difference Result 1703 states and 2586 transitions. [2018-12-08 18:19:25,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 18:19:25,651 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 149 [2018-12-08 18:19:25,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:19:25,652 INFO L225 Difference]: With dead ends: 1703 [2018-12-08 18:19:25,652 INFO L226 Difference]: Without dead ends: 919 [2018-12-08 18:19:25,652 INFO L631 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 [2018-12-08 18:19:25,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 919 states. [2018-12-08 18:19:25,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 919 to 811. [2018-12-08 18:19:25,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 811 states. [2018-12-08 18:19:25,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 811 states to 811 states and 1230 transitions. [2018-12-08 18:19:25,685 INFO L78 Accepts]: Start accepts. Automaton has 811 states and 1230 transitions. Word has length 149 [2018-12-08 18:19:25,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:19:25,685 INFO L480 AbstractCegarLoop]: Abstraction has 811 states and 1230 transitions. [2018-12-08 18:19:25,685 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 18:19:25,685 INFO L276 IsEmpty]: Start isEmpty. Operand 811 states and 1230 transitions. [2018-12-08 18:19:25,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-12-08 18:19:25,686 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:19:25,686 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 18:19:25,686 INFO L423 AbstractCegarLoop]: === Iteration 74 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:19:25,686 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:19:25,686 INFO L82 PathProgramCache]: Analyzing trace with hash -1338047429, now seen corresponding path program 1 times [2018-12-08 18:19:25,686 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:19:25,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:19:25,687 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:19:25,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:19:25,687 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:19:25,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:19:25,729 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2018-12-08 18:19:25,729 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:19:25,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 18:19:25,729 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:19:25,729 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 18:19:25,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 18:19:25,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 18:19:25,729 INFO L87 Difference]: Start difference. First operand 811 states and 1230 transitions. Second operand 4 states. [2018-12-08 18:19:25,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:19:25,953 INFO L93 Difference]: Finished difference Result 1705 states and 2586 transitions. [2018-12-08 18:19:25,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 18:19:25,953 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 151 [2018-12-08 18:19:25,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:19:25,954 INFO L225 Difference]: With dead ends: 1705 [2018-12-08 18:19:25,954 INFO L226 Difference]: Without dead ends: 919 [2018-12-08 18:19:25,955 INFO L631 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 [2018-12-08 18:19:25,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 919 states. [2018-12-08 18:19:25,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 919 to 811. [2018-12-08 18:19:25,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 811 states. [2018-12-08 18:19:25,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 811 states to 811 states and 1228 transitions. [2018-12-08 18:19:25,987 INFO L78 Accepts]: Start accepts. Automaton has 811 states and 1228 transitions. Word has length 151 [2018-12-08 18:19:25,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:19:25,987 INFO L480 AbstractCegarLoop]: Abstraction has 811 states and 1228 transitions. [2018-12-08 18:19:25,987 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 18:19:25,987 INFO L276 IsEmpty]: Start isEmpty. Operand 811 states and 1228 transitions. [2018-12-08 18:19:25,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-12-08 18:19:25,988 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:19:25,988 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 18:19:25,988 INFO L423 AbstractCegarLoop]: === Iteration 75 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:19:25,988 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:19:25,988 INFO L82 PathProgramCache]: Analyzing trace with hash 348247356, now seen corresponding path program 1 times [2018-12-08 18:19:25,988 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:19:25,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:19:25,988 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:19:25,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:19:25,988 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:19:25,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:19:26,021 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2018-12-08 18:19:26,022 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:19:26,022 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 18:19:26,022 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:19:26,022 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 18:19:26,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 18:19:26,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 18:19:26,022 INFO L87 Difference]: Start difference. First operand 811 states and 1228 transitions. Second operand 4 states. [2018-12-08 18:19:26,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:19:26,260 INFO L93 Difference]: Finished difference Result 1701 states and 2578 transitions. [2018-12-08 18:19:26,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 18:19:26,261 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 152 [2018-12-08 18:19:26,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:19:26,262 INFO L225 Difference]: With dead ends: 1701 [2018-12-08 18:19:26,262 INFO L226 Difference]: Without dead ends: 915 [2018-12-08 18:19:26,263 INFO L631 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 [2018-12-08 18:19:26,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 915 states. [2018-12-08 18:19:26,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 915 to 811. [2018-12-08 18:19:26,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 811 states. [2018-12-08 18:19:26,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 811 states to 811 states and 1226 transitions. [2018-12-08 18:19:26,298 INFO L78 Accepts]: Start accepts. Automaton has 811 states and 1226 transitions. Word has length 152 [2018-12-08 18:19:26,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:19:26,298 INFO L480 AbstractCegarLoop]: Abstraction has 811 states and 1226 transitions. [2018-12-08 18:19:26,298 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 18:19:26,298 INFO L276 IsEmpty]: Start isEmpty. Operand 811 states and 1226 transitions. [2018-12-08 18:19:26,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-12-08 18:19:26,299 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:19:26,299 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 18:19:26,299 INFO L423 AbstractCegarLoop]: === Iteration 76 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:19:26,299 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:19:26,299 INFO L82 PathProgramCache]: Analyzing trace with hash -1809961318, now seen corresponding path program 1 times [2018-12-08 18:19:26,299 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:19:26,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:19:26,300 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:19:26,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:19:26,300 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:19:26,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:19:26,335 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-12-08 18:19:26,335 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:19:26,335 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 18:19:26,335 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:19:26,335 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 18:19:26,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 18:19:26,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 18:19:26,336 INFO L87 Difference]: Start difference. First operand 811 states and 1226 transitions. Second operand 4 states. [2018-12-08 18:19:26,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:19:26,557 INFO L93 Difference]: Finished difference Result 1695 states and 2566 transitions. [2018-12-08 18:19:26,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 18:19:26,557 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 152 [2018-12-08 18:19:26,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:19:26,558 INFO L225 Difference]: With dead ends: 1695 [2018-12-08 18:19:26,558 INFO L226 Difference]: Without dead ends: 909 [2018-12-08 18:19:26,559 INFO L631 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 [2018-12-08 18:19:26,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 909 states. [2018-12-08 18:19:26,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 909 to 817. [2018-12-08 18:19:26,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 817 states. [2018-12-08 18:19:26,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 817 states to 817 states and 1236 transitions. [2018-12-08 18:19:26,592 INFO L78 Accepts]: Start accepts. Automaton has 817 states and 1236 transitions. Word has length 152 [2018-12-08 18:19:26,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:19:26,593 INFO L480 AbstractCegarLoop]: Abstraction has 817 states and 1236 transitions. [2018-12-08 18:19:26,593 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 18:19:26,593 INFO L276 IsEmpty]: Start isEmpty. Operand 817 states and 1236 transitions. [2018-12-08 18:19:26,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-12-08 18:19:26,593 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:19:26,593 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 18:19:26,593 INFO L423 AbstractCegarLoop]: === Iteration 77 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:19:26,594 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:19:26,594 INFO L82 PathProgramCache]: Analyzing trace with hash -1925375604, now seen corresponding path program 1 times [2018-12-08 18:19:26,594 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:19:26,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:19:26,594 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:19:26,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:19:26,594 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:19:26,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:19:26,634 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2018-12-08 18:19:26,634 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:19:26,634 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 18:19:26,634 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:19:26,634 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 18:19:26,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 18:19:26,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 18:19:26,635 INFO L87 Difference]: Start difference. First operand 817 states and 1236 transitions. Second operand 4 states. [2018-12-08 18:19:26,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:19:26,870 INFO L93 Difference]: Finished difference Result 1679 states and 2540 transitions. [2018-12-08 18:19:26,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 18:19:26,870 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 152 [2018-12-08 18:19:26,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:19:26,871 INFO L225 Difference]: With dead ends: 1679 [2018-12-08 18:19:26,871 INFO L226 Difference]: Without dead ends: 887 [2018-12-08 18:19:26,873 INFO L631 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 [2018-12-08 18:19:26,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 887 states. [2018-12-08 18:19:26,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 887 to 817. [2018-12-08 18:19:26,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 817 states. [2018-12-08 18:19:26,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 817 states to 817 states and 1234 transitions. [2018-12-08 18:19:26,914 INFO L78 Accepts]: Start accepts. Automaton has 817 states and 1234 transitions. Word has length 152 [2018-12-08 18:19:26,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:19:26,914 INFO L480 AbstractCegarLoop]: Abstraction has 817 states and 1234 transitions. [2018-12-08 18:19:26,914 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 18:19:26,914 INFO L276 IsEmpty]: Start isEmpty. Operand 817 states and 1234 transitions. [2018-12-08 18:19:26,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-12-08 18:19:26,915 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:19:26,915 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 18:19:26,915 INFO L423 AbstractCegarLoop]: === Iteration 78 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:19:26,915 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:19:26,915 INFO L82 PathProgramCache]: Analyzing trace with hash 1829144195, now seen corresponding path program 1 times [2018-12-08 18:19:26,915 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:19:26,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:19:26,916 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:19:26,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:19:26,916 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:19:26,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:19:26,947 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2018-12-08 18:19:26,947 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:19:26,947 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 18:19:26,947 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:19:26,947 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 18:19:26,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 18:19:26,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 18:19:26,947 INFO L87 Difference]: Start difference. First operand 817 states and 1234 transitions. Second operand 4 states. [2018-12-08 18:19:27,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:19:27,187 INFO L93 Difference]: Finished difference Result 1679 states and 2536 transitions. [2018-12-08 18:19:27,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 18:19:27,188 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 153 [2018-12-08 18:19:27,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:19:27,189 INFO L225 Difference]: With dead ends: 1679 [2018-12-08 18:19:27,189 INFO L226 Difference]: Without dead ends: 887 [2018-12-08 18:19:27,189 INFO L631 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 [2018-12-08 18:19:27,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 887 states. [2018-12-08 18:19:27,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 887 to 817. [2018-12-08 18:19:27,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 817 states. [2018-12-08 18:19:27,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 817 states to 817 states and 1232 transitions. [2018-12-08 18:19:27,224 INFO L78 Accepts]: Start accepts. Automaton has 817 states and 1232 transitions. Word has length 153 [2018-12-08 18:19:27,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:19:27,224 INFO L480 AbstractCegarLoop]: Abstraction has 817 states and 1232 transitions. [2018-12-08 18:19:27,224 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 18:19:27,224 INFO L276 IsEmpty]: Start isEmpty. Operand 817 states and 1232 transitions. [2018-12-08 18:19:27,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-12-08 18:19:27,225 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:19:27,225 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 18:19:27,225 INFO L423 AbstractCegarLoop]: === Iteration 79 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:19:27,225 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:19:27,225 INFO L82 PathProgramCache]: Analyzing trace with hash 845729325, now seen corresponding path program 1 times [2018-12-08 18:19:27,225 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:19:27,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:19:27,226 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:19:27,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:19:27,226 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:19:27,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:19:27,258 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 136 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-12-08 18:19:27,258 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:19:27,258 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 18:19:27,258 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:19:27,258 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 18:19:27,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 18:19:27,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 18:19:27,259 INFO L87 Difference]: Start difference. First operand 817 states and 1232 transitions. Second operand 4 states. [2018-12-08 18:19:27,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:19:27,514 INFO L93 Difference]: Finished difference Result 1727 states and 2604 transitions. [2018-12-08 18:19:27,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 18:19:27,514 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 154 [2018-12-08 18:19:27,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:19:27,516 INFO L225 Difference]: With dead ends: 1727 [2018-12-08 18:19:27,516 INFO L226 Difference]: Without dead ends: 935 [2018-12-08 18:19:27,517 INFO L631 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 [2018-12-08 18:19:27,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 935 states. [2018-12-08 18:19:27,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 935 to 817. [2018-12-08 18:19:27,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 817 states. [2018-12-08 18:19:27,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 817 states to 817 states and 1230 transitions. [2018-12-08 18:19:27,552 INFO L78 Accepts]: Start accepts. Automaton has 817 states and 1230 transitions. Word has length 154 [2018-12-08 18:19:27,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:19:27,552 INFO L480 AbstractCegarLoop]: Abstraction has 817 states and 1230 transitions. [2018-12-08 18:19:27,552 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 18:19:27,552 INFO L276 IsEmpty]: Start isEmpty. Operand 817 states and 1230 transitions. [2018-12-08 18:19:27,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-12-08 18:19:27,553 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:19:27,553 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 18:19:27,554 INFO L423 AbstractCegarLoop]: === Iteration 80 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:19:27,554 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:19:27,554 INFO L82 PathProgramCache]: Analyzing trace with hash -775063631, now seen corresponding path program 1 times [2018-12-08 18:19:27,554 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:19:27,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:19:27,554 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:19:27,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:19:27,555 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:19:27,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:19:27,599 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2018-12-08 18:19:27,599 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:19:27,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 18:19:27,599 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:19:27,600 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 18:19:27,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 18:19:27,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 18:19:27,600 INFO L87 Difference]: Start difference. First operand 817 states and 1230 transitions. Second operand 4 states. [2018-12-08 18:19:27,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:19:27,865 INFO L93 Difference]: Finished difference Result 1679 states and 2528 transitions. [2018-12-08 18:19:27,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 18:19:27,866 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 154 [2018-12-08 18:19:27,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:19:27,866 INFO L225 Difference]: With dead ends: 1679 [2018-12-08 18:19:27,867 INFO L226 Difference]: Without dead ends: 887 [2018-12-08 18:19:27,867 INFO L631 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 [2018-12-08 18:19:27,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 887 states. [2018-12-08 18:19:27,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 887 to 817. [2018-12-08 18:19:27,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 817 states. [2018-12-08 18:19:27,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 817 states to 817 states and 1228 transitions. [2018-12-08 18:19:27,903 INFO L78 Accepts]: Start accepts. Automaton has 817 states and 1228 transitions. Word has length 154 [2018-12-08 18:19:27,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:19:27,903 INFO L480 AbstractCegarLoop]: Abstraction has 817 states and 1228 transitions. [2018-12-08 18:19:27,903 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 18:19:27,903 INFO L276 IsEmpty]: Start isEmpty. Operand 817 states and 1228 transitions. [2018-12-08 18:19:27,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-12-08 18:19:27,904 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:19:27,904 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 18:19:27,904 INFO L423 AbstractCegarLoop]: === Iteration 81 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:19:27,904 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:19:27,904 INFO L82 PathProgramCache]: Analyzing trace with hash -1693684350, now seen corresponding path program 1 times [2018-12-08 18:19:27,904 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:19:27,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:19:27,905 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:19:27,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:19:27,905 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:19:27,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:19:27,942 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 138 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-12-08 18:19:27,942 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:19:27,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 18:19:27,942 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:19:27,942 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 18:19:27,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 18:19:27,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 18:19:27,942 INFO L87 Difference]: Start difference. First operand 817 states and 1228 transitions. Second operand 4 states. [2018-12-08 18:19:28,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:19:28,267 INFO L93 Difference]: Finished difference Result 1711 states and 2570 transitions. [2018-12-08 18:19:28,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 18:19:28,267 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 155 [2018-12-08 18:19:28,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:19:28,268 INFO L225 Difference]: With dead ends: 1711 [2018-12-08 18:19:28,268 INFO L226 Difference]: Without dead ends: 919 [2018-12-08 18:19:28,269 INFO L631 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 [2018-12-08 18:19:28,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 919 states. [2018-12-08 18:19:28,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 919 to 817. [2018-12-08 18:19:28,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 817 states. [2018-12-08 18:19:28,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 817 states to 817 states and 1226 transitions. [2018-12-08 18:19:28,307 INFO L78 Accepts]: Start accepts. Automaton has 817 states and 1226 transitions. Word has length 155 [2018-12-08 18:19:28,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:19:28,307 INFO L480 AbstractCegarLoop]: Abstraction has 817 states and 1226 transitions. [2018-12-08 18:19:28,307 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 18:19:28,308 INFO L276 IsEmpty]: Start isEmpty. Operand 817 states and 1226 transitions. [2018-12-08 18:19:28,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-12-08 18:19:28,308 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:19:28,308 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 18:19:28,308 INFO L423 AbstractCegarLoop]: === Iteration 82 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:19:28,308 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:19:28,309 INFO L82 PathProgramCache]: Analyzing trace with hash -1629077281, now seen corresponding path program 1 times [2018-12-08 18:19:28,309 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:19:28,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:19:28,309 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:19:28,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:19:28,309 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:19:28,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:19:28,354 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-12-08 18:19:28,354 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:19:28,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 18:19:28,354 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:19:28,354 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 18:19:28,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 18:19:28,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 18:19:28,355 INFO L87 Difference]: Start difference. First operand 817 states and 1226 transitions. Second operand 4 states. [2018-12-08 18:19:28,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:19:28,599 INFO L93 Difference]: Finished difference Result 1701 states and 2554 transitions. [2018-12-08 18:19:28,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 18:19:28,599 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 155 [2018-12-08 18:19:28,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:19:28,600 INFO L225 Difference]: With dead ends: 1701 [2018-12-08 18:19:28,600 INFO L226 Difference]: Without dead ends: 909 [2018-12-08 18:19:28,601 INFO L631 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 [2018-12-08 18:19:28,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 909 states. [2018-12-08 18:19:28,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 909 to 819. [2018-12-08 18:19:28,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 819 states. [2018-12-08 18:19:28,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 819 states to 819 states and 1228 transitions. [2018-12-08 18:19:28,640 INFO L78 Accepts]: Start accepts. Automaton has 819 states and 1228 transitions. Word has length 155 [2018-12-08 18:19:28,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:19:28,640 INFO L480 AbstractCegarLoop]: Abstraction has 819 states and 1228 transitions. [2018-12-08 18:19:28,640 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 18:19:28,641 INFO L276 IsEmpty]: Start isEmpty. Operand 819 states and 1228 transitions. [2018-12-08 18:19:28,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-12-08 18:19:28,642 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:19:28,642 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 18:19:28,642 INFO L423 AbstractCegarLoop]: === Iteration 83 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:19:28,642 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:19:28,642 INFO L82 PathProgramCache]: Analyzing trace with hash 1363635080, now seen corresponding path program 1 times [2018-12-08 18:19:28,642 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:19:28,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:19:28,643 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:19:28,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:19:28,643 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:19:28,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:19:28,689 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2018-12-08 18:19:28,689 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:19:28,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 18:19:28,690 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:19:28,690 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 18:19:28,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 18:19:28,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 18:19:28,690 INFO L87 Difference]: Start difference. First operand 819 states and 1228 transitions. Second operand 4 states. [2018-12-08 18:19:29,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:19:29,232 INFO L93 Difference]: Finished difference Result 1663 states and 2500 transitions. [2018-12-08 18:19:29,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 18:19:29,233 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 155 [2018-12-08 18:19:29,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:19:29,236 INFO L225 Difference]: With dead ends: 1663 [2018-12-08 18:19:29,236 INFO L226 Difference]: Without dead ends: 869 [2018-12-08 18:19:29,238 INFO L631 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 [2018-12-08 18:19:29,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 869 states. [2018-12-08 18:19:29,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 869 to 819. [2018-12-08 18:19:29,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 819 states. [2018-12-08 18:19:29,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 819 states to 819 states and 1226 transitions. [2018-12-08 18:19:29,290 INFO L78 Accepts]: Start accepts. Automaton has 819 states and 1226 transitions. Word has length 155 [2018-12-08 18:19:29,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:19:29,291 INFO L480 AbstractCegarLoop]: Abstraction has 819 states and 1226 transitions. [2018-12-08 18:19:29,291 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 18:19:29,291 INFO L276 IsEmpty]: Start isEmpty. Operand 819 states and 1226 transitions. [2018-12-08 18:19:29,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-12-08 18:19:29,292 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:19:29,292 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 18:19:29,292 INFO L423 AbstractCegarLoop]: === Iteration 84 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:19:29,292 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:19:29,292 INFO L82 PathProgramCache]: Analyzing trace with hash -1547235803, now seen corresponding path program 1 times [2018-12-08 18:19:29,292 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:19:29,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:19:29,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:19:29,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:19:29,293 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:19:29,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:19:29,340 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-12-08 18:19:29,340 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:19:29,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 18:19:29,341 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:19:29,341 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 18:19:29,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 18:19:29,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 18:19:29,341 INFO L87 Difference]: Start difference. First operand 819 states and 1226 transitions. Second operand 4 states. [2018-12-08 18:19:29,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:19:29,569 INFO L93 Difference]: Finished difference Result 1691 states and 2534 transitions. [2018-12-08 18:19:29,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 18:19:29,570 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 156 [2018-12-08 18:19:29,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:19:29,570 INFO L225 Difference]: With dead ends: 1691 [2018-12-08 18:19:29,570 INFO L226 Difference]: Without dead ends: 897 [2018-12-08 18:19:29,571 INFO L631 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 [2018-12-08 18:19:29,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 897 states. [2018-12-08 18:19:29,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 897 to 821. [2018-12-08 18:19:29,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 821 states. [2018-12-08 18:19:29,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 821 states to 821 states and 1228 transitions. [2018-12-08 18:19:29,608 INFO L78 Accepts]: Start accepts. Automaton has 821 states and 1228 transitions. Word has length 156 [2018-12-08 18:19:29,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:19:29,608 INFO L480 AbstractCegarLoop]: Abstraction has 821 states and 1228 transitions. [2018-12-08 18:19:29,608 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 18:19:29,608 INFO L276 IsEmpty]: Start isEmpty. Operand 821 states and 1228 transitions. [2018-12-08 18:19:29,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-12-08 18:19:29,608 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:19:29,608 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 18:19:29,609 INFO L423 AbstractCegarLoop]: === Iteration 85 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:19:29,609 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:19:29,609 INFO L82 PathProgramCache]: Analyzing trace with hash 533423430, now seen corresponding path program 1 times [2018-12-08 18:19:29,609 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:19:29,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:19:29,610 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:19:29,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:19:29,610 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:19:29,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:19:29,664 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 150 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-12-08 18:19:29,664 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:19:29,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 18:19:29,664 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:19:29,665 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 18:19:29,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 18:19:29,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 18:19:29,665 INFO L87 Difference]: Start difference. First operand 821 states and 1228 transitions. Second operand 4 states. [2018-12-08 18:19:29,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:19:29,880 INFO L93 Difference]: Finished difference Result 1693 states and 2534 transitions. [2018-12-08 18:19:29,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 18:19:29,880 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 156 [2018-12-08 18:19:29,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:19:29,881 INFO L225 Difference]: With dead ends: 1693 [2018-12-08 18:19:29,881 INFO L226 Difference]: Without dead ends: 897 [2018-12-08 18:19:29,881 INFO L631 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 [2018-12-08 18:19:29,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 897 states. [2018-12-08 18:19:29,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 897 to 823. [2018-12-08 18:19:29,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 823 states. [2018-12-08 18:19:29,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 823 states to 823 states and 1230 transitions. [2018-12-08 18:19:29,919 INFO L78 Accepts]: Start accepts. Automaton has 823 states and 1230 transitions. Word has length 156 [2018-12-08 18:19:29,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:19:29,919 INFO L480 AbstractCegarLoop]: Abstraction has 823 states and 1230 transitions. [2018-12-08 18:19:29,919 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 18:19:29,919 INFO L276 IsEmpty]: Start isEmpty. Operand 823 states and 1230 transitions. [2018-12-08 18:19:29,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-12-08 18:19:29,920 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:19:29,920 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 18:19:29,920 INFO L423 AbstractCegarLoop]: === Iteration 86 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:19:29,920 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:19:29,920 INFO L82 PathProgramCache]: Analyzing trace with hash -1236997818, now seen corresponding path program 1 times [2018-12-08 18:19:29,920 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:19:29,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:19:29,921 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:19:29,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:19:29,921 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:19:29,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:19:29,956 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-12-08 18:19:29,957 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:19:29,957 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 18:19:29,957 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:19:29,957 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 18:19:29,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 18:19:29,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 18:19:29,957 INFO L87 Difference]: Start difference. First operand 823 states and 1230 transitions. Second operand 4 states. [2018-12-08 18:19:30,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:19:30,318 INFO L93 Difference]: Finished difference Result 1717 states and 2562 transitions. [2018-12-08 18:19:30,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 18:19:30,318 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 157 [2018-12-08 18:19:30,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:19:30,319 INFO L225 Difference]: With dead ends: 1717 [2018-12-08 18:19:30,319 INFO L226 Difference]: Without dead ends: 919 [2018-12-08 18:19:30,320 INFO L631 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 [2018-12-08 18:19:30,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 919 states. [2018-12-08 18:19:30,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 919 to 823. [2018-12-08 18:19:30,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 823 states. [2018-12-08 18:19:30,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 823 states to 823 states and 1228 transitions. [2018-12-08 18:19:30,358 INFO L78 Accepts]: Start accepts. Automaton has 823 states and 1228 transitions. Word has length 157 [2018-12-08 18:19:30,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:19:30,358 INFO L480 AbstractCegarLoop]: Abstraction has 823 states and 1228 transitions. [2018-12-08 18:19:30,358 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 18:19:30,358 INFO L276 IsEmpty]: Start isEmpty. Operand 823 states and 1228 transitions. [2018-12-08 18:19:30,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-12-08 18:19:30,359 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:19:30,359 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 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, 1, 1, 1, 1, 1, 1] [2018-12-08 18:19:30,359 INFO L423 AbstractCegarLoop]: === Iteration 87 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:19:30,359 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:19:30,360 INFO L82 PathProgramCache]: Analyzing trace with hash 1447392288, now seen corresponding path program 1 times [2018-12-08 18:19:30,360 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:19:30,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:19:30,360 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:19:30,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:19:30,360 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:19:30,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:19:30,399 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 151 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-12-08 18:19:30,399 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:19:30,399 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 18:19:30,399 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:19:30,399 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 18:19:30,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 18:19:30,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 18:19:30,399 INFO L87 Difference]: Start difference. First operand 823 states and 1228 transitions. Second operand 4 states. [2018-12-08 18:19:30,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:19:30,691 INFO L93 Difference]: Finished difference Result 1689 states and 2523 transitions. [2018-12-08 18:19:30,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 18:19:30,692 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 157 [2018-12-08 18:19:30,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:19:30,693 INFO L225 Difference]: With dead ends: 1689 [2018-12-08 18:19:30,693 INFO L226 Difference]: Without dead ends: 891 [2018-12-08 18:19:30,694 INFO L631 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 [2018-12-08 18:19:30,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 891 states. [2018-12-08 18:19:30,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 891 to 825. [2018-12-08 18:19:30,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 825 states. [2018-12-08 18:19:30,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 825 states to 825 states and 1230 transitions. [2018-12-08 18:19:30,747 INFO L78 Accepts]: Start accepts. Automaton has 825 states and 1230 transitions. Word has length 157 [2018-12-08 18:19:30,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:19:30,747 INFO L480 AbstractCegarLoop]: Abstraction has 825 states and 1230 transitions. [2018-12-08 18:19:30,747 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 18:19:30,747 INFO L276 IsEmpty]: Start isEmpty. Operand 825 states and 1230 transitions. [2018-12-08 18:19:30,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-12-08 18:19:30,748 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:19:30,748 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 18:19:30,748 INFO L423 AbstractCegarLoop]: === Iteration 88 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:19:30,748 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:19:30,748 INFO L82 PathProgramCache]: Analyzing trace with hash -814181999, now seen corresponding path program 1 times [2018-12-08 18:19:30,748 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:19:30,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:19:30,749 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:19:30,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:19:30,749 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:19:30,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:19:30,792 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-12-08 18:19:30,792 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:19:30,792 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 18:19:30,793 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:19:30,793 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 18:19:30,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 18:19:30,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 18:19:30,793 INFO L87 Difference]: Start difference. First operand 825 states and 1230 transitions. Second operand 4 states. [2018-12-08 18:19:31,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:19:31,051 INFO L93 Difference]: Finished difference Result 1715 states and 2554 transitions. [2018-12-08 18:19:31,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 18:19:31,052 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 158 [2018-12-08 18:19:31,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:19:31,052 INFO L225 Difference]: With dead ends: 1715 [2018-12-08 18:19:31,052 INFO L226 Difference]: Without dead ends: 915 [2018-12-08 18:19:31,053 INFO L631 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 [2018-12-08 18:19:31,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 915 states. [2018-12-08 18:19:31,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 915 to 825. [2018-12-08 18:19:31,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 825 states. [2018-12-08 18:19:31,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 825 states to 825 states and 1228 transitions. [2018-12-08 18:19:31,093 INFO L78 Accepts]: Start accepts. Automaton has 825 states and 1228 transitions. Word has length 158 [2018-12-08 18:19:31,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:19:31,093 INFO L480 AbstractCegarLoop]: Abstraction has 825 states and 1228 transitions. [2018-12-08 18:19:31,093 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 18:19:31,093 INFO L276 IsEmpty]: Start isEmpty. Operand 825 states and 1228 transitions. [2018-12-08 18:19:31,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-12-08 18:19:31,094 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:19:31,094 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 18:19:31,094 INFO L423 AbstractCegarLoop]: === Iteration 89 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:19:31,094 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:19:31,094 INFO L82 PathProgramCache]: Analyzing trace with hash 1322576623, now seen corresponding path program 1 times [2018-12-08 18:19:31,094 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:19:31,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:19:31,095 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:19:31,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:19:31,095 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:19:31,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:19:31,137 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-12-08 18:19:31,137 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:19:31,137 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 18:19:31,137 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:19:31,138 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 18:19:31,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 18:19:31,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 18:19:31,138 INFO L87 Difference]: Start difference. First operand 825 states and 1228 transitions. Second operand 4 states. [2018-12-08 18:19:31,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:19:31,383 INFO L93 Difference]: Finished difference Result 1709 states and 2542 transitions. [2018-12-08 18:19:31,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 18:19:31,384 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 158 [2018-12-08 18:19:31,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:19:31,385 INFO L225 Difference]: With dead ends: 1709 [2018-12-08 18:19:31,385 INFO L226 Difference]: Without dead ends: 909 [2018-12-08 18:19:31,385 INFO L631 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 [2018-12-08 18:19:31,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 909 states. [2018-12-08 18:19:31,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 909 to 825. [2018-12-08 18:19:31,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 825 states. [2018-12-08 18:19:31,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 825 states to 825 states and 1226 transitions. [2018-12-08 18:19:31,426 INFO L78 Accepts]: Start accepts. Automaton has 825 states and 1226 transitions. Word has length 158 [2018-12-08 18:19:31,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:19:31,426 INFO L480 AbstractCegarLoop]: Abstraction has 825 states and 1226 transitions. [2018-12-08 18:19:31,426 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 18:19:31,426 INFO L276 IsEmpty]: Start isEmpty. Operand 825 states and 1226 transitions. [2018-12-08 18:19:31,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-12-08 18:19:31,427 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:19:31,427 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 18:19:31,427 INFO L423 AbstractCegarLoop]: === Iteration 90 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:19:31,427 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:19:31,427 INFO L82 PathProgramCache]: Analyzing trace with hash -642039090, now seen corresponding path program 1 times [2018-12-08 18:19:31,427 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:19:31,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:19:31,427 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:19:31,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:19:31,428 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:19:31,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:19:31,462 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-12-08 18:19:31,462 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:19:31,463 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 18:19:31,463 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:19:31,463 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 18:19:31,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 18:19:31,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 18:19:31,463 INFO L87 Difference]: Start difference. First operand 825 states and 1226 transitions. Second operand 4 states. [2018-12-08 18:19:31,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:19:31,936 INFO L93 Difference]: Finished difference Result 1691 states and 2515 transitions. [2018-12-08 18:19:31,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 18:19:31,937 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 158 [2018-12-08 18:19:31,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:19:31,939 INFO L225 Difference]: With dead ends: 1691 [2018-12-08 18:19:31,939 INFO L226 Difference]: Without dead ends: 891 [2018-12-08 18:19:31,941 INFO L631 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 [2018-12-08 18:19:31,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 891 states. [2018-12-08 18:19:31,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 891 to 827. [2018-12-08 18:19:31,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 827 states. [2018-12-08 18:19:32,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 827 states to 827 states and 1228 transitions. [2018-12-08 18:19:32,000 INFO L78 Accepts]: Start accepts. Automaton has 827 states and 1228 transitions. Word has length 158 [2018-12-08 18:19:32,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:19:32,000 INFO L480 AbstractCegarLoop]: Abstraction has 827 states and 1228 transitions. [2018-12-08 18:19:32,000 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 18:19:32,000 INFO L276 IsEmpty]: Start isEmpty. Operand 827 states and 1228 transitions. [2018-12-08 18:19:32,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-12-08 18:19:32,001 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:19:32,001 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 18:19:32,001 INFO L423 AbstractCegarLoop]: === Iteration 91 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:19:32,001 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:19:32,001 INFO L82 PathProgramCache]: Analyzing trace with hash -114411896, now seen corresponding path program 1 times [2018-12-08 18:19:32,002 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:19:32,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:19:32,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:19:32,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:19:32,002 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:19:32,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:19:32,033 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 153 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-12-08 18:19:32,033 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:19:32,033 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 18:19:32,033 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:19:32,033 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 18:19:32,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 18:19:32,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 18:19:32,034 INFO L87 Difference]: Start difference. First operand 827 states and 1228 transitions. Second operand 4 states. [2018-12-08 18:19:32,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:19:32,305 INFO L93 Difference]: Finished difference Result 1687 states and 2508 transitions. [2018-12-08 18:19:32,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 18:19:32,306 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 159 [2018-12-08 18:19:32,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:19:32,307 INFO L225 Difference]: With dead ends: 1687 [2018-12-08 18:19:32,307 INFO L226 Difference]: Without dead ends: 885 [2018-12-08 18:19:32,307 INFO L631 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 [2018-12-08 18:19:32,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 885 states. [2018-12-08 18:19:32,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 885 to 829. [2018-12-08 18:19:32,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 829 states. [2018-12-08 18:19:32,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 829 states to 829 states and 1230 transitions. [2018-12-08 18:19:32,352 INFO L78 Accepts]: Start accepts. Automaton has 829 states and 1230 transitions. Word has length 159 [2018-12-08 18:19:32,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:19:32,352 INFO L480 AbstractCegarLoop]: Abstraction has 829 states and 1230 transitions. [2018-12-08 18:19:32,352 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 18:19:32,352 INFO L276 IsEmpty]: Start isEmpty. Operand 829 states and 1230 transitions. [2018-12-08 18:19:32,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-12-08 18:19:32,353 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:19:32,353 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-12-08 18:19:32,353 INFO L423 AbstractCegarLoop]: === Iteration 92 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:19:32,353 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:19:32,353 INFO L82 PathProgramCache]: Analyzing trace with hash -1240684438, now seen corresponding path program 1 times [2018-12-08 18:19:32,354 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:19:32,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:19:32,354 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:19:32,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:19:32,354 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:19:32,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:19:32,386 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-12-08 18:19:32,386 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:19:32,386 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 18:19:32,386 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:19:32,386 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 18:19:32,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 18:19:32,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 18:19:32,387 INFO L87 Difference]: Start difference. First operand 829 states and 1230 transitions. Second operand 4 states. [2018-12-08 18:19:32,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:19:32,634 INFO L93 Difference]: Finished difference Result 1713 states and 2538 transitions. [2018-12-08 18:19:32,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 18:19:32,634 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 161 [2018-12-08 18:19:32,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:19:32,635 INFO L225 Difference]: With dead ends: 1713 [2018-12-08 18:19:32,635 INFO L226 Difference]: Without dead ends: 909 [2018-12-08 18:19:32,636 INFO L631 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 [2018-12-08 18:19:32,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 909 states. [2018-12-08 18:19:32,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 909 to 829. [2018-12-08 18:19:32,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 829 states. [2018-12-08 18:19:32,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 829 states to 829 states and 1228 transitions. [2018-12-08 18:19:32,677 INFO L78 Accepts]: Start accepts. Automaton has 829 states and 1228 transitions. Word has length 161 [2018-12-08 18:19:32,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:19:32,677 INFO L480 AbstractCegarLoop]: Abstraction has 829 states and 1228 transitions. [2018-12-08 18:19:32,677 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 18:19:32,677 INFO L276 IsEmpty]: Start isEmpty. Operand 829 states and 1228 transitions. [2018-12-08 18:19:32,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-12-08 18:19:32,678 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:19:32,678 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-12-08 18:19:32,678 INFO L423 AbstractCegarLoop]: === Iteration 93 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:19:32,678 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:19:32,678 INFO L82 PathProgramCache]: Analyzing trace with hash 1903007738, now seen corresponding path program 1 times [2018-12-08 18:19:32,678 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:19:32,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:19:32,679 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:19:32,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:19:32,679 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:19:32,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:19:32,712 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-12-08 18:19:32,713 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:19:32,713 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 18:19:32,713 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:19:32,713 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 18:19:32,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 18:19:32,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 18:19:32,713 INFO L87 Difference]: Start difference. First operand 829 states and 1228 transitions. Second operand 4 states. [2018-12-08 18:19:32,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:19:32,953 INFO L93 Difference]: Finished difference Result 1701 states and 2518 transitions. [2018-12-08 18:19:32,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 18:19:32,953 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 162 [2018-12-08 18:19:32,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:19:32,954 INFO L225 Difference]: With dead ends: 1701 [2018-12-08 18:19:32,954 INFO L226 Difference]: Without dead ends: 897 [2018-12-08 18:19:32,955 INFO L631 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 [2018-12-08 18:19:32,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 897 states. [2018-12-08 18:19:32,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 897 to 829. [2018-12-08 18:19:32,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 829 states. [2018-12-08 18:19:32,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 829 states to 829 states and 1226 transitions. [2018-12-08 18:19:32,997 INFO L78 Accepts]: Start accepts. Automaton has 829 states and 1226 transitions. Word has length 162 [2018-12-08 18:19:32,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:19:32,997 INFO L480 AbstractCegarLoop]: Abstraction has 829 states and 1226 transitions. [2018-12-08 18:19:32,997 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 18:19:32,997 INFO L276 IsEmpty]: Start isEmpty. Operand 829 states and 1226 transitions. [2018-12-08 18:19:32,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-12-08 18:19:32,997 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:19:32,998 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-12-08 18:19:32,998 INFO L423 AbstractCegarLoop]: === Iteration 94 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:19:32,998 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:19:32,998 INFO L82 PathProgramCache]: Analyzing trace with hash -311300325, now seen corresponding path program 1 times [2018-12-08 18:19:32,998 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:19:32,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:19:32,998 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:19:32,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:19:32,999 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:19:33,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:19:33,033 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 150 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-12-08 18:19:33,034 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:19:33,034 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 18:19:33,034 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:19:33,034 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 18:19:33,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 18:19:33,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 18:19:33,034 INFO L87 Difference]: Start difference. First operand 829 states and 1226 transitions. Second operand 4 states. [2018-12-08 18:19:33,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:19:33,312 INFO L93 Difference]: Finished difference Result 1701 states and 2514 transitions. [2018-12-08 18:19:33,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 18:19:33,313 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 162 [2018-12-08 18:19:33,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:19:33,313 INFO L225 Difference]: With dead ends: 1701 [2018-12-08 18:19:33,313 INFO L226 Difference]: Without dead ends: 897 [2018-12-08 18:19:33,314 INFO L631 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 [2018-12-08 18:19:33,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 897 states. [2018-12-08 18:19:33,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 897 to 829. [2018-12-08 18:19:33,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 829 states. [2018-12-08 18:19:33,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 829 states to 829 states and 1224 transitions. [2018-12-08 18:19:33,356 INFO L78 Accepts]: Start accepts. Automaton has 829 states and 1224 transitions. Word has length 162 [2018-12-08 18:19:33,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:19:33,357 INFO L480 AbstractCegarLoop]: Abstraction has 829 states and 1224 transitions. [2018-12-08 18:19:33,357 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 18:19:33,357 INFO L276 IsEmpty]: Start isEmpty. Operand 829 states and 1224 transitions. [2018-12-08 18:19:33,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-12-08 18:19:33,357 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:19:33,357 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 18:19:33,357 INFO L423 AbstractCegarLoop]: === Iteration 95 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:19:33,358 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:19:33,358 INFO L82 PathProgramCache]: Analyzing trace with hash -518747860, now seen corresponding path program 1 times [2018-12-08 18:19:33,358 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:19:33,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:19:33,358 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:19:33,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:19:33,358 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:19:33,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:19:33,402 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2018-12-08 18:19:33,403 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:19:33,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 18:19:33,403 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:19:33,403 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 18:19:33,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 18:19:33,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 18:19:33,403 INFO L87 Difference]: Start difference. First operand 829 states and 1224 transitions. Second operand 4 states. [2018-12-08 18:19:33,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:19:33,653 INFO L93 Difference]: Finished difference Result 1767 states and 2628 transitions. [2018-12-08 18:19:33,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 18:19:33,654 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 162 [2018-12-08 18:19:33,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:19:33,654 INFO L225 Difference]: With dead ends: 1767 [2018-12-08 18:19:33,654 INFO L226 Difference]: Without dead ends: 963 [2018-12-08 18:19:33,655 INFO L631 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 [2018-12-08 18:19:33,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 963 states. [2018-12-08 18:19:33,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 963 to 889. [2018-12-08 18:19:33,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 889 states. [2018-12-08 18:19:33,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 889 states to 889 states and 1330 transitions. [2018-12-08 18:19:33,698 INFO L78 Accepts]: Start accepts. Automaton has 889 states and 1330 transitions. Word has length 162 [2018-12-08 18:19:33,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:19:33,698 INFO L480 AbstractCegarLoop]: Abstraction has 889 states and 1330 transitions. [2018-12-08 18:19:33,698 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 18:19:33,698 INFO L276 IsEmpty]: Start isEmpty. Operand 889 states and 1330 transitions. [2018-12-08 18:19:33,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-12-08 18:19:33,699 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:19:33,699 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-12-08 18:19:33,699 INFO L423 AbstractCegarLoop]: === Iteration 96 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:19:33,699 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:19:33,699 INFO L82 PathProgramCache]: Analyzing trace with hash 1030759659, now seen corresponding path program 1 times [2018-12-08 18:19:33,699 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:19:33,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:19:33,700 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:19:33,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:19:33,700 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:19:33,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:19:33,752 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-12-08 18:19:33,752 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:19:33,752 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 18:19:33,752 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:19:33,752 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 18:19:33,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 18:19:33,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 18:19:33,752 INFO L87 Difference]: Start difference. First operand 889 states and 1330 transitions. Second operand 4 states. [2018-12-08 18:19:33,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:19:33,990 INFO L93 Difference]: Finished difference Result 1815 states and 2715 transitions. [2018-12-08 18:19:33,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 18:19:33,990 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 163 [2018-12-08 18:19:33,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:19:33,991 INFO L225 Difference]: With dead ends: 1815 [2018-12-08 18:19:33,991 INFO L226 Difference]: Without dead ends: 951 [2018-12-08 18:19:33,992 INFO L631 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 [2018-12-08 18:19:33,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 951 states. [2018-12-08 18:19:34,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 951 to 889. [2018-12-08 18:19:34,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 889 states. [2018-12-08 18:19:34,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 889 states to 889 states and 1328 transitions. [2018-12-08 18:19:34,035 INFO L78 Accepts]: Start accepts. Automaton has 889 states and 1328 transitions. Word has length 163 [2018-12-08 18:19:34,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:19:34,035 INFO L480 AbstractCegarLoop]: Abstraction has 889 states and 1328 transitions. [2018-12-08 18:19:34,035 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 18:19:34,036 INFO L276 IsEmpty]: Start isEmpty. Operand 889 states and 1328 transitions. [2018-12-08 18:19:34,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-12-08 18:19:34,037 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:19:34,037 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 18:19:34,037 INFO L423 AbstractCegarLoop]: === Iteration 97 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:19:34,037 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:19:34,037 INFO L82 PathProgramCache]: Analyzing trace with hash -672748701, now seen corresponding path program 1 times [2018-12-08 18:19:34,037 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:19:34,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:19:34,038 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:19:34,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:19:34,038 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:19:34,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:19:34,074 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-12-08 18:19:34,074 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:19:34,074 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 18:19:34,075 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:19:34,075 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 18:19:34,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 18:19:34,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 18:19:34,075 INFO L87 Difference]: Start difference. First operand 889 states and 1328 transitions. Second operand 4 states. [2018-12-08 18:19:34,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:19:34,360 INFO L93 Difference]: Finished difference Result 1815 states and 2711 transitions. [2018-12-08 18:19:34,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 18:19:34,360 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 164 [2018-12-08 18:19:34,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:19:34,361 INFO L225 Difference]: With dead ends: 1815 [2018-12-08 18:19:34,361 INFO L226 Difference]: Without dead ends: 951 [2018-12-08 18:19:34,362 INFO L631 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 [2018-12-08 18:19:34,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 951 states. [2018-12-08 18:19:34,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 951 to 889. [2018-12-08 18:19:34,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 889 states. [2018-12-08 18:19:34,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 889 states to 889 states and 1326 transitions. [2018-12-08 18:19:34,407 INFO L78 Accepts]: Start accepts. Automaton has 889 states and 1326 transitions. Word has length 164 [2018-12-08 18:19:34,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:19:34,407 INFO L480 AbstractCegarLoop]: Abstraction has 889 states and 1326 transitions. [2018-12-08 18:19:34,407 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 18:19:34,407 INFO L276 IsEmpty]: Start isEmpty. Operand 889 states and 1326 transitions. [2018-12-08 18:19:34,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2018-12-08 18:19:34,408 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:19:34,408 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 18:19:34,408 INFO L423 AbstractCegarLoop]: === Iteration 98 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:19:34,408 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:19:34,408 INFO L82 PathProgramCache]: Analyzing trace with hash -1066409837, now seen corresponding path program 1 times [2018-12-08 18:19:34,408 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:19:34,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:19:34,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:19:34,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:19:34,409 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:19:34,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:19:34,452 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 156 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-12-08 18:19:34,452 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:19:34,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 18:19:34,452 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:19:34,452 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 18:19:34,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 18:19:34,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 18:19:34,452 INFO L87 Difference]: Start difference. First operand 889 states and 1326 transitions. Second operand 4 states. [2018-12-08 18:19:34,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:19:34,722 INFO L93 Difference]: Finished difference Result 1809 states and 2700 transitions. [2018-12-08 18:19:34,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 18:19:34,722 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 165 [2018-12-08 18:19:34,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:19:34,723 INFO L225 Difference]: With dead ends: 1809 [2018-12-08 18:19:34,723 INFO L226 Difference]: Without dead ends: 945 [2018-12-08 18:19:34,724 INFO L631 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 [2018-12-08 18:19:34,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 945 states. [2018-12-08 18:19:34,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 945 to 813. [2018-12-08 18:19:34,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 813 states. [2018-12-08 18:19:34,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 813 states to 813 states and 1214 transitions. [2018-12-08 18:19:34,772 INFO L78 Accepts]: Start accepts. Automaton has 813 states and 1214 transitions. Word has length 165 [2018-12-08 18:19:34,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:19:34,772 INFO L480 AbstractCegarLoop]: Abstraction has 813 states and 1214 transitions. [2018-12-08 18:19:34,772 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 18:19:34,772 INFO L276 IsEmpty]: Start isEmpty. Operand 813 states and 1214 transitions. [2018-12-08 18:19:34,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2018-12-08 18:19:34,773 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:19:34,773 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 18:19:34,773 INFO L423 AbstractCegarLoop]: === Iteration 99 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:19:34,773 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:19:34,773 INFO L82 PathProgramCache]: Analyzing trace with hash 1244843128, now seen corresponding path program 1 times [2018-12-08 18:19:34,773 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:19:34,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:19:34,774 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:19:34,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:19:34,774 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:19:34,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:19:34,826 INFO L134 CoverageAnalysis]: Checked inductivity of 259 backedges. 177 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2018-12-08 18:19:34,827 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:19:34,827 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 18:19:34,827 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:19:34,827 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 18:19:34,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 18:19:34,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 18:19:34,827 INFO L87 Difference]: Start difference. First operand 813 states and 1214 transitions. Second operand 4 states. [2018-12-08 18:19:35,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:19:35,090 INFO L93 Difference]: Finished difference Result 1733 states and 2586 transitions. [2018-12-08 18:19:35,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 18:19:35,090 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 165 [2018-12-08 18:19:35,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:19:35,091 INFO L225 Difference]: With dead ends: 1733 [2018-12-08 18:19:35,091 INFO L226 Difference]: Without dead ends: 945 [2018-12-08 18:19:35,091 INFO L631 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 [2018-12-08 18:19:35,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 945 states. [2018-12-08 18:19:35,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 945 to 873. [2018-12-08 18:19:35,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 873 states. [2018-12-08 18:19:35,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 1304 transitions. [2018-12-08 18:19:35,137 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 1304 transitions. Word has length 165 [2018-12-08 18:19:35,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:19:35,137 INFO L480 AbstractCegarLoop]: Abstraction has 873 states and 1304 transitions. [2018-12-08 18:19:35,137 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 18:19:35,137 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 1304 transitions. [2018-12-08 18:19:35,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2018-12-08 18:19:35,138 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:19:35,138 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 18:19:35,138 INFO L423 AbstractCegarLoop]: === Iteration 100 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:19:35,138 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:19:35,138 INFO L82 PathProgramCache]: Analyzing trace with hash 1488640487, now seen corresponding path program 1 times [2018-12-08 18:19:35,139 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:19:35,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:19:35,139 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:19:35,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:19:35,139 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:19:35,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:19:35,170 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 118 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2018-12-08 18:19:35,170 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:19:35,170 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 18:19:35,170 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:19:35,170 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 18:19:35,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 18:19:35,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 18:19:35,171 INFO L87 Difference]: Start difference. First operand 873 states and 1304 transitions. Second operand 4 states. [2018-12-08 18:19:35,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:19:35,453 INFO L93 Difference]: Finished difference Result 1801 states and 2688 transitions. [2018-12-08 18:19:35,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 18:19:35,454 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 165 [2018-12-08 18:19:35,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:19:35,455 INFO L225 Difference]: With dead ends: 1801 [2018-12-08 18:19:35,455 INFO L226 Difference]: Without dead ends: 953 [2018-12-08 18:19:35,455 INFO L631 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 [2018-12-08 18:19:35,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 953 states. [2018-12-08 18:19:35,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 953 to 873. [2018-12-08 18:19:35,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 873 states. [2018-12-08 18:19:35,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 1302 transitions. [2018-12-08 18:19:35,502 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 1302 transitions. Word has length 165 [2018-12-08 18:19:35,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:19:35,503 INFO L480 AbstractCegarLoop]: Abstraction has 873 states and 1302 transitions. [2018-12-08 18:19:35,503 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 18:19:35,503 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 1302 transitions. [2018-12-08 18:19:35,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-12-08 18:19:35,503 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:19:35,503 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 18:19:35,504 INFO L423 AbstractCegarLoop]: === Iteration 101 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:19:35,504 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:19:35,504 INFO L82 PathProgramCache]: Analyzing trace with hash 289460616, now seen corresponding path program 1 times [2018-12-08 18:19:35,504 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:19:35,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:19:35,504 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:19:35,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:19:35,504 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:19:35,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:19:35,541 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 124 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2018-12-08 18:19:35,541 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:19:35,541 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 18:19:35,541 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:19:35,542 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 18:19:35,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 18:19:35,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 18:19:35,542 INFO L87 Difference]: Start difference. First operand 873 states and 1302 transitions. Second operand 4 states. [2018-12-08 18:19:35,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:19:35,809 INFO L93 Difference]: Finished difference Result 1801 states and 2684 transitions. [2018-12-08 18:19:35,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 18:19:35,810 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 166 [2018-12-08 18:19:35,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:19:35,811 INFO L225 Difference]: With dead ends: 1801 [2018-12-08 18:19:35,811 INFO L226 Difference]: Without dead ends: 953 [2018-12-08 18:19:35,811 INFO L631 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 [2018-12-08 18:19:35,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 953 states. [2018-12-08 18:19:35,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 953 to 873. [2018-12-08 18:19:35,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 873 states. [2018-12-08 18:19:35,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 1300 transitions. [2018-12-08 18:19:35,868 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 1300 transitions. Word has length 166 [2018-12-08 18:19:35,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:19:35,868 INFO L480 AbstractCegarLoop]: Abstraction has 873 states and 1300 transitions. [2018-12-08 18:19:35,868 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 18:19:35,868 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 1300 transitions. [2018-12-08 18:19:35,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2018-12-08 18:19:35,869 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:19:35,869 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 18:19:35,869 INFO L423 AbstractCegarLoop]: === Iteration 102 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:19:35,869 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:19:35,869 INFO L82 PathProgramCache]: Analyzing trace with hash -359739297, now seen corresponding path program 1 times [2018-12-08 18:19:35,869 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:19:35,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:19:35,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:19:35,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:19:35,870 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:19:35,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:19:35,904 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 156 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2018-12-08 18:19:35,904 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:19:35,904 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 18:19:35,904 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:19:35,905 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 18:19:35,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 18:19:35,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 18:19:35,905 INFO L87 Difference]: Start difference. First operand 873 states and 1300 transitions. Second operand 4 states. [2018-12-08 18:19:36,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:19:36,147 INFO L93 Difference]: Finished difference Result 1749 states and 2612 transitions. [2018-12-08 18:19:36,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 18:19:36,147 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 167 [2018-12-08 18:19:36,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:19:36,148 INFO L225 Difference]: With dead ends: 1749 [2018-12-08 18:19:36,148 INFO L226 Difference]: Without dead ends: 901 [2018-12-08 18:19:36,149 INFO L631 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 [2018-12-08 18:19:36,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 901 states. [2018-12-08 18:19:36,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 901 to 873. [2018-12-08 18:19:36,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 873 states. [2018-12-08 18:19:36,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 1298 transitions. [2018-12-08 18:19:36,198 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 1298 transitions. Word has length 167 [2018-12-08 18:19:36,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:19:36,198 INFO L480 AbstractCegarLoop]: Abstraction has 873 states and 1298 transitions. [2018-12-08 18:19:36,198 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 18:19:36,198 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 1298 transitions. [2018-12-08 18:19:36,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2018-12-08 18:19:36,198 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:19:36,199 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 18:19:36,199 INFO L423 AbstractCegarLoop]: === Iteration 103 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:19:36,199 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:19:36,199 INFO L82 PathProgramCache]: Analyzing trace with hash -1260614324, now seen corresponding path program 1 times [2018-12-08 18:19:36,199 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:19:36,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:19:36,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:19:36,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:19:36,199 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:19:36,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:19:36,240 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 162 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2018-12-08 18:19:36,240 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:19:36,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 18:19:36,240 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:19:36,240 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 18:19:36,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 18:19:36,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 18:19:36,241 INFO L87 Difference]: Start difference. First operand 873 states and 1298 transitions. Second operand 4 states. [2018-12-08 18:19:36,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:19:36,479 INFO L93 Difference]: Finished difference Result 1771 states and 2640 transitions. [2018-12-08 18:19:36,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 18:19:36,479 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 167 [2018-12-08 18:19:36,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:19:36,480 INFO L225 Difference]: With dead ends: 1771 [2018-12-08 18:19:36,480 INFO L226 Difference]: Without dead ends: 923 [2018-12-08 18:19:36,481 INFO L631 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 [2018-12-08 18:19:36,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 923 states. [2018-12-08 18:19:36,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 923 to 873. [2018-12-08 18:19:36,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 873 states. [2018-12-08 18:19:36,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 1296 transitions. [2018-12-08 18:19:36,529 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 1296 transitions. Word has length 167 [2018-12-08 18:19:36,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:19:36,529 INFO L480 AbstractCegarLoop]: Abstraction has 873 states and 1296 transitions. [2018-12-08 18:19:36,529 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 18:19:36,529 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 1296 transitions. [2018-12-08 18:19:36,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-12-08 18:19:36,530 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:19:36,530 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 18:19:36,530 INFO L423 AbstractCegarLoop]: === Iteration 104 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:19:36,530 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:19:36,530 INFO L82 PathProgramCache]: Analyzing trace with hash 769147445, now seen corresponding path program 1 times [2018-12-08 18:19:36,530 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:19:36,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:19:36,530 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:19:36,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:19:36,531 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:19:36,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:19:36,566 INFO L134 CoverageAnalysis]: Checked inductivity of 262 backedges. 167 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2018-12-08 18:19:36,566 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:19:36,567 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 18:19:36,567 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:19:36,567 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 18:19:36,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 18:19:36,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 18:19:36,567 INFO L87 Difference]: Start difference. First operand 873 states and 1296 transitions. Second operand 4 states. [2018-12-08 18:19:36,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:19:36,813 INFO L93 Difference]: Finished difference Result 1767 states and 2632 transitions. [2018-12-08 18:19:36,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 18:19:36,813 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 168 [2018-12-08 18:19:36,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:19:36,814 INFO L225 Difference]: With dead ends: 1767 [2018-12-08 18:19:36,814 INFO L226 Difference]: Without dead ends: 919 [2018-12-08 18:19:36,815 INFO L631 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 [2018-12-08 18:19:36,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 919 states. [2018-12-08 18:19:36,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 919 to 873. [2018-12-08 18:19:36,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 873 states. [2018-12-08 18:19:36,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 1294 transitions. [2018-12-08 18:19:36,864 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 1294 transitions. Word has length 168 [2018-12-08 18:19:36,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:19:36,864 INFO L480 AbstractCegarLoop]: Abstraction has 873 states and 1294 transitions. [2018-12-08 18:19:36,864 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 18:19:36,864 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 1294 transitions. [2018-12-08 18:19:36,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-12-08 18:19:36,865 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:19:36,865 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 18:19:36,866 INFO L423 AbstractCegarLoop]: === Iteration 105 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:19:36,866 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:19:36,866 INFO L82 PathProgramCache]: Analyzing trace with hash 2111104399, now seen corresponding path program 1 times [2018-12-08 18:19:36,866 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:19:36,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:19:36,866 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:19:36,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:19:36,867 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:19:36,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:19:36,980 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2018-12-08 18:19:36,980 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:19:36,980 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 18:19:36,980 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:19:36,981 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 18:19:36,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 18:19:36,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 18:19:36,981 INFO L87 Difference]: Start difference. First operand 873 states and 1294 transitions. Second operand 5 states. [2018-12-08 18:19:37,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:19:37,369 INFO L93 Difference]: Finished difference Result 1879 states and 2804 transitions. [2018-12-08 18:19:37,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 18:19:37,370 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 168 [2018-12-08 18:19:37,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:19:37,371 INFO L225 Difference]: With dead ends: 1879 [2018-12-08 18:19:37,371 INFO L226 Difference]: Without dead ends: 1031 [2018-12-08 18:19:37,371 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-08 18:19:37,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1031 states. [2018-12-08 18:19:37,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1031 to 939. [2018-12-08 18:19:37,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 939 states. [2018-12-08 18:19:37,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 939 states to 939 states and 1412 transitions. [2018-12-08 18:19:37,424 INFO L78 Accepts]: Start accepts. Automaton has 939 states and 1412 transitions. Word has length 168 [2018-12-08 18:19:37,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:19:37,424 INFO L480 AbstractCegarLoop]: Abstraction has 939 states and 1412 transitions. [2018-12-08 18:19:37,424 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 18:19:37,424 INFO L276 IsEmpty]: Start isEmpty. Operand 939 states and 1412 transitions. [2018-12-08 18:19:37,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-12-08 18:19:37,424 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:19:37,424 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 18:19:37,425 INFO L423 AbstractCegarLoop]: === Iteration 106 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:19:37,425 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:19:37,425 INFO L82 PathProgramCache]: Analyzing trace with hash -1317585046, now seen corresponding path program 1 times [2018-12-08 18:19:37,425 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:19:37,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:19:37,425 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:19:37,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:19:37,425 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:19:37,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:19:37,772 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 14 proven. 174 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-08 18:19:37,772 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 18:19:37,772 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-08 18:19:37,773 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 174 with the following transitions: [2018-12-08 18:19:37,774 INFO L205 CegarAbsIntRunner]: [0], [1], [5], [9], [12], [16], [27], [29], [33], [42], [44], [49], [54], [59], [64], [69], [74], [79], [84], [87], [89], [94], [99], [102], [104], [109], [114], [119], [124], [129], [134], [139], [144], [149], [154], [159], [164], [169], [174], [179], [184], [187], [189], [194], [197], [199], [204], [207], [278], [281], [289], [291], [294], [302], [305], [309], [514], [519], [524], [539], [544], [549], [554], [560], [565], [567], [572], [577], [583], [586], [590], [611], [645], [647], [659], [662], [663], [664], [666] [2018-12-08 18:19:37,800 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-08 18:19:37,800 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-08 18:19:38,241 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-08 18:19:38,242 INFO L272 AbstractInterpreter]: Visited 79 different actions 269 times. Merged at 62 different actions 181 times. Never widened. Performed 2189 root evaluator evaluations with a maximum evaluation depth of 5. Performed 2189 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 12 fixpoints after 6 different actions. Largest state had 118 variables. [2018-12-08 18:19:38,247 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:19:38,248 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-08 18:19:38,248 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 18:19:38,248 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6b342074-af84-4fe5-a218-0680d1cd191a/bin-2019/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 18:19:38,259 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:19:38,259 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-08 18:19:38,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:19:38,348 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 18:19:38,403 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:19:38,407 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2018-12-08 18:19:38,441 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:19:38,442 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:19:38,443 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 44 [2018-12-08 18:19:38,462 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:19:38,463 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:19:38,464 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:19:38,465 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:19:38,466 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2018-12-08 18:19:38,466 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-08 18:19:38,474 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 18:19:38,483 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 18:19:38,494 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 20 [2018-12-08 18:19:38,495 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 23 [2018-12-08 18:19:38,498 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:19:38,498 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2018-12-08 18:19:38,501 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:19:38,502 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:19:38,503 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:19:38,503 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:19:38,504 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 68 [2018-12-08 18:19:38,504 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-08 18:19:38,511 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 18:19:38,515 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 18:19:38,519 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 18:19:38,530 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 18:19:38,530 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:57, output treesize:79 [2018-12-08 18:19:38,567 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:19:38,570 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:19:38,591 INFO L478 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 0 case distinctions, treesize of input 98 treesize of output 77 [2018-12-08 18:19:38,594 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:19:38,595 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:19:38,595 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:19:38,599 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 127 [2018-12-08 18:19:38,599 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 18:19:38,620 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 18:19:38,640 INFO L478 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 0 case distinctions, treesize of input 103 treesize of output 82 [2018-12-08 18:19:38,643 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:19:38,643 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:19:38,644 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:19:38,647 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 132 [2018-12-08 18:19:38,650 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:19:38,651 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:19:38,651 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:19:38,652 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:19:38,653 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:19:38,653 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:19:38,655 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:19:38,661 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 16 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 168 [2018-12-08 18:19:38,661 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-08 18:19:38,677 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 18:19:38,684 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 18:19:38,691 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 18:19:38,691 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:136, output treesize:79 [2018-12-08 18:19:38,710 INFO L478 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 0 case distinctions, treesize of input 98 treesize of output 77 [2018-12-08 18:19:38,712 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:19:38,717 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:19:38,718 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:19:38,721 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 127 [2018-12-08 18:19:38,721 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 18:19:38,732 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 18:19:38,738 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 18:19:38,738 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:98, output treesize:79 [2018-12-08 18:19:38,742 INFO L478 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 0 case distinctions, treesize of input 98 treesize of output 77 [2018-12-08 18:19:38,745 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:19:38,746 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:19:38,746 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:19:38,749 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 127 [2018-12-08 18:19:38,750 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 18:19:38,760 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 18:19:38,768 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 18:19:38,768 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:98, output treesize:79 [2018-12-08 18:19:38,771 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:19:38,773 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:19:38,787 INFO L478 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 0 case distinctions, treesize of input 103 treesize of output 82 [2018-12-08 18:19:38,789 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:19:38,790 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:19:38,791 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:19:38,794 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 132 [2018-12-08 18:19:38,797 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:19:38,798 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:19:38,798 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:19:38,799 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:19:38,799 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:19:38,800 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:19:38,800 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:19:38,808 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 16 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 168 [2018-12-08 18:19:38,809 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-08 18:19:38,827 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 18:19:38,836 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 18:19:38,843 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 18:19:38,843 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:117, output treesize:79 [2018-12-08 18:19:38,849 INFO L478 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 0 case distinctions, treesize of input 98 treesize of output 77 [2018-12-08 18:19:38,851 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:19:38,852 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:19:38,852 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:19:38,855 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 127 [2018-12-08 18:19:38,855 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 18:19:38,866 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 18:19:38,871 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 18:19:38,871 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:98, output treesize:79 [2018-12-08 18:19:38,875 INFO L478 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 0 case distinctions, treesize of input 98 treesize of output 77 [2018-12-08 18:19:38,877 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:19:38,877 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:19:38,878 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:19:38,881 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 127 [2018-12-08 18:19:38,881 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 18:19:38,891 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 18:19:38,897 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 18:19:38,897 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:98, output treesize:79 [2018-12-08 18:19:38,906 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 45 [2018-12-08 18:19:38,908 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:19:38,910 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 46 [2018-12-08 18:19:38,911 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-08 18:19:38,915 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-08 18:19:38,931 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 113 [2018-12-08 18:19:38,933 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 28 treesize of output 27 [2018-12-08 18:19:38,933 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 18:19:38,942 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 18:19:38,949 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-08 18:19:38,950 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:128, output treesize:106 [2018-12-08 18:19:39,020 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 125 treesize of output 106 [2018-12-08 18:19:39,024 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:19:39,025 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:19:39,026 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:19:39,030 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 154 [2018-12-08 18:19:39,031 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 18:19:39,053 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 18:19:39,075 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 125 treesize of output 106 [2018-12-08 18:19:39,078 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:19:39,079 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:19:39,080 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:19:39,083 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 154 [2018-12-08 18:19:39,084 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 18:19:39,101 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 18:19:39,112 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-08 18:19:39,112 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:144, output treesize:106 [2018-12-08 18:19:39,153 INFO L478 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 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-08 18:19:39,155 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 10 treesize of output 9 [2018-12-08 18:19:39,156 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 18:19:39,158 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 18:19:39,191 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 125 treesize of output 106 [2018-12-08 18:19:39,194 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:19:39,196 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:19:39,197 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:19:39,200 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 154 [2018-12-08 18:19:39,200 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 18:19:39,213 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 18:19:39,222 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-08 18:19:39,223 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:138, output treesize:115 [2018-12-08 18:19:39,251 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 29 [2018-12-08 18:19:39,253 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2018-12-08 18:19:39,254 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:19:39,256 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:19:39,271 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 131 treesize of output 107 [2018-12-08 18:19:39,273 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2018-12-08 18:19:39,273 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 18:19:39,283 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 62 [2018-12-08 18:19:39,283 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:19:39,291 INFO L267 ElimStorePlain]: Start of recursive call 4: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:19:39,297 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 24 [2018-12-08 18:19:39,299 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 10 treesize of output 9 [2018-12-08 18:19:39,299 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-08 18:19:39,302 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 18:19:39,305 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-08 18:19:39,306 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:146, output treesize:23 [2018-12-08 18:19:39,326 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 31 [2018-12-08 18:19:39,329 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:19:39,330 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:19:39,330 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2018-12-08 18:19:39,331 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 18:19:39,337 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 18:19:39,342 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-08 18:19:39,342 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:36, output treesize:32 [2018-12-08 18:19:39,380 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 33 [2018-12-08 18:19:39,382 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-12-08 18:19:39,382 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 18:19:39,390 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:19:39,391 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:19:39,391 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-12-08 18:19:39,391 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-08 18:19:39,394 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 18:19:39,397 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 18:19:39,397 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:41, output treesize:3 [2018-12-08 18:19:39,548 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 64 proven. 96 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-12-08 18:19:39,549 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 18:19:39,607 INFO L478 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 38 treesize of output 36 [2018-12-08 18:19:39,608 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 32 [2018-12-08 18:19:39,609 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:19:39,611 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:19:39,613 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:19:39,613 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:38, output treesize:32 [2018-12-08 18:19:39,898 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:19:39,901 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:19:39,905 INFO L478 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 54 [2018-12-08 18:19:39,922 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 11 treesize of output 10 [2018-12-08 18:19:39,922 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 18:19:39,927 INFO L478 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 10 treesize of output 8 [2018-12-08 18:19:39,928 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2018-12-08 18:19:39,928 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-08 18:19:39,929 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 18:19:39,932 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 18:19:39,935 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:19:39,935 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:73, output treesize:15 [2018-12-08 18:19:39,944 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:19:39,946 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:19:39,953 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:19:39,954 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:19:39,955 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:19:39,955 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:51, output treesize:15 [2018-12-08 18:19:39,962 INFO L478 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 56 treesize of output 52 [2018-12-08 18:19:39,963 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 18:19:39,964 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 52 [2018-12-08 18:19:39,965 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-08 18:19:39,968 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-08 18:19:39,969 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-08 18:19:39,969 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:56, output treesize:44 [2018-12-08 18:19:40,021 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:19:40,025 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:19:40,025 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:19:40,028 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:19:40,029 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:19:40,033 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:19:40,044 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-12-08 18:19:40,045 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:65, output treesize:93 [2018-12-08 18:19:42,108 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:19:42,110 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:19:42,130 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:19:42,134 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:19:42,139 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-12-08 18:19:42,139 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:104, output treesize:63 [2018-12-08 18:19:44,259 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:19:44,264 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:19:44,313 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:19:44,314 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:19:44,334 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:19:44,340 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:19:44,354 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:19:44,358 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:19:44,363 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 4 dim-2 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2018-12-08 18:19:44,363 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 7 variables, input treesize:144, output treesize:83 [2018-12-08 18:19:46,429 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:19:46,430 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:19:46,449 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:19:46,452 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:19:46,457 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-12-08 18:19:46,457 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:104, output treesize:63 [2018-12-08 18:19:48,520 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:19:48,524 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:19:48,530 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:19:48,534 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:19:48,541 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:19:48,545 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:19:48,571 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:19:48,572 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:19:48,580 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-12-08 18:19:48,580 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:104, output treesize:63 [2018-12-08 18:19:50,672 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:19:50,682 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:19:50,684 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:19:50,694 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:19:50,695 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:19:50,704 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:19:50,819 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:19:50,826 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:19:50,917 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:19:50,925 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:19:50,925 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:19:50,932 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:19:50,933 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:19:50,940 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:19:51,022 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:19:51,026 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:19:51,090 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:19:51,095 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:19:51,105 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:19:51,113 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:19:51,121 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:19:51,125 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:19:51,160 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:19:51,162 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:19:51,171 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 6 dim-2 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2018-12-08 18:19:51,171 INFO L202 ElimStorePlain]: Needed 25 recursive calls to eliminate 9 variables, input treesize:184, output treesize:103 [2018-12-08 18:19:51,324 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 0 proven. 160 refuted. 28 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-08 18:19:51,340 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-08 18:19:51,340 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 26 [2018-12-08 18:19:51,340 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-08 18:19:51,341 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-08 18:19:51,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-08 18:19:51,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=561, Unknown=1, NotChecked=0, Total=650 [2018-12-08 18:19:51,341 INFO L87 Difference]: Start difference. First operand 939 states and 1412 transitions. Second operand 19 states. [2018-12-08 18:19:56,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:19:56,269 INFO L93 Difference]: Finished difference Result 2536 states and 3792 transitions. [2018-12-08 18:19:56,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-08 18:19:56,270 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 173 [2018-12-08 18:19:56,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:19:56,273 INFO L225 Difference]: With dead ends: 2536 [2018-12-08 18:19:56,273 INFO L226 Difference]: Without dead ends: 1622 [2018-12-08 18:19:56,275 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 375 GetRequests, 325 SyntacticMatches, 15 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 309 ImplicationChecksByTransitivity, 11.4s TimeCoverageRelationStatistics Valid=231, Invalid=1100, Unknown=1, NotChecked=0, Total=1332 [2018-12-08 18:19:56,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1622 states. [2018-12-08 18:19:56,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1622 to 899. [2018-12-08 18:19:56,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 899 states. [2018-12-08 18:19:56,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 899 states to 899 states and 1334 transitions. [2018-12-08 18:19:56,345 INFO L78 Accepts]: Start accepts. Automaton has 899 states and 1334 transitions. Word has length 173 [2018-12-08 18:19:56,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:19:56,345 INFO L480 AbstractCegarLoop]: Abstraction has 899 states and 1334 transitions. [2018-12-08 18:19:56,345 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-08 18:19:56,345 INFO L276 IsEmpty]: Start isEmpty. Operand 899 states and 1334 transitions. [2018-12-08 18:19:56,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-12-08 18:19:56,346 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:19:56,346 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 18:19:56,347 INFO L423 AbstractCegarLoop]: === Iteration 107 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:19:56,347 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:19:56,347 INFO L82 PathProgramCache]: Analyzing trace with hash -284520792, now seen corresponding path program 1 times [2018-12-08 18:19:56,347 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:19:56,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:19:56,348 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:19:56,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:19:56,348 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:19:56,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:19:56,395 INFO L134 CoverageAnalysis]: Checked inductivity of 221 backedges. 173 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2018-12-08 18:19:56,395 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:19:56,395 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 18:19:56,396 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:19:56,396 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 18:19:56,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 18:19:56,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 18:19:56,396 INFO L87 Difference]: Start difference. First operand 899 states and 1334 transitions. Second operand 4 states. [2018-12-08 18:19:56,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:19:56,696 INFO L93 Difference]: Finished difference Result 1845 states and 2734 transitions. [2018-12-08 18:19:56,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 18:19:56,696 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 173 [2018-12-08 18:19:56,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:19:56,698 INFO L225 Difference]: With dead ends: 1845 [2018-12-08 18:19:56,698 INFO L226 Difference]: Without dead ends: 971 [2018-12-08 18:19:56,699 INFO L631 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 [2018-12-08 18:19:56,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 971 states. [2018-12-08 18:19:56,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 971 to 839. [2018-12-08 18:19:56,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 839 states. [2018-12-08 18:19:56,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 839 states to 839 states and 1242 transitions. [2018-12-08 18:19:56,793 INFO L78 Accepts]: Start accepts. Automaton has 839 states and 1242 transitions. Word has length 173 [2018-12-08 18:19:56,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:19:56,793 INFO L480 AbstractCegarLoop]: Abstraction has 839 states and 1242 transitions. [2018-12-08 18:19:56,793 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 18:19:56,793 INFO L276 IsEmpty]: Start isEmpty. Operand 839 states and 1242 transitions. [2018-12-08 18:19:56,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-12-08 18:19:56,794 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:19:56,794 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 18:19:56,794 INFO L423 AbstractCegarLoop]: === Iteration 108 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:19:56,794 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:19:56,794 INFO L82 PathProgramCache]: Analyzing trace with hash -2036911981, now seen corresponding path program 1 times [2018-12-08 18:19:56,794 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:19:56,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:19:56,795 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:19:56,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:19:56,795 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:19:56,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:19:56,853 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 175 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2018-12-08 18:19:56,853 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:19:56,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 18:19:56,853 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:19:56,853 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 18:19:56,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 18:19:56,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 18:19:56,854 INFO L87 Difference]: Start difference. First operand 839 states and 1242 transitions. Second operand 4 states. [2018-12-08 18:19:57,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:19:57,129 INFO L93 Difference]: Finished difference Result 1781 states and 2636 transitions. [2018-12-08 18:19:57,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 18:19:57,130 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 174 [2018-12-08 18:19:57,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:19:57,131 INFO L225 Difference]: With dead ends: 1781 [2018-12-08 18:19:57,131 INFO L226 Difference]: Without dead ends: 967 [2018-12-08 18:19:57,132 INFO L631 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 [2018-12-08 18:19:57,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 967 states. [2018-12-08 18:19:57,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 967 to 901. [2018-12-08 18:19:57,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 901 states. [2018-12-08 18:19:57,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 901 states to 901 states and 1334 transitions. [2018-12-08 18:19:57,199 INFO L78 Accepts]: Start accepts. Automaton has 901 states and 1334 transitions. Word has length 174 [2018-12-08 18:19:57,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:19:57,199 INFO L480 AbstractCegarLoop]: Abstraction has 901 states and 1334 transitions. [2018-12-08 18:19:57,199 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 18:19:57,199 INFO L276 IsEmpty]: Start isEmpty. Operand 901 states and 1334 transitions. [2018-12-08 18:19:57,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-12-08 18:19:57,200 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:19:57,200 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 18:19:57,200 INFO L423 AbstractCegarLoop]: === Iteration 109 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:19:57,200 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:19:57,201 INFO L82 PathProgramCache]: Analyzing trace with hash -175998908, now seen corresponding path program 1 times [2018-12-08 18:19:57,201 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:19:57,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:19:57,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:19:57,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:19:57,201 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:19:57,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:19:57,262 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2018-12-08 18:19:57,262 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:19:57,262 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 18:19:57,262 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:19:57,262 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 18:19:57,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 18:19:57,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 18:19:57,263 INFO L87 Difference]: Start difference. First operand 901 states and 1334 transitions. Second operand 4 states. [2018-12-08 18:19:57,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:19:57,572 INFO L93 Difference]: Finished difference Result 1851 states and 2740 transitions. [2018-12-08 18:19:57,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 18:19:57,572 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 177 [2018-12-08 18:19:57,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:19:57,573 INFO L225 Difference]: With dead ends: 1851 [2018-12-08 18:19:57,573 INFO L226 Difference]: Without dead ends: 975 [2018-12-08 18:19:57,573 INFO L631 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 [2018-12-08 18:19:57,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 975 states. [2018-12-08 18:19:57,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 975 to 901. [2018-12-08 18:19:57,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 901 states. [2018-12-08 18:19:57,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 901 states to 901 states and 1332 transitions. [2018-12-08 18:19:57,630 INFO L78 Accepts]: Start accepts. Automaton has 901 states and 1332 transitions. Word has length 177 [2018-12-08 18:19:57,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:19:57,630 INFO L480 AbstractCegarLoop]: Abstraction has 901 states and 1332 transitions. [2018-12-08 18:19:57,630 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 18:19:57,630 INFO L276 IsEmpty]: Start isEmpty. Operand 901 states and 1332 transitions. [2018-12-08 18:19:57,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-12-08 18:19:57,631 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:19:57,631 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 18:19:57,631 INFO L423 AbstractCegarLoop]: === Iteration 110 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:19:57,631 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:19:57,631 INFO L82 PathProgramCache]: Analyzing trace with hash 225246923, now seen corresponding path program 1 times [2018-12-08 18:19:57,632 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:19:57,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:19:57,632 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:19:57,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:19:57,632 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:19:57,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:19:57,682 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 136 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2018-12-08 18:19:57,682 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:19:57,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 18:19:57,683 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:19:57,683 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 18:19:57,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 18:19:57,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 18:19:57,683 INFO L87 Difference]: Start difference. First operand 901 states and 1332 transitions. Second operand 4 states. [2018-12-08 18:19:57,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:19:57,959 INFO L93 Difference]: Finished difference Result 1851 states and 2736 transitions. [2018-12-08 18:19:57,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 18:19:57,960 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 178 [2018-12-08 18:19:57,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:19:57,961 INFO L225 Difference]: With dead ends: 1851 [2018-12-08 18:19:57,961 INFO L226 Difference]: Without dead ends: 975 [2018-12-08 18:19:57,962 INFO L631 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 [2018-12-08 18:19:57,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 975 states. [2018-12-08 18:19:58,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 975 to 901. [2018-12-08 18:19:58,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 901 states. [2018-12-08 18:19:58,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 901 states to 901 states and 1330 transitions. [2018-12-08 18:19:58,021 INFO L78 Accepts]: Start accepts. Automaton has 901 states and 1330 transitions. Word has length 178 [2018-12-08 18:19:58,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:19:58,021 INFO L480 AbstractCegarLoop]: Abstraction has 901 states and 1330 transitions. [2018-12-08 18:19:58,021 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 18:19:58,021 INFO L276 IsEmpty]: Start isEmpty. Operand 901 states and 1330 transitions. [2018-12-08 18:19:58,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-12-08 18:19:58,022 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:19:58,022 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 18:19:58,022 INFO L423 AbstractCegarLoop]: === Iteration 111 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:19:58,022 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:19:58,022 INFO L82 PathProgramCache]: Analyzing trace with hash 1043728489, now seen corresponding path program 1 times [2018-12-08 18:19:58,022 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:19:58,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:19:58,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:19:58,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:19:58,023 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:19:58,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:19:58,067 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2018-12-08 18:19:58,067 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:19:58,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 18:19:58,067 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:19:58,067 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 18:19:58,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 18:19:58,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 18:19:58,068 INFO L87 Difference]: Start difference. First operand 901 states and 1330 transitions. Second operand 4 states. [2018-12-08 18:19:58,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:19:58,382 INFO L93 Difference]: Finished difference Result 1851 states and 2732 transitions. [2018-12-08 18:19:58,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 18:19:58,382 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 179 [2018-12-08 18:19:58,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:19:58,383 INFO L225 Difference]: With dead ends: 1851 [2018-12-08 18:19:58,383 INFO L226 Difference]: Without dead ends: 975 [2018-12-08 18:19:58,384 INFO L631 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 [2018-12-08 18:19:58,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 975 states. [2018-12-08 18:19:58,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 975 to 901. [2018-12-08 18:19:58,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 901 states. [2018-12-08 18:19:58,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 901 states to 901 states and 1328 transitions. [2018-12-08 18:19:58,444 INFO L78 Accepts]: Start accepts. Automaton has 901 states and 1328 transitions. Word has length 179 [2018-12-08 18:19:58,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:19:58,444 INFO L480 AbstractCegarLoop]: Abstraction has 901 states and 1328 transitions. [2018-12-08 18:19:58,444 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 18:19:58,444 INFO L276 IsEmpty]: Start isEmpty. Operand 901 states and 1328 transitions. [2018-12-08 18:19:58,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-12-08 18:19:58,445 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:19:58,445 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 18:19:58,446 INFO L423 AbstractCegarLoop]: === Iteration 112 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:19:58,446 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:19:58,446 INFO L82 PathProgramCache]: Analyzing trace with hash 1911615952, now seen corresponding path program 1 times [2018-12-08 18:19:58,446 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:19:58,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:19:58,447 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:19:58,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:19:58,447 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:19:58,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:19:58,495 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2018-12-08 18:19:58,495 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:19:58,496 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 18:19:58,496 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:19:58,496 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 18:19:58,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 18:19:58,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 18:19:58,496 INFO L87 Difference]: Start difference. First operand 901 states and 1328 transitions. Second operand 4 states. [2018-12-08 18:19:58,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:19:58,793 INFO L93 Difference]: Finished difference Result 1831 states and 2704 transitions. [2018-12-08 18:19:58,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 18:19:58,793 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 180 [2018-12-08 18:19:58,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:19:58,794 INFO L225 Difference]: With dead ends: 1831 [2018-12-08 18:19:58,794 INFO L226 Difference]: Without dead ends: 955 [2018-12-08 18:19:58,794 INFO L631 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 [2018-12-08 18:19:58,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 955 states. [2018-12-08 18:19:58,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 955 to 901. [2018-12-08 18:19:58,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 901 states. [2018-12-08 18:19:58,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 901 states to 901 states and 1326 transitions. [2018-12-08 18:19:58,851 INFO L78 Accepts]: Start accepts. Automaton has 901 states and 1326 transitions. Word has length 180 [2018-12-08 18:19:58,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:19:58,852 INFO L480 AbstractCegarLoop]: Abstraction has 901 states and 1326 transitions. [2018-12-08 18:19:58,852 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 18:19:58,852 INFO L276 IsEmpty]: Start isEmpty. Operand 901 states and 1326 transitions. [2018-12-08 18:19:58,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-12-08 18:19:58,852 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:19:58,852 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 18:19:58,853 INFO L423 AbstractCegarLoop]: === Iteration 113 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:19:58,853 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:19:58,853 INFO L82 PathProgramCache]: Analyzing trace with hash -404264575, now seen corresponding path program 1 times [2018-12-08 18:19:58,853 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:19:58,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:19:58,853 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:19:58,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:19:58,853 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:19:58,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:19:58,924 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2018-12-08 18:19:58,925 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:19:58,925 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 18:19:58,925 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:19:58,925 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 18:19:58,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 18:19:58,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-08 18:19:58,925 INFO L87 Difference]: Start difference. First operand 901 states and 1326 transitions. Second operand 5 states. [2018-12-08 18:19:59,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:19:59,322 INFO L93 Difference]: Finished difference Result 2083 states and 3108 transitions. [2018-12-08 18:19:59,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 18:19:59,323 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 183 [2018-12-08 18:19:59,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:19:59,324 INFO L225 Difference]: With dead ends: 2083 [2018-12-08 18:19:59,324 INFO L226 Difference]: Without dead ends: 1207 [2018-12-08 18:19:59,325 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-08 18:19:59,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1207 states. [2018-12-08 18:19:59,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1207 to 979. [2018-12-08 18:19:59,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 979 states. [2018-12-08 18:19:59,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 979 states to 979 states and 1468 transitions. [2018-12-08 18:19:59,389 INFO L78 Accepts]: Start accepts. Automaton has 979 states and 1468 transitions. Word has length 183 [2018-12-08 18:19:59,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:19:59,389 INFO L480 AbstractCegarLoop]: Abstraction has 979 states and 1468 transitions. [2018-12-08 18:19:59,389 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 18:19:59,389 INFO L276 IsEmpty]: Start isEmpty. Operand 979 states and 1468 transitions. [2018-12-08 18:19:59,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-12-08 18:19:59,390 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:19:59,390 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 18:19:59,390 INFO L423 AbstractCegarLoop]: === Iteration 114 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:19:59,390 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:19:59,390 INFO L82 PathProgramCache]: Analyzing trace with hash 112427317, now seen corresponding path program 1 times [2018-12-08 18:19:59,390 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:19:59,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:19:59,390 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:19:59,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:19:59,390 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:19:59,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:19:59,468 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2018-12-08 18:19:59,469 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:19:59,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 18:19:59,469 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:19:59,469 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 18:19:59,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 18:19:59,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-08 18:19:59,469 INFO L87 Difference]: Start difference. First operand 979 states and 1468 transitions. Second operand 5 states. [2018-12-08 18:20:00,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:20:00,290 INFO L93 Difference]: Finished difference Result 2151 states and 3244 transitions. [2018-12-08 18:20:00,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 18:20:00,290 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 184 [2018-12-08 18:20:00,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:20:00,292 INFO L225 Difference]: With dead ends: 2151 [2018-12-08 18:20:00,292 INFO L226 Difference]: Without dead ends: 1197 [2018-12-08 18:20:00,293 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-08 18:20:00,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1197 states. [2018-12-08 18:20:00,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1197 to 1033. [2018-12-08 18:20:00,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1033 states. [2018-12-08 18:20:00,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1033 states to 1033 states and 1578 transitions. [2018-12-08 18:20:00,365 INFO L78 Accepts]: Start accepts. Automaton has 1033 states and 1578 transitions. Word has length 184 [2018-12-08 18:20:00,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:20:00,365 INFO L480 AbstractCegarLoop]: Abstraction has 1033 states and 1578 transitions. [2018-12-08 18:20:00,365 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 18:20:00,365 INFO L276 IsEmpty]: Start isEmpty. Operand 1033 states and 1578 transitions. [2018-12-08 18:20:00,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2018-12-08 18:20:00,366 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:20:00,366 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 18:20:00,366 INFO L423 AbstractCegarLoop]: === Iteration 115 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:20:00,366 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:20:00,366 INFO L82 PathProgramCache]: Analyzing trace with hash 420335011, now seen corresponding path program 1 times [2018-12-08 18:20:00,366 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:20:00,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:20:00,366 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:20:00,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:20:00,367 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:20:00,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:20:00,605 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 4 proven. 205 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2018-12-08 18:20:00,605 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 18:20:00,605 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-08 18:20:00,605 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 198 with the following transitions: [2018-12-08 18:20:00,606 INFO L205 CegarAbsIntRunner]: [0], [1], [5], [9], [12], [16], [27], [29], [33], [42], [44], [49], [54], [59], [64], [69], [74], [79], [84], [87], [89], [94], [99], [102], [104], [109], [112], [114], [119], [122], [124], [129], [132], [134], [139], [144], [149], [152], [154], [159], [164], [169], [174], [179], [184], [187], [278], [281], [289], [291], [294], [302], [307], [309], [311], [314], [329], [331], [336], [338], [343], [348], [389], [391], [393], [396], [407], [409], [419], [421], [426], [432], [454], [456], [514], [519], [524], [611], [645], [647], [659], [662], [663], [664], [666] [2018-12-08 18:20:00,608 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-08 18:20:00,608 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-08 18:20:00,821 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-08 18:20:00,821 INFO L272 AbstractInterpreter]: Visited 85 different actions 225 times. Merged at 68 different actions 130 times. Never widened. Performed 1637 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1637 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 15 fixpoints after 8 different actions. Largest state had 137 variables. [2018-12-08 18:20:00,824 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:20:00,824 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-08 18:20:00,824 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 18:20:00,825 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6b342074-af84-4fe5-a218-0680d1cd191a/bin-2019/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 18:20:00,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:20:00,834 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-08 18:20:00,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:20:00,942 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 18:20:00,961 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:20:00,961 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2018-12-08 18:20:01,001 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:20:01,002 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:20:01,003 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 44 [2018-12-08 18:20:01,017 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:20:01,019 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:20:01,019 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:20:01,020 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:20:01,021 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2018-12-08 18:20:01,021 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-08 18:20:01,028 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 18:20:01,034 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 18:20:01,044 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 20 [2018-12-08 18:20:01,045 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 23 [2018-12-08 18:20:01,047 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:20:01,047 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2018-12-08 18:20:01,049 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:20:01,050 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:20:01,051 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:20:01,051 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:20:01,052 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 68 [2018-12-08 18:20:01,052 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-08 18:20:01,058 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 18:20:01,061 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 18:20:01,064 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 18:20:01,072 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 18:20:01,073 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:57, output treesize:79 [2018-12-08 18:20:01,101 INFO L478 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 0 case distinctions, treesize of input 98 treesize of output 77 [2018-12-08 18:20:01,105 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:20:01,106 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:20:01,107 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:20:01,111 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 127 [2018-12-08 18:20:01,111 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 18:20:01,128 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 18:20:01,143 INFO L478 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 0 case distinctions, treesize of input 98 treesize of output 77 [2018-12-08 18:20:01,145 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:20:01,146 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:20:01,146 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:20:01,150 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 127 [2018-12-08 18:20:01,150 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 18:20:01,163 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 18:20:01,173 INFO L478 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 0 case distinctions, treesize of input 98 treesize of output 77 [2018-12-08 18:20:01,176 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:20:01,176 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:20:01,177 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:20:01,180 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 127 [2018-12-08 18:20:01,180 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-08 18:20:01,191 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 18:20:01,197 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 18:20:01,197 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:136, output treesize:79 [2018-12-08 18:20:01,213 INFO L478 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 0 case distinctions, treesize of input 98 treesize of output 77 [2018-12-08 18:20:01,215 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:20:01,216 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:20:01,217 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:20:01,220 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 127 [2018-12-08 18:20:01,221 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 18:20:01,232 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 18:20:01,237 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 18:20:01,237 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:98, output treesize:79 [2018-12-08 18:20:01,241 INFO L478 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 0 case distinctions, treesize of input 98 treesize of output 77 [2018-12-08 18:20:01,243 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:20:01,244 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:20:01,245 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:20:01,247 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 127 [2018-12-08 18:20:01,248 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 18:20:01,258 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 18:20:01,264 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 18:20:01,264 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:98, output treesize:79 [2018-12-08 18:20:01,266 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:20:01,268 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:20:01,282 INFO L478 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 0 case distinctions, treesize of input 103 treesize of output 82 [2018-12-08 18:20:01,284 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:20:01,285 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:20:01,285 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:20:01,289 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 132 [2018-12-08 18:20:01,292 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:20:01,293 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:20:01,293 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:20:01,294 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:20:01,294 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:20:01,295 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:20:01,296 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:20:01,301 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 16 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 168 [2018-12-08 18:20:01,302 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-08 18:20:01,317 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 18:20:01,326 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 18:20:01,333 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 18:20:01,333 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:117, output treesize:79 [2018-12-08 18:20:01,338 INFO L478 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 0 case distinctions, treesize of input 98 treesize of output 77 [2018-12-08 18:20:01,341 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:20:01,341 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:20:01,342 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:20:01,345 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 127 [2018-12-08 18:20:01,345 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 18:20:01,366 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 18:20:01,372 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 18:20:01,372 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:98, output treesize:79 [2018-12-08 18:20:01,375 INFO L478 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 0 case distinctions, treesize of input 98 treesize of output 77 [2018-12-08 18:20:01,377 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:20:01,377 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:20:01,378 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:20:01,380 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 127 [2018-12-08 18:20:01,380 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 18:20:01,391 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 18:20:01,397 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 18:20:01,397 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:98, output treesize:79 [2018-12-08 18:20:01,403 INFO L478 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 0 case distinctions, treesize of input 98 treesize of output 77 [2018-12-08 18:20:01,406 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:20:01,407 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:20:01,407 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:20:01,411 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 127 [2018-12-08 18:20:01,411 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 18:20:01,424 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 18:20:01,436 INFO L478 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 0 case distinctions, treesize of input 98 treesize of output 77 [2018-12-08 18:20:01,438 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:20:01,439 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:20:01,440 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:20:01,443 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 127 [2018-12-08 18:20:01,443 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 18:20:01,456 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 18:20:01,464 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 18:20:01,464 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:117, output treesize:79 [2018-12-08 18:20:01,468 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 45 [2018-12-08 18:20:01,470 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 37 [2018-12-08 18:20:01,470 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:20:01,472 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:20:01,486 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 110 [2018-12-08 18:20:01,487 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 28 treesize of output 1 [2018-12-08 18:20:01,488 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 18:20:01,494 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 18:20:01,499 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 18:20:01,499 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:128, output treesize:79 [2018-12-08 18:20:01,501 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:20:01,503 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:20:01,516 INFO L478 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 0 case distinctions, treesize of input 103 treesize of output 82 [2018-12-08 18:20:01,519 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:20:01,520 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:20:01,521 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:20:01,527 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 132 [2018-12-08 18:20:01,533 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:20:01,534 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:20:01,535 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:20:01,536 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:20:01,536 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:20:01,537 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:20:01,538 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:20:01,546 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 16 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 168 [2018-12-08 18:20:01,547 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-08 18:20:01,569 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 18:20:01,577 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 18:20:01,587 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 18:20:01,587 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:117, output treesize:79 [2018-12-08 18:20:01,592 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 45 [2018-12-08 18:20:01,593 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 37 [2018-12-08 18:20:01,594 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:20:01,596 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:20:01,619 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 110 [2018-12-08 18:20:01,621 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 28 treesize of output 1 [2018-12-08 18:20:01,621 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 18:20:01,629 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 18:20:01,636 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 18:20:01,637 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:128, output treesize:79 [2018-12-08 18:20:01,649 INFO L478 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 80 [2018-12-08 18:20:01,653 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 10 treesize of output 9 [2018-12-08 18:20:01,653 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 18:20:01,669 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:20:01,679 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 55 [2018-12-08 18:20:01,682 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 22 treesize of output 21 [2018-12-08 18:20:01,683 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 18:20:01,700 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:20:01,709 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 49 [2018-12-08 18:20:01,713 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:20:01,715 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:20:01,715 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2018-12-08 18:20:01,715 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-08 18:20:01,731 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 18:20:01,742 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 18:20:01,753 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 18:20:01,800 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:20:01,804 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:20:01,848 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:20:01,861 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:20:01,904 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:20:01,910 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 226 treesize of output 227 [2018-12-08 18:20:01,913 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 50 treesize of output 1 [2018-12-08 18:20:01,913 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-08 18:20:01,922 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 18:20:01,956 INFO L478 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 240 treesize of output 182 [2018-12-08 18:20:01,978 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:20:01,980 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:20:01,981 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:20:01,986 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 157 treesize of output 232 [2018-12-08 18:20:01,986 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-08 18:20:02,018 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 184 treesize of output 153 [2018-12-08 18:20:02,020 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 22 treesize of output 21 [2018-12-08 18:20:02,020 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-12-08 18:20:02,042 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 149 treesize of output 125 [2018-12-08 18:20:02,045 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:20:02,046 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:20:02,046 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:20:02,048 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:20:02,049 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:20:02,050 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:20:02,050 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:20:02,058 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 16 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 210 [2018-12-08 18:20:02,058 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-12-08 18:20:02,081 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 18:20:02,093 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 18:20:02,105 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 18:20:02,124 INFO L478 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 0 case distinctions, treesize of input 62 treesize of output 55 [2018-12-08 18:20:02,127 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:20:02,128 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 51 [2018-12-08 18:20:02,128 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-12-08 18:20:02,133 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 18:20:02,147 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 18:20:02,147 INFO L202 ElimStorePlain]: Needed 21 recursive calls to eliminate 6 variables, input treesize:343, output treesize:118 [2018-12-08 18:20:02,178 INFO L478 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 53 treesize of output 49 [2018-12-08 18:20:02,180 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 41 [2018-12-08 18:20:02,181 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:20:02,186 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:20:02,201 INFO L478 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 119 treesize of output 97 [2018-12-08 18:20:02,203 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 77 [2018-12-08 18:20:02,203 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:20:02,210 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:20:02,218 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:20:02,219 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 58 [2018-12-08 18:20:02,221 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:20:02,221 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:20:02,222 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:20:02,222 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 69 [2018-12-08 18:20:02,223 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-08 18:20:02,230 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 18:20:02,234 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-08 18:20:02,234 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:149, output treesize:38 [2018-12-08 18:20:02,430 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 91 proven. 118 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2018-12-08 18:20:02,430 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 18:20:02,491 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:20:02,497 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:20:02,526 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:20:02,531 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:20:02,552 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:20:02,564 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:20:02,581 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:20:02,585 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:20:02,602 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:20:02,609 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 282 treesize of output 273 [2018-12-08 18:20:02,613 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:20:02,615 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 258 treesize of output 245 [2018-12-08 18:20:02,615 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-08 18:20:02,621 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 18:20:02,628 INFO L478 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 198 treesize of output 196 [2018-12-08 18:20:02,632 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 191 treesize of output 187 [2018-12-08 18:20:02,633 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:20:02,637 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:20:02,646 INFO L478 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 187 treesize of output 159 [2018-12-08 18:20:02,648 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 11 treesize of output 10 [2018-12-08 18:20:02,648 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-08 18:20:02,658 INFO L478 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 0 case distinctions, treesize of input 158 treesize of output 129 [2018-12-08 18:20:02,675 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 18:20:02,675 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 18:20:02,676 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 70 [2018-12-08 18:20:02,676 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-12-08 18:20:02,696 INFO L478 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 121 treesize of output 112 [2018-12-08 18:20:02,699 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 18:20:02,699 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 18:20:02,700 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 98 [2018-12-08 18:20:02,700 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-12-08 18:20:02,715 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 83 [2018-12-08 18:20:02,715 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-12-08 18:20:02,724 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 18:20:02,725 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 18:20:02,725 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 18:20:02,725 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 18:20:02,726 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 18:20:02,726 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 18:20:02,726 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 27 [2018-12-08 18:20:02,727 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-12-08 18:20:02,735 INFO L267 ElimStorePlain]: Start of recursive call 18: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-08 18:20:02,738 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 182 treesize of output 168 [2018-12-08 18:20:02,740 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2018-12-08 18:20:02,740 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-12-08 18:20:02,746 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 18:20:02,746 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 18:20:02,747 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2018-12-08 18:20:02,747 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-12-08 18:20:02,750 INFO L267 ElimStorePlain]: Start of recursive call 22: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 18:20:02,756 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-08 18:20:02,762 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-08 18:20:02,770 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-12-08 18:20:02,770 INFO L202 ElimStorePlain]: Needed 24 recursive calls to eliminate 7 variables, input treesize:289, output treesize:98 [2018-12-08 18:20:02,775 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:20:02,777 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:20:02,779 INFO L478 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 38 treesize of output 36 [2018-12-08 18:20:02,780 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 32 [2018-12-08 18:20:02,780 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:20:02,782 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:20:02,783 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-08 18:20:02,783 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:61, output treesize:32 [2018-12-08 18:20:02,789 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:20:02,790 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:20:02,797 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:20:02,798 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:20:02,799 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:20:02,799 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:51, output treesize:15 [2018-12-08 18:20:02,803 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:20:02,805 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:20:02,807 INFO L478 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 38 treesize of output 36 [2018-12-08 18:20:02,808 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 32 [2018-12-08 18:20:02,808 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:20:02,810 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:20:02,811 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-08 18:20:02,811 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:61, output treesize:32 [2018-12-08 18:20:02,817 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:20:02,818 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:20:02,825 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:20:02,826 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:20:02,827 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:20:02,827 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:51, output treesize:15 [2018-12-08 18:20:02,831 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:20:02,832 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:20:02,833 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:20:02,833 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:15 [2018-12-08 18:20:02,837 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:20:02,838 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:20:02,839 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:20:02,839 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:15 [2018-12-08 18:20:02,843 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:20:02,845 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:20:02,853 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:20:02,855 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:20:02,856 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-08 18:20:02,856 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:51, output treesize:20 [2018-12-08 18:20:02,860 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:20:02,861 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:20:02,862 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:20:02,862 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:15 [2018-12-08 18:20:02,866 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:20:02,867 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:20:02,868 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:20:02,868 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:15 [2018-12-08 18:20:02,873 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:20:02,875 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:20:02,881 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:20:02,883 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:20:02,890 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:20:02,891 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:20:02,892 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-08 18:20:02,893 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:71, output treesize:20 [2018-12-08 18:20:02,947 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 0 proven. 209 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2018-12-08 18:20:02,963 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-08 18:20:02,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 19 [2018-12-08 18:20:02,963 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-08 18:20:02,963 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-08 18:20:02,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-08 18:20:02,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2018-12-08 18:20:02,963 INFO L87 Difference]: Start difference. First operand 1033 states and 1578 transitions. Second operand 15 states. [2018-12-08 18:20:06,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:20:06,207 INFO L93 Difference]: Finished difference Result 3461 states and 5276 transitions. [2018-12-08 18:20:06,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-08 18:20:06,207 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 197 [2018-12-08 18:20:06,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:20:06,209 INFO L225 Difference]: With dead ends: 3461 [2018-12-08 18:20:06,209 INFO L226 Difference]: Without dead ends: 2453 [2018-12-08 18:20:06,210 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 420 GetRequests, 374 SyntacticMatches, 23 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=129, Invalid=471, Unknown=0, NotChecked=0, Total=600 [2018-12-08 18:20:06,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2453 states. [2018-12-08 18:20:06,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2453 to 1411. [2018-12-08 18:20:06,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1411 states. [2018-12-08 18:20:06,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1411 states to 1411 states and 2216 transitions. [2018-12-08 18:20:06,291 INFO L78 Accepts]: Start accepts. Automaton has 1411 states and 2216 transitions. Word has length 197 [2018-12-08 18:20:06,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:20:06,291 INFO L480 AbstractCegarLoop]: Abstraction has 1411 states and 2216 transitions. [2018-12-08 18:20:06,291 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-08 18:20:06,291 INFO L276 IsEmpty]: Start isEmpty. Operand 1411 states and 2216 transitions. [2018-12-08 18:20:06,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-12-08 18:20:06,292 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:20:06,292 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 18:20:06,292 INFO L423 AbstractCegarLoop]: === Iteration 116 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:20:06,292 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:20:06,292 INFO L82 PathProgramCache]: Analyzing trace with hash -66263640, now seen corresponding path program 1 times [2018-12-08 18:20:06,292 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:20:06,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:20:06,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:20:06,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:20:06,293 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:20:06,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 18:20:06,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 18:20:06,495 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-08 18:20:06,537 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 24587 could not be translated for associated CType STRUCT~~ssl_method_st?version~INT?ssl_new~*((*~SSL~0 ) : INT)?ssl_clear~*((*~SSL~0 ) : VOID)?ssl_free~*((*~SSL~0 ) : VOID)?ssl_accept~*((*~SSL~0 ) : INT)?ssl_connect~*((*~SSL~0 ) : INT)?ssl_read~*((*~SSL~0 *VOID INT ) : INT)?ssl_peek~*((*~SSL~0 *VOID INT ) : INT)?ssl_write~*((*~SSL~0 *VOID INT ) : INT)?ssl_shutdown~*((*~SSL~0 ) : INT)?ssl_renegotiate~*((*~SSL~0 ) : INT)?ssl_renegotiate_check~*((*~SSL~0 ) : INT)?ssl_ctrl~*((*~SSL~0 INT LONG *CHAR ) : LONG)?ssl_ctx_ctrl~*((*~SSL_CTX~0 INT LONG *CHAR ) : LONG)?get_cipher_by_char~*((*UCHAR ) : *~SSL_CIPHER~0)?put_cipher_by_char~*((*~SSL_CIPHER~0 *UCHAR ) : INT)?ssl_pending~*((*~SSL~0 ) : INT)?num_ciphers~*(() : INT)?get_cipher~*((UINT ) : *~SSL_CIPHER~0)?get_ssl_method~*((INT ) : *ssl_method_st)?get_timeout~*(() : LONG)?ssl3_enc~*ssl3_enc_method?ssl_version~*(() : INT)?ssl_callback_ctrl~*((*~SSL~0 INT *(() : VOID) ) : LONG)?ssl_ctx_callback_ctrl~*((*~SSL_CTX~0 INT *(() : VOID) ) : LONG)# [2018-12-08 18:20:06,537 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 24590 could not be translated for associated CType STRUCT~~ssl_method_st?version~INT?ssl_new~*((*~SSL~0 ) : INT)?ssl_clear~*((*~SSL~0 ) : VOID)?ssl_free~*((*~SSL~0 ) : VOID)?ssl_accept~*((*~SSL~0 ) : INT)?ssl_connect~*((*~SSL~0 ) : INT)?ssl_read~*((*~SSL~0 *VOID INT ) : INT)?ssl_peek~*((*~SSL~0 *VOID INT ) : INT)?ssl_write~*((*~SSL~0 *VOID INT ) : INT)?ssl_shutdown~*((*~SSL~0 ) : INT)?ssl_renegotiate~*((*~SSL~0 ) : INT)?ssl_renegotiate_check~*((*~SSL~0 ) : INT)?ssl_ctrl~*((*~SSL~0 INT LONG *CHAR ) : LONG)?ssl_ctx_ctrl~*((*~SSL_CTX~0 INT LONG *CHAR ) : LONG)?get_cipher_by_char~*((*UCHAR ) : *~SSL_CIPHER~0)?put_cipher_by_char~*((*~SSL_CIPHER~0 *UCHAR ) : INT)?ssl_pending~*((*~SSL~0 ) : INT)?num_ciphers~*(() : INT)?get_cipher~*((UINT ) : *~SSL_CIPHER~0)?get_ssl_method~*((INT ) : *ssl_method_st)?get_timeout~*(() : LONG)?ssl3_enc~*ssl3_enc_method?ssl_version~*(() : INT)?ssl_callback_ctrl~*((*~SSL~0 INT *(() : VOID) ) : LONG)?ssl_ctx_callback_ctrl~*((*~SSL_CTX~0 INT *(() : VOID) ) : LONG)# [2018-12-08 18:20:06,585 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.12 06:20:06 BoogieIcfgContainer [2018-12-08 18:20:06,585 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-08 18:20:06,585 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-08 18:20:06,585 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-08 18:20:06,585 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-08 18:20:06,586 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 06:19:07" (3/4) ... [2018-12-08 18:20:06,588 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-08 18:20:06,588 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-08 18:20:06,589 INFO L168 Benchmark]: Toolchain (without parser) took 60597.49 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 572.0 MB). Free memory was 948.1 MB in the beginning and 973.4 MB in the end (delta: -25.3 MB). Peak memory consumption was 546.7 MB. Max. memory is 11.5 GB. [2018-12-08 18:20:06,590 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 973.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 18:20:06,590 INFO L168 Benchmark]: CACSL2BoogieTranslator took 342.66 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 99.1 MB). Free memory was 948.1 MB in the beginning and 1.1 GB in the end (delta: -131.4 MB). Peak memory consumption was 39.8 MB. Max. memory is 11.5 GB. [2018-12-08 18:20:06,590 INFO L168 Benchmark]: Boogie Procedure Inliner took 22.33 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 18:20:06,590 INFO L168 Benchmark]: Boogie Preprocessor took 47.43 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.3 MB). Peak memory consumption was 7.3 MB. Max. memory is 11.5 GB. [2018-12-08 18:20:06,590 INFO L168 Benchmark]: RCFGBuilder took 609.62 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 977.8 MB in the end (delta: 94.4 MB). Peak memory consumption was 94.4 MB. Max. memory is 11.5 GB. [2018-12-08 18:20:06,590 INFO L168 Benchmark]: TraceAbstraction took 59569.69 ms. Allocated memory was 1.1 GB in the beginning and 1.6 GB in the end (delta: 472.9 MB). Free memory was 977.8 MB in the beginning and 973.4 MB in the end (delta: 4.4 MB). Peak memory consumption was 477.3 MB. Max. memory is 11.5 GB. [2018-12-08 18:20:06,590 INFO L168 Benchmark]: Witness Printer took 3.09 ms. Allocated memory is still 1.6 GB. Free memory is still 973.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 18:20:06,591 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 973.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 342.66 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 99.1 MB). Free memory was 948.1 MB in the beginning and 1.1 GB in the end (delta: -131.4 MB). Peak memory consumption was 39.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 22.33 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 47.43 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.3 MB). Peak memory consumption was 7.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 609.62 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 977.8 MB in the end (delta: 94.4 MB). Peak memory consumption was 94.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 59569.69 ms. Allocated memory was 1.1 GB in the beginning and 1.6 GB in the end (delta: 472.9 MB). Free memory was 977.8 MB in the beginning and 973.4 MB in the end (delta: 4.4 MB). Peak memory consumption was 477.3 MB. Max. memory is 11.5 GB. * Witness Printer took 3.09 ms. Allocated memory is still 1.6 GB. Free memory is still 973.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 24587 could not be translated for associated CType STRUCT~~ssl_method_st?version~INT?ssl_new~*((*~SSL~0 ) : INT)?ssl_clear~*((*~SSL~0 ) : VOID)?ssl_free~*((*~SSL~0 ) : VOID)?ssl_accept~*((*~SSL~0 ) : INT)?ssl_connect~*((*~SSL~0 ) : INT)?ssl_read~*((*~SSL~0 *VOID INT ) : INT)?ssl_peek~*((*~SSL~0 *VOID INT ) : INT)?ssl_write~*((*~SSL~0 *VOID INT ) : INT)?ssl_shutdown~*((*~SSL~0 ) : INT)?ssl_renegotiate~*((*~SSL~0 ) : INT)?ssl_renegotiate_check~*((*~SSL~0 ) : INT)?ssl_ctrl~*((*~SSL~0 INT LONG *CHAR ) : LONG)?ssl_ctx_ctrl~*((*~SSL_CTX~0 INT LONG *CHAR ) : LONG)?get_cipher_by_char~*((*UCHAR ) : *~SSL_CIPHER~0)?put_cipher_by_char~*((*~SSL_CIPHER~0 *UCHAR ) : INT)?ssl_pending~*((*~SSL~0 ) : INT)?num_ciphers~*(() : INT)?get_cipher~*((UINT ) : *~SSL_CIPHER~0)?get_ssl_method~*((INT ) : *ssl_method_st)?get_timeout~*(() : LONG)?ssl3_enc~*ssl3_enc_method?ssl_version~*(() : INT)?ssl_callback_ctrl~*((*~SSL~0 INT *(() : VOID) ) : LONG)?ssl_ctx_callback_ctrl~*((*~SSL_CTX~0 INT *(() : VOID) ) : LONG)# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 24590 could not be translated for associated CType STRUCT~~ssl_method_st?version~INT?ssl_new~*((*~SSL~0 ) : INT)?ssl_clear~*((*~SSL~0 ) : VOID)?ssl_free~*((*~SSL~0 ) : VOID)?ssl_accept~*((*~SSL~0 ) : INT)?ssl_connect~*((*~SSL~0 ) : INT)?ssl_read~*((*~SSL~0 *VOID INT ) : INT)?ssl_peek~*((*~SSL~0 *VOID INT ) : INT)?ssl_write~*((*~SSL~0 *VOID INT ) : INT)?ssl_shutdown~*((*~SSL~0 ) : INT)?ssl_renegotiate~*((*~SSL~0 ) : INT)?ssl_renegotiate_check~*((*~SSL~0 ) : INT)?ssl_ctrl~*((*~SSL~0 INT LONG *CHAR ) : LONG)?ssl_ctx_ctrl~*((*~SSL_CTX~0 INT LONG *CHAR ) : LONG)?get_cipher_by_char~*((*UCHAR ) : *~SSL_CIPHER~0)?put_cipher_by_char~*((*~SSL_CIPHER~0 *UCHAR ) : INT)?ssl_pending~*((*~SSL~0 ) : INT)?num_ciphers~*(() : INT)?get_cipher~*((UINT ) : *~SSL_CIPHER~0)?get_ssl_method~*((INT ) : *ssl_method_st)?get_timeout~*(() : LONG)?ssl3_enc~*ssl3_enc_method?ssl_version~*(() : INT)?ssl_callback_ctrl~*((*~SSL~0 INT *(() : VOID) ) : LONG)?ssl_ctx_callback_ctrl~*((*~SSL_CTX~0 INT *(() : VOID) ) : LONG)# * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 1750]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of bitwiseAnd at line 1121. Possible FailurePath: [L1042] static int init = 1; [L1043] static SSL_METHOD SSLv3_server_data ; VAL [\old(init)=24609, \old(SSLv3_server_data)=null, \old(SSLv3_server_data)=null, init=1, SSLv3_server_data={24589:0}] [L1065] SSL *s ; [L1066] int tmp ; [L1070] s = malloc(sizeof(SSL)) [L1071] s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1072] s->ctx = malloc(sizeof(SSL_CTX)) [L1073] s->session = malloc(sizeof(SSL_SESSION)) VAL [init=1, malloc(sizeof(SSL))={24597:0}, malloc(sizeof(SSL_CTX))={24611:0}, malloc(sizeof(SSL_SESSION))={24578:0}, malloc(sizeof(struct ssl3_state_st))={24602:0}, s={24597:0}, SSLv3_server_data={24589:0}] [L1074] CALL ssl3_accept(s) VAL [init=1, s={24597:0}, SSLv3_server_data={24589:0}] [L1080] BUF_MEM *buf ; [L1081] unsigned long l ; [L1082] unsigned long Time ; [L1083] unsigned long tmp ; [L1084] void (*cb)() ; [L1085] long num1 ; [L1086] int ret ; [L1087] int new_state ; [L1088] int state ; [L1089] int skip ; [L1090] int got_new_session ; [L1091] int tmp___1 = __VERIFIER_nondet_int() ; [L1092] int tmp___2 = __VERIFIER_nondet_int() ; [L1093] int tmp___3 = __VERIFIER_nondet_int() ; [L1094] int tmp___4 = __VERIFIER_nondet_int() ; [L1095] int tmp___5 = __VERIFIER_nondet_int() ; [L1096] int tmp___6 = __VERIFIER_nondet_int() ; [L1097] int tmp___7 ; [L1098] long tmp___8 = __VERIFIER_nondet_long() ; [L1099] int tmp___9 = __VERIFIER_nondet_int() ; [L1100] int tmp___10 = __VERIFIER_nondet_int() ; [L1101] int blastFlag ; [L1105] s->state = 8464 [L1106] blastFlag = 0 [L1107] s->hit=__VERIFIER_nondet_int () [L1108] s->state = 8464 [L1109] tmp = __VERIFIER_nondet_int() [L1110] Time = tmp [L1111] cb = (void (*)())((void *)0) [L1112] ret = -1 [L1113] skip = 0 [L1114] got_new_session = 0 [L1115] EXPR s->info_callback VAL [={0:0}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={24597:0}, s={24597:0}, s->info_callback={2:-1}, skip=0, SSLv3_server_data={24589:0}, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1115] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1116] EXPR s->info_callback [L1116] cb = s->info_callback [L1120] EXPR s->in_handshake [L1120] s->in_handshake += 1 [L1121] COND FALSE !(tmp___1 & 12288) VAL [={2:-1}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={24597:0}, s={24597:0}, skip=0, SSLv3_server_data={24589:0}, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1130] EXPR s->cert VAL [={2:-1}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={24597:0}, s={24597:0}, s->cert={3:-2}, skip=0, SSLv3_server_data={24589:0}, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1130] COND FALSE !((unsigned long )s->cert == (unsigned long )((void *)0)) [L1136] COND TRUE 1 VAL [={2:-1}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={24597:0}, s={24597:0}, skip=0, SSLv3_server_data={24589:0}, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [={2:-1}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={24597:0}, s={24597:0}, s->state=8464, skip=0, SSLv3_server_data={24589:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [={2:-1}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={24597:0}, s={24597:0}, s->state=8464, skip=0, SSLv3_server_data={24589:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [={2:-1}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={24597:0}, s={24597:0}, s->state=8464, skip=0, SSLv3_server_data={24589:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [={2:-1}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={24597:0}, s={24597:0}, s->state=8464, skip=0, SSLv3_server_data={24589:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [={2:-1}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={24597:0}, s={24597:0}, s->state=8464, skip=0, SSLv3_server_data={24589:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [={2:-1}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={24597:0}, s={24597:0}, s->state=8464, skip=0, SSLv3_server_data={24589:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [={2:-1}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={24597:0}, s={24597:0}, s->state=8464, skip=0, SSLv3_server_data={24589:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [={2:-1}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={24597:0}, s={24597:0}, s->state=8464, skip=0, SSLv3_server_data={24589:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [={2:-1}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={24597:0}, s={24597:0}, s->state=8464, skip=0, SSLv3_server_data={24589:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1163] COND TRUE s->state == 8464 [L1323] s->shutdown = 0 [L1324] ret = __VERIFIER_nondet_int() [L1325] COND TRUE blastFlag == 0 [L1326] blastFlag = 1 VAL [={2:-1}, blastFlag=1, got_new_session=0, init=1, ret=1, s={24597:0}, s={24597:0}, skip=0, SSLv3_server_data={24589:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1330] COND FALSE !(ret <= 0) [L1335] got_new_session = 1 [L1336] s->state = 8496 [L1337] s->init_num = 0 VAL [={2:-1}, blastFlag=1, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, skip=0, SSLv3_server_data={24589:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1709] EXPR s->s3 [L1709] EXPR (s->s3)->tmp.reuse_message VAL [={2:-1}, (s->s3)->tmp.reuse_message=24594, blastFlag=1, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->s3={24602:0}, skip=0, SSLv3_server_data={24589:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1709] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1738] skip = 0 VAL [={2:-1}, blastFlag=1, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, skip=0, SSLv3_server_data={24589:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1136] COND TRUE 1 VAL [={2:-1}, blastFlag=1, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, skip=0, SSLv3_server_data={24589:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [={2:-1}, blastFlag=1, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8496, skip=0, SSLv3_server_data={24589:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [={2:-1}, blastFlag=1, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8496, skip=0, SSLv3_server_data={24589:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [={2:-1}, blastFlag=1, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8496, skip=0, SSLv3_server_data={24589:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [={2:-1}, blastFlag=1, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8496, skip=0, SSLv3_server_data={24589:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [={2:-1}, blastFlag=1, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8496, skip=0, SSLv3_server_data={24589:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [={2:-1}, blastFlag=1, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8496, skip=0, SSLv3_server_data={24589:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [={2:-1}, blastFlag=1, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8496, skip=0, SSLv3_server_data={24589:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [={2:-1}, blastFlag=1, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8496, skip=0, SSLv3_server_data={24589:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [={2:-1}, blastFlag=1, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8496, skip=0, SSLv3_server_data={24589:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [={2:-1}, blastFlag=1, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8496, skip=0, SSLv3_server_data={24589:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [={2:-1}, blastFlag=1, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8496, skip=0, SSLv3_server_data={24589:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [={2:-1}, blastFlag=1, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8496, skip=0, SSLv3_server_data={24589:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1172] COND TRUE s->state == 8496 [L1341] ret = __VERIFIER_nondet_int() [L1342] COND TRUE blastFlag == 1 [L1343] blastFlag = 2 VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, skip=0, SSLv3_server_data={24589:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1347] COND FALSE !(ret <= 0) [L1352] s->hit VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->hit=1, skip=0, SSLv3_server_data={24589:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1352] COND TRUE s->hit [L1353] s->state = 8656 VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, skip=0, SSLv3_server_data={24589:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1357] s->init_num = 0 VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, skip=0, SSLv3_server_data={24589:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1709] EXPR s->s3 [L1709] EXPR (s->s3)->tmp.reuse_message VAL [={2:-1}, (s->s3)->tmp.reuse_message=24594, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->s3={24602:0}, skip=0, SSLv3_server_data={24589:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1709] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1738] skip = 0 VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, skip=0, SSLv3_server_data={24589:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1136] COND TRUE 1 VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, skip=0, SSLv3_server_data={24589:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8656, skip=0, SSLv3_server_data={24589:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8656, skip=0, SSLv3_server_data={24589:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8656, skip=0, SSLv3_server_data={24589:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8656, skip=0, SSLv3_server_data={24589:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8656, skip=0, SSLv3_server_data={24589:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8656, skip=0, SSLv3_server_data={24589:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8656, skip=0, SSLv3_server_data={24589:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8656, skip=0, SSLv3_server_data={24589:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8656, skip=0, SSLv3_server_data={24589:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8656, skip=0, SSLv3_server_data={24589:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8656, skip=0, SSLv3_server_data={24589:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8656, skip=0, SSLv3_server_data={24589:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8656, skip=0, SSLv3_server_data={24589:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8656, skip=0, SSLv3_server_data={24589:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8656, skip=0, SSLv3_server_data={24589:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8656, skip=0, SSLv3_server_data={24589:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8656, skip=0, SSLv3_server_data={24589:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8656, skip=0, SSLv3_server_data={24589:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8656, skip=0, SSLv3_server_data={24589:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8656, skip=0, SSLv3_server_data={24589:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8656, skip=0, SSLv3_server_data={24589:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8656, skip=0, SSLv3_server_data={24589:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1202] COND FALSE !(s->state == 8448) [L1205] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8656, skip=0, SSLv3_server_data={24589:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1205] COND FALSE !(s->state == 8576) [L1208] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8656, skip=0, SSLv3_server_data={24589:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1208] COND FALSE !(s->state == 8577) [L1211] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8656, skip=0, SSLv3_server_data={24589:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1211] COND FALSE !(s->state == 8592) [L1214] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8656, skip=0, SSLv3_server_data={24589:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1214] COND FALSE !(s->state == 8593) [L1217] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8656, skip=0, SSLv3_server_data={24589:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1217] COND FALSE !(s->state == 8608) [L1220] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8656, skip=0, SSLv3_server_data={24589:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1220] COND FALSE !(s->state == 8609) [L1223] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8656, skip=0, SSLv3_server_data={24589:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1223] COND FALSE !(s->state == 8640) [L1226] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8656, skip=0, SSLv3_server_data={24589:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1226] COND FALSE !(s->state == 8641) [L1229] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8656, skip=0, SSLv3_server_data={24589:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1229] COND TRUE s->state == 8656 [L1594] EXPR s->session [L1594] EXPR s->s3 [L1594] EXPR (s->s3)->tmp.new_cipher [L1594] (s->session)->cipher = (s->s3)->tmp.new_cipher [L1595] COND FALSE !(! tmp___9) [L1601] ret = __VERIFIER_nondet_int() [L1602] COND FALSE !(blastFlag == 10) VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, skip=0, SSLv3_server_data={24589:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1605] COND FALSE !(blastFlag == 13) VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, skip=0, SSLv3_server_data={24589:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1611] COND FALSE !(ret <= 0) [L1616] s->state = 8672 [L1617] s->init_num = 0 VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, skip=0, SSLv3_server_data={24589:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1618] COND FALSE !(! tmp___10) VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, skip=0, SSLv3_server_data={24589:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1709] EXPR s->s3 [L1709] EXPR (s->s3)->tmp.reuse_message VAL [={2:-1}, (s->s3)->tmp.reuse_message=24594, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->s3={24602:0}, skip=0, SSLv3_server_data={24589:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1709] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1738] skip = 0 VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, skip=0, SSLv3_server_data={24589:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1136] COND TRUE 1 VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, skip=0, SSLv3_server_data={24589:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8672, skip=0, SSLv3_server_data={24589:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8672, skip=0, SSLv3_server_data={24589:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8672, skip=0, SSLv3_server_data={24589:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8672, skip=0, SSLv3_server_data={24589:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8672, skip=0, SSLv3_server_data={24589:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8672, skip=0, SSLv3_server_data={24589:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8672, skip=0, SSLv3_server_data={24589:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8672, skip=0, SSLv3_server_data={24589:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8672, skip=0, SSLv3_server_data={24589:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8672, skip=0, SSLv3_server_data={24589:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8672, skip=0, SSLv3_server_data={24589:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8672, skip=0, SSLv3_server_data={24589:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8672, skip=0, SSLv3_server_data={24589:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8672, skip=0, SSLv3_server_data={24589:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8672, skip=0, SSLv3_server_data={24589:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8672, skip=0, SSLv3_server_data={24589:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8672, skip=0, SSLv3_server_data={24589:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8672, skip=0, SSLv3_server_data={24589:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8672, skip=0, SSLv3_server_data={24589:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8672, skip=0, SSLv3_server_data={24589:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8672, skip=0, SSLv3_server_data={24589:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8672, skip=0, SSLv3_server_data={24589:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1202] COND FALSE !(s->state == 8448) [L1205] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8672, skip=0, SSLv3_server_data={24589:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1205] COND FALSE !(s->state == 8576) [L1208] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8672, skip=0, SSLv3_server_data={24589:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1208] COND FALSE !(s->state == 8577) [L1211] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8672, skip=0, SSLv3_server_data={24589:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1211] COND FALSE !(s->state == 8592) [L1214] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8672, skip=0, SSLv3_server_data={24589:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1214] COND FALSE !(s->state == 8593) [L1217] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8672, skip=0, SSLv3_server_data={24589:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1217] COND FALSE !(s->state == 8608) [L1220] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8672, skip=0, SSLv3_server_data={24589:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1220] COND FALSE !(s->state == 8609) [L1223] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8672, skip=0, SSLv3_server_data={24589:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1223] COND FALSE !(s->state == 8640) [L1226] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8672, skip=0, SSLv3_server_data={24589:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1226] COND FALSE !(s->state == 8641) [L1229] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8672, skip=0, SSLv3_server_data={24589:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1229] COND FALSE !(s->state == 8656) [L1232] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8672, skip=0, SSLv3_server_data={24589:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1232] COND FALSE !(s->state == 8657) [L1235] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8672, skip=0, SSLv3_server_data={24589:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1235] COND TRUE s->state == 8672 [L1627] ret = __VERIFIER_nondet_int() [L1628] COND FALSE !(blastFlag == 11) VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=7, s={24597:0}, s={24597:0}, skip=0, SSLv3_server_data={24589:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1631] COND FALSE !(blastFlag == 14) VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=7, s={24597:0}, s={24597:0}, skip=0, SSLv3_server_data={24589:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1637] COND FALSE !(ret <= 0) [L1642] s->state = 8448 [L1643] s->hit VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=7, s={24597:0}, s={24597:0}, s->hit=1, skip=0, SSLv3_server_data={24589:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1643] COND TRUE s->hit [L1644] EXPR s->s3 [L1644] (s->s3)->tmp.next_state = 8640 [L1648] s->init_num = 0 VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=7, s={24597:0}, s={24597:0}, skip=0, SSLv3_server_data={24589:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1709] EXPR s->s3 [L1709] EXPR (s->s3)->tmp.reuse_message VAL [={2:-1}, (s->s3)->tmp.reuse_message=24594, blastFlag=2, got_new_session=1, init=1, ret=7, s={24597:0}, s={24597:0}, s->s3={24602:0}, skip=0, SSLv3_server_data={24589:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1709] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1738] skip = 0 VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=7, s={24597:0}, s={24597:0}, skip=0, SSLv3_server_data={24589:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1136] COND TRUE 1 VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=7, s={24597:0}, s={24597:0}, skip=0, SSLv3_server_data={24589:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=7, s={24597:0}, s={24597:0}, s->state=8448, skip=0, SSLv3_server_data={24589:0}, state=8448, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=7, s={24597:0}, s={24597:0}, s->state=8448, skip=0, SSLv3_server_data={24589:0}, state=8448, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=7, s={24597:0}, s={24597:0}, s->state=8448, skip=0, SSLv3_server_data={24589:0}, state=8448, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=7, s={24597:0}, s={24597:0}, s->state=8448, skip=0, SSLv3_server_data={24589:0}, state=8448, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=7, s={24597:0}, s={24597:0}, s->state=8448, skip=0, SSLv3_server_data={24589:0}, state=8448, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=7, s={24597:0}, s={24597:0}, s->state=8448, skip=0, SSLv3_server_data={24589:0}, state=8448, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=7, s={24597:0}, s={24597:0}, s->state=8448, skip=0, SSLv3_server_data={24589:0}, state=8448, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=7, s={24597:0}, s={24597:0}, s->state=8448, skip=0, SSLv3_server_data={24589:0}, state=8448, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=7, s={24597:0}, s={24597:0}, s->state=8448, skip=0, SSLv3_server_data={24589:0}, state=8448, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=7, s={24597:0}, s={24597:0}, s->state=8448, skip=0, SSLv3_server_data={24589:0}, state=8448, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=7, s={24597:0}, s={24597:0}, s->state=8448, skip=0, SSLv3_server_data={24589:0}, state=8448, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=7, s={24597:0}, s={24597:0}, s->state=8448, skip=0, SSLv3_server_data={24589:0}, state=8448, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=7, s={24597:0}, s={24597:0}, s->state=8448, skip=0, SSLv3_server_data={24589:0}, state=8448, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=7, s={24597:0}, s={24597:0}, s->state=8448, skip=0, SSLv3_server_data={24589:0}, state=8448, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=7, s={24597:0}, s={24597:0}, s->state=8448, skip=0, SSLv3_server_data={24589:0}, state=8448, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=7, s={24597:0}, s={24597:0}, s->state=8448, skip=0, SSLv3_server_data={24589:0}, state=8448, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=7, s={24597:0}, s={24597:0}, s->state=8448, skip=0, SSLv3_server_data={24589:0}, state=8448, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=7, s={24597:0}, s={24597:0}, s->state=8448, skip=0, SSLv3_server_data={24589:0}, state=8448, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=7, s={24597:0}, s={24597:0}, s->state=8448, skip=0, SSLv3_server_data={24589:0}, state=8448, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=7, s={24597:0}, s={24597:0}, s->state=8448, skip=0, SSLv3_server_data={24589:0}, state=8448, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=7, s={24597:0}, s={24597:0}, s->state=8448, skip=0, SSLv3_server_data={24589:0}, state=8448, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=7, s={24597:0}, s={24597:0}, s->state=8448, skip=0, SSLv3_server_data={24589:0}, state=8448, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1202] COND TRUE s->state == 8448 [L1490] COND FALSE !(num1 > 0L) VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, num1=0, ret=7, s={24597:0}, s={24597:0}, skip=0, SSLv3_server_data={24589:0}, state=8448, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1503] EXPR s->s3 [L1503] EXPR (s->s3)->tmp.next_state [L1503] s->state = (s->s3)->tmp.next_state [L1709] EXPR s->s3 [L1709] EXPR (s->s3)->tmp.reuse_message VAL [={2:-1}, (s->s3)->tmp.reuse_message=24594, blastFlag=2, got_new_session=1, init=1, num1=0, ret=7, s={24597:0}, s={24597:0}, s->s3={24602:0}, skip=0, SSLv3_server_data={24589:0}, state=8448, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1709] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1738] skip = 0 VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, num1=0, ret=7, s={24597:0}, s={24597:0}, skip=0, SSLv3_server_data={24589:0}, state=8448, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1136] COND TRUE 1 VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, num1=0, ret=7, s={24597:0}, s={24597:0}, skip=0, SSLv3_server_data={24589:0}, state=8448, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, num1=0, ret=7, s={24597:0}, s={24597:0}, s->state=8640, skip=0, SSLv3_server_data={24589:0}, state=8640, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, num1=0, ret=7, s={24597:0}, s={24597:0}, s->state=8640, skip=0, SSLv3_server_data={24589:0}, state=8640, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, num1=0, ret=7, s={24597:0}, s={24597:0}, s->state=8640, skip=0, SSLv3_server_data={24589:0}, state=8640, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, num1=0, ret=7, s={24597:0}, s={24597:0}, s->state=8640, skip=0, SSLv3_server_data={24589:0}, state=8640, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, num1=0, ret=7, s={24597:0}, s={24597:0}, s->state=8640, skip=0, SSLv3_server_data={24589:0}, state=8640, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, num1=0, ret=7, s={24597:0}, s={24597:0}, s->state=8640, skip=0, SSLv3_server_data={24589:0}, state=8640, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, num1=0, ret=7, s={24597:0}, s={24597:0}, s->state=8640, skip=0, SSLv3_server_data={24589:0}, state=8640, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, num1=0, ret=7, s={24597:0}, s={24597:0}, s->state=8640, skip=0, SSLv3_server_data={24589:0}, state=8640, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, num1=0, ret=7, s={24597:0}, s={24597:0}, s->state=8640, skip=0, SSLv3_server_data={24589:0}, state=8640, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, num1=0, ret=7, s={24597:0}, s={24597:0}, s->state=8640, skip=0, SSLv3_server_data={24589:0}, state=8640, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, num1=0, ret=7, s={24597:0}, s={24597:0}, s->state=8640, skip=0, SSLv3_server_data={24589:0}, state=8640, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, num1=0, ret=7, s={24597:0}, s={24597:0}, s->state=8640, skip=0, SSLv3_server_data={24589:0}, state=8640, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, num1=0, ret=7, s={24597:0}, s={24597:0}, s->state=8640, skip=0, SSLv3_server_data={24589:0}, state=8640, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, num1=0, ret=7, s={24597:0}, s={24597:0}, s->state=8640, skip=0, SSLv3_server_data={24589:0}, state=8640, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, num1=0, ret=7, s={24597:0}, s={24597:0}, s->state=8640, skip=0, SSLv3_server_data={24589:0}, state=8640, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, num1=0, ret=7, s={24597:0}, s={24597:0}, s->state=8640, skip=0, SSLv3_server_data={24589:0}, state=8640, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, num1=0, ret=7, s={24597:0}, s={24597:0}, s->state=8640, skip=0, SSLv3_server_data={24589:0}, state=8640, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, num1=0, ret=7, s={24597:0}, s={24597:0}, s->state=8640, skip=0, SSLv3_server_data={24589:0}, state=8640, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, num1=0, ret=7, s={24597:0}, s={24597:0}, s->state=8640, skip=0, SSLv3_server_data={24589:0}, state=8640, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, num1=0, ret=7, s={24597:0}, s={24597:0}, s->state=8640, skip=0, SSLv3_server_data={24589:0}, state=8640, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, num1=0, ret=7, s={24597:0}, s={24597:0}, s->state=8640, skip=0, SSLv3_server_data={24589:0}, state=8640, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, num1=0, ret=7, s={24597:0}, s={24597:0}, s->state=8640, skip=0, SSLv3_server_data={24589:0}, state=8640, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1202] COND FALSE !(s->state == 8448) [L1205] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, num1=0, ret=7, s={24597:0}, s={24597:0}, s->state=8640, skip=0, SSLv3_server_data={24589:0}, state=8640, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1205] COND FALSE !(s->state == 8576) [L1208] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, num1=0, ret=7, s={24597:0}, s={24597:0}, s->state=8640, skip=0, SSLv3_server_data={24589:0}, state=8640, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1208] COND FALSE !(s->state == 8577) [L1211] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, num1=0, ret=7, s={24597:0}, s={24597:0}, s->state=8640, skip=0, SSLv3_server_data={24589:0}, state=8640, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1211] COND FALSE !(s->state == 8592) [L1214] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, num1=0, ret=7, s={24597:0}, s={24597:0}, s->state=8640, skip=0, SSLv3_server_data={24589:0}, state=8640, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1214] COND FALSE !(s->state == 8593) [L1217] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, num1=0, ret=7, s={24597:0}, s={24597:0}, s->state=8640, skip=0, SSLv3_server_data={24589:0}, state=8640, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1217] COND FALSE !(s->state == 8608) [L1220] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, num1=0, ret=7, s={24597:0}, s={24597:0}, s->state=8640, skip=0, SSLv3_server_data={24589:0}, state=8640, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1220] COND FALSE !(s->state == 8609) [L1223] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, num1=0, ret=7, s={24597:0}, s={24597:0}, s->state=8640, skip=0, SSLv3_server_data={24589:0}, state=8640, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1223] COND TRUE s->state == 8640 [L1570] ret = __VERIFIER_nondet_int() [L1571] COND FALSE !(blastFlag == 9) VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, num1=0, ret=0, s={24597:0}, s={24597:0}, skip=0, SSLv3_server_data={24589:0}, state=8640, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1574] COND FALSE !(blastFlag == 12) VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, num1=0, ret=0, s={24597:0}, s={24597:0}, skip=0, SSLv3_server_data={24589:0}, state=8640, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1750] __VERIFIER_error() VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, num1=0, ret=0, s={24597:0}, s={24597:0}, skip=0, SSLv3_server_data={24589:0}, state=8640, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 164 locations, 1 error locations. UNSAFE Result, 59.5s OverallTime, 116 OverallIterations, 7 TraceHistogramMax, 34.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 27103 SDtfs, 9982 SDslu, 44746 SDs, 0 SdLazy, 28976 SolverSat, 1558 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 23.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1510 GetRequests, 925 SyntacticMatches, 187 SemanticMatches, 398 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 476 ImplicationChecksByTransitivity, 13.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1411occurred in iteration=115, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.6s AbstIntTime, 2 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 2.9s AutomataMinimizationTime, 115 MinimizatonAttempts, 8930 StatesRemovedByMinimization, 115 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 18.1s InterpolantComputationTime, 15323 NumberOfCodeBlocks, 15323 NumberOfCodeBlocksAsserted, 118 NumberOfCheckSat, 15372 ConstructedInterpolants, 191 QuantifiedInterpolants, 11951553 SizeOfPredicates, 30 NumberOfNonLiveVariables, 1610 ConjunctsInSsa, 93 ConjunctsInUnsatCore, 119 InterpolantComputations, 113 PerfectInterpolantSequences, 15810/16800 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.23-635dfa2 [2018-12-08 18:20:08,070 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-08 18:20:08,071 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-08 18:20:08,077 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-08 18:20:08,077 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-08 18:20:08,077 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-08 18:20:08,078 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-08 18:20:08,079 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-08 18:20:08,080 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-08 18:20:08,080 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-08 18:20:08,080 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-08 18:20:08,081 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-08 18:20:08,081 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-08 18:20:08,082 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-08 18:20:08,082 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-08 18:20:08,083 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-08 18:20:08,083 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-08 18:20:08,084 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-08 18:20:08,085 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-08 18:20:08,086 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-08 18:20:08,086 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-08 18:20:08,087 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-08 18:20:08,088 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-08 18:20:08,088 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-08 18:20:08,088 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-08 18:20:08,088 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-08 18:20:08,089 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-08 18:20:08,089 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-08 18:20:08,090 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-08 18:20:08,090 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-08 18:20:08,090 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-08 18:20:08,091 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-08 18:20:08,091 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-08 18:20:08,091 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-08 18:20:08,091 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-08 18:20:08,092 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-08 18:20:08,092 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_6b342074-af84-4fe5-a218-0680d1cd191a/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2018-12-08 18:20:08,099 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-08 18:20:08,099 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-08 18:20:08,100 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-08 18:20:08,100 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-08 18:20:08,100 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-08 18:20:08,100 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-08 18:20:08,100 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-08 18:20:08,101 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-08 18:20:08,101 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-08 18:20:08,101 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-08 18:20:08,101 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-08 18:20:08,101 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-08 18:20:08,101 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-08 18:20:08,102 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-08 18:20:08,102 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-08 18:20:08,102 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-08 18:20:08,102 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-08 18:20:08,102 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-12-08 18:20:08,102 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-12-08 18:20:08,102 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-08 18:20:08,102 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-08 18:20:08,103 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-08 18:20:08,103 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-08 18:20:08,103 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-08 18:20:08,103 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-08 18:20:08,103 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-08 18:20:08,103 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-08 18:20:08,103 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-08 18:20:08,103 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-08 18:20:08,104 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-08 18:20:08,104 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-08 18:20:08,104 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-12-08 18:20:08,104 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-08 18:20:08,104 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2018-12-08 18:20:08,104 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-12-08 18:20:08,104 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 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/working_dir_6b342074-af84-4fe5-a218-0680d1cd191a/bin-2019/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan 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 -> d06f77684af1a50a152dd1d7247c10847b7d2ace [2018-12-08 18:20:08,123 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-08 18:20:08,130 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-08 18:20:08,133 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-08 18:20:08,134 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-08 18:20:08,134 INFO L276 PluginConnector]: CDTParser initialized [2018-12-08 18:20:08,134 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_6b342074-af84-4fe5-a218-0680d1cd191a/bin-2019/utaipan/../../sv-benchmarks/c/ssh/s3_srvr.blast.14_false-unreach-call.i.cil.c [2018-12-08 18:20:08,172 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_6b342074-af84-4fe5-a218-0680d1cd191a/bin-2019/utaipan/data/fe277a740/e449e7f5d15e41b8a765f7c2f35fd69f/FLAGcfad31fbd [2018-12-08 18:20:08,635 INFO L307 CDTParser]: Found 1 translation units. [2018-12-08 18:20:08,636 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_6b342074-af84-4fe5-a218-0680d1cd191a/sv-benchmarks/c/ssh/s3_srvr.blast.14_false-unreach-call.i.cil.c [2018-12-08 18:20:08,645 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_6b342074-af84-4fe5-a218-0680d1cd191a/bin-2019/utaipan/data/fe277a740/e449e7f5d15e41b8a765f7c2f35fd69f/FLAGcfad31fbd [2018-12-08 18:20:08,655 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_6b342074-af84-4fe5-a218-0680d1cd191a/bin-2019/utaipan/data/fe277a740/e449e7f5d15e41b8a765f7c2f35fd69f [2018-12-08 18:20:08,657 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-08 18:20:08,658 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-08 18:20:08,658 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-08 18:20:08,658 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-08 18:20:08,661 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-08 18:20:08,661 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 06:20:08" (1/1) ... [2018-12-08 18:20:08,663 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78cb6da1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 06:20:08, skipping insertion in model container [2018-12-08 18:20:08,663 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 06:20:08" (1/1) ... [2018-12-08 18:20:08,667 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-08 18:20:08,695 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-08 18:20:08,909 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 18:20:08,921 INFO L191 MainTranslator]: Completed pre-run [2018-12-08 18:20:09,029 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 18:20:09,030 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator has thrown an exception: java.lang.AssertionError at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CTranslationUtil.extractNonAggregateNonUnionTypes(CTranslationUtil.java:470) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.MemoryHandler.getInitializationForOnHeapVariableOfAggregateOrUnionType(MemoryHandler.java:2813) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.InitializationHandler.makeOnHeapDefaultInitializationViaConstArray(InitializationHandler.java:814) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.InitializationHandler.initialize(InitializationHandler.java:254) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.InitializationHandler.initialize(InitializationHandler.java:194) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.PostProcessor.createUltimateInitProcedure(PostProcessor.java:639) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.PostProcessor.postProcess(PostProcessor.java:205) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:566) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainDispatcher.dispatch(MainDispatcher.java:269) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.performMainRun(MainTranslator.java:230) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.translate(MainTranslator.java:193) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.run(MainTranslator.java:117) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.(MainTranslator.java:95) at de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver.finish(CACSL2BoogieTranslatorObserver.java:129) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-12-08 18:20:09,032 INFO L168 Benchmark]: Toolchain (without parser) took 374.61 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.2 MB). Free memory was 938.0 MB in the beginning and 1.1 GB in the end (delta: -174.4 MB). Peak memory consumption was 40.8 MB. Max. memory is 11.5 GB. [2018-12-08 18:20:09,033 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 972.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 18:20:09,033 INFO L168 Benchmark]: CACSL2BoogieTranslator took 373.12 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.2 MB). Free memory was 938.0 MB in the beginning and 1.1 GB in the end (delta: -174.4 MB). Peak memory consumption was 40.8 MB. Max. memory is 11.5 GB. [2018-12-08 18:20:09,034 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 972.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 373.12 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.2 MB). Free memory was 938.0 MB in the beginning and 1.1 GB in the end (delta: -174.4 MB). Peak memory consumption was 40.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - ExceptionOrErrorResult: AssertionError: null de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: AssertionError: null: de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CTranslationUtil.extractNonAggregateNonUnionTypes(CTranslationUtil.java:470) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...