./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/ssh/s3_srvr.blast.07_false-unreach-call.i.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_73a470a1-fd1b-4132-9c85-c391d27a4779/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_73a470a1-fd1b-4132-9c85-c391d27a4779/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_73a470a1-fd1b-4132-9c85-c391d27a4779/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_73a470a1-fd1b-4132-9c85-c391d27a4779/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/ssh/s3_srvr.blast.07_false-unreach-call.i.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_73a470a1-fd1b-4132-9c85-c391d27a4779/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_73a470a1-fd1b-4132-9c85-c391d27a4779/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 26d2d88b107593355990b3892c0d3e9a5490a1a3 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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_73a470a1-fd1b-4132-9c85-c391d27a4779/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_73a470a1-fd1b-4132-9c85-c391d27a4779/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_73a470a1-fd1b-4132-9c85-c391d27a4779/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_73a470a1-fd1b-4132-9c85-c391d27a4779/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/ssh/s3_srvr.blast.07_false-unreach-call.i.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_73a470a1-fd1b-4132-9c85-c391d27a4779/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_73a470a1-fd1b-4132-9c85-c391d27a4779/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 26d2d88b107593355990b3892c0d3e9a5490a1a3 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 12:33:20,022 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 12:33:20,023 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 12:33:20,029 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 12:33:20,030 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 12:33:20,030 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 12:33:20,031 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 12:33:20,033 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 12:33:20,034 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 12:33:20,034 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 12:33:20,035 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 12:33:20,035 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 12:33:20,036 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 12:33:20,037 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 12:33:20,038 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 12:33:20,038 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 12:33:20,039 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 12:33:20,040 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 12:33:20,041 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 12:33:20,042 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 12:33:20,042 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 12:33:20,043 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 12:33:20,044 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 12:33:20,044 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 12:33:20,044 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 12:33:20,045 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 12:33:20,045 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 12:33:20,045 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 12:33:20,046 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 12:33:20,047 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 12:33:20,047 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 12:33:20,047 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 12:33:20,048 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 12:33:20,048 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 12:33:20,048 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 12:33:20,049 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 12:33:20,049 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_73a470a1-fd1b-4132-9c85-c391d27a4779/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-10 12:33:20,059 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 12:33:20,059 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 12:33:20,060 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 12:33:20,060 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-10 12:33:20,060 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-10 12:33:20,060 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-10 12:33:20,060 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-10 12:33:20,061 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-10 12:33:20,061 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-10 12:33:20,061 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-10 12:33:20,061 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-10 12:33:20,061 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 12:33:20,062 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 12:33:20,062 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 12:33:20,062 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 12:33:20,062 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 12:33:20,062 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 12:33:20,062 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 12:33:20,062 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 12:33:20,062 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 12:33:20,063 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 12:33:20,063 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 12:33:20,063 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 12:33:20,063 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 12:33:20,063 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 12:33:20,063 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 12:33:20,063 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 12:33:20,064 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 12:33:20,064 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 12:33:20,064 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 12:33:20,067 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-10 12:33:20,067 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 12:33:20,067 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 12:33:20,067 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-10 12:33:20,067 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_73a470a1-fd1b-4132-9c85-c391d27a4779/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 -> 26d2d88b107593355990b3892c0d3e9a5490a1a3 [2018-11-10 12:33:20,091 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 12:33:20,100 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 12:33:20,103 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 12:33:20,104 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 12:33:20,104 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 12:33:20,105 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_73a470a1-fd1b-4132-9c85-c391d27a4779/bin-2019/utaipan/../../sv-benchmarks/c/ssh/s3_srvr.blast.07_false-unreach-call.i.cil.c [2018-11-10 12:33:20,149 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_73a470a1-fd1b-4132-9c85-c391d27a4779/bin-2019/utaipan/data/b3ab38a19/208c5d5799ba4716a1a217fdace1b2ba/FLAGbc28d3487 [2018-11-10 12:33:20,645 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 12:33:20,646 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_73a470a1-fd1b-4132-9c85-c391d27a4779/sv-benchmarks/c/ssh/s3_srvr.blast.07_false-unreach-call.i.cil.c [2018-11-10 12:33:20,659 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_73a470a1-fd1b-4132-9c85-c391d27a4779/bin-2019/utaipan/data/b3ab38a19/208c5d5799ba4716a1a217fdace1b2ba/FLAGbc28d3487 [2018-11-10 12:33:20,672 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_73a470a1-fd1b-4132-9c85-c391d27a4779/bin-2019/utaipan/data/b3ab38a19/208c5d5799ba4716a1a217fdace1b2ba [2018-11-10 12:33:20,674 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 12:33:20,676 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 12:33:20,676 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 12:33:20,676 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 12:33:20,680 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 12:33:20,681 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:33:20" (1/1) ... [2018-11-10 12:33:20,683 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7acb3176 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:33:20, skipping insertion in model container [2018-11-10 12:33:20,683 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:33:20" (1/1) ... [2018-11-10 12:33:20,692 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 12:33:20,733 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 12:33:21,200 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 12:33:21,209 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 12:33:21,577 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 12:33:21,590 INFO L193 MainTranslator]: Completed translation [2018-11-10 12:33:21,591 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:33:21 WrapperNode [2018-11-10 12:33:21,591 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 12:33:21,591 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 12:33:21,592 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 12:33:21,592 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 12:33:21,598 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:33:21" (1/1) ... [2018-11-10 12:33:21,615 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:33:21" (1/1) ... [2018-11-10 12:33:21,661 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 12:33:21,661 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 12:33:21,661 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 12:33:21,661 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 12:33:21,669 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:33:21" (1/1) ... [2018-11-10 12:33:21,670 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:33:21" (1/1) ... [2018-11-10 12:33:21,681 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:33:21" (1/1) ... [2018-11-10 12:33:21,681 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:33:21" (1/1) ... [2018-11-10 12:33:21,717 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:33:21" (1/1) ... [2018-11-10 12:33:21,725 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:33:21" (1/1) ... [2018-11-10 12:33:21,731 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:33:21" (1/1) ... [2018-11-10 12:33:21,738 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 12:33:21,738 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 12:33:21,739 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 12:33:21,739 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 12:33:21,740 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:33:21" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_73a470a1-fd1b-4132-9c85-c391d27a4779/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-11-10 12:33:21,787 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 12:33:21,787 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 12:33:21,787 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_accept [2018-11-10 12:33:21,787 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_accept [2018-11-10 12:33:21,787 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 12:33:21,787 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 12:33:21,788 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 12:33:21,788 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 12:33:22,198 WARN L667 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-10 12:33:22,199 WARN L632 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-10 12:33:22,695 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 12:33:22,695 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:33:22 BoogieIcfgContainer [2018-11-10 12:33:22,695 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 12:33:22,696 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 12:33:22,696 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 12:33:22,698 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 12:33:22,698 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 12:33:20" (1/3) ... [2018-11-10 12:33:22,698 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e75be25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 12:33:22, skipping insertion in model container [2018-11-10 12:33:22,699 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:33:21" (2/3) ... [2018-11-10 12:33:22,699 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e75be25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 12:33:22, skipping insertion in model container [2018-11-10 12:33:22,699 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:33:22" (3/3) ... [2018-11-10 12:33:22,700 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.07_false-unreach-call.i.cil.c [2018-11-10 12:33:22,706 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 12:33:22,712 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-10 12:33:22,721 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-10 12:33:22,743 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 12:33:22,743 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-10 12:33:22,743 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 12:33:22,744 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 12:33:22,744 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 12:33:22,744 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 12:33:22,744 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 12:33:22,744 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 12:33:22,759 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states. [2018-11-10 12:33:22,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-10 12:33:22,765 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:33:22,766 INFO L375 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] [2018-11-10 12:33:22,768 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:33:22,772 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:33:22,773 INFO L82 PathProgramCache]: Analyzing trace with hash -2122663997, now seen corresponding path program 1 times [2018-11-10 12:33:22,774 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 12:33:22,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:33:22,809 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:33:22,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:33:22,809 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 12:33:22,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:33:23,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:33:23,040 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:33:23,041 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:33:23,041 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 12:33:23,045 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 12:33:23,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:33:23,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:33:23,056 INFO L87 Difference]: Start difference. First operand 158 states. Second operand 3 states. [2018-11-10 12:33:23,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:33:23,158 INFO L93 Difference]: Finished difference Result 438 states and 739 transitions. [2018-11-10 12:33:23,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:33:23,160 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2018-11-10 12:33:23,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:33:23,170 INFO L225 Difference]: With dead ends: 438 [2018-11-10 12:33:23,170 INFO L226 Difference]: Without dead ends: 267 [2018-11-10 12:33:23,173 INFO L605 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-11-10 12:33:23,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2018-11-10 12:33:23,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 267. [2018-11-10 12:33:23,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2018-11-10 12:33:23,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 399 transitions. [2018-11-10 12:33:23,219 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 399 transitions. Word has length 42 [2018-11-10 12:33:23,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:33:23,220 INFO L481 AbstractCegarLoop]: Abstraction has 267 states and 399 transitions. [2018-11-10 12:33:23,220 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 12:33:23,220 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 399 transitions. [2018-11-10 12:33:23,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-11-10 12:33:23,222 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:33:23,222 INFO L375 BasicCegarLoop]: trace histogram [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-11-10 12:33:23,223 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:33:23,223 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:33:23,223 INFO L82 PathProgramCache]: Analyzing trace with hash 692256734, now seen corresponding path program 1 times [2018-11-10 12:33:23,223 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 12:33:23,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:33:23,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:33:23,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:33:23,224 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 12:33:23,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:33:23,356 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:33:23,356 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:33:23,356 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 12:33:23,356 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 12:33:23,358 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 12:33:23,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 12:33:23,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-10 12:33:23,358 INFO L87 Difference]: Start difference. First operand 267 states and 399 transitions. Second operand 4 states. [2018-11-10 12:33:23,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:33:23,649 INFO L93 Difference]: Finished difference Result 439 states and 663 transitions. [2018-11-10 12:33:23,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 12:33:23,650 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2018-11-10 12:33:23,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:33:23,652 INFO L225 Difference]: With dead ends: 439 [2018-11-10 12:33:23,652 INFO L226 Difference]: Without dead ends: 311 [2018-11-10 12:33:23,653 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-10 12:33:23,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2018-11-10 12:33:23,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 290. [2018-11-10 12:33:23,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 290 states. [2018-11-10 12:33:23,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 438 transitions. [2018-11-10 12:33:23,669 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 438 transitions. Word has length 60 [2018-11-10 12:33:23,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:33:23,669 INFO L481 AbstractCegarLoop]: Abstraction has 290 states and 438 transitions. [2018-11-10 12:33:23,669 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 12:33:23,669 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 438 transitions. [2018-11-10 12:33:23,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-11-10 12:33:23,672 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:33:23,672 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-11-10 12:33:23,672 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:33:23,672 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:33:23,673 INFO L82 PathProgramCache]: Analyzing trace with hash -182699472, now seen corresponding path program 1 times [2018-11-10 12:33:23,673 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 12:33:23,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:33:23,674 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:33:23,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:33:23,675 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 12:33:23,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:33:23,765 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-10 12:33:23,765 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:33:23,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:33:23,766 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 12:33:23,766 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 12:33:23,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:33:23,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:33:23,767 INFO L87 Difference]: Start difference. First operand 290 states and 438 transitions. Second operand 3 states. [2018-11-10 12:33:23,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:33:23,855 INFO L93 Difference]: Finished difference Result 587 states and 905 transitions. [2018-11-10 12:33:23,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:33:23,856 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2018-11-10 12:33:23,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:33:23,858 INFO L225 Difference]: With dead ends: 587 [2018-11-10 12:33:23,858 INFO L226 Difference]: Without dead ends: 436 [2018-11-10 12:33:23,859 INFO L605 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-11-10 12:33:23,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2018-11-10 12:33:23,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 436. [2018-11-10 12:33:23,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 436 states. [2018-11-10 12:33:23,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 659 transitions. [2018-11-10 12:33:23,873 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 659 transitions. Word has length 74 [2018-11-10 12:33:23,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:33:23,873 INFO L481 AbstractCegarLoop]: Abstraction has 436 states and 659 transitions. [2018-11-10 12:33:23,874 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 12:33:23,874 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 659 transitions. [2018-11-10 12:33:23,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-11-10 12:33:23,876 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:33:23,877 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-11-10 12:33:23,877 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:33:23,877 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:33:23,877 INFO L82 PathProgramCache]: Analyzing trace with hash 610798098, now seen corresponding path program 1 times [2018-11-10 12:33:23,877 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 12:33:23,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:33:23,878 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:33:23,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:33:23,879 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 12:33:23,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:33:23,955 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-10 12:33:23,955 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:33:23,955 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:33:23,955 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 12:33:23,956 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 12:33:23,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:33:23,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:33:23,956 INFO L87 Difference]: Start difference. First operand 436 states and 659 transitions. Second operand 3 states. [2018-11-10 12:33:24,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:33:24,010 INFO L93 Difference]: Finished difference Result 882 states and 1351 transitions. [2018-11-10 12:33:24,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:33:24,011 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2018-11-10 12:33:24,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:33:24,013 INFO L225 Difference]: With dead ends: 882 [2018-11-10 12:33:24,013 INFO L226 Difference]: Without dead ends: 585 [2018-11-10 12:33:24,014 INFO L605 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-11-10 12:33:24,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2018-11-10 12:33:24,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 585. [2018-11-10 12:33:24,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 585 states. [2018-11-10 12:33:24,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 888 transitions. [2018-11-10 12:33:24,029 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 888 transitions. Word has length 83 [2018-11-10 12:33:24,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:33:24,029 INFO L481 AbstractCegarLoop]: Abstraction has 585 states and 888 transitions. [2018-11-10 12:33:24,029 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 12:33:24,029 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 888 transitions. [2018-11-10 12:33:24,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-11-10 12:33:24,031 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:33:24,031 INFO L375 BasicCegarLoop]: trace histogram [4, 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] [2018-11-10 12:33:24,031 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:33:24,031 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:33:24,031 INFO L82 PathProgramCache]: Analyzing trace with hash -606699514, now seen corresponding path program 1 times [2018-11-10 12:33:24,031 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 12:33:24,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:33:24,032 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:33:24,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:33:24,033 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 12:33:24,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:33:24,120 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-11-10 12:33:24,120 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:33:24,120 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:33:24,121 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 12:33:24,121 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 12:33:24,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:33:24,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:33:24,121 INFO L87 Difference]: Start difference. First operand 585 states and 888 transitions. Second operand 3 states. [2018-11-10 12:33:24,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:33:24,171 INFO L93 Difference]: Finished difference Result 1182 states and 1810 transitions. [2018-11-10 12:33:24,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:33:24,172 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 108 [2018-11-10 12:33:24,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:33:24,173 INFO L225 Difference]: With dead ends: 1182 [2018-11-10 12:33:24,173 INFO L226 Difference]: Without dead ends: 736 [2018-11-10 12:33:24,174 INFO L605 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-11-10 12:33:24,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 736 states. [2018-11-10 12:33:24,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 736 to 734. [2018-11-10 12:33:24,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 734 states. [2018-11-10 12:33:24,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 734 states to 734 states and 1121 transitions. [2018-11-10 12:33:24,186 INFO L78 Accepts]: Start accepts. Automaton has 734 states and 1121 transitions. Word has length 108 [2018-11-10 12:33:24,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:33:24,186 INFO L481 AbstractCegarLoop]: Abstraction has 734 states and 1121 transitions. [2018-11-10 12:33:24,186 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 12:33:24,186 INFO L276 IsEmpty]: Start isEmpty. Operand 734 states and 1121 transitions. [2018-11-10 12:33:24,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-11-10 12:33:24,188 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:33:24,188 INFO L375 BasicCegarLoop]: trace histogram [4, 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, 1] [2018-11-10 12:33:24,188 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:33:24,189 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:33:24,189 INFO L82 PathProgramCache]: Analyzing trace with hash 1057268164, now seen corresponding path program 1 times [2018-11-10 12:33:24,189 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 12:33:24,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:33:24,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:33:24,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:33:24,190 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 12:33:24,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:33:24,252 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-11-10 12:33:24,253 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:33:24,253 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:33:24,253 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 12:33:24,253 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 12:33:24,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:33:24,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:33:24,254 INFO L87 Difference]: Start difference. First operand 734 states and 1121 transitions. Second operand 3 states. [2018-11-10 12:33:24,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:33:24,301 INFO L93 Difference]: Finished difference Result 1480 states and 2274 transitions. [2018-11-10 12:33:24,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:33:24,302 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 114 [2018-11-10 12:33:24,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:33:24,305 INFO L225 Difference]: With dead ends: 1480 [2018-11-10 12:33:24,305 INFO L226 Difference]: Without dead ends: 885 [2018-11-10 12:33:24,306 INFO L605 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-11-10 12:33:24,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 885 states. [2018-11-10 12:33:24,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 885 to 883. [2018-11-10 12:33:24,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 883 states. [2018-11-10 12:33:24,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 883 states to 883 states and 1340 transitions. [2018-11-10 12:33:24,320 INFO L78 Accepts]: Start accepts. Automaton has 883 states and 1340 transitions. Word has length 114 [2018-11-10 12:33:24,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:33:24,320 INFO L481 AbstractCegarLoop]: Abstraction has 883 states and 1340 transitions. [2018-11-10 12:33:24,320 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 12:33:24,321 INFO L276 IsEmpty]: Start isEmpty. Operand 883 states and 1340 transitions. [2018-11-10 12:33:24,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-11-10 12:33:24,323 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:33:24,323 INFO L375 BasicCegarLoop]: trace histogram [4, 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] [2018-11-10 12:33:24,323 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:33:24,323 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:33:24,324 INFO L82 PathProgramCache]: Analyzing trace with hash 606270970, now seen corresponding path program 1 times [2018-11-10 12:33:24,324 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 12:33:24,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:33:24,325 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:33:24,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:33:24,325 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 12:33:24,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:33:24,402 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-11-10 12:33:24,402 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:33:24,402 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:33:24,402 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 12:33:24,403 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 12:33:24,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:33:24,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:33:24,403 INFO L87 Difference]: Start difference. First operand 883 states and 1340 transitions. Second operand 3 states. [2018-11-10 12:33:24,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:33:24,453 INFO L93 Difference]: Finished difference Result 1776 states and 2711 transitions. [2018-11-10 12:33:24,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:33:24,454 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 131 [2018-11-10 12:33:24,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:33:24,456 INFO L225 Difference]: With dead ends: 1776 [2018-11-10 12:33:24,457 INFO L226 Difference]: Without dead ends: 1032 [2018-11-10 12:33:24,458 INFO L605 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-11-10 12:33:24,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1032 states. [2018-11-10 12:33:24,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1032 to 1032. [2018-11-10 12:33:24,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1032 states. [2018-11-10 12:33:24,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1032 states to 1032 states and 1570 transitions. [2018-11-10 12:33:24,473 INFO L78 Accepts]: Start accepts. Automaton has 1032 states and 1570 transitions. Word has length 131 [2018-11-10 12:33:24,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:33:24,474 INFO L481 AbstractCegarLoop]: Abstraction has 1032 states and 1570 transitions. [2018-11-10 12:33:24,474 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 12:33:24,474 INFO L276 IsEmpty]: Start isEmpty. Operand 1032 states and 1570 transitions. [2018-11-10 12:33:24,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-11-10 12:33:24,475 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:33:24,475 INFO L375 BasicCegarLoop]: trace histogram [5, 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] [2018-11-10 12:33:24,476 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:33:24,476 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:33:24,476 INFO L82 PathProgramCache]: Analyzing trace with hash -1793540287, now seen corresponding path program 1 times [2018-11-10 12:33:24,476 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 12:33:24,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:33:24,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:33:24,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:33:24,477 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 12:33:24,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:33:24,550 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2018-11-10 12:33:24,550 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:33:24,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:33:24,551 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 12:33:24,551 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 12:33:24,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:33:24,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:33:24,551 INFO L87 Difference]: Start difference. First operand 1032 states and 1570 transitions. Second operand 3 states. [2018-11-10 12:33:24,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:33:24,600 INFO L93 Difference]: Finished difference Result 1185 states and 1800 transitions. [2018-11-10 12:33:24,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:33:24,600 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 138 [2018-11-10 12:33:24,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:33:24,603 INFO L225 Difference]: With dead ends: 1185 [2018-11-10 12:33:24,603 INFO L226 Difference]: Without dead ends: 1183 [2018-11-10 12:33:24,603 INFO L605 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-11-10 12:33:24,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1183 states. [2018-11-10 12:33:24,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1183 to 1181. [2018-11-10 12:33:24,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1181 states. [2018-11-10 12:33:24,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1181 states to 1181 states and 1797 transitions. [2018-11-10 12:33:24,621 INFO L78 Accepts]: Start accepts. Automaton has 1181 states and 1797 transitions. Word has length 138 [2018-11-10 12:33:24,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:33:24,622 INFO L481 AbstractCegarLoop]: Abstraction has 1181 states and 1797 transitions. [2018-11-10 12:33:24,622 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 12:33:24,622 INFO L276 IsEmpty]: Start isEmpty. Operand 1181 states and 1797 transitions. [2018-11-10 12:33:24,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-11-10 12:33:24,624 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:33:24,624 INFO L375 BasicCegarLoop]: trace histogram [5, 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] [2018-11-10 12:33:24,624 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:33:24,624 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:33:24,624 INFO L82 PathProgramCache]: Analyzing trace with hash 850355908, now seen corresponding path program 1 times [2018-11-10 12:33:24,624 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 12:33:24,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:33:24,625 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:33:24,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:33:24,625 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 12:33:24,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:33:25,077 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 14 proven. 182 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-10 12:33:25,078 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 12:33:25,078 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 12:33:25,078 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 176 with the following transitions: [2018-11-10 12:33:25,080 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [12], [16], [27], [29], [33], [37], [43], [45], [50], [55], [60], [65], [70], [75], [80], [85], [88], [90], [95], [100], [103], [105], [110], [115], [120], [125], [130], [135], [140], [145], [150], [155], [160], [165], [170], [175], [180], [185], [188], [190], [195], [198], [200], [205], [208], [279], [282], [290], [292], [295], [303], [306], [310], [490], [493], [509], [514], [517], [535], [540], [542], [545], [553], [556], [560], [581], [615], [617], [629], [632], [633], [634], [636] [2018-11-10 12:33:25,124 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 12:33:25,124 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 12:33:25,607 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-10 12:34:04,275 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-10 12:34:04,276 INFO L272 AbstractInterpreter]: Visited 77 different actions 529 times. Merged at 64 different actions 421 times. Widened at 8 different actions 27 times. Found 21 fixpoints after 8 different actions. Largest state had 142 variables. [2018-11-10 12:34:04,293 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:34:04,295 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-10 12:34:04,295 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 12:34:04,295 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_73a470a1-fd1b-4132-9c85-c391d27a4779/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-11-10 12:34:04,320 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:34:04,320 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 12:34:04,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:34:04,575 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:34:04,631 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 5 treesize of output 1 [2018-11-10 12:34:04,631 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 12:34:04,648 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 12:34:04,652 INFO L477 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-11-10 12:34:04,652 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 12:34:04,654 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:34:04,668 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 20 [2018-11-10 12:34:04,670 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 23 [2018-11-10 12:34:04,675 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:34:04,677 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2018-11-10 12:34:04,682 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:34:04,683 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:34:04,684 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:34:04,687 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 52 [2018-11-10 12:34:04,688 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-10 12:34:04,697 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:34:04,703 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:34:04,708 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:34:04,719 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:34:04,720 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 7 variables, input treesize:51, output treesize:23 [2018-11-10 12:34:04,790 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-11-10 12:34:04,793 INFO L477 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 17 treesize of output 9 [2018-11-10 12:34:04,793 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:34:04,808 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:34:04,837 INFO L477 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 3 case distinctions, treesize of input 22 treesize of output 34 [2018-11-10 12:34:04,841 INFO L477 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 23 treesize of output 22 [2018-11-10 12:34:04,842 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 12:34:04,859 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:34:04,866 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:34:04,866 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:45, output treesize:14 [2018-11-10 12:34:04,892 INFO L477 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-11-10 12:34:04,895 INFO L477 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-11-10 12:34:04,895 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:34:04,897 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:34:04,903 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:34:04,903 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2018-11-10 12:34:04,922 INFO L477 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 34 treesize of output 28 [2018-11-10 12:34:04,933 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2018-11-10 12:34:04,934 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 12:34:04,939 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 12:34:04,970 INFO L477 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 21 treesize of output 22 [2018-11-10 12:34:04,973 INFO L477 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 8 treesize of output 7 [2018-11-10 12:34:04,973 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 12:34:04,979 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:34:04,985 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:34:04,986 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:46, output treesize:13 [2018-11-10 12:34:05,006 INFO L477 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 21 treesize of output 16 [2018-11-10 12:34:05,018 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:34:05,020 INFO L477 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 16 treesize of output 23 [2018-11-10 12:34:05,021 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:34:05,026 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:34:05,032 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:34:05,033 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:13 [2018-11-10 12:34:05,039 INFO L477 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 15 treesize of output 11 [2018-11-10 12:34:05,040 INFO L477 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 3 [2018-11-10 12:34:05,041 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:34:05,042 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:34:05,044 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:34:05,044 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-11-10 12:34:05,165 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 0 proven. 167 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-11-10 12:34:05,165 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 12:34:05,286 INFO L477 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 50 treesize of output 42 [2018-11-10 12:34:05,309 INFO L477 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-11-10 12:34:05,309 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:34:05,319 INFO L477 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-11-10 12:34:05,321 INFO L477 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-11-10 12:34:05,321 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 12:34:05,323 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:34:05,329 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:34:05,336 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:34:05,337 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:10 [2018-11-10 12:34:05,700 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 0 proven. 167 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-11-10 12:34:05,717 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 12:34:05,717 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 24 [2018-11-10 12:34:05,717 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 12:34:05,718 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-10 12:34:05,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-10 12:34:05,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=467, Unknown=0, NotChecked=0, Total=552 [2018-11-10 12:34:05,719 INFO L87 Difference]: Start difference. First operand 1181 states and 1797 transitions. Second operand 17 states. [2018-11-10 12:34:07,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:34:07,116 INFO L93 Difference]: Finished difference Result 3051 states and 4660 transitions. [2018-11-10 12:34:07,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 12:34:07,117 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 175 [2018-11-10 12:34:07,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:34:07,120 INFO L225 Difference]: With dead ends: 3051 [2018-11-10 12:34:07,121 INFO L226 Difference]: Without dead ends: 1884 [2018-11-10 12:34:07,122 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 371 GetRequests, 343 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=150, Invalid=662, Unknown=0, NotChecked=0, Total=812 [2018-11-10 12:34:07,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1884 states. [2018-11-10 12:34:07,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1884 to 1445. [2018-11-10 12:34:07,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1445 states. [2018-11-10 12:34:07,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1445 states to 1445 states and 2269 transitions. [2018-11-10 12:34:07,155 INFO L78 Accepts]: Start accepts. Automaton has 1445 states and 2269 transitions. Word has length 175 [2018-11-10 12:34:07,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:34:07,155 INFO L481 AbstractCegarLoop]: Abstraction has 1445 states and 2269 transitions. [2018-11-10 12:34:07,155 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-10 12:34:07,155 INFO L276 IsEmpty]: Start isEmpty. Operand 1445 states and 2269 transitions. [2018-11-10 12:34:07,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-11-10 12:34:07,158 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:34:07,158 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:34:07,158 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:34:07,158 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:34:07,158 INFO L82 PathProgramCache]: Analyzing trace with hash -10605328, now seen corresponding path program 1 times [2018-11-10 12:34:07,158 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 12:34:07,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:34:07,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:34:07,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:34:07,160 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 12:34:07,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:34:07,247 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 168 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2018-11-10 12:34:07,247 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:34:07,247 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 12:34:07,248 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 12:34:07,248 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 12:34:07,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 12:34:07,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-10 12:34:07,248 INFO L87 Difference]: Start difference. First operand 1445 states and 2269 transitions. Second operand 4 states. [2018-11-10 12:34:07,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:34:07,499 INFO L93 Difference]: Finished difference Result 3393 states and 5318 transitions. [2018-11-10 12:34:07,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 12:34:07,499 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 182 [2018-11-10 12:34:07,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:34:07,503 INFO L225 Difference]: With dead ends: 3393 [2018-11-10 12:34:07,503 INFO L226 Difference]: Without dead ends: 1962 [2018-11-10 12:34:07,505 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-10 12:34:07,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1962 states. [2018-11-10 12:34:07,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1962 to 1677. [2018-11-10 12:34:07,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1677 states. [2018-11-10 12:34:07,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1677 states to 1677 states and 2677 transitions. [2018-11-10 12:34:07,539 INFO L78 Accepts]: Start accepts. Automaton has 1677 states and 2677 transitions. Word has length 182 [2018-11-10 12:34:07,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:34:07,539 INFO L481 AbstractCegarLoop]: Abstraction has 1677 states and 2677 transitions. [2018-11-10 12:34:07,539 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 12:34:07,539 INFO L276 IsEmpty]: Start isEmpty. Operand 1677 states and 2677 transitions. [2018-11-10 12:34:07,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-11-10 12:34:07,542 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:34:07,542 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:34:07,542 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:34:07,542 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:34:07,542 INFO L82 PathProgramCache]: Analyzing trace with hash -1629534909, now seen corresponding path program 1 times [2018-11-10 12:34:07,542 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 12:34:07,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:34:07,543 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:34:07,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:34:07,543 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 12:34:07,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:34:07,627 INFO L134 CoverageAnalysis]: Checked inductivity of 241 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 134 trivial. 0 not checked. [2018-11-10 12:34:07,627 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:34:07,627 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 12:34:07,627 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 12:34:07,627 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 12:34:07,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 12:34:07,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 12:34:07,628 INFO L87 Difference]: Start difference. First operand 1677 states and 2677 transitions. Second operand 4 states. [2018-11-10 12:34:07,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:34:07,834 INFO L93 Difference]: Finished difference Result 3580 states and 5689 transitions. [2018-11-10 12:34:07,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 12:34:07,835 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 190 [2018-11-10 12:34:07,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:34:07,838 INFO L225 Difference]: With dead ends: 3580 [2018-11-10 12:34:07,838 INFO L226 Difference]: Without dead ends: 1917 [2018-11-10 12:34:07,841 INFO L605 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-11-10 12:34:07,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1917 states. [2018-11-10 12:34:07,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1917 to 1813. [2018-11-10 12:34:07,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1813 states. [2018-11-10 12:34:07,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1813 states to 1813 states and 2893 transitions. [2018-11-10 12:34:07,880 INFO L78 Accepts]: Start accepts. Automaton has 1813 states and 2893 transitions. Word has length 190 [2018-11-10 12:34:07,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:34:07,881 INFO L481 AbstractCegarLoop]: Abstraction has 1813 states and 2893 transitions. [2018-11-10 12:34:07,881 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 12:34:07,881 INFO L276 IsEmpty]: Start isEmpty. Operand 1813 states and 2893 transitions. [2018-11-10 12:34:07,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-11-10 12:34:07,883 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:34:07,883 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:34:07,884 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:34:07,884 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:34:07,884 INFO L82 PathProgramCache]: Analyzing trace with hash 132048247, now seen corresponding path program 1 times [2018-11-10 12:34:07,884 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 12:34:07,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:34:07,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:34:07,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:34:07,885 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 12:34:07,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:34:07,986 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2018-11-10 12:34:07,986 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:34:07,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 12:34:07,986 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 12:34:07,986 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 12:34:07,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 12:34:07,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 12:34:07,987 INFO L87 Difference]: Start difference. First operand 1813 states and 2893 transitions. Second operand 4 states. [2018-11-10 12:34:08,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:34:08,308 INFO L93 Difference]: Finished difference Result 4851 states and 7709 transitions. [2018-11-10 12:34:08,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 12:34:08,309 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 190 [2018-11-10 12:34:08,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:34:08,314 INFO L225 Difference]: With dead ends: 4851 [2018-11-10 12:34:08,314 INFO L226 Difference]: Without dead ends: 3052 [2018-11-10 12:34:08,317 INFO L605 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-11-10 12:34:08,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3052 states. [2018-11-10 12:34:08,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3052 to 2133. [2018-11-10 12:34:08,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2133 states. [2018-11-10 12:34:08,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2133 states to 2133 states and 3477 transitions. [2018-11-10 12:34:08,367 INFO L78 Accepts]: Start accepts. Automaton has 2133 states and 3477 transitions. Word has length 190 [2018-11-10 12:34:08,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:34:08,368 INFO L481 AbstractCegarLoop]: Abstraction has 2133 states and 3477 transitions. [2018-11-10 12:34:08,368 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 12:34:08,368 INFO L276 IsEmpty]: Start isEmpty. Operand 2133 states and 3477 transitions. [2018-11-10 12:34:08,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2018-11-10 12:34:08,371 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:34:08,371 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:34:08,371 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:34:08,371 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:34:08,371 INFO L82 PathProgramCache]: Analyzing trace with hash -208478994, now seen corresponding path program 1 times [2018-11-10 12:34:08,371 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 12:34:08,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:34:08,372 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:34:08,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:34:08,372 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 12:34:08,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:34:08,467 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 116 proven. 0 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2018-11-10 12:34:08,467 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:34:08,468 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 12:34:08,468 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 12:34:08,468 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 12:34:08,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 12:34:08,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 12:34:08,468 INFO L87 Difference]: Start difference. First operand 2133 states and 3477 transitions. Second operand 4 states. [2018-11-10 12:34:08,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:34:08,791 INFO L93 Difference]: Finished difference Result 5219 states and 8397 transitions. [2018-11-10 12:34:08,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 12:34:08,792 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 191 [2018-11-10 12:34:08,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:34:08,798 INFO L225 Difference]: With dead ends: 5219 [2018-11-10 12:34:08,798 INFO L226 Difference]: Without dead ends: 3100 [2018-11-10 12:34:08,800 INFO L605 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-11-10 12:34:08,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3100 states. [2018-11-10 12:34:08,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3100 to 2461. [2018-11-10 12:34:08,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2461 states. [2018-11-10 12:34:08,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2461 states to 2461 states and 4077 transitions. [2018-11-10 12:34:08,857 INFO L78 Accepts]: Start accepts. Automaton has 2461 states and 4077 transitions. Word has length 191 [2018-11-10 12:34:08,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:34:08,857 INFO L481 AbstractCegarLoop]: Abstraction has 2461 states and 4077 transitions. [2018-11-10 12:34:08,857 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 12:34:08,857 INFO L276 IsEmpty]: Start isEmpty. Operand 2461 states and 4077 transitions. [2018-11-10 12:34:08,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2018-11-10 12:34:08,861 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:34:08,861 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:34:08,861 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:34:08,861 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:34:08,861 INFO L82 PathProgramCache]: Analyzing trace with hash -867015539, now seen corresponding path program 1 times [2018-11-10 12:34:08,861 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 12:34:08,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:34:08,862 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:34:08,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:34:08,862 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 12:34:08,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:34:08,964 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 196 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2018-11-10 12:34:08,965 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:34:08,965 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 12:34:08,965 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 12:34:08,965 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 12:34:08,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 12:34:08,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 12:34:08,966 INFO L87 Difference]: Start difference. First operand 2461 states and 4077 transitions. Second operand 4 states. [2018-11-10 12:34:09,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:34:09,287 INFO L93 Difference]: Finished difference Result 5890 states and 9596 transitions. [2018-11-10 12:34:09,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 12:34:09,288 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 197 [2018-11-10 12:34:09,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:34:09,294 INFO L225 Difference]: With dead ends: 5890 [2018-11-10 12:34:09,294 INFO L226 Difference]: Without dead ends: 3443 [2018-11-10 12:34:09,297 INFO L605 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-11-10 12:34:09,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3443 states. [2018-11-10 12:34:09,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3443 to 2812. [2018-11-10 12:34:09,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2812 states. [2018-11-10 12:34:09,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2812 states to 2812 states and 4692 transitions. [2018-11-10 12:34:09,357 INFO L78 Accepts]: Start accepts. Automaton has 2812 states and 4692 transitions. Word has length 197 [2018-11-10 12:34:09,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:34:09,358 INFO L481 AbstractCegarLoop]: Abstraction has 2812 states and 4692 transitions. [2018-11-10 12:34:09,358 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 12:34:09,358 INFO L276 IsEmpty]: Start isEmpty. Operand 2812 states and 4692 transitions. [2018-11-10 12:34:09,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-11-10 12:34:09,361 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:34:09,361 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:34:09,362 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:34:09,362 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:34:09,362 INFO L82 PathProgramCache]: Analyzing trace with hash 1043556602, now seen corresponding path program 1 times [2018-11-10 12:34:09,362 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 12:34:09,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:34:09,363 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:34:09,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:34:09,363 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 12:34:09,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:34:09,451 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 196 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2018-11-10 12:34:09,451 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:34:09,451 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 12:34:09,451 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 12:34:09,452 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 12:34:09,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 12:34:09,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 12:34:09,452 INFO L87 Difference]: Start difference. First operand 2812 states and 4692 transitions. Second operand 4 states. [2018-11-10 12:34:09,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:34:09,776 INFO L93 Difference]: Finished difference Result 6249 states and 10219 transitions. [2018-11-10 12:34:09,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 12:34:09,777 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 198 [2018-11-10 12:34:09,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:34:09,785 INFO L225 Difference]: With dead ends: 6249 [2018-11-10 12:34:09,785 INFO L226 Difference]: Without dead ends: 3451 [2018-11-10 12:34:09,789 INFO L605 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-11-10 12:34:09,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3451 states. [2018-11-10 12:34:09,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3451 to 2828. [2018-11-10 12:34:09,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2828 states. [2018-11-10 12:34:09,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2828 states to 2828 states and 4716 transitions. [2018-11-10 12:34:09,850 INFO L78 Accepts]: Start accepts. Automaton has 2828 states and 4716 transitions. Word has length 198 [2018-11-10 12:34:09,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:34:09,851 INFO L481 AbstractCegarLoop]: Abstraction has 2828 states and 4716 transitions. [2018-11-10 12:34:09,851 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 12:34:09,851 INFO L276 IsEmpty]: Start isEmpty. Operand 2828 states and 4716 transitions. [2018-11-10 12:34:09,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2018-11-10 12:34:09,854 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:34:09,854 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 12:34:09,855 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:34:09,855 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:34:09,855 INFO L82 PathProgramCache]: Analyzing trace with hash -1016428612, now seen corresponding path program 1 times [2018-11-10 12:34:09,855 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 12:34:09,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:34:09,856 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:34:09,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:34:09,856 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 12:34:09,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:34:09,948 INFO L134 CoverageAnalysis]: Checked inductivity of 367 backedges. 251 proven. 6 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2018-11-10 12:34:09,948 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 12:34:09,949 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 12:34:09,950 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 206 with the following transitions: [2018-11-10 12:34:09,950 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [12], [16], [27], [29], [33], [37], [43], [45], [50], [55], [60], [65], [70], [75], [80], [85], [88], [90], [95], [100], [103], [105], [110], [113], [115], [120], [123], [125], [130], [133], [135], [140], [145], [150], [155], [160], [165], [170], [175], [180], [185], [190], [195], [198], [279], [282], [290], [292], [295], [297], [303], [306], [310], [312], [317], [320], [328], [330], [332], [337], [339], [342], [371], [374], [382], [392], [394], [397], [408], [410], [420], [422], [425], [509], [514], [519], [524], [527], [535], [540], [581], [615], [617], [629], [632], [633], [634], [636] [2018-11-10 12:34:09,955 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 12:34:09,955 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 12:34:10,232 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-10 12:35:07,689 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-10 12:35:07,689 INFO L272 AbstractInterpreter]: Visited 92 different actions 668 times. Merged at 73 different actions 528 times. Widened at 13 different actions 41 times. Found 31 fixpoints after 14 different actions. Largest state had 166 variables. [2018-11-10 12:35:07,690 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:35:07,691 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-10 12:35:07,691 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 12:35:07,691 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_73a470a1-fd1b-4132-9c85-c391d27a4779/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-11-10 12:35:07,697 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:35:07,697 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 12:35:07,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:35:07,947 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:35:07,951 INFO L477 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-11-10 12:35:07,956 INFO L477 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-11-10 12:35:07,957 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:35:07,960 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:35:07,961 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:35:07,961 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-10 12:35:07,969 INFO L477 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 21 treesize of output 16 [2018-11-10 12:35:07,972 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:35:07,974 INFO L477 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 16 treesize of output 23 [2018-11-10 12:35:07,974 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:35:07,981 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:35:07,985 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:35:07,985 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:26, output treesize:9 [2018-11-10 12:35:07,987 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-10 12:35:07,988 INFO L477 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 15 treesize of output 3 [2018-11-10 12:35:07,989 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:35:07,989 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:35:07,990 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:35:07,990 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:19, output treesize:3 [2018-11-10 12:35:08,012 INFO L134 CoverageAnalysis]: Checked inductivity of 367 backedges. 233 proven. 0 refuted. 0 times theorem prover too weak. 134 trivial. 0 not checked. [2018-11-10 12:35:08,013 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 12:35:08,050 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-11-10 12:35:08,051 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 16 treesize of output 1 [2018-11-10 12:35:08,051 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:35:08,052 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:35:08,052 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:35:08,052 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:1 [2018-11-10 12:35:08,096 INFO L134 CoverageAnalysis]: Checked inductivity of 367 backedges. 237 proven. 4 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2018-11-10 12:35:08,114 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-11-10 12:35:08,114 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6, 7] total 13 [2018-11-10 12:35:08,114 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 12:35:08,114 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 12:35:08,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 12:35:08,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2018-11-10 12:35:08,115 INFO L87 Difference]: Start difference. First operand 2828 states and 4716 transitions. Second operand 4 states. [2018-11-10 12:35:08,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:35:08,469 INFO L93 Difference]: Finished difference Result 6127 states and 10028 transitions. [2018-11-10 12:35:08,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 12:35:08,470 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 205 [2018-11-10 12:35:08,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:35:08,476 INFO L225 Difference]: With dead ends: 6127 [2018-11-10 12:35:08,476 INFO L226 Difference]: Without dead ends: 3313 [2018-11-10 12:35:08,480 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 418 GetRequests, 405 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2018-11-10 12:35:08,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3313 states. [2018-11-10 12:35:08,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3313 to 2828. [2018-11-10 12:35:08,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2828 states. [2018-11-10 12:35:08,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2828 states to 2828 states and 4708 transitions. [2018-11-10 12:35:08,543 INFO L78 Accepts]: Start accepts. Automaton has 2828 states and 4708 transitions. Word has length 205 [2018-11-10 12:35:08,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:35:08,543 INFO L481 AbstractCegarLoop]: Abstraction has 2828 states and 4708 transitions. [2018-11-10 12:35:08,543 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 12:35:08,543 INFO L276 IsEmpty]: Start isEmpty. Operand 2828 states and 4708 transitions. [2018-11-10 12:35:08,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2018-11-10 12:35:08,547 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:35:08,547 INFO L375 BasicCegarLoop]: trace histogram [6, 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] [2018-11-10 12:35:08,547 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:35:08,547 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:35:08,547 INFO L82 PathProgramCache]: Analyzing trace with hash -1084632837, now seen corresponding path program 1 times [2018-11-10 12:35:08,547 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 12:35:08,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:35:08,548 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:35:08,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:35:08,548 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 12:35:08,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:35:08,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:35:08,760 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-11-10 12:35:08,775 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 12:35:08,776 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 12:35:08,776 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 12:35:08,777 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 12:35:08,777 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 12:35:08,777 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 12:35:08,834 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 12:35:08 BoogieIcfgContainer [2018-11-10 12:35:08,834 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-10 12:35:08,834 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 12:35:08,834 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 12:35:08,836 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 12:35:08,836 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:33:22" (3/4) ... [2018-11-10 12:35:08,839 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-10 12:35:08,839 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 12:35:08,840 INFO L168 Benchmark]: Toolchain (without parser) took 108165.11 ms. Allocated memory was 1.0 GB in the beginning and 5.0 GB in the end (delta: 3.9 GB). Free memory was 953.1 MB in the beginning and 1.5 GB in the end (delta: -533.3 MB). Peak memory consumption was 3.4 GB. Max. memory is 11.5 GB. [2018-11-10 12:35:08,841 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 982.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 12:35:08,841 INFO L168 Benchmark]: CACSL2BoogieTranslator took 914.87 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 120.6 MB). Free memory was 953.1 MB in the beginning and 1.1 GB in the end (delta: -152.8 MB). Peak memory consumption was 174.0 MB. Max. memory is 11.5 GB. [2018-11-10 12:35:08,842 INFO L168 Benchmark]: Boogie Procedure Inliner took 69.51 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: 12.6 MB). Peak memory consumption was 12.6 MB. Max. memory is 11.5 GB. [2018-11-10 12:35:08,842 INFO L168 Benchmark]: Boogie Preprocessor took 76.99 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: 6.3 MB). Peak memory consumption was 6.3 MB. Max. memory is 11.5 GB. [2018-11-10 12:35:08,842 INFO L168 Benchmark]: RCFGBuilder took 956.76 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 917.5 MB in the end (delta: 169.6 MB). Peak memory consumption was 169.6 MB. Max. memory is 11.5 GB. [2018-11-10 12:35:08,842 INFO L168 Benchmark]: TraceAbstraction took 106138.34 ms. Allocated memory was 1.1 GB in the beginning and 5.0 GB in the end (delta: 3.8 GB). Free memory was 917.5 MB in the beginning and 1.5 GB in the end (delta: -568.9 MB). Peak memory consumption was 3.3 GB. Max. memory is 11.5 GB. [2018-11-10 12:35:08,843 INFO L168 Benchmark]: Witness Printer took 5.03 ms. Allocated memory is still 5.0 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 12:35:08,848 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 982.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 914.87 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 120.6 MB). Free memory was 953.1 MB in the beginning and 1.1 GB in the end (delta: -152.8 MB). Peak memory consumption was 174.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 69.51 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: 12.6 MB). Peak memory consumption was 12.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 76.99 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: 6.3 MB). Peak memory consumption was 6.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 956.76 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 917.5 MB in the end (delta: 169.6 MB). Peak memory consumption was 169.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 106138.34 ms. Allocated memory was 1.1 GB in the beginning and 5.0 GB in the end (delta: 3.8 GB). Free memory was 917.5 MB in the beginning and 1.5 GB in the end (delta: -568.9 MB). Peak memory consumption was 3.3 GB. Max. memory is 11.5 GB. * Witness Printer took 5.03 ms. Allocated memory is still 5.0 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 1726]: 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] CALL static SSL_METHOD SSLv3_server_data ; [L1043] RET static SSL_METHOD SSLv3_server_data ; [L1043] RET static SSL_METHOD SSLv3_server_data ; [L1043] RET static SSL_METHOD SSLv3_server_data ; [L1043] RET static SSL_METHOD SSLv3_server_data ; [L1043] RET static SSL_METHOD SSLv3_server_data ; [L1043] RET static SSL_METHOD SSLv3_server_data ; [L1043] RET static SSL_METHOD SSLv3_server_data ; [L1043] RET static SSL_METHOD SSLv3_server_data ; [L1043] RET static SSL_METHOD SSLv3_server_data ; [L1043] RET static SSL_METHOD SSLv3_server_data ; [L1043] RET static SSL_METHOD SSLv3_server_data ; [L1043] RET static SSL_METHOD SSLv3_server_data ; [L1043] RET static SSL_METHOD SSLv3_server_data ; [L1043] RET static SSL_METHOD SSLv3_server_data ; [L1043] RET static SSL_METHOD SSLv3_server_data ; [L1043] RET static SSL_METHOD SSLv3_server_data ; [L1043] RET static SSL_METHOD SSLv3_server_data ; [L1043] RET static SSL_METHOD SSLv3_server_data ; [L1043] RET static SSL_METHOD SSLv3_server_data ; [L1043] RET static SSL_METHOD SSLv3_server_data ; [L1043] RET static SSL_METHOD SSLv3_server_data ; [L1043] RET static SSL_METHOD SSLv3_server_data ; [L1043] RET static SSL_METHOD SSLv3_server_data ; [L1043] RET static SSL_METHOD SSLv3_server_data ; [L1043] RET static SSL_METHOD SSLv3_server_data ; [L1043] RET static SSL_METHOD SSLv3_server_data ; [L1065] SSL *s ; [L1066] int tmp ; [L1070] EXPR, FCALL malloc(sizeof(SSL)) [L1070] s = malloc(sizeof(SSL)) [L1071] EXPR, FCALL malloc(sizeof(struct ssl3_state_st)) [L1071] CALL s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1071] RET s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1072] EXPR, FCALL malloc(sizeof(SSL_CTX)) [L1072] CALL s->ctx = malloc(sizeof(SSL_CTX)) [L1072] RET s->ctx = malloc(sizeof(SSL_CTX)) [L1073] EXPR, FCALL malloc(sizeof(SSL_SESSION)) [L1073] CALL s->session = malloc(sizeof(SSL_SESSION)) [L1073] RET s->session = malloc(sizeof(SSL_SESSION)) [L1074] CALL ssl3_accept(s) VAL [init=1, SSLv3_server_data={24588: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] CALL s->state = 8464 [L1105] RET s->state = 8464 [L1106] blastFlag = 0 [L1107] CALL s->hit=__VERIFIER_nondet_int () [L1107] RET s->hit=__VERIFIER_nondet_int () [L1108] CALL s->state = 8464 [L1108] RET 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] CALL, EXPR s->info_callback [L1115] RET, EXPR s->info_callback [L1115] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1116] CALL, EXPR s->info_callback [L1116] RET, EXPR s->info_callback [L1116] cb = s->info_callback [L1120] CALL, EXPR s->in_handshake [L1120] RET, EXPR s->in_handshake [L1120] CALL s->in_handshake += 1 [L1120] RET s->in_handshake += 1 [L1121] COND FALSE !(tmp___1 & 12288) VAL [init=1, SSLv3_server_data={24588:0}] [L1130] CALL, EXPR s->cert [L1130] RET, EXPR s->cert [L1130] COND FALSE !((unsigned long )s->cert == (unsigned long )((void *)0)) [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={24588:0}] [L1138] CALL, EXPR s->state [L1138] RET, EXPR s->state [L1138] state = s->state [L1139] CALL, EXPR s->state [L1139] RET, EXPR s->state [L1139] COND FALSE !(s->state == 12292) [L1142] CALL, EXPR s->state [L1142] RET, EXPR s->state [L1142] COND FALSE !(s->state == 16384) [L1145] CALL, EXPR s->state [L1145] RET, EXPR s->state [L1145] COND FALSE !(s->state == 8192) [L1148] CALL, EXPR s->state [L1148] RET, EXPR s->state [L1148] COND FALSE !(s->state == 24576) [L1151] CALL, EXPR s->state [L1151] RET, EXPR s->state [L1151] COND FALSE !(s->state == 8195) [L1154] CALL, EXPR s->state [L1154] RET, EXPR s->state [L1154] COND FALSE !(s->state == 8480) [L1157] CALL, EXPR s->state [L1157] RET, EXPR s->state [L1157] COND FALSE !(s->state == 8481) [L1160] CALL, EXPR s->state [L1160] RET, EXPR s->state [L1160] COND FALSE !(s->state == 8482) [L1163] CALL, EXPR s->state [L1163] RET, EXPR s->state [L1163] COND TRUE s->state == 8464 [L1323] CALL s->shutdown = 0 [L1323] RET s->shutdown = 0 [L1324] ret = __VERIFIER_nondet_int() [L1325] COND TRUE blastFlag == 0 [L1326] blastFlag = 1 VAL [init=1, SSLv3_server_data={24588:0}] [L1330] COND FALSE !(ret <= 0) [L1335] got_new_session = 1 [L1336] CALL s->state = 8496 [L1336] RET s->state = 8496 [L1337] CALL s->init_num = 0 [L1337] RET s->init_num = 0 [L1685] CALL, EXPR s->s3 [L1685] RET, EXPR s->s3 [L1685] CALL, EXPR (s->s3)->tmp.reuse_message [L1685] RET, EXPR (s->s3)->tmp.reuse_message [L1685] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1714] skip = 0 VAL [init=1, SSLv3_server_data={24588:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={24588:0}] [L1138] CALL, EXPR s->state [L1138] RET, EXPR s->state [L1138] state = s->state [L1139] CALL, EXPR s->state [L1139] RET, EXPR s->state [L1139] COND FALSE !(s->state == 12292) [L1142] CALL, EXPR s->state [L1142] RET, EXPR s->state [L1142] COND FALSE !(s->state == 16384) [L1145] CALL, EXPR s->state [L1145] RET, EXPR s->state [L1145] COND FALSE !(s->state == 8192) [L1148] CALL, EXPR s->state [L1148] RET, EXPR s->state [L1148] COND FALSE !(s->state == 24576) [L1151] CALL, EXPR s->state [L1151] RET, EXPR s->state [L1151] COND FALSE !(s->state == 8195) [L1154] CALL, EXPR s->state [L1154] RET, EXPR s->state [L1154] COND FALSE !(s->state == 8480) [L1157] CALL, EXPR s->state [L1157] RET, EXPR s->state [L1157] COND FALSE !(s->state == 8481) [L1160] CALL, EXPR s->state [L1160] RET, EXPR s->state [L1160] COND FALSE !(s->state == 8482) [L1163] CALL, EXPR s->state [L1163] RET, EXPR s->state [L1163] COND FALSE !(s->state == 8464) [L1166] CALL, EXPR s->state [L1166] RET, EXPR s->state [L1166] COND FALSE !(s->state == 8465) [L1169] CALL, EXPR s->state [L1169] RET, EXPR s->state [L1169] COND FALSE !(s->state == 8466) [L1172] CALL, EXPR s->state [L1172] RET, EXPR s->state [L1172] COND TRUE s->state == 8496 [L1341] ret = __VERIFIER_nondet_int() [L1342] COND TRUE blastFlag == 1 [L1343] blastFlag = 2 VAL [init=1, SSLv3_server_data={24588:0}] [L1347] COND FALSE !(ret <= 0) [L1352] CALL s->hit [L1352] RET s->hit [L1352] COND TRUE s->hit [L1353] CALL s->state = 8656 [L1353] RET s->state = 8656 [L1357] CALL s->init_num = 0 [L1357] RET s->init_num = 0 [L1685] CALL, EXPR s->s3 [L1685] RET, EXPR s->s3 [L1685] CALL, EXPR (s->s3)->tmp.reuse_message [L1685] RET, EXPR (s->s3)->tmp.reuse_message [L1685] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1714] skip = 0 VAL [init=1, SSLv3_server_data={24588:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={24588:0}] [L1138] CALL, EXPR s->state [L1138] RET, EXPR s->state [L1138] state = s->state [L1139] CALL, EXPR s->state [L1139] RET, EXPR s->state [L1139] COND FALSE !(s->state == 12292) [L1142] CALL, EXPR s->state [L1142] RET, EXPR s->state [L1142] COND FALSE !(s->state == 16384) [L1145] CALL, EXPR s->state [L1145] RET, EXPR s->state [L1145] COND FALSE !(s->state == 8192) [L1148] CALL, EXPR s->state [L1148] RET, EXPR s->state [L1148] COND FALSE !(s->state == 24576) [L1151] CALL, EXPR s->state [L1151] RET, EXPR s->state [L1151] COND FALSE !(s->state == 8195) [L1154] CALL, EXPR s->state [L1154] RET, EXPR s->state [L1154] COND FALSE !(s->state == 8480) [L1157] CALL, EXPR s->state [L1157] RET, EXPR s->state [L1157] COND FALSE !(s->state == 8481) [L1160] CALL, EXPR s->state [L1160] RET, EXPR s->state [L1160] COND FALSE !(s->state == 8482) [L1163] CALL, EXPR s->state [L1163] RET, EXPR s->state [L1163] COND FALSE !(s->state == 8464) [L1166] CALL, EXPR s->state [L1166] RET, EXPR s->state [L1166] COND FALSE !(s->state == 8465) [L1169] CALL, EXPR s->state [L1169] RET, EXPR s->state [L1169] COND FALSE !(s->state == 8466) [L1172] CALL, EXPR s->state [L1172] RET, EXPR s->state [L1172] COND FALSE !(s->state == 8496) [L1175] CALL, EXPR s->state [L1175] RET, EXPR s->state [L1175] COND FALSE !(s->state == 8497) [L1178] CALL, EXPR s->state [L1178] RET, EXPR s->state [L1178] COND FALSE !(s->state == 8512) [L1181] CALL, EXPR s->state [L1181] RET, EXPR s->state [L1181] COND FALSE !(s->state == 8513) [L1184] CALL, EXPR s->state [L1184] RET, EXPR s->state [L1184] COND FALSE !(s->state == 8528) [L1187] CALL, EXPR s->state [L1187] RET, EXPR s->state [L1187] COND FALSE !(s->state == 8529) [L1190] CALL, EXPR s->state [L1190] RET, EXPR s->state [L1190] COND FALSE !(s->state == 8544) [L1193] CALL, EXPR s->state [L1193] RET, EXPR s->state [L1193] COND FALSE !(s->state == 8545) [L1196] CALL, EXPR s->state [L1196] RET, EXPR s->state [L1196] COND FALSE !(s->state == 8560) [L1199] CALL, EXPR s->state [L1199] RET, EXPR s->state [L1199] COND FALSE !(s->state == 8561) [L1202] CALL, EXPR s->state [L1202] RET, EXPR s->state [L1202] COND FALSE !(s->state == 8448) [L1205] CALL, EXPR s->state [L1205] RET, EXPR s->state [L1205] COND FALSE !(s->state == 8576) [L1208] CALL, EXPR s->state [L1208] RET, EXPR s->state [L1208] COND FALSE !(s->state == 8577) [L1211] CALL, EXPR s->state [L1211] RET, EXPR s->state [L1211] COND FALSE !(s->state == 8592) [L1214] CALL, EXPR s->state [L1214] RET, EXPR s->state [L1214] COND FALSE !(s->state == 8593) [L1217] CALL, EXPR s->state [L1217] RET, EXPR s->state [L1217] COND FALSE !(s->state == 8608) [L1220] CALL, EXPR s->state [L1220] RET, EXPR s->state [L1220] COND FALSE !(s->state == 8609) [L1223] CALL, EXPR s->state [L1223] RET, EXPR s->state [L1223] COND FALSE !(s->state == 8640) [L1226] CALL, EXPR s->state [L1226] RET, EXPR s->state [L1226] COND FALSE !(s->state == 8641) [L1229] CALL, EXPR s->state [L1229] RET, EXPR s->state [L1229] COND TRUE s->state == 8656 [L1570] CALL, EXPR s->session [L1570] RET, EXPR s->session [L1570] CALL, EXPR s->s3 [L1570] RET, EXPR s->s3 [L1570] CALL, EXPR (s->s3)->tmp.new_cipher [L1570] RET, EXPR (s->s3)->tmp.new_cipher [L1570] CALL (s->session)->cipher = (s->s3)->tmp.new_cipher [L1570] RET (s->session)->cipher = (s->s3)->tmp.new_cipher [L1571] COND FALSE !(! tmp___9) [L1577] ret = __VERIFIER_nondet_int() [L1578] COND TRUE blastFlag == 2 [L1579] blastFlag = 3 VAL [init=1, SSLv3_server_data={24588:0}] [L1591] COND FALSE !(ret <= 0) [L1596] CALL s->state = 8672 [L1596] RET s->state = 8672 [L1597] CALL s->init_num = 0 [L1597] RET s->init_num = 0 [L1598] COND FALSE !(! tmp___10) VAL [init=1, SSLv3_server_data={24588:0}] [L1685] CALL, EXPR s->s3 [L1685] RET, EXPR s->s3 [L1685] CALL, EXPR (s->s3)->tmp.reuse_message [L1685] RET, EXPR (s->s3)->tmp.reuse_message [L1685] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1714] skip = 0 VAL [init=1, SSLv3_server_data={24588:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={24588:0}] [L1138] CALL, EXPR s->state [L1138] RET, EXPR s->state [L1138] state = s->state [L1139] CALL, EXPR s->state [L1139] RET, EXPR s->state [L1139] COND FALSE !(s->state == 12292) [L1142] CALL, EXPR s->state [L1142] RET, EXPR s->state [L1142] COND FALSE !(s->state == 16384) [L1145] CALL, EXPR s->state [L1145] RET, EXPR s->state [L1145] COND FALSE !(s->state == 8192) [L1148] CALL, EXPR s->state [L1148] RET, EXPR s->state [L1148] COND FALSE !(s->state == 24576) [L1151] CALL, EXPR s->state [L1151] RET, EXPR s->state [L1151] COND FALSE !(s->state == 8195) [L1154] CALL, EXPR s->state [L1154] RET, EXPR s->state [L1154] COND FALSE !(s->state == 8480) [L1157] CALL, EXPR s->state [L1157] RET, EXPR s->state [L1157] COND FALSE !(s->state == 8481) [L1160] CALL, EXPR s->state [L1160] RET, EXPR s->state [L1160] COND FALSE !(s->state == 8482) [L1163] CALL, EXPR s->state [L1163] RET, EXPR s->state [L1163] COND FALSE !(s->state == 8464) [L1166] CALL, EXPR s->state [L1166] RET, EXPR s->state [L1166] COND FALSE !(s->state == 8465) [L1169] CALL, EXPR s->state [L1169] RET, EXPR s->state [L1169] COND FALSE !(s->state == 8466) [L1172] CALL, EXPR s->state [L1172] RET, EXPR s->state [L1172] COND FALSE !(s->state == 8496) [L1175] CALL, EXPR s->state [L1175] RET, EXPR s->state [L1175] COND FALSE !(s->state == 8497) [L1178] CALL, EXPR s->state [L1178] RET, EXPR s->state [L1178] COND FALSE !(s->state == 8512) [L1181] CALL, EXPR s->state [L1181] RET, EXPR s->state [L1181] COND FALSE !(s->state == 8513) [L1184] CALL, EXPR s->state [L1184] RET, EXPR s->state [L1184] COND FALSE !(s->state == 8528) [L1187] CALL, EXPR s->state [L1187] RET, EXPR s->state [L1187] COND FALSE !(s->state == 8529) [L1190] CALL, EXPR s->state [L1190] RET, EXPR s->state [L1190] COND FALSE !(s->state == 8544) [L1193] CALL, EXPR s->state [L1193] RET, EXPR s->state [L1193] COND FALSE !(s->state == 8545) [L1196] CALL, EXPR s->state [L1196] RET, EXPR s->state [L1196] COND FALSE !(s->state == 8560) [L1199] CALL, EXPR s->state [L1199] RET, EXPR s->state [L1199] COND FALSE !(s->state == 8561) [L1202] CALL, EXPR s->state [L1202] RET, EXPR s->state [L1202] COND FALSE !(s->state == 8448) [L1205] CALL, EXPR s->state [L1205] RET, EXPR s->state [L1205] COND FALSE !(s->state == 8576) [L1208] CALL, EXPR s->state [L1208] RET, EXPR s->state [L1208] COND FALSE !(s->state == 8577) [L1211] CALL, EXPR s->state [L1211] RET, EXPR s->state [L1211] COND FALSE !(s->state == 8592) [L1214] CALL, EXPR s->state [L1214] RET, EXPR s->state [L1214] COND FALSE !(s->state == 8593) [L1217] CALL, EXPR s->state [L1217] RET, EXPR s->state [L1217] COND FALSE !(s->state == 8608) [L1220] CALL, EXPR s->state [L1220] RET, EXPR s->state [L1220] COND FALSE !(s->state == 8609) [L1223] CALL, EXPR s->state [L1223] RET, EXPR s->state [L1223] COND FALSE !(s->state == 8640) [L1226] CALL, EXPR s->state [L1226] RET, EXPR s->state [L1226] COND FALSE !(s->state == 8641) [L1229] CALL, EXPR s->state [L1229] RET, EXPR s->state [L1229] COND FALSE !(s->state == 8656) [L1232] CALL, EXPR s->state [L1232] RET, EXPR s->state [L1232] COND FALSE !(s->state == 8657) [L1235] CALL, EXPR s->state [L1235] RET, EXPR s->state [L1235] COND TRUE s->state == 8672 [L1607] ret = __VERIFIER_nondet_int() [L1608] COND TRUE blastFlag == 3 [L1609] blastFlag = 4 VAL [init=1, SSLv3_server_data={24588:0}] [L1613] COND FALSE !(ret <= 0) [L1618] CALL s->state = 8448 [L1618] RET s->state = 8448 [L1619] CALL s->hit [L1619] RET s->hit [L1619] COND TRUE s->hit [L1620] CALL, EXPR s->s3 [L1620] RET, EXPR s->s3 [L1620] CALL (s->s3)->tmp.next_state = 8640 [L1620] RET (s->s3)->tmp.next_state = 8640 [L1624] CALL s->init_num = 0 [L1624] RET s->init_num = 0 [L1685] CALL, EXPR s->s3 [L1685] RET, EXPR s->s3 [L1685] CALL, EXPR (s->s3)->tmp.reuse_message [L1685] RET, EXPR (s->s3)->tmp.reuse_message [L1685] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1714] skip = 0 VAL [init=1, SSLv3_server_data={24588:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={24588:0}] [L1138] CALL, EXPR s->state [L1138] RET, EXPR s->state [L1138] state = s->state [L1139] CALL, EXPR s->state [L1139] RET, EXPR s->state [L1139] COND FALSE !(s->state == 12292) [L1142] CALL, EXPR s->state [L1142] RET, EXPR s->state [L1142] COND FALSE !(s->state == 16384) [L1145] CALL, EXPR s->state [L1145] RET, EXPR s->state [L1145] COND FALSE !(s->state == 8192) [L1148] CALL, EXPR s->state [L1148] RET, EXPR s->state [L1148] COND FALSE !(s->state == 24576) [L1151] CALL, EXPR s->state [L1151] RET, EXPR s->state [L1151] COND FALSE !(s->state == 8195) [L1154] CALL, EXPR s->state [L1154] RET, EXPR s->state [L1154] COND FALSE !(s->state == 8480) [L1157] CALL, EXPR s->state [L1157] RET, EXPR s->state [L1157] COND FALSE !(s->state == 8481) [L1160] CALL, EXPR s->state [L1160] RET, EXPR s->state [L1160] COND FALSE !(s->state == 8482) [L1163] CALL, EXPR s->state [L1163] RET, EXPR s->state [L1163] COND FALSE !(s->state == 8464) [L1166] CALL, EXPR s->state [L1166] RET, EXPR s->state [L1166] COND FALSE !(s->state == 8465) [L1169] CALL, EXPR s->state [L1169] RET, EXPR s->state [L1169] COND FALSE !(s->state == 8466) [L1172] CALL, EXPR s->state [L1172] RET, EXPR s->state [L1172] COND FALSE !(s->state == 8496) [L1175] CALL, EXPR s->state [L1175] RET, EXPR s->state [L1175] COND FALSE !(s->state == 8497) [L1178] CALL, EXPR s->state [L1178] RET, EXPR s->state [L1178] COND FALSE !(s->state == 8512) [L1181] CALL, EXPR s->state [L1181] RET, EXPR s->state [L1181] COND FALSE !(s->state == 8513) [L1184] CALL, EXPR s->state [L1184] RET, EXPR s->state [L1184] COND FALSE !(s->state == 8528) [L1187] CALL, EXPR s->state [L1187] RET, EXPR s->state [L1187] COND FALSE !(s->state == 8529) [L1190] CALL, EXPR s->state [L1190] RET, EXPR s->state [L1190] COND FALSE !(s->state == 8544) [L1193] CALL, EXPR s->state [L1193] RET, EXPR s->state [L1193] COND FALSE !(s->state == 8545) [L1196] CALL, EXPR s->state [L1196] RET, EXPR s->state [L1196] COND FALSE !(s->state == 8560) [L1199] CALL, EXPR s->state [L1199] RET, EXPR s->state [L1199] COND FALSE !(s->state == 8561) [L1202] CALL, EXPR s->state [L1202] RET, EXPR s->state [L1202] COND TRUE s->state == 8448 [L1490] COND FALSE !(num1 > 0L) VAL [init=1, SSLv3_server_data={24588:0}] [L1503] CALL, EXPR s->s3 [L1503] RET, EXPR s->s3 [L1503] CALL, EXPR (s->s3)->tmp.next_state [L1503] RET, EXPR (s->s3)->tmp.next_state [L1503] CALL s->state = (s->s3)->tmp.next_state [L1503] RET s->state = (s->s3)->tmp.next_state [L1685] CALL, EXPR s->s3 [L1685] RET, EXPR s->s3 [L1685] CALL, EXPR (s->s3)->tmp.reuse_message [L1685] RET, EXPR (s->s3)->tmp.reuse_message [L1685] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1714] skip = 0 VAL [init=1, SSLv3_server_data={24588:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={24588:0}] [L1138] CALL, EXPR s->state [L1138] RET, EXPR s->state [L1138] state = s->state [L1139] CALL, EXPR s->state [L1139] RET, EXPR s->state [L1139] COND FALSE !(s->state == 12292) [L1142] CALL, EXPR s->state [L1142] RET, EXPR s->state [L1142] COND FALSE !(s->state == 16384) [L1145] CALL, EXPR s->state [L1145] RET, EXPR s->state [L1145] COND FALSE !(s->state == 8192) [L1148] CALL, EXPR s->state [L1148] RET, EXPR s->state [L1148] COND FALSE !(s->state == 24576) [L1151] CALL, EXPR s->state [L1151] RET, EXPR s->state [L1151] COND FALSE !(s->state == 8195) [L1154] CALL, EXPR s->state [L1154] RET, EXPR s->state [L1154] COND FALSE !(s->state == 8480) [L1157] CALL, EXPR s->state [L1157] RET, EXPR s->state [L1157] COND FALSE !(s->state == 8481) [L1160] CALL, EXPR s->state [L1160] RET, EXPR s->state [L1160] COND FALSE !(s->state == 8482) [L1163] CALL, EXPR s->state [L1163] RET, EXPR s->state [L1163] COND FALSE !(s->state == 8464) [L1166] CALL, EXPR s->state [L1166] RET, EXPR s->state [L1166] COND FALSE !(s->state == 8465) [L1169] CALL, EXPR s->state [L1169] RET, EXPR s->state [L1169] COND FALSE !(s->state == 8466) [L1172] CALL, EXPR s->state [L1172] RET, EXPR s->state [L1172] COND FALSE !(s->state == 8496) [L1175] CALL, EXPR s->state [L1175] RET, EXPR s->state [L1175] COND FALSE !(s->state == 8497) [L1178] CALL, EXPR s->state [L1178] RET, EXPR s->state [L1178] COND FALSE !(s->state == 8512) [L1181] CALL, EXPR s->state [L1181] RET, EXPR s->state [L1181] COND FALSE !(s->state == 8513) [L1184] CALL, EXPR s->state [L1184] RET, EXPR s->state [L1184] COND FALSE !(s->state == 8528) [L1187] CALL, EXPR s->state [L1187] RET, EXPR s->state [L1187] COND FALSE !(s->state == 8529) [L1190] CALL, EXPR s->state [L1190] RET, EXPR s->state [L1190] COND FALSE !(s->state == 8544) [L1193] CALL, EXPR s->state [L1193] RET, EXPR s->state [L1193] COND FALSE !(s->state == 8545) [L1196] CALL, EXPR s->state [L1196] RET, EXPR s->state [L1196] COND FALSE !(s->state == 8560) [L1199] CALL, EXPR s->state [L1199] RET, EXPR s->state [L1199] COND FALSE !(s->state == 8561) [L1202] CALL, EXPR s->state [L1202] RET, EXPR s->state [L1202] COND FALSE !(s->state == 8448) [L1205] CALL, EXPR s->state [L1205] RET, EXPR s->state [L1205] COND FALSE !(s->state == 8576) [L1208] CALL, EXPR s->state [L1208] RET, EXPR s->state [L1208] COND FALSE !(s->state == 8577) [L1211] CALL, EXPR s->state [L1211] RET, EXPR s->state [L1211] COND FALSE !(s->state == 8592) [L1214] CALL, EXPR s->state [L1214] RET, EXPR s->state [L1214] COND FALSE !(s->state == 8593) [L1217] CALL, EXPR s->state [L1217] RET, EXPR s->state [L1217] COND FALSE !(s->state == 8608) [L1220] CALL, EXPR s->state [L1220] RET, EXPR s->state [L1220] COND FALSE !(s->state == 8609) [L1223] CALL, EXPR s->state [L1223] RET, EXPR s->state [L1223] COND TRUE s->state == 8640 [L1550] ret = __VERIFIER_nondet_int() [L1551] COND TRUE blastFlag == 4 VAL [init=1, SSLv3_server_data={24588:0}] [L1726] __VERIFIER_error() VAL [init=1, SSLv3_server_data={24588:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 160 locations, 1 error locations. UNSAFE Result, 106.0s OverallTime, 17 OverallIterations, 7 TraceHistogramMax, 4.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3510 SDtfs, 2784 SDslu, 4409 SDs, 0 SdLazy, 3198 SolverSat, 380 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 845 GetRequests, 778 SyntacticMatches, 2 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2828occurred in iteration=15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 96.9s AbstIntTime, 2 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 16 MinimizatonAttempts, 4152 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 2863 NumberOfCodeBlocks, 2863 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 3018 ConstructedInterpolants, 84 QuantifiedInterpolants, 2724901 SizeOfPredicates, 68 NumberOfNonLiveVariables, 4055 ConjunctsInSsa, 124 ConjunctsInUnsatCore, 20 InterpolantComputations, 15 PerfectInterpolantSequences, 3481/4007 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-1dbac8b [2018-11-10 12:35:10,341 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 12:35:10,342 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 12:35:10,349 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 12:35:10,349 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 12:35:10,350 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 12:35:10,350 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 12:35:10,352 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 12:35:10,353 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 12:35:10,353 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 12:35:10,354 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 12:35:10,354 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 12:35:10,355 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 12:35:10,356 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 12:35:10,357 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 12:35:10,357 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 12:35:10,358 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 12:35:10,359 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 12:35:10,361 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 12:35:10,362 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 12:35:10,363 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 12:35:10,363 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 12:35:10,365 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 12:35:10,366 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 12:35:10,366 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 12:35:10,366 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 12:35:10,367 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 12:35:10,368 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 12:35:10,369 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 12:35:10,370 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 12:35:10,370 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 12:35:10,370 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 12:35:10,370 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 12:35:10,371 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 12:35:10,371 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 12:35:10,371 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 12:35:10,372 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_73a470a1-fd1b-4132-9c85-c391d27a4779/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2018-11-10 12:35:10,383 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 12:35:10,383 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 12:35:10,383 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 12:35:10,384 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-10 12:35:10,384 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-10 12:35:10,384 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-10 12:35:10,384 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-10 12:35:10,385 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-10 12:35:10,385 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 12:35:10,385 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 12:35:10,385 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 12:35:10,385 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 12:35:10,386 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 12:35:10,386 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 12:35:10,386 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 12:35:10,386 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-10 12:35:10,386 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-10 12:35:10,386 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 12:35:10,386 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 12:35:10,386 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 12:35:10,386 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 12:35:10,387 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 12:35:10,387 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 12:35:10,387 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 12:35:10,387 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 12:35:10,387 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 12:35:10,387 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 12:35:10,387 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 12:35:10,387 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-11-10 12:35:10,387 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 12:35:10,387 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-10 12:35:10,387 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-10 12:35:10,387 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_73a470a1-fd1b-4132-9c85-c391d27a4779/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 -> 26d2d88b107593355990b3892c0d3e9a5490a1a3 [2018-11-10 12:35:10,416 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 12:35:10,424 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 12:35:10,426 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 12:35:10,427 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 12:35:10,427 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 12:35:10,428 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_73a470a1-fd1b-4132-9c85-c391d27a4779/bin-2019/utaipan/../../sv-benchmarks/c/ssh/s3_srvr.blast.07_false-unreach-call.i.cil.c [2018-11-10 12:35:10,463 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_73a470a1-fd1b-4132-9c85-c391d27a4779/bin-2019/utaipan/data/56e5482be/ae9b35c0f79f43328a6ea51eb4180114/FLAG55804e368 [2018-11-10 12:35:10,834 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 12:35:10,835 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_73a470a1-fd1b-4132-9c85-c391d27a4779/sv-benchmarks/c/ssh/s3_srvr.blast.07_false-unreach-call.i.cil.c [2018-11-10 12:35:10,848 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_73a470a1-fd1b-4132-9c85-c391d27a4779/bin-2019/utaipan/data/56e5482be/ae9b35c0f79f43328a6ea51eb4180114/FLAG55804e368 [2018-11-10 12:35:10,856 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_73a470a1-fd1b-4132-9c85-c391d27a4779/bin-2019/utaipan/data/56e5482be/ae9b35c0f79f43328a6ea51eb4180114 [2018-11-10 12:35:10,859 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 12:35:10,859 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 12:35:10,860 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 12:35:10,860 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 12:35:10,862 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 12:35:10,863 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:35:10" (1/1) ... [2018-11-10 12:35:10,864 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14c0a400 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:35:10, skipping insertion in model container [2018-11-10 12:35:10,864 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:35:10" (1/1) ... [2018-11-10 12:35:10,870 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 12:35:10,915 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 12:35:11,409 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 12:35:11,420 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 12:35:11,594 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 12:35:11,610 INFO L193 MainTranslator]: Completed translation [2018-11-10 12:35:11,610 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:35:11 WrapperNode [2018-11-10 12:35:11,610 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 12:35:11,611 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 12:35:11,611 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 12:35:11,611 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 12:35:11,677 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:35:11" (1/1) ... [2018-11-10 12:35:11,694 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:35:11" (1/1) ... [2018-11-10 12:35:11,738 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 12:35:11,739 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 12:35:11,739 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 12:35:11,739 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 12:35:11,748 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:35:11" (1/1) ... [2018-11-10 12:35:11,748 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:35:11" (1/1) ... [2018-11-10 12:35:11,761 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:35:11" (1/1) ... [2018-11-10 12:35:11,761 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:35:11" (1/1) ... [2018-11-10 12:35:11,794 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:35:11" (1/1) ... [2018-11-10 12:35:11,801 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:35:11" (1/1) ... [2018-11-10 12:35:11,806 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:35:11" (1/1) ... [2018-11-10 12:35:11,813 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 12:35:11,814 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 12:35:11,814 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 12:35:11,814 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 12:35:11,814 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:35:11" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_73a470a1-fd1b-4132-9c85-c391d27a4779/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-11-10 12:35:11,866 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 12:35:11,866 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 12:35:11,867 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_accept [2018-11-10 12:35:11,867 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_accept [2018-11-10 12:35:11,867 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 12:35:11,867 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 12:35:11,867 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 12:35:11,867 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 12:35:14,286 WARN L667 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-10 12:35:14,287 WARN L632 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-10 12:35:15,084 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 12:35:15,085 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:35:15 BoogieIcfgContainer [2018-11-10 12:35:15,085 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 12:35:15,086 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 12:35:15,086 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 12:35:15,088 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 12:35:15,089 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 12:35:10" (1/3) ... [2018-11-10 12:35:15,089 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@636eb838 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 12:35:15, skipping insertion in model container [2018-11-10 12:35:15,089 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:35:11" (2/3) ... [2018-11-10 12:35:15,090 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@636eb838 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 12:35:15, skipping insertion in model container [2018-11-10 12:35:15,090 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:35:15" (3/3) ... [2018-11-10 12:35:15,091 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.07_false-unreach-call.i.cil.c [2018-11-10 12:35:15,099 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 12:35:15,104 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-10 12:35:15,112 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-10 12:35:15,134 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 12:35:15,135 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 12:35:15,135 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-10 12:35:15,135 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 12:35:15,135 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 12:35:15,135 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 12:35:15,135 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 12:35:15,135 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 12:35:15,135 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 12:35:15,150 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states. [2018-11-10 12:35:15,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-10 12:35:15,156 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:35:15,157 INFO L375 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] [2018-11-10 12:35:15,158 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:35:15,162 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:35:15,162 INFO L82 PathProgramCache]: Analyzing trace with hash -2122663997, now seen corresponding path program 1 times [2018-11-10 12:35:15,166 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 12:35:15,166 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_73a470a1-fd1b-4132-9c85-c391d27a4779/bin-2019/utaipan/cvc4nyu Starting monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 12:35:15,180 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:35:15,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:35:15,326 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:35:15,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:35:15,354 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 12:35:15,357 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:35:15,358 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:35:15,360 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 12:35:15,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:35:15,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:35:15,369 INFO L87 Difference]: Start difference. First operand 158 states. Second operand 3 states. [2018-11-10 12:35:15,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:35:15,493 INFO L93 Difference]: Finished difference Result 438 states and 739 transitions. [2018-11-10 12:35:15,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:35:15,498 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2018-11-10 12:35:15,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:35:15,511 INFO L225 Difference]: With dead ends: 438 [2018-11-10 12:35:15,511 INFO L226 Difference]: Without dead ends: 267 [2018-11-10 12:35:15,514 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 40 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-11-10 12:35:15,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2018-11-10 12:35:15,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 267. [2018-11-10 12:35:15,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2018-11-10 12:35:15,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 399 transitions. [2018-11-10 12:35:15,559 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 399 transitions. Word has length 42 [2018-11-10 12:35:15,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:35:15,559 INFO L481 AbstractCegarLoop]: Abstraction has 267 states and 399 transitions. [2018-11-10 12:35:15,560 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 12:35:15,560 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 399 transitions. [2018-11-10 12:35:15,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-11-10 12:35:15,562 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:35:15,562 INFO L375 BasicCegarLoop]: trace histogram [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-11-10 12:35:15,562 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:35:15,563 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:35:15,563 INFO L82 PathProgramCache]: Analyzing trace with hash 692256734, now seen corresponding path program 1 times [2018-11-10 12:35:15,564 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 12:35:15,564 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_73a470a1-fd1b-4132-9c85-c391d27a4779/bin-2019/utaipan/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 12:35:15,587 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:35:15,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:35:15,693 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:35:15,707 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:35:15,707 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 12:35:15,709 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:35:15,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:35:15,710 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 12:35:15,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:35:15,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:35:15,711 INFO L87 Difference]: Start difference. First operand 267 states and 399 transitions. Second operand 3 states. [2018-11-10 12:35:15,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:35:15,789 INFO L93 Difference]: Finished difference Result 518 states and 788 transitions. [2018-11-10 12:35:15,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:35:15,790 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2018-11-10 12:35:15,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:35:15,792 INFO L225 Difference]: With dead ends: 518 [2018-11-10 12:35:15,792 INFO L226 Difference]: Without dead ends: 390 [2018-11-10 12:35:15,793 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 58 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-11-10 12:35:15,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2018-11-10 12:35:15,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 390. [2018-11-10 12:35:15,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2018-11-10 12:35:15,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 581 transitions. [2018-11-10 12:35:15,815 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 581 transitions. Word has length 60 [2018-11-10 12:35:15,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:35:15,815 INFO L481 AbstractCegarLoop]: Abstraction has 390 states and 581 transitions. [2018-11-10 12:35:15,816 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 12:35:15,816 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 581 transitions. [2018-11-10 12:35:15,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-11-10 12:35:15,819 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:35:15,819 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-11-10 12:35:15,819 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:35:15,819 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:35:15,819 INFO L82 PathProgramCache]: Analyzing trace with hash 610798098, now seen corresponding path program 1 times [2018-11-10 12:35:15,822 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 12:35:15,822 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_73a470a1-fd1b-4132-9c85-c391d27a4779/bin-2019/utaipan/cvc4nyu Starting monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 12:35:15,835 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:35:15,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:35:15,967 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:35:16,011 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-10 12:35:16,011 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 12:35:16,013 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:35:16,013 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:35:16,014 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 12:35:16,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:35:16,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:35:16,014 INFO L87 Difference]: Start difference. First operand 390 states and 581 transitions. Second operand 3 states. [2018-11-10 12:35:16,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:35:16,066 INFO L93 Difference]: Finished difference Result 762 states and 1149 transitions. [2018-11-10 12:35:16,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:35:16,067 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2018-11-10 12:35:16,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:35:16,069 INFO L225 Difference]: With dead ends: 762 [2018-11-10 12:35:16,069 INFO L226 Difference]: Without dead ends: 511 [2018-11-10 12:35:16,070 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 81 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-11-10 12:35:16,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2018-11-10 12:35:16,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 511. [2018-11-10 12:35:16,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 511 states. [2018-11-10 12:35:16,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 762 transitions. [2018-11-10 12:35:16,087 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 762 transitions. Word has length 83 [2018-11-10 12:35:16,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:35:16,088 INFO L481 AbstractCegarLoop]: Abstraction has 511 states and 762 transitions. [2018-11-10 12:35:16,088 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 12:35:16,088 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 762 transitions. [2018-11-10 12:35:16,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-11-10 12:35:16,090 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:35:16,091 INFO L375 BasicCegarLoop]: trace histogram [4, 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] [2018-11-10 12:35:16,091 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:35:16,091 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:35:16,091 INFO L82 PathProgramCache]: Analyzing trace with hash -606699514, now seen corresponding path program 1 times [2018-11-10 12:35:16,092 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 12:35:16,092 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_73a470a1-fd1b-4132-9c85-c391d27a4779/bin-2019/utaipan/cvc4nyu Starting monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 12:35:16,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:35:16,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:35:16,263 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:35:16,289 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-11-10 12:35:16,289 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 12:35:16,291 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:35:16,291 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:35:16,292 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 12:35:16,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:35:16,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:35:16,292 INFO L87 Difference]: Start difference. First operand 511 states and 762 transitions. Second operand 3 states. [2018-11-10 12:35:16,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:35:16,343 INFO L93 Difference]: Finished difference Result 1008 states and 1517 transitions. [2018-11-10 12:35:16,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:35:16,343 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 108 [2018-11-10 12:35:16,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:35:16,345 INFO L225 Difference]: With dead ends: 1008 [2018-11-10 12:35:16,345 INFO L226 Difference]: Without dead ends: 636 [2018-11-10 12:35:16,346 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 106 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-11-10 12:35:16,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 636 states. [2018-11-10 12:35:16,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 636 to 636. [2018-11-10 12:35:16,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 636 states. [2018-11-10 12:35:16,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 636 states to 636 states and 947 transitions. [2018-11-10 12:35:16,358 INFO L78 Accepts]: Start accepts. Automaton has 636 states and 947 transitions. Word has length 108 [2018-11-10 12:35:16,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:35:16,358 INFO L481 AbstractCegarLoop]: Abstraction has 636 states and 947 transitions. [2018-11-10 12:35:16,358 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 12:35:16,358 INFO L276 IsEmpty]: Start isEmpty. Operand 636 states and 947 transitions. [2018-11-10 12:35:16,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-11-10 12:35:16,360 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:35:16,360 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:35:16,360 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:35:16,360 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:35:16,360 INFO L82 PathProgramCache]: Analyzing trace with hash 981316796, now seen corresponding path program 1 times [2018-11-10 12:35:16,361 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 12:35:16,361 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_73a470a1-fd1b-4132-9c85-c391d27a4779/bin-2019/utaipan/cvc4nyu Starting monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 12:35:16,383 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:35:16,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:35:16,618 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:35:16,641 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-11-10 12:35:16,641 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 12:35:16,643 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:35:16,644 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:35:16,644 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 12:35:16,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:35:16,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:35:16,645 INFO L87 Difference]: Start difference. First operand 636 states and 947 transitions. Second operand 3 states. [2018-11-10 12:35:16,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:35:16,723 INFO L93 Difference]: Finished difference Result 1256 states and 1884 transitions. [2018-11-10 12:35:16,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:35:16,724 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 125 [2018-11-10 12:35:16,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:35:16,726 INFO L225 Difference]: With dead ends: 1256 [2018-11-10 12:35:16,726 INFO L226 Difference]: Without dead ends: 759 [2018-11-10 12:35:16,727 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 123 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-11-10 12:35:16,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 759 states. [2018-11-10 12:35:16,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 759 to 759. [2018-11-10 12:35:16,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 759 states. [2018-11-10 12:35:16,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 759 states to 759 states and 1129 transitions. [2018-11-10 12:35:16,746 INFO L78 Accepts]: Start accepts. Automaton has 759 states and 1129 transitions. Word has length 125 [2018-11-10 12:35:16,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:35:16,746 INFO L481 AbstractCegarLoop]: Abstraction has 759 states and 1129 transitions. [2018-11-10 12:35:16,746 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 12:35:16,746 INFO L276 IsEmpty]: Start isEmpty. Operand 759 states and 1129 transitions. [2018-11-10 12:35:16,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-11-10 12:35:16,748 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:35:16,749 INFO L375 BasicCegarLoop]: trace histogram [5, 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] [2018-11-10 12:35:16,749 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:35:16,749 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:35:16,749 INFO L82 PathProgramCache]: Analyzing trace with hash -1793540287, now seen corresponding path program 1 times [2018-11-10 12:35:16,750 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 12:35:16,750 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_73a470a1-fd1b-4132-9c85-c391d27a4779/bin-2019/utaipan/cvc4nyu Starting monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 12:35:16,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:35:16,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:35:16,932 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:35:16,953 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2018-11-10 12:35:16,953 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 12:35:16,955 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:35:16,955 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:35:16,955 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 12:35:16,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:35:16,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:35:16,956 INFO L87 Difference]: Start difference. First operand 759 states and 1129 transitions. Second operand 3 states. [2018-11-10 12:35:17,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:35:17,011 INFO L93 Difference]: Finished difference Result 1503 states and 2250 transitions. [2018-11-10 12:35:17,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:35:17,012 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 138 [2018-11-10 12:35:17,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:35:17,015 INFO L225 Difference]: With dead ends: 1503 [2018-11-10 12:35:17,015 INFO L226 Difference]: Without dead ends: 883 [2018-11-10 12:35:17,017 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 136 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-11-10 12:35:17,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 883 states. [2018-11-10 12:35:17,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 883 to 883. [2018-11-10 12:35:17,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 883 states. [2018-11-10 12:35:17,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 883 states to 883 states and 1313 transitions. [2018-11-10 12:35:17,030 INFO L78 Accepts]: Start accepts. Automaton has 883 states and 1313 transitions. Word has length 138 [2018-11-10 12:35:17,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:35:17,030 INFO L481 AbstractCegarLoop]: Abstraction has 883 states and 1313 transitions. [2018-11-10 12:35:17,030 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 12:35:17,030 INFO L276 IsEmpty]: Start isEmpty. Operand 883 states and 1313 transitions. [2018-11-10 12:35:17,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-11-10 12:35:17,032 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:35:17,032 INFO L375 BasicCegarLoop]: trace histogram [5, 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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 12:35:17,032 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:35:17,032 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:35:17,032 INFO L82 PathProgramCache]: Analyzing trace with hash -2076637946, now seen corresponding path program 1 times [2018-11-10 12:35:17,033 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 12:35:17,033 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_73a470a1-fd1b-4132-9c85-c391d27a4779/bin-2019/utaipan/cvc4nyu Starting monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 12:35:17,054 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:35:17,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:35:17,290 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:35:17,331 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2018-11-10 12:35:17,332 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 12:35:17,334 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:35:17,334 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:35:17,334 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 12:35:17,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:35:17,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:35:17,335 INFO L87 Difference]: Start difference. First operand 883 states and 1313 transitions. Second operand 3 states. [2018-11-10 12:35:17,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:35:17,439 INFO L93 Difference]: Finished difference Result 1749 states and 2613 transitions. [2018-11-10 12:35:17,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:35:17,439 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 169 [2018-11-10 12:35:17,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:35:17,443 INFO L225 Difference]: With dead ends: 1749 [2018-11-10 12:35:17,443 INFO L226 Difference]: Without dead ends: 1005 [2018-11-10 12:35:17,444 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 167 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-11-10 12:35:17,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1005 states. [2018-11-10 12:35:17,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1005 to 1003. [2018-11-10 12:35:17,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1003 states. [2018-11-10 12:35:17,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1003 states to 1003 states and 1492 transitions. [2018-11-10 12:35:17,468 INFO L78 Accepts]: Start accepts. Automaton has 1003 states and 1492 transitions. Word has length 169 [2018-11-10 12:35:17,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:35:17,469 INFO L481 AbstractCegarLoop]: Abstraction has 1003 states and 1492 transitions. [2018-11-10 12:35:17,469 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 12:35:17,469 INFO L276 IsEmpty]: Start isEmpty. Operand 1003 states and 1492 transitions. [2018-11-10 12:35:17,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-11-10 12:35:17,472 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:35:17,472 INFO L375 BasicCegarLoop]: trace histogram [5, 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] [2018-11-10 12:35:17,472 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:35:17,472 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:35:17,473 INFO L82 PathProgramCache]: Analyzing trace with hash 850355908, now seen corresponding path program 1 times [2018-11-10 12:35:17,473 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 12:35:17,473 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_73a470a1-fd1b-4132-9c85-c391d27a4779/bin-2019/utaipan/cvc4nyu Starting monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 12:35:17,495 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:35:20,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:35:20,593 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:35:20,717 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:35:20,721 INFO L477 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 20 treesize of output 32 [2018-11-10 12:35:20,735 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 28 treesize of output 23 [2018-11-10 12:35:20,767 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:35:20,777 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:35:20,788 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:35:20,789 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 13 [2018-11-10 12:35:20,789 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 12:35:20,845 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:35:20,875 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:35:20,935 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 10 [2018-11-10 12:35:20,945 INFO L477 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-11-10 12:35:20,945 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-10 12:35:20,952 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:35:21,034 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 23 treesize of output 20 [2018-11-10 12:35:21,043 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 20 treesize of output 23 [2018-11-10 12:35:21,053 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:35:21,057 INFO L477 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 23 treesize of output 33 [2018-11-10 12:35:21,069 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:35:21,072 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:35:21,073 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:35:21,076 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 52 [2018-11-10 12:35:21,077 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-10 12:35:21,094 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:35:21,104 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:35:21,116 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:35:21,152 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:35:21,153 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 6 variables, input treesize:62, output treesize:65 [2018-11-10 12:35:21,241 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:35:21,253 INFO L477 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 72 treesize of output 76 [2018-11-10 12:35:21,259 INFO L477 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-11-10 12:35:21,260 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:35:21,274 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:35:21,303 INFO L477 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 29 treesize of output 25 [2018-11-10 12:35:21,308 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 12:35:21,309 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2018-11-10 12:35:21,309 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 12:35:21,315 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:35:21,334 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:35:21,335 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:82, output treesize:46 [2018-11-10 12:35:21,367 INFO L477 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 15 treesize of output 12 [2018-11-10 12:35:21,371 INFO L477 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 12 treesize of output 1 [2018-11-10 12:35:21,371 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:35:21,373 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:35:21,385 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:35:21,386 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:61, output treesize:46 [2018-11-10 12:35:21,396 INFO L477 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-11-10 12:35:21,400 INFO L477 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-11-10 12:35:21,400 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:35:21,403 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:35:21,420 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:35:21,420 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:59, output treesize:55 [2018-11-10 12:35:21,465 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:35:21,478 INFO L477 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 33 treesize of output 34 [2018-11-10 12:35:21,485 INFO L477 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 14 treesize of output 13 [2018-11-10 12:35:21,485 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:35:21,496 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:35:21,554 INFO L477 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 33 treesize of output 24 [2018-11-10 12:35:21,560 INFO L477 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 24 treesize of output 1 [2018-11-10 12:35:21,560 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 12:35:21,561 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:35:21,597 INFO L477 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 42 [2018-11-10 12:35:21,606 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:35:21,607 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 12:35:21,609 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:35:21,609 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 12:35:21,615 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 46 [2018-11-10 12:35:21,615 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 12:35:21,625 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 12:35:21,635 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:35:21,635 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:111, output treesize:13 [2018-11-10 12:35:21,662 INFO L477 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 23 treesize of output 18 [2018-11-10 12:35:21,666 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:35:21,668 INFO L477 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 18 treesize of output 27 [2018-11-10 12:35:21,668 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:35:21,675 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:35:21,684 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:35:21,685 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-11-10 12:35:21,690 INFO L477 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 17 treesize of output 13 [2018-11-10 12:35:21,692 INFO L477 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 13 treesize of output 5 [2018-11-10 12:35:21,692 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:35:21,694 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:35:21,695 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:35:21,696 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-10 12:35:21,815 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 0 proven. 167 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-11-10 12:35:21,815 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 12:35:21,886 INFO L477 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 34 treesize of output 25 [2018-11-10 12:35:21,890 INFO L477 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 25 treesize of output 1 [2018-11-10 12:35:21,890 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:35:21,894 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:35:21,900 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-11-10 12:35:21,900 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:65, output treesize:30 [2018-11-10 12:35:21,993 INFO L477 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 50 treesize of output 42 [2018-11-10 12:35:22,044 INFO L477 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-11-10 12:35:22,045 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:35:22,065 INFO L477 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-11-10 12:35:22,068 INFO L477 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-11-10 12:35:22,068 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 12:35:22,071 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:35:22,081 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:35:22,095 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:35:22,095 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:10 [2018-11-10 12:35:22,141 INFO L477 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 16 treesize of output 13 [2018-11-10 12:35:22,145 INFO L477 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 13 treesize of output 1 [2018-11-10 12:35:22,145 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:35:22,147 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:35:22,150 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:35:22,150 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:10 [2018-11-10 12:35:22,592 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 0 proven. 167 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-11-10 12:35:22,599 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 12:35:22,599 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_73a470a1-fd1b-4132-9c85-c391d27a4779/bin-2019/utaipan/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 12:35:22,626 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:35:23,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:35:23,015 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:35:23,068 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 5 treesize of output 1 [2018-11-10 12:35:23,069 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 12:35:23,113 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 12:35:23,116 INFO L477 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-11-10 12:35:23,117 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 12:35:23,121 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:35:23,148 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 20 [2018-11-10 12:35:23,150 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 23 [2018-11-10 12:35:23,153 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:35:23,155 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2018-11-10 12:35:23,159 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:35:23,172 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:35:23,174 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:35:23,178 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 52 [2018-11-10 12:35:23,178 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-10 12:35:23,189 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:35:23,196 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:35:23,204 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:35:23,221 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:35:23,221 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:48, output treesize:23 [2018-11-10 12:35:23,367 INFO L477 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 3 case distinctions, treesize of input 28 treesize of output 40 [2018-11-10 12:35:23,373 INFO L477 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 29 treesize of output 28 [2018-11-10 12:35:23,373 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:35:23,407 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:35:23,420 INFO L477 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 23 treesize of output 19 [2018-11-10 12:35:23,422 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 12:35:23,423 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2018-11-10 12:35:23,423 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 12:35:23,427 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:35:23,433 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:35:23,433 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:38, output treesize:12 [2018-11-10 12:35:23,467 INFO L477 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-11-10 12:35:23,469 INFO L477 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-11-10 12:35:23,469 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:35:23,470 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:35:23,476 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:35:23,476 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2018-11-10 12:35:23,512 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:35:23,517 INFO L477 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 33 treesize of output 34 [2018-11-10 12:35:23,519 INFO L477 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 14 treesize of output 13 [2018-11-10 12:35:23,520 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:35:23,526 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:35:23,537 INFO L477 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 22 treesize of output 18 [2018-11-10 12:35:23,539 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 12:35:23,540 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2018-11-10 12:35:23,540 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 12:35:23,547 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 12:35:23,561 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:35:23,562 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:44, output treesize:13 [2018-11-10 12:35:23,567 INFO L477 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 23 treesize of output 18 [2018-11-10 12:35:23,570 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:35:23,573 INFO L477 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 18 treesize of output 27 [2018-11-10 12:35:23,573 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:35:23,579 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:35:23,587 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:35:23,587 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-11-10 12:35:23,591 INFO L477 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 17 treesize of output 13 [2018-11-10 12:35:23,592 INFO L477 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 13 treesize of output 5 [2018-11-10 12:35:23,592 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:35:23,603 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:35:23,605 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:35:23,605 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-10 12:35:23,656 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 0 proven. 167 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-11-10 12:35:23,656 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 12:35:23,739 INFO L477 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 50 treesize of output 42 [2018-11-10 12:35:23,791 INFO L477 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-11-10 12:35:23,791 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:35:23,809 INFO L477 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-11-10 12:35:23,812 INFO L477 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-11-10 12:35:23,812 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 12:35:23,814 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:35:23,825 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:35:23,835 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:35:23,835 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:10 [2018-11-10 12:35:24,169 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 0 proven. 167 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-11-10 12:35:24,193 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-11-10 12:35:24,193 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9, 9] total 24 [2018-11-10 12:35:24,194 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-10 12:35:24,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-10 12:35:24,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=461, Unknown=0, NotChecked=0, Total=552 [2018-11-10 12:35:24,195 INFO L87 Difference]: Start difference. First operand 1003 states and 1492 transitions. Second operand 24 states. [2018-11-10 12:35:38,574 WARN L179 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 57 [2018-11-10 12:35:43,958 WARN L179 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 62 [2018-11-10 12:35:45,885 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2018-11-10 12:35:46,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:35:46,560 INFO L93 Difference]: Finished difference Result 3904 states and 5837 transitions. [2018-11-10 12:35:46,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 12:35:46,562 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 175 [2018-11-10 12:35:46,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:35:46,570 INFO L225 Difference]: With dead ends: 3904 [2018-11-10 12:35:46,570 INFO L226 Difference]: Without dead ends: 2915 [2018-11-10 12:35:46,572 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 703 GetRequests, 673 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=182, Invalid=630, Unknown=0, NotChecked=0, Total=812 [2018-11-10 12:35:46,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2915 states. [2018-11-10 12:35:46,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2915 to 1323. [2018-11-10 12:35:46,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1323 states. [2018-11-10 12:35:46,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1323 states to 1323 states and 2076 transitions. [2018-11-10 12:35:46,646 INFO L78 Accepts]: Start accepts. Automaton has 1323 states and 2076 transitions. Word has length 175 [2018-11-10 12:35:46,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:35:46,646 INFO L481 AbstractCegarLoop]: Abstraction has 1323 states and 2076 transitions. [2018-11-10 12:35:46,646 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-10 12:35:46,646 INFO L276 IsEmpty]: Start isEmpty. Operand 1323 states and 2076 transitions. [2018-11-10 12:35:46,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-11-10 12:35:46,649 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:35:46,649 INFO L375 BasicCegarLoop]: trace histogram [5, 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, 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-11-10 12:35:46,650 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:35:46,650 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:35:46,650 INFO L82 PathProgramCache]: Analyzing trace with hash 584222017, now seen corresponding path program 1 times [2018-11-10 12:35:46,651 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 12:35:46,651 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_73a470a1-fd1b-4132-9c85-c391d27a4779/bin-2019/utaipan/cvc4nyu Starting monitored process 11 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 12:35:46,671 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:35:48,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:35:49,197 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:35:49,250 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:35:49,250 INFO L477 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 20 treesize of output 32 [2018-11-10 12:35:49,257 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 28 treesize of output 23 [2018-11-10 12:35:49,273 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:35:49,277 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:35:49,279 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:35:49,279 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-10 12:35:49,280 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 12:35:49,305 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:35:49,337 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:35:49,393 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 10 [2018-11-10 12:35:49,400 INFO L477 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-11-10 12:35:49,401 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-10 12:35:49,409 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:35:49,457 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 23 treesize of output 20 [2018-11-10 12:35:49,463 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 20 treesize of output 23 [2018-11-10 12:35:49,468 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:35:49,470 INFO L477 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 23 treesize of output 33 [2018-11-10 12:35:49,475 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:35:49,477 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:35:49,478 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:35:49,481 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 52 [2018-11-10 12:35:49,481 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-10 12:35:49,496 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:35:49,508 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:35:49,520 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:35:49,554 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:35:49,555 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 6 variables, input treesize:62, output treesize:65 [2018-11-10 12:35:49,654 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:35:49,669 INFO L477 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 72 treesize of output 76 [2018-11-10 12:35:49,675 INFO L477 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-11-10 12:35:49,675 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:35:49,695 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:35:49,739 INFO L477 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 29 treesize of output 25 [2018-11-10 12:35:49,747 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 12:35:49,749 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2018-11-10 12:35:49,749 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 12:35:49,759 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:35:49,789 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:35:49,789 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:82, output treesize:46 [2018-11-10 12:35:49,829 INFO L477 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 15 treesize of output 12 [2018-11-10 12:35:49,833 INFO L477 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 12 treesize of output 1 [2018-11-10 12:35:49,834 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:35:49,835 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:35:49,846 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:35:49,846 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:61, output treesize:46 [2018-11-10 12:35:49,854 INFO L477 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-11-10 12:35:49,858 INFO L477 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-11-10 12:35:49,858 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:35:49,862 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:35:49,878 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:35:49,878 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:59, output treesize:55 [2018-11-10 12:35:49,914 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:35:49,925 INFO L477 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 33 treesize of output 34 [2018-11-10 12:35:49,937 INFO L477 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 14 treesize of output 13 [2018-11-10 12:35:49,938 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:35:49,950 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:35:50,000 INFO L477 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 33 treesize of output 24 [2018-11-10 12:35:50,004 INFO L477 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 24 treesize of output 1 [2018-11-10 12:35:50,005 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 12:35:50,006 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:35:50,031 INFO L477 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 42 [2018-11-10 12:35:50,034 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 12:35:50,035 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:35:50,036 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:35:50,036 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 12:35:50,041 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 46 [2018-11-10 12:35:50,042 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 12:35:50,049 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 12:35:50,058 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:35:50,058 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:111, output treesize:13 [2018-11-10 12:35:50,076 INFO L477 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 23 treesize of output 18 [2018-11-10 12:35:50,079 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:35:50,080 INFO L477 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 18 treesize of output 27 [2018-11-10 12:35:50,080 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:35:50,085 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:35:50,092 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:35:50,092 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-11-10 12:35:50,095 INFO L477 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 17 treesize of output 13 [2018-11-10 12:35:50,096 INFO L477 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 13 treesize of output 5 [2018-11-10 12:35:50,096 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:35:50,097 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:35:50,098 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:35:50,098 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-10 12:35:50,243 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-11-10 12:35:50,244 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 12:35:50,311 INFO L477 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 34 treesize of output 25 [2018-11-10 12:35:50,314 INFO L477 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 25 treesize of output 1 [2018-11-10 12:35:50,314 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:35:50,316 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:35:50,319 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-11-10 12:35:50,320 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:65, output treesize:30 [2018-11-10 12:35:50,372 INFO L477 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 50 treesize of output 42 [2018-11-10 12:35:50,408 INFO L477 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-11-10 12:35:50,408 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:35:50,422 INFO L477 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-11-10 12:35:50,425 INFO L477 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-11-10 12:35:50,425 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 12:35:50,428 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:35:50,443 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:35:50,458 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:35:50,458 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:10 [2018-11-10 12:35:50,495 INFO L477 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 16 treesize of output 13 [2018-11-10 12:35:50,499 INFO L477 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 13 treesize of output 1 [2018-11-10 12:35:50,499 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:35:50,502 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:35:50,505 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:35:50,505 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:10 [2018-11-10 12:35:50,750 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-11-10 12:35:50,755 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 12:35:50,755 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_73a470a1-fd1b-4132-9c85-c391d27a4779/bin-2019/utaipan/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 12:35:50,760 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:35:50,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:35:50,967 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:35:50,972 INFO L477 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-11-10 12:35:50,974 INFO L477 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-11-10 12:35:50,974 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:35:50,976 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:35:50,978 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:35:50,978 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-10 12:35:51,033 INFO L477 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 3 case distinctions, treesize of input 21 treesize of output 33 [2018-11-10 12:35:51,036 INFO L477 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-11-10 12:35:51,036 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:35:51,064 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:35:51,094 INFO L477 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 2 case distinctions, treesize of input 19 treesize of output 26 [2018-11-10 12:35:51,094 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-10 12:35:51,114 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 12:35:51,133 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 2 xjuncts. [2018-11-10 12:35:51,133 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:21, output treesize:27 [2018-11-10 12:35:51,210 INFO L477 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 3 case distinctions, treesize of input 30 treesize of output 40 [2018-11-10 12:35:53,231 WARN L686 Elim1Store]: solver failed to check if following not equals relation is implied: (= (bvadd ssl3_accept_~s.offset (_ bv52 32)) |ssl3_accept_write~intINTTYPE4_#ptr.offset|) [2018-11-10 12:35:53,233 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:35:53,237 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:35:53,239 INFO L303 Elim1Store]: Index analysis took 2028 ms [2018-11-10 12:35:53,321 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 59 [2018-11-10 12:35:53,322 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-10 12:35:53,417 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:35:53,420 INFO L477 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 25 treesize of output 34 [2018-11-10 12:35:53,420 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 12:35:53,459 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 12:35:53,510 INFO L477 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 23 treesize of output 18 [2018-11-10 12:35:53,513 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:35:53,515 INFO L477 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 18 treesize of output 27 [2018-11-10 12:35:53,515 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-10 12:35:53,523 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:35:53,558 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-10 12:35:53,559 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:54, output treesize:36 [2018-11-10 12:35:53,689 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-10 12:35:53,690 INFO L477 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 15 treesize of output 3 [2018-11-10 12:35:53,690 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:35:53,692 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:35:53,693 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:35:53,693 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-10 12:35:53,728 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 102 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2018-11-10 12:35:53,728 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 12:35:53,747 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-11-10 12:35:53,747 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [9, 9] total 22 [2018-11-10 12:35:53,748 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-10 12:35:53,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-10 12:35:53,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=388, Unknown=0, NotChecked=0, Total=462 [2018-11-10 12:35:53,748 INFO L87 Difference]: Start difference. First operand 1323 states and 2076 transitions. Second operand 22 states. [2018-11-10 12:36:10,156 WARN L179 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 57 [2018-11-10 12:36:15,241 WARN L179 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 61 [2018-11-10 12:36:15,433 WARN L179 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 62 [2018-11-10 12:36:16,346 WARN L179 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 54 [2018-11-10 12:36:17,052 WARN L179 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 59 [2018-11-10 12:36:19,623 WARN L179 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 63 [2018-11-10 12:36:21,005 WARN L179 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 65 [2018-11-10 12:36:23,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:36:23,434 INFO L93 Difference]: Finished difference Result 4878 states and 7422 transitions. [2018-11-10 12:36:23,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-10 12:36:23,436 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 176 [2018-11-10 12:36:23,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:36:23,445 INFO L225 Difference]: With dead ends: 4878 [2018-11-10 12:36:23,445 INFO L226 Difference]: Without dead ends: 3569 [2018-11-10 12:36:23,448 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 539 GetRequests, 509 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=209, Invalid=721, Unknown=0, NotChecked=0, Total=930 [2018-11-10 12:36:23,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3569 states. [2018-11-10 12:36:23,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3569 to 1915. [2018-11-10 12:36:23,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1915 states. [2018-11-10 12:36:23,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1915 states to 1915 states and 3140 transitions. [2018-11-10 12:36:23,558 INFO L78 Accepts]: Start accepts. Automaton has 1915 states and 3140 transitions. Word has length 176 [2018-11-10 12:36:23,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:36:23,558 INFO L481 AbstractCegarLoop]: Abstraction has 1915 states and 3140 transitions. [2018-11-10 12:36:23,558 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-10 12:36:23,559 INFO L276 IsEmpty]: Start isEmpty. Operand 1915 states and 3140 transitions. [2018-11-10 12:36:23,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-11-10 12:36:23,562 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:36:23,562 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:36:23,563 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:36:23,563 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:36:23,563 INFO L82 PathProgramCache]: Analyzing trace with hash -10605328, now seen corresponding path program 1 times [2018-11-10 12:36:23,564 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 12:36:23,564 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_73a470a1-fd1b-4132-9c85-c391d27a4779/bin-2019/utaipan/cvc4nyu Starting monitored process 13 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 12:36:23,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:36:24,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:36:25,348 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:36:25,369 INFO L477 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 11 treesize of output 8 [2018-11-10 12:36:25,377 INFO L477 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 8 treesize of output 7 [2018-11-10 12:36:25,377 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:36:25,383 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:36:25,399 INFO L477 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 11 treesize of output 8 [2018-11-10 12:36:25,401 INFO L477 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 8 treesize of output 7 [2018-11-10 12:36:25,401 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 12:36:25,404 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:36:25,411 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:36:25,411 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:23, output treesize:1 [2018-11-10 12:36:25,418 INFO L477 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 31 treesize of output 22 [2018-11-10 12:36:25,420 INFO L477 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-11-10 12:36:25,420 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:36:25,425 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:36:25,428 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:36:25,429 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:21 [2018-11-10 12:36:25,441 INFO L477 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 43 treesize of output 27 [2018-11-10 12:36:25,443 INFO L477 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 27 treesize of output 3 [2018-11-10 12:36:25,444 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:36:25,445 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:36:25,448 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:36:25,448 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:43, output treesize:3 [2018-11-10 12:36:25,464 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2018-11-10 12:36:25,465 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 12:36:25,471 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:36:25,471 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 12:36:25,471 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 12:36:25,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 12:36:25,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 12:36:25,472 INFO L87 Difference]: Start difference. First operand 1915 states and 3140 transitions. Second operand 4 states. [2018-11-10 12:36:27,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:36:27,921 INFO L93 Difference]: Finished difference Result 3911 states and 6415 transitions. [2018-11-10 12:36:27,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 12:36:27,922 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 182 [2018-11-10 12:36:27,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:36:27,927 INFO L225 Difference]: With dead ends: 3911 [2018-11-10 12:36:27,927 INFO L226 Difference]: Without dead ends: 2010 [2018-11-10 12:36:27,930 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 179 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-11-10 12:36:27,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2010 states. [2018-11-10 12:36:28,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2010 to 1931. [2018-11-10 12:36:28,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1931 states. [2018-11-10 12:36:28,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1931 states to 1931 states and 3156 transitions. [2018-11-10 12:36:28,021 INFO L78 Accepts]: Start accepts. Automaton has 1931 states and 3156 transitions. Word has length 182 [2018-11-10 12:36:28,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:36:28,021 INFO L481 AbstractCegarLoop]: Abstraction has 1931 states and 3156 transitions. [2018-11-10 12:36:28,021 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 12:36:28,021 INFO L276 IsEmpty]: Start isEmpty. Operand 1931 states and 3156 transitions. [2018-11-10 12:36:28,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-11-10 12:36:28,024 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:36:28,025 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:36:28,025 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:36:28,025 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:36:28,025 INFO L82 PathProgramCache]: Analyzing trace with hash -1335461522, now seen corresponding path program 1 times [2018-11-10 12:36:28,026 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 12:36:28,026 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_73a470a1-fd1b-4132-9c85-c391d27a4779/bin-2019/utaipan/cvc4nyu Starting monitored process 14 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 12:36:28,062 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:36:29,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:36:29,879 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:36:29,941 INFO L477 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-11-10 12:36:29,942 INFO L477 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-11-10 12:36:29,943 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:36:29,945 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:36:29,950 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:36:29,950 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-10 12:36:29,964 INFO L477 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 23 treesize of output 18 [2018-11-10 12:36:29,966 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:36:29,968 INFO L477 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 18 treesize of output 27 [2018-11-10 12:36:29,968 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:36:29,973 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:36:29,981 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:36:29,981 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-11-10 12:36:29,984 INFO L477 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 17 treesize of output 13 [2018-11-10 12:36:29,986 INFO L477 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 13 treesize of output 5 [2018-11-10 12:36:29,986 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:36:29,987 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:36:29,988 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:36:29,988 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-10 12:36:30,007 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 180 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2018-11-10 12:36:30,007 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 12:36:30,013 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:36:30,013 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 12:36:30,013 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 12:36:30,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 12:36:30,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-10 12:36:30,013 INFO L87 Difference]: Start difference. First operand 1931 states and 3156 transitions. Second operand 7 states. [2018-11-10 12:36:33,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:36:33,097 INFO L93 Difference]: Finished difference Result 4675 states and 7520 transitions. [2018-11-10 12:36:33,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 12:36:33,098 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 182 [2018-11-10 12:36:33,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:36:33,102 INFO L225 Difference]: With dead ends: 4675 [2018-11-10 12:36:33,102 INFO L226 Difference]: Without dead ends: 2758 [2018-11-10 12:36:33,105 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-11-10 12:36:33,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2758 states. [2018-11-10 12:36:33,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2758 to 2145. [2018-11-10 12:36:33,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2145 states. [2018-11-10 12:36:33,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2145 states to 2145 states and 3514 transitions. [2018-11-10 12:36:33,204 INFO L78 Accepts]: Start accepts. Automaton has 2145 states and 3514 transitions. Word has length 182 [2018-11-10 12:36:33,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:36:33,204 INFO L481 AbstractCegarLoop]: Abstraction has 2145 states and 3514 transitions. [2018-11-10 12:36:33,205 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 12:36:33,205 INFO L276 IsEmpty]: Start isEmpty. Operand 2145 states and 3514 transitions. [2018-11-10 12:36:33,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-11-10 12:36:33,208 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:36:33,208 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:36:33,209 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:36:33,209 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:36:33,209 INFO L82 PathProgramCache]: Analyzing trace with hash -971995024, now seen corresponding path program 1 times [2018-11-10 12:36:33,210 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 12:36:33,210 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_73a470a1-fd1b-4132-9c85-c391d27a4779/bin-2019/utaipan/cvc4nyu Starting monitored process 15 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 12:36:33,235 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:36:34,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:36:35,032 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:36:35,045 INFO L477 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 18 treesize of output 15 [2018-11-10 12:36:35,046 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-10 12:36:35,049 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:36:35,052 INFO L477 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 18 treesize of output 27 [2018-11-10 12:36:35,053 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 12:36:35,058 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:36:35,062 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:36:35,069 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:36:35,069 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-11-10 12:36:35,107 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 168 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2018-11-10 12:36:35,108 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 12:36:35,112 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:36:35,113 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 12:36:35,113 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 12:36:35,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 12:36:35,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-10 12:36:35,113 INFO L87 Difference]: Start difference. First operand 2145 states and 3514 transitions. Second operand 7 states. [2018-11-10 12:36:38,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:36:38,198 INFO L93 Difference]: Finished difference Result 4792 states and 7801 transitions. [2018-11-10 12:36:38,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 12:36:38,199 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 182 [2018-11-10 12:36:38,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:36:38,203 INFO L225 Difference]: With dead ends: 4792 [2018-11-10 12:36:38,203 INFO L226 Difference]: Without dead ends: 2661 [2018-11-10 12:36:38,205 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-11-10 12:36:38,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2661 states. [2018-11-10 12:36:38,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2661 to 2377. [2018-11-10 12:36:38,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2377 states. [2018-11-10 12:36:38,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2377 states to 2377 states and 3922 transitions. [2018-11-10 12:36:38,291 INFO L78 Accepts]: Start accepts. Automaton has 2377 states and 3922 transitions. Word has length 182 [2018-11-10 12:36:38,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:36:38,292 INFO L481 AbstractCegarLoop]: Abstraction has 2377 states and 3922 transitions. [2018-11-10 12:36:38,292 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 12:36:38,292 INFO L276 IsEmpty]: Start isEmpty. Operand 2377 states and 3922 transitions. [2018-11-10 12:36:38,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2018-11-10 12:36:38,294 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:36:38,294 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:36:38,294 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:36:38,294 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:36:38,294 INFO L82 PathProgramCache]: Analyzing trace with hash 229883865, now seen corresponding path program 1 times [2018-11-10 12:36:38,295 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 12:36:38,295 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_73a470a1-fd1b-4132-9c85-c391d27a4779/bin-2019/utaipan/cvc4nyu Starting monitored process 16 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 12:36:38,315 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:36:39,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:36:39,362 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:36:39,369 INFO L477 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-11-10 12:36:39,371 INFO L477 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-11-10 12:36:39,371 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:36:39,373 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:36:39,376 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:36:39,376 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-10 12:36:39,385 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-10 12:36:39,387 INFO L477 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 15 treesize of output 3 [2018-11-10 12:36:39,387 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:36:39,388 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:36:39,389 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:36:39,389 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-10 12:36:39,403 INFO L134 CoverageAnalysis]: Checked inductivity of 299 backedges. 170 proven. 0 refuted. 0 times theorem prover too weak. 129 trivial. 0 not checked. [2018-11-10 12:36:39,403 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 12:36:39,407 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:36:39,407 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 12:36:39,407 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 12:36:39,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 12:36:39,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 12:36:39,408 INFO L87 Difference]: Start difference. First operand 2377 states and 3922 transitions. Second operand 4 states. [2018-11-10 12:36:41,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:36:41,900 INFO L93 Difference]: Finished difference Result 4980 states and 8179 transitions. [2018-11-10 12:36:41,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 12:36:41,901 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 197 [2018-11-10 12:36:41,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:36:41,905 INFO L225 Difference]: With dead ends: 4980 [2018-11-10 12:36:41,905 INFO L226 Difference]: Without dead ends: 2617 [2018-11-10 12:36:41,908 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 194 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-11-10 12:36:41,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2617 states. [2018-11-10 12:36:41,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2617 to 2513. [2018-11-10 12:36:41,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2513 states. [2018-11-10 12:36:41,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2513 states to 2513 states and 4138 transitions. [2018-11-10 12:36:41,978 INFO L78 Accepts]: Start accepts. Automaton has 2513 states and 4138 transitions. Word has length 197 [2018-11-10 12:36:41,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:36:41,978 INFO L481 AbstractCegarLoop]: Abstraction has 2513 states and 4138 transitions. [2018-11-10 12:36:41,978 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 12:36:41,978 INFO L276 IsEmpty]: Start isEmpty. Operand 2513 states and 4138 transitions. [2018-11-10 12:36:41,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2018-11-10 12:36:41,981 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:36:41,981 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:36:41,981 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:36:41,981 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:36:41,981 INFO L82 PathProgramCache]: Analyzing trace with hash 774740237, now seen corresponding path program 1 times [2018-11-10 12:36:41,982 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 12:36:41,982 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_73a470a1-fd1b-4132-9c85-c391d27a4779/bin-2019/utaipan/cvc4nyu Starting monitored process 17 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 12:36:41,994 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:36:42,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:36:42,901 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:36:42,907 INFO L477 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-11-10 12:36:42,909 INFO L477 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-11-10 12:36:42,909 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:36:42,912 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:36:42,914 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:36:42,914 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-10 12:36:42,921 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-10 12:36:42,922 INFO L477 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 15 treesize of output 3 [2018-11-10 12:36:42,922 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:36:42,923 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:36:42,924 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:36:42,925 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-10 12:36:42,943 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 196 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2018-11-10 12:36:42,943 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 12:36:42,949 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:36:42,949 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 12:36:42,949 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 12:36:42,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 12:36:42,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 12:36:42,950 INFO L87 Difference]: Start difference. First operand 2513 states and 4138 transitions. Second operand 4 states. [2018-11-10 12:36:45,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:36:45,732 INFO L93 Difference]: Finished difference Result 5825 states and 9470 transitions. [2018-11-10 12:36:45,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 12:36:45,733 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 197 [2018-11-10 12:36:45,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:36:45,738 INFO L225 Difference]: With dead ends: 5825 [2018-11-10 12:36:45,738 INFO L226 Difference]: Without dead ends: 3326 [2018-11-10 12:36:45,741 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 194 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-11-10 12:36:45,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3326 states. [2018-11-10 12:36:45,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3326 to 2849. [2018-11-10 12:36:45,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2849 states. [2018-11-10 12:36:45,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2849 states to 2849 states and 4738 transitions. [2018-11-10 12:36:45,839 INFO L78 Accepts]: Start accepts. Automaton has 2849 states and 4738 transitions. Word has length 197 [2018-11-10 12:36:45,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:36:45,839 INFO L481 AbstractCegarLoop]: Abstraction has 2849 states and 4738 transitions. [2018-11-10 12:36:45,839 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 12:36:45,839 INFO L276 IsEmpty]: Start isEmpty. Operand 2849 states and 4738 transitions. [2018-11-10 12:36:45,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-11-10 12:36:45,841 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:36:45,841 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:36:45,841 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:36:45,841 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:36:45,841 INFO L82 PathProgramCache]: Analyzing trace with hash -1456482063, now seen corresponding path program 1 times [2018-11-10 12:36:45,842 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 12:36:45,842 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_73a470a1-fd1b-4132-9c85-c391d27a4779/bin-2019/utaipan/cvc4nyu Starting monitored process 18 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 12:36:45,855 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:36:47,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:36:48,193 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:36:48,221 INFO L477 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 11 treesize of output 8 [2018-11-10 12:36:48,222 INFO L477 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 8 treesize of output 7 [2018-11-10 12:36:48,222 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:36:48,231 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:36:48,237 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:36:48,237 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2018-11-10 12:36:48,276 INFO L477 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 23 treesize of output 18 [2018-11-10 12:36:48,279 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:36:48,281 INFO L477 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 18 treesize of output 27 [2018-11-10 12:36:48,281 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:36:48,288 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:36:48,296 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:36:48,296 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-11-10 12:36:48,300 INFO L477 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 23 treesize of output 18 [2018-11-10 12:36:48,304 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:36:48,306 INFO L477 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 18 treesize of output 27 [2018-11-10 12:36:48,306 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:36:48,311 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:36:48,320 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:36:48,320 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-11-10 12:36:48,325 INFO L477 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 23 treesize of output 18 [2018-11-10 12:36:48,328 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:36:48,330 INFO L477 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 18 treesize of output 27 [2018-11-10 12:36:48,330 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:36:48,336 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:36:48,344 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:36:48,344 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-11-10 12:36:48,346 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-11-10 12:36:48,351 INFO L477 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 3 [2018-11-10 12:36:48,351 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:36:48,352 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:36:48,353 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:36:48,354 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:20, output treesize:3 [2018-11-10 12:36:48,375 INFO L134 CoverageAnalysis]: Checked inductivity of 299 backedges. 162 proven. 0 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2018-11-10 12:36:48,375 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 12:36:48,380 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:36:48,381 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-10 12:36:48,381 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-10 12:36:48,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 12:36:48,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-11-10 12:36:48,382 INFO L87 Difference]: Start difference. First operand 2849 states and 4738 transitions. Second operand 8 states. [2018-11-10 12:36:53,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:36:53,292 INFO L93 Difference]: Finished difference Result 5756 states and 9555 transitions. [2018-11-10 12:36:53,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 12:36:53,293 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 198 [2018-11-10 12:36:53,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:36:53,297 INFO L225 Difference]: With dead ends: 5756 [2018-11-10 12:36:53,297 INFO L226 Difference]: Without dead ends: 2921 [2018-11-10 12:36:53,299 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2018-11-10 12:36:53,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2921 states. [2018-11-10 12:36:53,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2921 to 2921. [2018-11-10 12:36:53,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2921 states. [2018-11-10 12:36:53,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2921 states to 2921 states and 4826 transitions. [2018-11-10 12:36:53,379 INFO L78 Accepts]: Start accepts. Automaton has 2921 states and 4826 transitions. Word has length 198 [2018-11-10 12:36:53,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:36:53,379 INFO L481 AbstractCegarLoop]: Abstraction has 2921 states and 4826 transitions. [2018-11-10 12:36:53,379 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-10 12:36:53,379 INFO L276 IsEmpty]: Start isEmpty. Operand 2921 states and 4826 transitions. [2018-11-10 12:36:53,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-11-10 12:36:53,381 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:36:53,381 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:36:53,381 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:36:53,381 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:36:53,381 INFO L82 PathProgramCache]: Analyzing trace with hash 292660869, now seen corresponding path program 1 times [2018-11-10 12:36:53,382 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 12:36:53,382 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_73a470a1-fd1b-4132-9c85-c391d27a4779/bin-2019/utaipan/cvc4nyu Starting monitored process 19 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 12:36:53,394 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:36:55,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:36:55,859 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:36:55,874 INFO L477 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 18 treesize of output 15 [2018-11-10 12:36:55,875 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-10 12:36:55,878 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:36:55,880 INFO L477 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 18 treesize of output 27 [2018-11-10 12:36:55,881 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 12:36:55,886 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:36:55,890 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:36:55,900 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:36:55,900 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-11-10 12:36:55,911 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-10 12:36:55,912 INFO L477 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 15 treesize of output 3 [2018-11-10 12:36:55,912 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:36:55,913 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:36:55,916 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:36:55,916 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-11-10 12:36:55,937 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 189 proven. 0 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2018-11-10 12:36:55,937 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 12:36:55,943 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:36:55,943 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 12:36:55,943 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 12:36:55,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 12:36:55,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-10 12:36:55,943 INFO L87 Difference]: Start difference. First operand 2921 states and 4826 transitions. Second operand 7 states. [2018-11-10 12:36:58,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:36:58,943 INFO L93 Difference]: Finished difference Result 6184 states and 10097 transitions. [2018-11-10 12:36:58,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 12:36:58,943 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 198 [2018-11-10 12:36:58,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:36:58,947 INFO L225 Difference]: With dead ends: 6184 [2018-11-10 12:36:58,947 INFO L226 Difference]: Without dead ends: 3277 [2018-11-10 12:36:58,949 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-11-10 12:36:58,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3277 states. [2018-11-10 12:36:59,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3277 to 2921. [2018-11-10 12:36:59,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2921 states. [2018-11-10 12:36:59,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2921 states to 2921 states and 4818 transitions. [2018-11-10 12:36:59,035 INFO L78 Accepts]: Start accepts. Automaton has 2921 states and 4818 transitions. Word has length 198 [2018-11-10 12:36:59,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:36:59,036 INFO L481 AbstractCegarLoop]: Abstraction has 2921 states and 4818 transitions. [2018-11-10 12:36:59,036 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 12:36:59,036 INFO L276 IsEmpty]: Start isEmpty. Operand 2921 states and 4818 transitions. [2018-11-10 12:36:59,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-11-10 12:36:59,038 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:36:59,038 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:36:59,038 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:36:59,039 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:36:59,039 INFO L82 PathProgramCache]: Analyzing trace with hash 398378106, now seen corresponding path program 1 times [2018-11-10 12:36:59,039 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 12:36:59,040 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_73a470a1-fd1b-4132-9c85-c391d27a4779/bin-2019/utaipan/cvc4nyu Starting monitored process 20 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 12:36:59,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:36:59,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:37:00,002 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:37:00,012 INFO L477 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-11-10 12:37:00,014 INFO L477 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-11-10 12:37:00,014 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:37:00,016 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:37:00,018 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:37:00,018 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-10 12:37:00,024 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-10 12:37:00,026 INFO L477 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 15 treesize of output 3 [2018-11-10 12:37:00,026 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:37:00,027 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:37:00,028 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:37:00,028 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-10 12:37:00,046 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 196 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2018-11-10 12:37:00,047 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 12:37:00,051 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:37:00,051 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 12:37:00,051 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 12:37:00,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 12:37:00,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 12:37:00,052 INFO L87 Difference]: Start difference. First operand 2921 states and 4818 transitions. Second operand 4 states. [2018-11-10 12:37:02,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:37:02,811 INFO L93 Difference]: Finished difference Result 6335 states and 10265 transitions. [2018-11-10 12:37:02,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 12:37:02,812 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 198 [2018-11-10 12:37:02,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:37:02,816 INFO L225 Difference]: With dead ends: 6335 [2018-11-10 12:37:02,816 INFO L226 Difference]: Without dead ends: 3428 [2018-11-10 12:37:02,820 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 195 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-11-10 12:37:02,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3428 states. [2018-11-10 12:37:02,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3428 to 2929. [2018-11-10 12:37:02,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2929 states. [2018-11-10 12:37:02,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2929 states to 2929 states and 4826 transitions. [2018-11-10 12:37:02,965 INFO L78 Accepts]: Start accepts. Automaton has 2929 states and 4826 transitions. Word has length 198 [2018-11-10 12:37:02,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:37:02,965 INFO L481 AbstractCegarLoop]: Abstraction has 2929 states and 4826 transitions. [2018-11-10 12:37:02,965 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 12:37:02,965 INFO L276 IsEmpty]: Start isEmpty. Operand 2929 states and 4826 transitions. [2018-11-10 12:37:02,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-11-10 12:37:02,967 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:37:02,968 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:37:02,968 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:37:02,968 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:37:02,968 INFO L82 PathProgramCache]: Analyzing trace with hash 1044005489, now seen corresponding path program 1 times [2018-11-10 12:37:02,968 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 12:37:02,968 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_73a470a1-fd1b-4132-9c85-c391d27a4779/bin-2019/utaipan/cvc4nyu Starting monitored process 21 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 12:37:03,015 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:37:04,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:37:05,399 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:37:05,432 INFO L477 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 18 treesize of output 15 [2018-11-10 12:37:05,434 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-10 12:37:05,437 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:37:05,439 INFO L477 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 18 treesize of output 27 [2018-11-10 12:37:05,439 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 12:37:05,446 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:37:05,451 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:37:05,459 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:37:05,459 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-11-10 12:37:05,475 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-10 12:37:05,477 INFO L477 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 15 treesize of output 3 [2018-11-10 12:37:05,477 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:37:05,478 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:37:05,481 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:37:05,481 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-11-10 12:37:05,516 INFO L134 CoverageAnalysis]: Checked inductivity of 311 backedges. 195 proven. 0 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2018-11-10 12:37:05,517 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 12:37:05,524 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:37:05,525 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 12:37:05,525 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 12:37:05,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 12:37:05,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-10 12:37:05,525 INFO L87 Difference]: Start difference. First operand 2929 states and 4826 transitions. Second operand 7 states. [2018-11-10 12:37:08,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:37:08,552 INFO L93 Difference]: Finished difference Result 6200 states and 10097 transitions. [2018-11-10 12:37:08,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 12:37:08,552 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 199 [2018-11-10 12:37:08,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:37:08,557 INFO L225 Difference]: With dead ends: 6200 [2018-11-10 12:37:08,557 INFO L226 Difference]: Without dead ends: 3285 [2018-11-10 12:37:08,561 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 193 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-11-10 12:37:08,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3285 states. [2018-11-10 12:37:08,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3285 to 2929. [2018-11-10 12:37:08,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2929 states. [2018-11-10 12:37:08,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2929 states to 2929 states and 4818 transitions. [2018-11-10 12:37:08,685 INFO L78 Accepts]: Start accepts. Automaton has 2929 states and 4818 transitions. Word has length 199 [2018-11-10 12:37:08,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:37:08,685 INFO L481 AbstractCegarLoop]: Abstraction has 2929 states and 4818 transitions. [2018-11-10 12:37:08,685 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 12:37:08,685 INFO L276 IsEmpty]: Start isEmpty. Operand 2929 states and 4818 transitions. [2018-11-10 12:37:08,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2018-11-10 12:37:08,687 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:37:08,688 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:37:08,688 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:37:08,688 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:37:08,688 INFO L82 PathProgramCache]: Analyzing trace with hash -1740393527, now seen corresponding path program 1 times [2018-11-10 12:37:08,689 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 12:37:08,689 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_73a470a1-fd1b-4132-9c85-c391d27a4779/bin-2019/utaipan/cvc4nyu Starting monitored process 22 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 12:37:08,706 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:37:10,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:37:10,859 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:37:10,875 INFO L477 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 18 treesize of output 15 [2018-11-10 12:37:10,877 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-10 12:37:10,880 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:37:10,881 INFO L477 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 18 treesize of output 27 [2018-11-10 12:37:10,882 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 12:37:10,887 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:37:10,891 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:37:10,898 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:37:10,898 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-11-10 12:37:10,909 INFO L477 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 17 treesize of output 13 [2018-11-10 12:37:10,910 INFO L477 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 13 treesize of output 5 [2018-11-10 12:37:10,911 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:37:10,912 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:37:10,913 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:37:10,913 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-10 12:37:10,937 INFO L134 CoverageAnalysis]: Checked inductivity of 350 backedges. 230 proven. 4 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2018-11-10 12:37:10,937 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 12:37:10,957 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-10 12:37:10,957 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 12:37:10,957 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:37:10,957 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2018-11-10 12:37:10,994 INFO L134 CoverageAnalysis]: Checked inductivity of 350 backedges. 234 proven. 0 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2018-11-10 12:37:11,000 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 12:37:11,000 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2018-11-10 12:37:11,000 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 12:37:11,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 12:37:11,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-10 12:37:11,001 INFO L87 Difference]: Start difference. First operand 2929 states and 4818 transitions. Second operand 9 states. [2018-11-10 12:37:14,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:37:14,708 INFO L93 Difference]: Finished difference Result 6880 states and 11005 transitions. [2018-11-10 12:37:14,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 12:37:14,709 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 200 [2018-11-10 12:37:14,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:37:14,714 INFO L225 Difference]: With dead ends: 6880 [2018-11-10 12:37:14,714 INFO L226 Difference]: Without dead ends: 4329 [2018-11-10 12:37:14,718 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 407 GetRequests, 395 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2018-11-10 12:37:14,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4329 states. [2018-11-10 12:37:14,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4329 to 3089. [2018-11-10 12:37:14,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3089 states. [2018-11-10 12:37:14,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3089 states to 3089 states and 5042 transitions. [2018-11-10 12:37:14,866 INFO L78 Accepts]: Start accepts. Automaton has 3089 states and 5042 transitions. Word has length 200 [2018-11-10 12:37:14,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:37:14,867 INFO L481 AbstractCegarLoop]: Abstraction has 3089 states and 5042 transitions. [2018-11-10 12:37:14,867 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 12:37:14,867 INFO L276 IsEmpty]: Start isEmpty. Operand 3089 states and 5042 transitions. [2018-11-10 12:37:14,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2018-11-10 12:37:14,869 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:37:14,869 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:37:14,869 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:37:14,869 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:37:14,869 INFO L82 PathProgramCache]: Analyzing trace with hash 1109608330, now seen corresponding path program 1 times [2018-11-10 12:37:14,870 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 12:37:14,870 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_73a470a1-fd1b-4132-9c85-c391d27a4779/bin-2019/utaipan/cvc4nyu Starting monitored process 23 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 12:37:14,883 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:37:16,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:37:17,281 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:37:17,306 INFO L477 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 18 treesize of output 15 [2018-11-10 12:37:17,308 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-10 12:37:17,311 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:37:17,312 INFO L477 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 18 treesize of output 27 [2018-11-10 12:37:17,312 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 12:37:17,317 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:37:17,322 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:37:17,330 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:37:17,330 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-11-10 12:37:17,343 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-10 12:37:17,344 INFO L477 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 15 treesize of output 3 [2018-11-10 12:37:17,345 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:37:17,346 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:37:17,349 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:37:17,349 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-11-10 12:37:17,373 INFO L134 CoverageAnalysis]: Checked inductivity of 317 backedges. 201 proven. 0 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2018-11-10 12:37:17,373 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 12:37:17,380 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:37:17,380 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 12:37:17,380 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 12:37:17,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 12:37:17,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-10 12:37:17,381 INFO L87 Difference]: Start difference. First operand 3089 states and 5042 transitions. Second operand 7 states. [2018-11-10 12:37:20,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:37:20,425 INFO L93 Difference]: Finished difference Result 6520 states and 10529 transitions. [2018-11-10 12:37:20,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 12:37:20,426 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 200 [2018-11-10 12:37:20,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:37:20,428 INFO L225 Difference]: With dead ends: 6520 [2018-11-10 12:37:20,428 INFO L226 Difference]: Without dead ends: 3445 [2018-11-10 12:37:20,431 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-11-10 12:37:20,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3445 states. [2018-11-10 12:37:20,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3445 to 3089. [2018-11-10 12:37:20,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3089 states. [2018-11-10 12:37:20,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3089 states to 3089 states and 5034 transitions. [2018-11-10 12:37:20,530 INFO L78 Accepts]: Start accepts. Automaton has 3089 states and 5034 transitions. Word has length 200 [2018-11-10 12:37:20,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:37:20,530 INFO L481 AbstractCegarLoop]: Abstraction has 3089 states and 5034 transitions. [2018-11-10 12:37:20,530 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 12:37:20,530 INFO L276 IsEmpty]: Start isEmpty. Operand 3089 states and 5034 transitions. [2018-11-10 12:37:20,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2018-11-10 12:37:20,533 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:37:20,533 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:37:20,533 INFO L424 AbstractCegarLoop]: === Iteration 21 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:37:20,533 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:37:20,533 INFO L82 PathProgramCache]: Analyzing trace with hash 1392052502, now seen corresponding path program 1 times [2018-11-10 12:37:20,534 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 12:37:20,534 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_73a470a1-fd1b-4132-9c85-c391d27a4779/bin-2019/utaipan/cvc4nyu Starting monitored process 24 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 12:37:20,547 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:37:22,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:37:22,955 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:37:22,972 INFO L477 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 18 treesize of output 15 [2018-11-10 12:37:22,974 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-10 12:37:22,977 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:37:22,979 INFO L477 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 18 treesize of output 27 [2018-11-10 12:37:22,980 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 12:37:22,985 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:37:22,996 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:37:23,005 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:37:23,005 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-11-10 12:37:23,017 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-10 12:37:23,018 INFO L477 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 15 treesize of output 3 [2018-11-10 12:37:23,018 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:37:23,019 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:37:23,022 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:37:23,022 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-11-10 12:37:23,044 INFO L134 CoverageAnalysis]: Checked inductivity of 323 backedges. 207 proven. 0 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2018-11-10 12:37:23,044 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 12:37:23,050 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:37:23,051 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 12:37:23,051 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 12:37:23,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 12:37:23,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-10 12:37:23,051 INFO L87 Difference]: Start difference. First operand 3089 states and 5034 transitions. Second operand 7 states. [2018-11-10 12:37:26,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:37:26,060 INFO L93 Difference]: Finished difference Result 6440 states and 10409 transitions. [2018-11-10 12:37:26,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 12:37:26,061 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 201 [2018-11-10 12:37:26,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:37:26,063 INFO L225 Difference]: With dead ends: 6440 [2018-11-10 12:37:26,063 INFO L226 Difference]: Without dead ends: 3365 [2018-11-10 12:37:26,066 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-11-10 12:37:26,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3365 states. [2018-11-10 12:37:26,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3365 to 3089. [2018-11-10 12:37:26,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3089 states. [2018-11-10 12:37:26,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3089 states to 3089 states and 5026 transitions. [2018-11-10 12:37:26,178 INFO L78 Accepts]: Start accepts. Automaton has 3089 states and 5026 transitions. Word has length 201 [2018-11-10 12:37:26,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:37:26,179 INFO L481 AbstractCegarLoop]: Abstraction has 3089 states and 5026 transitions. [2018-11-10 12:37:26,179 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 12:37:26,179 INFO L276 IsEmpty]: Start isEmpty. Operand 3089 states and 5026 transitions. [2018-11-10 12:37:26,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2018-11-10 12:37:26,181 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:37:26,181 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:37:26,181 INFO L424 AbstractCegarLoop]: === Iteration 22 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:37:26,181 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:37:26,181 INFO L82 PathProgramCache]: Analyzing trace with hash -132625424, now seen corresponding path program 1 times [2018-11-10 12:37:26,182 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 12:37:26,182 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_73a470a1-fd1b-4132-9c85-c391d27a4779/bin-2019/utaipan/cvc4nyu Starting monitored process 25 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 12:37:26,195 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:37:27,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:37:28,384 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:37:28,415 INFO L477 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 18 treesize of output 15 [2018-11-10 12:37:28,417 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-10 12:37:28,419 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:37:28,420 INFO L477 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 18 treesize of output 27 [2018-11-10 12:37:28,420 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 12:37:28,426 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:37:28,430 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:37:28,437 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:37:28,437 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-11-10 12:37:28,450 INFO L477 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 17 treesize of output 13 [2018-11-10 12:37:28,451 INFO L477 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 13 treesize of output 5 [2018-11-10 12:37:28,451 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:37:28,452 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:37:28,453 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:37:28,453 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-10 12:37:28,475 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 236 proven. 3 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2018-11-10 12:37:28,475 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 12:37:28,493 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-10 12:37:28,494 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 12:37:28,494 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:37:28,494 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2018-11-10 12:37:28,508 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 239 proven. 0 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2018-11-10 12:37:28,514 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 12:37:28,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2018-11-10 12:37:28,514 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 12:37:28,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 12:37:28,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-10 12:37:28,515 INFO L87 Difference]: Start difference. First operand 3089 states and 5026 transitions. Second operand 9 states. [2018-11-10 12:37:32,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:37:32,051 INFO L93 Difference]: Finished difference Result 6952 states and 11040 transitions. [2018-11-10 12:37:32,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 12:37:32,052 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 201 [2018-11-10 12:37:32,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:37:32,055 INFO L225 Difference]: With dead ends: 6952 [2018-11-10 12:37:32,055 INFO L226 Difference]: Without dead ends: 4261 [2018-11-10 12:37:32,056 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 409 GetRequests, 397 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2018-11-10 12:37:32,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4261 states. [2018-11-10 12:37:32,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4261 to 3109. [2018-11-10 12:37:32,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3109 states. [2018-11-10 12:37:32,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3109 states to 3109 states and 5015 transitions. [2018-11-10 12:37:32,161 INFO L78 Accepts]: Start accepts. Automaton has 3109 states and 5015 transitions. Word has length 201 [2018-11-10 12:37:32,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:37:32,161 INFO L481 AbstractCegarLoop]: Abstraction has 3109 states and 5015 transitions. [2018-11-10 12:37:32,161 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 12:37:32,161 INFO L276 IsEmpty]: Start isEmpty. Operand 3109 states and 5015 transitions. [2018-11-10 12:37:32,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-11-10 12:37:32,164 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:37:32,164 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:37:32,164 INFO L424 AbstractCegarLoop]: === Iteration 23 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:37:32,164 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:37:32,164 INFO L82 PathProgramCache]: Analyzing trace with hash -392710652, now seen corresponding path program 1 times [2018-11-10 12:37:32,165 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 12:37:32,165 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_73a470a1-fd1b-4132-9c85-c391d27a4779/bin-2019/utaipan/cvc4nyu Starting monitored process 26 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 12:37:32,177 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:37:33,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:37:34,325 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:37:34,348 INFO L477 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 18 treesize of output 15 [2018-11-10 12:37:34,350 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-10 12:37:34,353 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:37:34,354 INFO L477 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 18 treesize of output 27 [2018-11-10 12:37:34,355 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 12:37:34,360 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:37:34,364 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:37:34,372 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:37:34,372 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-11-10 12:37:34,384 INFO L477 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 17 treesize of output 13 [2018-11-10 12:37:34,385 INFO L477 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 13 treesize of output 5 [2018-11-10 12:37:34,385 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:37:34,386 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:37:34,387 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:37:34,387 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-10 12:37:34,408 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 241 proven. 3 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2018-11-10 12:37:34,409 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 12:37:34,428 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-10 12:37:34,428 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 12:37:34,428 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:37:34,429 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2018-11-10 12:37:34,447 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 244 proven. 0 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2018-11-10 12:37:34,453 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 12:37:34,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2018-11-10 12:37:34,453 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 12:37:34,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 12:37:34,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-10 12:37:34,453 INFO L87 Difference]: Start difference. First operand 3109 states and 5015 transitions. Second operand 9 states. [2018-11-10 12:37:37,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:37:37,821 INFO L93 Difference]: Finished difference Result 7104 states and 11212 transitions. [2018-11-10 12:37:37,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 12:37:37,822 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 202 [2018-11-10 12:37:37,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:37:37,825 INFO L225 Difference]: With dead ends: 7104 [2018-11-10 12:37:37,825 INFO L226 Difference]: Without dead ends: 4406 [2018-11-10 12:37:37,827 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 411 GetRequests, 399 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2018-11-10 12:37:37,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4406 states. [2018-11-10 12:37:37,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4406 to 3285. [2018-11-10 12:37:37,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3285 states. [2018-11-10 12:37:37,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3285 states to 3285 states and 5255 transitions. [2018-11-10 12:37:37,943 INFO L78 Accepts]: Start accepts. Automaton has 3285 states and 5255 transitions. Word has length 202 [2018-11-10 12:37:37,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:37:37,943 INFO L481 AbstractCegarLoop]: Abstraction has 3285 states and 5255 transitions. [2018-11-10 12:37:37,943 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 12:37:37,943 INFO L276 IsEmpty]: Start isEmpty. Operand 3285 states and 5255 transitions. [2018-11-10 12:37:37,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2018-11-10 12:37:37,945 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:37:37,946 INFO L375 BasicCegarLoop]: trace histogram [6, 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] [2018-11-10 12:37:37,946 INFO L424 AbstractCegarLoop]: === Iteration 24 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:37:37,946 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:37:37,946 INFO L82 PathProgramCache]: Analyzing trace with hash -1084632837, now seen corresponding path program 1 times [2018-11-10 12:37:37,946 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 12:37:37,946 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_73a470a1-fd1b-4132-9c85-c391d27a4779/bin-2019/utaipan/cvc4nyu Starting monitored process 27 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 12:37:37,963 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:37:41,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:37:45,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:37:46,343 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-11-10 12:37:46,359 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 12:37:46,359 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 12:37:46,360 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 12:37:46,360 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 12:37:46,360 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 12:37:46,361 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 12:37:46,422 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 12:37:46 BoogieIcfgContainer [2018-11-10 12:37:46,422 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-10 12:37:46,422 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 12:37:46,423 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 12:37:46,423 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 12:37:46,423 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:35:15" (3/4) ... [2018-11-10 12:37:46,428 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-10 12:37:46,433 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 12:37:46,433 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 12:37:46,434 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 12:37:46,434 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 12:37:46,434 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 12:37:46,434 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 12:37:46,495 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_73a470a1-fd1b-4132-9c85-c391d27a4779/bin-2019/utaipan/witness.graphml [2018-11-10 12:37:46,495 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 12:37:46,496 INFO L168 Benchmark]: Toolchain (without parser) took 155637.00 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 331.9 MB). Free memory was 945.2 MB in the beginning and 940.1 MB in the end (delta: 5.1 MB). Peak memory consumption was 337.0 MB. Max. memory is 11.5 GB. [2018-11-10 12:37:46,496 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 12:37:46,496 INFO L168 Benchmark]: CACSL2BoogieTranslator took 750.83 ms. Allocated memory is still 1.0 GB. Free memory was 945.2 MB in the beginning and 778.8 MB in the end (delta: 166.4 MB). Peak memory consumption was 166.4 MB. Max. memory is 11.5 GB. [2018-11-10 12:37:46,497 INFO L168 Benchmark]: Boogie Procedure Inliner took 127.61 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.7 MB). Free memory was 778.8 MB in the beginning and 1.1 GB in the end (delta: -341.5 MB). Peak memory consumption was 21.0 MB. Max. memory is 11.5 GB. [2018-11-10 12:37:46,497 INFO L168 Benchmark]: Boogie Preprocessor took 74.49 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.0 MB). Peak memory consumption was 6.0 MB. Max. memory is 11.5 GB. [2018-11-10 12:37:46,497 INFO L168 Benchmark]: RCFGBuilder took 3271.59 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 938.2 MB in the end (delta: 176.2 MB). Peak memory consumption was 176.2 MB. Max. memory is 11.5 GB. [2018-11-10 12:37:46,497 INFO L168 Benchmark]: TraceAbstraction took 151336.48 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 198.2 MB). Free memory was 938.2 MB in the beginning and 960.8 MB in the end (delta: -22.6 MB). Peak memory consumption was 175.6 MB. Max. memory is 11.5 GB. [2018-11-10 12:37:46,497 INFO L168 Benchmark]: Witness Printer took 72.91 ms. Allocated memory is still 1.4 GB. Free memory was 960.8 MB in the beginning and 940.1 MB in the end (delta: 20.7 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. [2018-11-10 12:37:46,499 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.13 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 750.83 ms. Allocated memory is still 1.0 GB. Free memory was 945.2 MB in the beginning and 778.8 MB in the end (delta: 166.4 MB). Peak memory consumption was 166.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 127.61 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.7 MB). Free memory was 778.8 MB in the beginning and 1.1 GB in the end (delta: -341.5 MB). Peak memory consumption was 21.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 74.49 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.0 MB). Peak memory consumption was 6.0 MB. Max. memory is 11.5 GB. * RCFGBuilder took 3271.59 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 938.2 MB in the end (delta: 176.2 MB). Peak memory consumption was 176.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 151336.48 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 198.2 MB). Free memory was 938.2 MB in the beginning and 960.8 MB in the end (delta: -22.6 MB). Peak memory consumption was 175.6 MB. Max. memory is 11.5 GB. * Witness Printer took 72.91 ms. Allocated memory is still 1.4 GB. Free memory was 960.8 MB in the beginning and 940.1 MB in the end (delta: 20.7 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1726]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L1042] static int init = 1; [L1043] CALL static SSL_METHOD SSLv3_server_data ; [L1043] RET static SSL_METHOD SSLv3_server_data ; [L1043] RET static SSL_METHOD SSLv3_server_data ; [L1043] RET static SSL_METHOD SSLv3_server_data ; [L1043] RET static SSL_METHOD SSLv3_server_data ; [L1043] RET static SSL_METHOD SSLv3_server_data ; [L1043] RET static SSL_METHOD SSLv3_server_data ; [L1043] RET static SSL_METHOD SSLv3_server_data ; [L1043] RET static SSL_METHOD SSLv3_server_data ; [L1043] RET static SSL_METHOD SSLv3_server_data ; [L1043] RET static SSL_METHOD SSLv3_server_data ; [L1043] RET static SSL_METHOD SSLv3_server_data ; [L1043] RET static SSL_METHOD SSLv3_server_data ; [L1043] RET static SSL_METHOD SSLv3_server_data ; [L1043] RET static SSL_METHOD SSLv3_server_data ; [L1043] RET static SSL_METHOD SSLv3_server_data ; [L1043] RET static SSL_METHOD SSLv3_server_data ; [L1043] RET static SSL_METHOD SSLv3_server_data ; [L1043] RET static SSL_METHOD SSLv3_server_data ; [L1043] RET static SSL_METHOD SSLv3_server_data ; [L1043] RET static SSL_METHOD SSLv3_server_data ; [L1043] RET static SSL_METHOD SSLv3_server_data ; [L1043] RET static SSL_METHOD SSLv3_server_data ; [L1043] RET static SSL_METHOD SSLv3_server_data ; [L1043] RET static SSL_METHOD SSLv3_server_data ; [L1043] RET static SSL_METHOD SSLv3_server_data ; [L1043] RET static SSL_METHOD SSLv3_server_data ; [L1065] SSL *s ; [L1066] int tmp ; [L1070] EXPR, FCALL malloc(sizeof(SSL)) [L1070] s = malloc(sizeof(SSL)) [L1071] EXPR, FCALL malloc(sizeof(struct ssl3_state_st)) [L1071] CALL s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1071] RET s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1072] EXPR, FCALL malloc(sizeof(SSL_CTX)) [L1072] CALL s->ctx = malloc(sizeof(SSL_CTX)) [L1072] RET s->ctx = malloc(sizeof(SSL_CTX)) [L1073] EXPR, FCALL malloc(sizeof(SSL_SESSION)) [L1073] CALL s->session = malloc(sizeof(SSL_SESSION)) [L1073] RET s->session = malloc(sizeof(SSL_SESSION)) [L1074] CALL ssl3_accept(s) VAL [init=1, SSLv3_server_data={2122317174: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] CALL s->state = 8464 [L1105] RET s->state = 8464 [L1106] blastFlag = 0 [L1107] CALL s->hit=__VERIFIER_nondet_int () [L1107] RET s->hit=__VERIFIER_nondet_int () [L1108] CALL s->state = 8464 [L1108] RET 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] CALL, EXPR s->info_callback [L1115] RET, EXPR s->info_callback [L1115] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1116] CALL, EXPR s->info_callback [L1116] RET, EXPR s->info_callback [L1116] cb = s->info_callback [L1120] CALL, EXPR s->in_handshake [L1120] RET, EXPR s->in_handshake [L1120] CALL s->in_handshake += 1 [L1120] RET s->in_handshake += 1 [L1121] COND FALSE !(tmp___1 & 12288) VAL [init=1, SSLv3_server_data={2122317174:0}] [L1130] CALL, EXPR s->cert [L1130] RET, EXPR s->cert [L1130] COND FALSE !((unsigned long )s->cert == (unsigned long )((void *)0)) [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={2122317174:0}] [L1138] CALL, EXPR s->state [L1138] RET, EXPR s->state [L1138] state = s->state [L1139] CALL, EXPR s->state [L1139] RET, EXPR s->state [L1139] COND FALSE !(s->state == 12292) [L1142] CALL, EXPR s->state [L1142] RET, EXPR s->state [L1142] COND FALSE !(s->state == 16384) [L1145] CALL, EXPR s->state [L1145] RET, EXPR s->state [L1145] COND FALSE !(s->state == 8192) [L1148] CALL, EXPR s->state [L1148] RET, EXPR s->state [L1148] COND FALSE !(s->state == 24576) [L1151] CALL, EXPR s->state [L1151] RET, EXPR s->state [L1151] COND FALSE !(s->state == 8195) [L1154] CALL, EXPR s->state [L1154] RET, EXPR s->state [L1154] COND FALSE !(s->state == 8480) [L1157] CALL, EXPR s->state [L1157] RET, EXPR s->state [L1157] COND FALSE !(s->state == 8481) [L1160] CALL, EXPR s->state [L1160] RET, EXPR s->state [L1160] COND FALSE !(s->state == 8482) [L1163] CALL, EXPR s->state [L1163] RET, EXPR s->state [L1163] COND TRUE s->state == 8464 [L1323] CALL s->shutdown = 0 [L1323] RET s->shutdown = 0 [L1324] ret = __VERIFIER_nondet_int() [L1325] COND TRUE blastFlag == 0 [L1326] blastFlag = 1 VAL [init=1, SSLv3_server_data={2122317174:0}] [L1330] COND FALSE !(ret <= 0) [L1335] got_new_session = 1 [L1336] CALL s->state = 8496 [L1336] RET s->state = 8496 [L1337] CALL s->init_num = 0 [L1337] RET s->init_num = 0 [L1685] CALL, EXPR s->s3 [L1685] RET, EXPR s->s3 [L1685] CALL, EXPR (s->s3)->tmp.reuse_message [L1685] RET, EXPR (s->s3)->tmp.reuse_message [L1685] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1714] skip = 0 VAL [init=1, SSLv3_server_data={2122317174:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={2122317174:0}] [L1138] CALL, EXPR s->state [L1138] RET, EXPR s->state [L1138] state = s->state [L1139] CALL, EXPR s->state [L1139] RET, EXPR s->state [L1139] COND FALSE !(s->state == 12292) [L1142] CALL, EXPR s->state [L1142] RET, EXPR s->state [L1142] COND FALSE !(s->state == 16384) [L1145] CALL, EXPR s->state [L1145] RET, EXPR s->state [L1145] COND FALSE !(s->state == 8192) [L1148] CALL, EXPR s->state [L1148] RET, EXPR s->state [L1148] COND FALSE !(s->state == 24576) [L1151] CALL, EXPR s->state [L1151] RET, EXPR s->state [L1151] COND FALSE !(s->state == 8195) [L1154] CALL, EXPR s->state [L1154] RET, EXPR s->state [L1154] COND FALSE !(s->state == 8480) [L1157] CALL, EXPR s->state [L1157] RET, EXPR s->state [L1157] COND FALSE !(s->state == 8481) [L1160] CALL, EXPR s->state [L1160] RET, EXPR s->state [L1160] COND FALSE !(s->state == 8482) [L1163] CALL, EXPR s->state [L1163] RET, EXPR s->state [L1163] COND FALSE !(s->state == 8464) [L1166] CALL, EXPR s->state [L1166] RET, EXPR s->state [L1166] COND FALSE !(s->state == 8465) [L1169] CALL, EXPR s->state [L1169] RET, EXPR s->state [L1169] COND FALSE !(s->state == 8466) [L1172] CALL, EXPR s->state [L1172] RET, EXPR s->state [L1172] COND TRUE s->state == 8496 [L1341] ret = __VERIFIER_nondet_int() [L1342] COND TRUE blastFlag == 1 [L1343] blastFlag = 2 VAL [init=1, SSLv3_server_data={2122317174:0}] [L1347] COND FALSE !(ret <= 0) [L1352] CALL s->hit [L1352] RET s->hit [L1352] COND TRUE s->hit [L1353] CALL s->state = 8656 [L1353] RET s->state = 8656 [L1357] CALL s->init_num = 0 [L1357] RET s->init_num = 0 [L1685] CALL, EXPR s->s3 [L1685] RET, EXPR s->s3 [L1685] CALL, EXPR (s->s3)->tmp.reuse_message [L1685] RET, EXPR (s->s3)->tmp.reuse_message [L1685] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1714] skip = 0 VAL [init=1, SSLv3_server_data={2122317174:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={2122317174:0}] [L1138] CALL, EXPR s->state [L1138] RET, EXPR s->state [L1138] state = s->state [L1139] CALL, EXPR s->state [L1139] RET, EXPR s->state [L1139] COND FALSE !(s->state == 12292) [L1142] CALL, EXPR s->state [L1142] RET, EXPR s->state [L1142] COND FALSE !(s->state == 16384) [L1145] CALL, EXPR s->state [L1145] RET, EXPR s->state [L1145] COND FALSE !(s->state == 8192) [L1148] CALL, EXPR s->state [L1148] RET, EXPR s->state [L1148] COND FALSE !(s->state == 24576) [L1151] CALL, EXPR s->state [L1151] RET, EXPR s->state [L1151] COND FALSE !(s->state == 8195) [L1154] CALL, EXPR s->state [L1154] RET, EXPR s->state [L1154] COND FALSE !(s->state == 8480) [L1157] CALL, EXPR s->state [L1157] RET, EXPR s->state [L1157] COND FALSE !(s->state == 8481) [L1160] CALL, EXPR s->state [L1160] RET, EXPR s->state [L1160] COND FALSE !(s->state == 8482) [L1163] CALL, EXPR s->state [L1163] RET, EXPR s->state [L1163] COND FALSE !(s->state == 8464) [L1166] CALL, EXPR s->state [L1166] RET, EXPR s->state [L1166] COND FALSE !(s->state == 8465) [L1169] CALL, EXPR s->state [L1169] RET, EXPR s->state [L1169] COND FALSE !(s->state == 8466) [L1172] CALL, EXPR s->state [L1172] RET, EXPR s->state [L1172] COND FALSE !(s->state == 8496) [L1175] CALL, EXPR s->state [L1175] RET, EXPR s->state [L1175] COND FALSE !(s->state == 8497) [L1178] CALL, EXPR s->state [L1178] RET, EXPR s->state [L1178] COND FALSE !(s->state == 8512) [L1181] CALL, EXPR s->state [L1181] RET, EXPR s->state [L1181] COND FALSE !(s->state == 8513) [L1184] CALL, EXPR s->state [L1184] RET, EXPR s->state [L1184] COND FALSE !(s->state == 8528) [L1187] CALL, EXPR s->state [L1187] RET, EXPR s->state [L1187] COND FALSE !(s->state == 8529) [L1190] CALL, EXPR s->state [L1190] RET, EXPR s->state [L1190] COND FALSE !(s->state == 8544) [L1193] CALL, EXPR s->state [L1193] RET, EXPR s->state [L1193] COND FALSE !(s->state == 8545) [L1196] CALL, EXPR s->state [L1196] RET, EXPR s->state [L1196] COND FALSE !(s->state == 8560) [L1199] CALL, EXPR s->state [L1199] RET, EXPR s->state [L1199] COND FALSE !(s->state == 8561) [L1202] CALL, EXPR s->state [L1202] RET, EXPR s->state [L1202] COND FALSE !(s->state == 8448) [L1205] CALL, EXPR s->state [L1205] RET, EXPR s->state [L1205] COND FALSE !(s->state == 8576) [L1208] CALL, EXPR s->state [L1208] RET, EXPR s->state [L1208] COND FALSE !(s->state == 8577) [L1211] CALL, EXPR s->state [L1211] RET, EXPR s->state [L1211] COND FALSE !(s->state == 8592) [L1214] CALL, EXPR s->state [L1214] RET, EXPR s->state [L1214] COND FALSE !(s->state == 8593) [L1217] CALL, EXPR s->state [L1217] RET, EXPR s->state [L1217] COND FALSE !(s->state == 8608) [L1220] CALL, EXPR s->state [L1220] RET, EXPR s->state [L1220] COND FALSE !(s->state == 8609) [L1223] CALL, EXPR s->state [L1223] RET, EXPR s->state [L1223] COND FALSE !(s->state == 8640) [L1226] CALL, EXPR s->state [L1226] RET, EXPR s->state [L1226] COND FALSE !(s->state == 8641) [L1229] CALL, EXPR s->state [L1229] RET, EXPR s->state [L1229] COND TRUE s->state == 8656 [L1570] CALL, EXPR s->session [L1570] RET, EXPR s->session [L1570] CALL, EXPR s->s3 [L1570] RET, EXPR s->s3 [L1570] CALL, EXPR (s->s3)->tmp.new_cipher [L1570] RET, EXPR (s->s3)->tmp.new_cipher [L1570] CALL (s->session)->cipher = (s->s3)->tmp.new_cipher [L1570] RET (s->session)->cipher = (s->s3)->tmp.new_cipher [L1571] COND FALSE !(! tmp___9) [L1577] ret = __VERIFIER_nondet_int() [L1578] COND TRUE blastFlag == 2 [L1579] blastFlag = 3 VAL [init=1, SSLv3_server_data={2122317174:0}] [L1591] COND FALSE !(ret <= 0) [L1596] CALL s->state = 8672 [L1596] RET s->state = 8672 [L1597] CALL s->init_num = 0 [L1597] RET s->init_num = 0 [L1598] COND FALSE !(! tmp___10) VAL [init=1, SSLv3_server_data={2122317174:0}] [L1685] CALL, EXPR s->s3 [L1685] RET, EXPR s->s3 [L1685] CALL, EXPR (s->s3)->tmp.reuse_message [L1685] RET, EXPR (s->s3)->tmp.reuse_message [L1685] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1714] skip = 0 VAL [init=1, SSLv3_server_data={2122317174:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={2122317174:0}] [L1138] CALL, EXPR s->state [L1138] RET, EXPR s->state [L1138] state = s->state [L1139] CALL, EXPR s->state [L1139] RET, EXPR s->state [L1139] COND FALSE !(s->state == 12292) [L1142] CALL, EXPR s->state [L1142] RET, EXPR s->state [L1142] COND FALSE !(s->state == 16384) [L1145] CALL, EXPR s->state [L1145] RET, EXPR s->state [L1145] COND FALSE !(s->state == 8192) [L1148] CALL, EXPR s->state [L1148] RET, EXPR s->state [L1148] COND FALSE !(s->state == 24576) [L1151] CALL, EXPR s->state [L1151] RET, EXPR s->state [L1151] COND FALSE !(s->state == 8195) [L1154] CALL, EXPR s->state [L1154] RET, EXPR s->state [L1154] COND FALSE !(s->state == 8480) [L1157] CALL, EXPR s->state [L1157] RET, EXPR s->state [L1157] COND FALSE !(s->state == 8481) [L1160] CALL, EXPR s->state [L1160] RET, EXPR s->state [L1160] COND FALSE !(s->state == 8482) [L1163] CALL, EXPR s->state [L1163] RET, EXPR s->state [L1163] COND FALSE !(s->state == 8464) [L1166] CALL, EXPR s->state [L1166] RET, EXPR s->state [L1166] COND FALSE !(s->state == 8465) [L1169] CALL, EXPR s->state [L1169] RET, EXPR s->state [L1169] COND FALSE !(s->state == 8466) [L1172] CALL, EXPR s->state [L1172] RET, EXPR s->state [L1172] COND FALSE !(s->state == 8496) [L1175] CALL, EXPR s->state [L1175] RET, EXPR s->state [L1175] COND FALSE !(s->state == 8497) [L1178] CALL, EXPR s->state [L1178] RET, EXPR s->state [L1178] COND FALSE !(s->state == 8512) [L1181] CALL, EXPR s->state [L1181] RET, EXPR s->state [L1181] COND FALSE !(s->state == 8513) [L1184] CALL, EXPR s->state [L1184] RET, EXPR s->state [L1184] COND FALSE !(s->state == 8528) [L1187] CALL, EXPR s->state [L1187] RET, EXPR s->state [L1187] COND FALSE !(s->state == 8529) [L1190] CALL, EXPR s->state [L1190] RET, EXPR s->state [L1190] COND FALSE !(s->state == 8544) [L1193] CALL, EXPR s->state [L1193] RET, EXPR s->state [L1193] COND FALSE !(s->state == 8545) [L1196] CALL, EXPR s->state [L1196] RET, EXPR s->state [L1196] COND FALSE !(s->state == 8560) [L1199] CALL, EXPR s->state [L1199] RET, EXPR s->state [L1199] COND FALSE !(s->state == 8561) [L1202] CALL, EXPR s->state [L1202] RET, EXPR s->state [L1202] COND FALSE !(s->state == 8448) [L1205] CALL, EXPR s->state [L1205] RET, EXPR s->state [L1205] COND FALSE !(s->state == 8576) [L1208] CALL, EXPR s->state [L1208] RET, EXPR s->state [L1208] COND FALSE !(s->state == 8577) [L1211] CALL, EXPR s->state [L1211] RET, EXPR s->state [L1211] COND FALSE !(s->state == 8592) [L1214] CALL, EXPR s->state [L1214] RET, EXPR s->state [L1214] COND FALSE !(s->state == 8593) [L1217] CALL, EXPR s->state [L1217] RET, EXPR s->state [L1217] COND FALSE !(s->state == 8608) [L1220] CALL, EXPR s->state [L1220] RET, EXPR s->state [L1220] COND FALSE !(s->state == 8609) [L1223] CALL, EXPR s->state [L1223] RET, EXPR s->state [L1223] COND FALSE !(s->state == 8640) [L1226] CALL, EXPR s->state [L1226] RET, EXPR s->state [L1226] COND FALSE !(s->state == 8641) [L1229] CALL, EXPR s->state [L1229] RET, EXPR s->state [L1229] COND FALSE !(s->state == 8656) [L1232] CALL, EXPR s->state [L1232] RET, EXPR s->state [L1232] COND FALSE !(s->state == 8657) [L1235] CALL, EXPR s->state [L1235] RET, EXPR s->state [L1235] COND TRUE s->state == 8672 [L1607] ret = __VERIFIER_nondet_int() [L1608] COND TRUE blastFlag == 3 [L1609] blastFlag = 4 VAL [init=1, SSLv3_server_data={2122317174:0}] [L1613] COND FALSE !(ret <= 0) [L1618] CALL s->state = 8448 [L1618] RET s->state = 8448 [L1619] CALL s->hit [L1619] RET s->hit [L1619] COND TRUE s->hit [L1620] CALL, EXPR s->s3 [L1620] RET, EXPR s->s3 [L1620] CALL (s->s3)->tmp.next_state = 8640 [L1620] RET (s->s3)->tmp.next_state = 8640 [L1624] CALL s->init_num = 0 [L1624] RET s->init_num = 0 [L1685] CALL, EXPR s->s3 [L1685] RET, EXPR s->s3 [L1685] CALL, EXPR (s->s3)->tmp.reuse_message [L1685] RET, EXPR (s->s3)->tmp.reuse_message [L1685] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1714] skip = 0 VAL [init=1, SSLv3_server_data={2122317174:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={2122317174:0}] [L1138] CALL, EXPR s->state [L1138] RET, EXPR s->state [L1138] state = s->state [L1139] CALL, EXPR s->state [L1139] RET, EXPR s->state [L1139] COND FALSE !(s->state == 12292) [L1142] CALL, EXPR s->state [L1142] RET, EXPR s->state [L1142] COND FALSE !(s->state == 16384) [L1145] CALL, EXPR s->state [L1145] RET, EXPR s->state [L1145] COND FALSE !(s->state == 8192) [L1148] CALL, EXPR s->state [L1148] RET, EXPR s->state [L1148] COND FALSE !(s->state == 24576) [L1151] CALL, EXPR s->state [L1151] RET, EXPR s->state [L1151] COND FALSE !(s->state == 8195) [L1154] CALL, EXPR s->state [L1154] RET, EXPR s->state [L1154] COND FALSE !(s->state == 8480) [L1157] CALL, EXPR s->state [L1157] RET, EXPR s->state [L1157] COND FALSE !(s->state == 8481) [L1160] CALL, EXPR s->state [L1160] RET, EXPR s->state [L1160] COND FALSE !(s->state == 8482) [L1163] CALL, EXPR s->state [L1163] RET, EXPR s->state [L1163] COND FALSE !(s->state == 8464) [L1166] CALL, EXPR s->state [L1166] RET, EXPR s->state [L1166] COND FALSE !(s->state == 8465) [L1169] CALL, EXPR s->state [L1169] RET, EXPR s->state [L1169] COND FALSE !(s->state == 8466) [L1172] CALL, EXPR s->state [L1172] RET, EXPR s->state [L1172] COND FALSE !(s->state == 8496) [L1175] CALL, EXPR s->state [L1175] RET, EXPR s->state [L1175] COND FALSE !(s->state == 8497) [L1178] CALL, EXPR s->state [L1178] RET, EXPR s->state [L1178] COND FALSE !(s->state == 8512) [L1181] CALL, EXPR s->state [L1181] RET, EXPR s->state [L1181] COND FALSE !(s->state == 8513) [L1184] CALL, EXPR s->state [L1184] RET, EXPR s->state [L1184] COND FALSE !(s->state == 8528) [L1187] CALL, EXPR s->state [L1187] RET, EXPR s->state [L1187] COND FALSE !(s->state == 8529) [L1190] CALL, EXPR s->state [L1190] RET, EXPR s->state [L1190] COND FALSE !(s->state == 8544) [L1193] CALL, EXPR s->state [L1193] RET, EXPR s->state [L1193] COND FALSE !(s->state == 8545) [L1196] CALL, EXPR s->state [L1196] RET, EXPR s->state [L1196] COND FALSE !(s->state == 8560) [L1199] CALL, EXPR s->state [L1199] RET, EXPR s->state [L1199] COND FALSE !(s->state == 8561) [L1202] CALL, EXPR s->state [L1202] RET, EXPR s->state [L1202] COND TRUE s->state == 8448 [L1490] COND FALSE !(num1 > 0L) VAL [init=1, SSLv3_server_data={2122317174:0}] [L1503] CALL, EXPR s->s3 [L1503] RET, EXPR s->s3 [L1503] CALL, EXPR (s->s3)->tmp.next_state [L1503] RET, EXPR (s->s3)->tmp.next_state [L1503] CALL s->state = (s->s3)->tmp.next_state [L1503] RET s->state = (s->s3)->tmp.next_state [L1685] CALL, EXPR s->s3 [L1685] RET, EXPR s->s3 [L1685] CALL, EXPR (s->s3)->tmp.reuse_message [L1685] RET, EXPR (s->s3)->tmp.reuse_message [L1685] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1714] skip = 0 VAL [init=1, SSLv3_server_data={2122317174:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={2122317174:0}] [L1138] CALL, EXPR s->state [L1138] RET, EXPR s->state [L1138] state = s->state [L1139] CALL, EXPR s->state [L1139] RET, EXPR s->state [L1139] COND FALSE !(s->state == 12292) [L1142] CALL, EXPR s->state [L1142] RET, EXPR s->state [L1142] COND FALSE !(s->state == 16384) [L1145] CALL, EXPR s->state [L1145] RET, EXPR s->state [L1145] COND FALSE !(s->state == 8192) [L1148] CALL, EXPR s->state [L1148] RET, EXPR s->state [L1148] COND FALSE !(s->state == 24576) [L1151] CALL, EXPR s->state [L1151] RET, EXPR s->state [L1151] COND FALSE !(s->state == 8195) [L1154] CALL, EXPR s->state [L1154] RET, EXPR s->state [L1154] COND FALSE !(s->state == 8480) [L1157] CALL, EXPR s->state [L1157] RET, EXPR s->state [L1157] COND FALSE !(s->state == 8481) [L1160] CALL, EXPR s->state [L1160] RET, EXPR s->state [L1160] COND FALSE !(s->state == 8482) [L1163] CALL, EXPR s->state [L1163] RET, EXPR s->state [L1163] COND FALSE !(s->state == 8464) [L1166] CALL, EXPR s->state [L1166] RET, EXPR s->state [L1166] COND FALSE !(s->state == 8465) [L1169] CALL, EXPR s->state [L1169] RET, EXPR s->state [L1169] COND FALSE !(s->state == 8466) [L1172] CALL, EXPR s->state [L1172] RET, EXPR s->state [L1172] COND FALSE !(s->state == 8496) [L1175] CALL, EXPR s->state [L1175] RET, EXPR s->state [L1175] COND FALSE !(s->state == 8497) [L1178] CALL, EXPR s->state [L1178] RET, EXPR s->state [L1178] COND FALSE !(s->state == 8512) [L1181] CALL, EXPR s->state [L1181] RET, EXPR s->state [L1181] COND FALSE !(s->state == 8513) [L1184] CALL, EXPR s->state [L1184] RET, EXPR s->state [L1184] COND FALSE !(s->state == 8528) [L1187] CALL, EXPR s->state [L1187] RET, EXPR s->state [L1187] COND FALSE !(s->state == 8529) [L1190] CALL, EXPR s->state [L1190] RET, EXPR s->state [L1190] COND FALSE !(s->state == 8544) [L1193] CALL, EXPR s->state [L1193] RET, EXPR s->state [L1193] COND FALSE !(s->state == 8545) [L1196] CALL, EXPR s->state [L1196] RET, EXPR s->state [L1196] COND FALSE !(s->state == 8560) [L1199] CALL, EXPR s->state [L1199] RET, EXPR s->state [L1199] COND FALSE !(s->state == 8561) [L1202] CALL, EXPR s->state [L1202] RET, EXPR s->state [L1202] COND FALSE !(s->state == 8448) [L1205] CALL, EXPR s->state [L1205] RET, EXPR s->state [L1205] COND FALSE !(s->state == 8576) [L1208] CALL, EXPR s->state [L1208] RET, EXPR s->state [L1208] COND FALSE !(s->state == 8577) [L1211] CALL, EXPR s->state [L1211] RET, EXPR s->state [L1211] COND FALSE !(s->state == 8592) [L1214] CALL, EXPR s->state [L1214] RET, EXPR s->state [L1214] COND FALSE !(s->state == 8593) [L1217] CALL, EXPR s->state [L1217] RET, EXPR s->state [L1217] COND FALSE !(s->state == 8608) [L1220] CALL, EXPR s->state [L1220] RET, EXPR s->state [L1220] COND FALSE !(s->state == 8609) [L1223] CALL, EXPR s->state [L1223] RET, EXPR s->state [L1223] COND TRUE s->state == 8640 [L1550] ret = __VERIFIER_nondet_int() [L1551] COND TRUE blastFlag == 4 VAL [init=1, SSLv3_server_data={2122317174:0}] [L1726] __VERIFIER_error() VAL [init=1, SSLv3_server_data={2122317174:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 160 locations, 1 error locations. UNSAFE Result, 151.2s OverallTime, 24 OverallIterations, 7 TraceHistogramMax, 97.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 5768 SDtfs, 10352 SDslu, 11667 SDs, 0 SdLazy, 10833 SolverSat, 1193 SolverUnsat, 31 SolverUnknown, 0 SolverNotchecked, 89.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5336 GetRequests, 5163 SyntacticMatches, 4 SemanticMatches, 169 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 430 ImplicationChecksByTransitivity, 4.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3285occurred in iteration=23, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.7s AutomataMinimizationTime, 23 MinimizatonAttempts, 10161 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 1.3s SsaConstructionTime, 29.7s SatisfiabilityAnalysisTime, 15.5s InterpolantComputationTime, 4369 NumberOfCodeBlocks, 4369 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 5262 ConstructedInterpolants, 253 QuantifiedInterpolants, 6660349 SizeOfPredicates, 447 NumberOfNonLiveVariables, 25279 ConjunctsInSsa, 480 ConjunctsInUnsatCore, 31 InterpolantComputations, 22 PerfectInterpolantSequences, 6492/7508 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...