./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/forester-heap/dll-rb-sentinel_false-unreach-call_false-valid-memtrack.i --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_8a846bc7-7dcb-4774-967e-8eda370dcf3e/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_8a846bc7-7dcb-4774-967e-8eda370dcf3e/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_8a846bc7-7dcb-4774-967e-8eda370dcf3e/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_8a846bc7-7dcb-4774-967e-8eda370dcf3e/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/forester-heap/dll-rb-sentinel_false-unreach-call_false-valid-memtrack.i -s /tmp/vcloud-vcloud-master/worker/working_dir_8a846bc7-7dcb-4774-967e-8eda370dcf3e/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_8a846bc7-7dcb-4774-967e-8eda370dcf3e/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b9633ec6dc7e01a7231c1be5ed310faef61ba6b0 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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:50:47,950 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 12:50:47,951 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 12:50:47,959 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 12:50:47,959 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 12:50:47,960 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 12:50:47,960 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 12:50:47,961 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 12:50:47,962 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 12:50:47,962 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 12:50:47,963 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 12:50:47,963 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 12:50:47,963 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 12:50:47,964 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 12:50:47,964 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 12:50:47,965 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 12:50:47,965 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 12:50:47,966 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 12:50:47,967 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 12:50:47,968 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 12:50:47,969 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 12:50:47,970 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 12:50:47,971 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 12:50:47,972 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 12:50:47,972 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 12:50:47,972 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 12:50:47,973 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 12:50:47,973 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 12:50:47,974 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 12:50:47,974 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 12:50:47,975 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 12:50:47,975 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 12:50:47,975 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 12:50:47,975 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 12:50:47,976 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 12:50:47,977 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 12:50:47,977 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_8a846bc7-7dcb-4774-967e-8eda370dcf3e/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-10 12:50:47,984 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 12:50:47,984 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 12:50:47,984 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 12:50:47,985 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-10 12:50:47,985 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 12:50:47,985 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 12:50:47,985 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 12:50:47,985 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 12:50:47,986 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 12:50:47,986 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 12:50:47,986 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 12:50:47,986 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 12:50:47,986 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 12:50:47,986 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 12:50:47,986 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 12:50:47,987 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 12:50:47,987 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 12:50:47,987 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 12:50:47,987 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 12:50:47,987 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 12:50:47,987 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 12:50:47,987 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 12:50:47,987 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 12:50:47,988 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 12:50:47,988 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 12:50:47,988 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 12:50:47,988 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 12:50:47,988 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 12:50:47,988 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 12:50:47,988 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_8a846bc7-7dcb-4774-967e-8eda370dcf3e/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b9633ec6dc7e01a7231c1be5ed310faef61ba6b0 [2018-11-10 12:50:48,010 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 12:50:48,018 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 12:50:48,020 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 12:50:48,020 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 12:50:48,021 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 12:50:48,021 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_8a846bc7-7dcb-4774-967e-8eda370dcf3e/bin-2019/uautomizer/../../sv-benchmarks/c/forester-heap/dll-rb-sentinel_false-unreach-call_false-valid-memtrack.i [2018-11-10 12:50:48,057 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_8a846bc7-7dcb-4774-967e-8eda370dcf3e/bin-2019/uautomizer/data/3b874dd84/2cedc3ef4ee64ec3b195bf6849f65d44/FLAG20258c59f [2018-11-10 12:50:48,480 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 12:50:48,480 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_8a846bc7-7dcb-4774-967e-8eda370dcf3e/sv-benchmarks/c/forester-heap/dll-rb-sentinel_false-unreach-call_false-valid-memtrack.i [2018-11-10 12:50:48,486 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_8a846bc7-7dcb-4774-967e-8eda370dcf3e/bin-2019/uautomizer/data/3b874dd84/2cedc3ef4ee64ec3b195bf6849f65d44/FLAG20258c59f [2018-11-10 12:50:48,496 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_8a846bc7-7dcb-4774-967e-8eda370dcf3e/bin-2019/uautomizer/data/3b874dd84/2cedc3ef4ee64ec3b195bf6849f65d44 [2018-11-10 12:50:48,499 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 12:50:48,500 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-10 12:50:48,501 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 12:50:48,501 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 12:50:48,504 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 12:50:48,504 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:50:48" (1/1) ... [2018-11-10 12:50:48,507 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a27cf3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:50:48, skipping insertion in model container [2018-11-10 12:50:48,507 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:50:48" (1/1) ... [2018-11-10 12:50:48,512 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 12:50:48,542 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 12:50:48,717 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 12:50:48,723 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 12:50:48,751 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 12:50:48,781 INFO L193 MainTranslator]: Completed translation [2018-11-10 12:50:48,781 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:50:48 WrapperNode [2018-11-10 12:50:48,781 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 12:50:48,782 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 12:50:48,782 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 12:50:48,782 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 12:50:48,829 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:50:48" (1/1) ... [2018-11-10 12:50:48,829 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:50:48" (1/1) ... [2018-11-10 12:50:48,841 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:50:48" (1/1) ... [2018-11-10 12:50:48,841 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:50:48" (1/1) ... [2018-11-10 12:50:48,855 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:50:48" (1/1) ... [2018-11-10 12:50:48,861 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:50:48" (1/1) ... [2018-11-10 12:50:48,863 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:50:48" (1/1) ... [2018-11-10 12:50:48,868 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 12:50:48,868 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 12:50:48,868 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 12:50:48,868 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 12:50:48,869 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:50:48" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8a846bc7-7dcb-4774-967e-8eda370dcf3e/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 12:50:48,911 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 12:50:48,911 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 12:50:48,911 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 12:50:48,911 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-11-10 12:50:48,912 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-11-10 12:50:48,912 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-11-10 12:50:48,912 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-11-10 12:50:48,912 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-11-10 12:50:48,912 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-11-10 12:50:48,912 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-11-10 12:50:48,912 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-11-10 12:50:48,912 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-11-10 12:50:48,912 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-11-10 12:50:48,912 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-11-10 12:50:48,913 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-11-10 12:50:48,913 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-11-10 12:50:48,913 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-11-10 12:50:48,913 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-11-10 12:50:48,913 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-11-10 12:50:48,913 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-11-10 12:50:48,913 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-11-10 12:50:48,913 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-11-10 12:50:48,914 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-11-10 12:50:48,914 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-11-10 12:50:48,914 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-11-10 12:50:48,914 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-11-10 12:50:48,914 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-11-10 12:50:48,914 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-11-10 12:50:48,914 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-11-10 12:50:48,914 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-11-10 12:50:48,914 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-11-10 12:50:48,914 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-11-10 12:50:48,915 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-11-10 12:50:48,915 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-11-10 12:50:48,915 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-11-10 12:50:48,915 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-11-10 12:50:48,915 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-11-10 12:50:48,915 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-11-10 12:50:48,915 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-11-10 12:50:48,915 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-11-10 12:50:48,915 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-11-10 12:50:48,916 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-11-10 12:50:48,916 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-11-10 12:50:48,916 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-11-10 12:50:48,916 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-11-10 12:50:48,916 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-11-10 12:50:48,916 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-11-10 12:50:48,916 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-11-10 12:50:48,916 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-11-10 12:50:48,916 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-11-10 12:50:48,917 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-11-10 12:50:48,917 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-11-10 12:50:48,917 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-11-10 12:50:48,917 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-11-10 12:50:48,917 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-11-10 12:50:48,917 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-11-10 12:50:48,917 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-11-10 12:50:48,917 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-11-10 12:50:48,917 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-11-10 12:50:48,918 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-11-10 12:50:48,918 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-11-10 12:50:48,918 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2018-11-10 12:50:48,918 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-11-10 12:50:48,918 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-11-10 12:50:48,918 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2018-11-10 12:50:48,918 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-11-10 12:50:48,918 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-10 12:50:48,918 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2018-11-10 12:50:48,919 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-11-10 12:50:48,919 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-11-10 12:50:48,919 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-11-10 12:50:48,919 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-11-10 12:50:48,919 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-11-10 12:50:48,919 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-11-10 12:50:48,919 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-11-10 12:50:48,919 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-11-10 12:50:48,919 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-11-10 12:50:48,920 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-11-10 12:50:48,920 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-11-10 12:50:48,920 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-11-10 12:50:48,920 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-11-10 12:50:48,920 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-11-10 12:50:48,920 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-11-10 12:50:48,920 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-11-10 12:50:48,920 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-11-10 12:50:48,920 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-11-10 12:50:48,920 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-11-10 12:50:48,921 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-11-10 12:50:48,921 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-11-10 12:50:48,921 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-11-10 12:50:48,921 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-11-10 12:50:48,921 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-11-10 12:50:48,921 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-11-10 12:50:48,921 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-11-10 12:50:48,921 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-11-10 12:50:48,921 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-11-10 12:50:48,922 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-11-10 12:50:48,922 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-11-10 12:50:48,922 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-11-10 12:50:48,922 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-11-10 12:50:48,922 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-11-10 12:50:48,922 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-11-10 12:50:48,922 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-11-10 12:50:48,922 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-11-10 12:50:48,922 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-11-10 12:50:48,922 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-11-10 12:50:48,923 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-10 12:50:48,923 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-10 12:50:48,923 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 12:50:48,923 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-10 12:50:48,923 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-10 12:50:48,923 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-10 12:50:48,923 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-10 12:50:48,923 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-10 12:50:48,923 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-10 12:50:48,923 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 12:50:48,924 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 12:50:48,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-11-10 12:50:49,294 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 12:50:49,295 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:50:49 BoogieIcfgContainer [2018-11-10 12:50:49,295 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 12:50:49,295 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 12:50:49,295 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 12:50:49,297 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 12:50:49,298 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 12:50:48" (1/3) ... [2018-11-10 12:50:49,298 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6091a4e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 12:50:49, skipping insertion in model container [2018-11-10 12:50:49,298 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:50:48" (2/3) ... [2018-11-10 12:50:49,298 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6091a4e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 12:50:49, skipping insertion in model container [2018-11-10 12:50:49,299 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:50:49" (3/3) ... [2018-11-10 12:50:49,300 INFO L112 eAbstractionObserver]: Analyzing ICFG dll-rb-sentinel_false-unreach-call_false-valid-memtrack.i [2018-11-10 12:50:49,308 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 12:50:49,315 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 7 error locations. [2018-11-10 12:50:49,328 INFO L257 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2018-11-10 12:50:49,354 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 12:50:49,355 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 12:50:49,355 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-10 12:50:49,355 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 12:50:49,355 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 12:50:49,355 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 12:50:49,355 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 12:50:49,355 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 12:50:49,356 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 12:50:49,370 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states. [2018-11-10 12:50:49,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-10 12:50:49,374 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:50:49,375 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] [2018-11-10 12:50:49,376 INFO L424 AbstractCegarLoop]: === Iteration 1 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:50:49,380 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:50:49,380 INFO L82 PathProgramCache]: Analyzing trace with hash 1293338631, now seen corresponding path program 1 times [2018-11-10 12:50:49,382 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:50:49,382 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:50:49,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:50:49,422 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:50:49,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:50:49,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:50:49,488 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:50:49,490 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:50:49,490 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 12:50:49,492 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-10 12:50:49,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-10 12:50:49,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-10 12:50:49,502 INFO L87 Difference]: Start difference. First operand 107 states. Second operand 2 states. [2018-11-10 12:50:49,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:50:49,522 INFO L93 Difference]: Finished difference Result 198 states and 256 transitions. [2018-11-10 12:50:49,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-10 12:50:49,524 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 21 [2018-11-10 12:50:49,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:50:49,531 INFO L225 Difference]: With dead ends: 198 [2018-11-10 12:50:49,531 INFO L226 Difference]: Without dead ends: 88 [2018-11-10 12:50:49,534 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-10 12:50:49,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-11-10 12:50:49,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2018-11-10 12:50:49,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-11-10 12:50:49,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 91 transitions. [2018-11-10 12:50:49,561 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 91 transitions. Word has length 21 [2018-11-10 12:50:49,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:50:49,562 INFO L481 AbstractCegarLoop]: Abstraction has 88 states and 91 transitions. [2018-11-10 12:50:49,562 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-10 12:50:49,562 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 91 transitions. [2018-11-10 12:50:49,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-10 12:50:49,562 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:50:49,562 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] [2018-11-10 12:50:49,563 INFO L424 AbstractCegarLoop]: === Iteration 2 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:50:49,563 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:50:49,563 INFO L82 PathProgramCache]: Analyzing trace with hash 1347792492, now seen corresponding path program 1 times [2018-11-10 12:50:49,563 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:50:49,563 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:50:49,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:50:49,565 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:50:49,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:50:49,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:50:49,673 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:50:49,673 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:50:49,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 12:50:49,674 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 12:50:49,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 12:50:49,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-10 12:50:49,675 INFO L87 Difference]: Start difference. First operand 88 states and 91 transitions. Second operand 7 states. [2018-11-10 12:50:49,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:50:49,837 INFO L93 Difference]: Finished difference Result 107 states and 112 transitions. [2018-11-10 12:50:49,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 12:50:49,837 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2018-11-10 12:50:49,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:50:49,838 INFO L225 Difference]: With dead ends: 107 [2018-11-10 12:50:49,838 INFO L226 Difference]: Without dead ends: 105 [2018-11-10 12:50:49,839 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2018-11-10 12:50:49,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-11-10 12:50:49,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 86. [2018-11-10 12:50:49,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-11-10 12:50:49,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 89 transitions. [2018-11-10 12:50:49,846 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 89 transitions. Word has length 23 [2018-11-10 12:50:49,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:50:49,847 INFO L481 AbstractCegarLoop]: Abstraction has 86 states and 89 transitions. [2018-11-10 12:50:49,847 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 12:50:49,847 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 89 transitions. [2018-11-10 12:50:49,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-10 12:50:49,848 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:50:49,848 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] [2018-11-10 12:50:49,848 INFO L424 AbstractCegarLoop]: === Iteration 3 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:50:49,848 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:50:49,848 INFO L82 PathProgramCache]: Analyzing trace with hash -1086976655, now seen corresponding path program 1 times [2018-11-10 12:50:49,848 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:50:49,849 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:50:49,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:50:49,850 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:50:49,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:50:49,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:50:50,020 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:50:50,020 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:50:50,020 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-10 12:50:50,021 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-10 12:50:50,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-10 12:50:50,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-11-10 12:50:50,021 INFO L87 Difference]: Start difference. First operand 86 states and 89 transitions. Second operand 10 states. [2018-11-10 12:50:50,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:50:50,277 INFO L93 Difference]: Finished difference Result 166 states and 174 transitions. [2018-11-10 12:50:50,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-10 12:50:50,277 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 27 [2018-11-10 12:50:50,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:50:50,278 INFO L225 Difference]: With dead ends: 166 [2018-11-10 12:50:50,278 INFO L226 Difference]: Without dead ends: 164 [2018-11-10 12:50:50,279 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=222, Unknown=0, NotChecked=0, Total=342 [2018-11-10 12:50:50,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2018-11-10 12:50:50,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 118. [2018-11-10 12:50:50,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-11-10 12:50:50,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 126 transitions. [2018-11-10 12:50:50,288 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 126 transitions. Word has length 27 [2018-11-10 12:50:50,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:50:50,288 INFO L481 AbstractCegarLoop]: Abstraction has 118 states and 126 transitions. [2018-11-10 12:50:50,288 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-10 12:50:50,288 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 126 transitions. [2018-11-10 12:50:50,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-10 12:50:50,289 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:50:50,289 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] [2018-11-10 12:50:50,289 INFO L424 AbstractCegarLoop]: === Iteration 4 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:50:50,290 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:50:50,290 INFO L82 PathProgramCache]: Analyzing trace with hash 2127889302, now seen corresponding path program 1 times [2018-11-10 12:50:50,290 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:50:50,290 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:50:50,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:50:50,291 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:50:50,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:50:50,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:50:50,322 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:50:50,323 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:50:50,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 12:50:50,323 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 12:50:50,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 12:50:50,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 12:50:50,324 INFO L87 Difference]: Start difference. First operand 118 states and 126 transitions. Second operand 4 states. [2018-11-10 12:50:50,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:50:50,371 INFO L93 Difference]: Finished difference Result 129 states and 138 transitions. [2018-11-10 12:50:50,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 12:50:50,371 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2018-11-10 12:50:50,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:50:50,372 INFO L225 Difference]: With dead ends: 129 [2018-11-10 12:50:50,372 INFO L226 Difference]: Without dead ends: 127 [2018-11-10 12:50:50,373 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:50:50,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-11-10 12:50:50,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 116. [2018-11-10 12:50:50,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-11-10 12:50:50,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 123 transitions. [2018-11-10 12:50:50,380 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 123 transitions. Word has length 34 [2018-11-10 12:50:50,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:50:50,381 INFO L481 AbstractCegarLoop]: Abstraction has 116 states and 123 transitions. [2018-11-10 12:50:50,381 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 12:50:50,381 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 123 transitions. [2018-11-10 12:50:50,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-10 12:50:50,382 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:50:50,382 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] [2018-11-10 12:50:50,382 INFO L424 AbstractCegarLoop]: === Iteration 5 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:50:50,382 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:50:50,383 INFO L82 PathProgramCache]: Analyzing trace with hash 1158131534, now seen corresponding path program 1 times [2018-11-10 12:50:50,383 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:50:50,383 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:50:50,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:50:50,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:50:50,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:50:50,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:50:50,508 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:50:50,508 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:50:50,508 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 12:50:50,508 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 12:50:50,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 12:50:50,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 12:50:50,509 INFO L87 Difference]: Start difference. First operand 116 states and 123 transitions. Second operand 5 states. [2018-11-10 12:50:50,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:50:50,581 INFO L93 Difference]: Finished difference Result 152 states and 162 transitions. [2018-11-10 12:50:50,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 12:50:50,582 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 36 [2018-11-10 12:50:50,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:50:50,583 INFO L225 Difference]: With dead ends: 152 [2018-11-10 12:50:50,583 INFO L226 Difference]: Without dead ends: 133 [2018-11-10 12:50:50,583 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-10 12:50:50,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-11-10 12:50:50,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 120. [2018-11-10 12:50:50,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-11-10 12:50:50,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 127 transitions. [2018-11-10 12:50:50,588 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 127 transitions. Word has length 36 [2018-11-10 12:50:50,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:50:50,589 INFO L481 AbstractCegarLoop]: Abstraction has 120 states and 127 transitions. [2018-11-10 12:50:50,589 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 12:50:50,589 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 127 transitions. [2018-11-10 12:50:50,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-10 12:50:50,590 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:50:50,590 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] [2018-11-10 12:50:50,590 INFO L424 AbstractCegarLoop]: === Iteration 6 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:50:50,590 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:50:50,590 INFO L82 PathProgramCache]: Analyzing trace with hash 1177888219, now seen corresponding path program 1 times [2018-11-10 12:50:50,591 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:50:50,591 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:50:50,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:50:50,592 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:50:50,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:50:50,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:50:50,629 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:50:50,630 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:50:50,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 12:50:50,630 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 12:50:50,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 12:50:50,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 12:50:50,631 INFO L87 Difference]: Start difference. First operand 120 states and 127 transitions. Second operand 4 states. [2018-11-10 12:50:50,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:50:50,702 INFO L93 Difference]: Finished difference Result 126 states and 134 transitions. [2018-11-10 12:50:50,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 12:50:50,702 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 38 [2018-11-10 12:50:50,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:50:50,702 INFO L225 Difference]: With dead ends: 126 [2018-11-10 12:50:50,703 INFO L226 Difference]: Without dead ends: 124 [2018-11-10 12:50:50,703 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:50:50,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-11-10 12:50:50,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 118. [2018-11-10 12:50:50,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-11-10 12:50:50,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 124 transitions. [2018-11-10 12:50:50,710 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 124 transitions. Word has length 38 [2018-11-10 12:50:50,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:50:50,710 INFO L481 AbstractCegarLoop]: Abstraction has 118 states and 124 transitions. [2018-11-10 12:50:50,710 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 12:50:50,710 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 124 transitions. [2018-11-10 12:50:50,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-10 12:50:50,711 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:50:50,711 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] [2018-11-10 12:50:50,712 INFO L424 AbstractCegarLoop]: === Iteration 7 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:50:50,712 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:50:50,712 INFO L82 PathProgramCache]: Analyzing trace with hash 589117983, now seen corresponding path program 1 times [2018-11-10 12:50:50,712 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:50:50,712 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:50:50,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:50:50,713 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:50:50,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:50:50,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:50:50,870 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:50:50,870 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:50:50,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-11-10 12:50:50,870 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-10 12:50:50,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-10 12:50:50,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2018-11-10 12:50:50,871 INFO L87 Difference]: Start difference. First operand 118 states and 124 transitions. Second operand 13 states. [2018-11-10 12:50:51,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:50:51,167 INFO L93 Difference]: Finished difference Result 167 states and 176 transitions. [2018-11-10 12:50:51,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-10 12:50:51,167 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 41 [2018-11-10 12:50:51,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:50:51,168 INFO L225 Difference]: With dead ends: 167 [2018-11-10 12:50:51,168 INFO L226 Difference]: Without dead ends: 165 [2018-11-10 12:50:51,168 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=127, Invalid=335, Unknown=0, NotChecked=0, Total=462 [2018-11-10 12:50:51,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-11-10 12:50:51,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 142. [2018-11-10 12:50:51,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-11-10 12:50:51,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 150 transitions. [2018-11-10 12:50:51,174 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 150 transitions. Word has length 41 [2018-11-10 12:50:51,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:50:51,174 INFO L481 AbstractCegarLoop]: Abstraction has 142 states and 150 transitions. [2018-11-10 12:50:51,174 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-10 12:50:51,174 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 150 transitions. [2018-11-10 12:50:51,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-10 12:50:51,175 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:50:51,175 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:50:51,176 INFO L424 AbstractCegarLoop]: === Iteration 8 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:50:51,176 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:50:51,176 INFO L82 PathProgramCache]: Analyzing trace with hash -55747688, now seen corresponding path program 1 times [2018-11-10 12:50:51,176 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:50:51,176 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:50:51,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:50:51,177 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:50:51,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:50:51,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:50:51,242 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:50:51,242 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 12:50:51,242 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8a846bc7-7dcb-4774-967e-8eda370dcf3e/bin-2019/uautomizer/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:50:51,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:50:51,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:50:51,281 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:50:51,317 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:50:51,319 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:50:51,320 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:50:51,338 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:50:51,349 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:50:51,351 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:50:51,351 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 12:50:51,357 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:50:51,363 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:50:51,364 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:23, output treesize:15 [2018-11-10 12:50:51,371 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:50:51,374 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:50:51,375 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:50:51,377 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:50:51,383 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:50:51,391 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:50:51,393 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:50:51,394 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:50:51,394 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 12:50:51,399 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:50:51,405 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:50:51,405 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:41, output treesize:33 [2018-11-10 12:50:51,459 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 24 treesize of output 18 [2018-11-10 12:50:51,462 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:50:51,463 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-11-10 12:50:51,464 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:50:51,467 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:50:51,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 24 treesize of output 18 [2018-11-10 12:50:51,479 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:50:51,480 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-11-10 12:50:51,481 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 12:50:51,484 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:50:51,487 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:50:51,487 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:47, output treesize:7 [2018-11-10 12:50:51,501 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:50:51,518 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 12:50:51,518 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 8 [2018-11-10 12:50:51,519 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-10 12:50:51,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 12:50:51,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-11-10 12:50:51,519 INFO L87 Difference]: Start difference. First operand 142 states and 150 transitions. Second operand 8 states. [2018-11-10 12:50:51,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:50:51,735 INFO L93 Difference]: Finished difference Result 177 states and 186 transitions. [2018-11-10 12:50:51,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-10 12:50:51,735 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 42 [2018-11-10 12:50:51,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:50:51,736 INFO L225 Difference]: With dead ends: 177 [2018-11-10 12:50:51,736 INFO L226 Difference]: Without dead ends: 142 [2018-11-10 12:50:51,736 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 39 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2018-11-10 12:50:51,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-11-10 12:50:51,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2018-11-10 12:50:51,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-11-10 12:50:51,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 149 transitions. [2018-11-10 12:50:51,742 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 149 transitions. Word has length 42 [2018-11-10 12:50:51,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:50:51,742 INFO L481 AbstractCegarLoop]: Abstraction has 142 states and 149 transitions. [2018-11-10 12:50:51,742 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-10 12:50:51,742 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 149 transitions. [2018-11-10 12:50:51,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-10 12:50:51,743 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:50:51,743 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:50:51,743 INFO L424 AbstractCegarLoop]: === Iteration 9 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:50:51,743 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:50:51,744 INFO L82 PathProgramCache]: Analyzing trace with hash -734620293, now seen corresponding path program 1 times [2018-11-10 12:50:51,744 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:50:51,744 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:50:51,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:50:51,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:50:51,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:50:51,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:50:51,980 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:50:51,980 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:50:51,980 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2018-11-10 12:50:51,980 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-10 12:50:51,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-10 12:50:51,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2018-11-10 12:50:51,981 INFO L87 Difference]: Start difference. First operand 142 states and 149 transitions. Second operand 18 states. [2018-11-10 12:50:52,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:50:52,680 INFO L93 Difference]: Finished difference Result 178 states and 186 transitions. [2018-11-10 12:50:52,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-10 12:50:52,680 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 50 [2018-11-10 12:50:52,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:50:52,681 INFO L225 Difference]: With dead ends: 178 [2018-11-10 12:50:52,681 INFO L226 Difference]: Without dead ends: 176 [2018-11-10 12:50:52,682 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=354, Invalid=1128, Unknown=0, NotChecked=0, Total=1482 [2018-11-10 12:50:52,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-11-10 12:50:52,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 162. [2018-11-10 12:50:52,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-11-10 12:50:52,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 169 transitions. [2018-11-10 12:50:52,687 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 169 transitions. Word has length 50 [2018-11-10 12:50:52,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:50:52,687 INFO L481 AbstractCegarLoop]: Abstraction has 162 states and 169 transitions. [2018-11-10 12:50:52,687 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-10 12:50:52,687 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 169 transitions. [2018-11-10 12:50:52,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-11-10 12:50:52,688 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:50:52,688 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:50:52,689 INFO L424 AbstractCegarLoop]: === Iteration 10 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:50:52,689 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:50:52,689 INFO L82 PathProgramCache]: Analyzing trace with hash 2123776255, now seen corresponding path program 1 times [2018-11-10 12:50:52,689 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:50:52,689 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:50:52,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:50:52,690 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:50:52,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:50:52,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:50:53,270 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:50:53,270 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 12:50:53,270 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8a846bc7-7dcb-4774-967e-8eda370dcf3e/bin-2019/uautomizer/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:50:53,276 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:50:53,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:50:53,296 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:50:53,299 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 6 treesize of output 5 [2018-11-10 12:50:53,299 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 12:50:53,300 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:50:53,300 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-10 12:50:53,319 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:50:53,320 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:50:53,321 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:50:53,326 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:50:53,329 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:50:53,329 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2018-11-10 12:50:53,351 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:50:53,352 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:50:53,352 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-10 12:50:53,353 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 12:50:53,356 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:50:53,356 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:17 [2018-11-10 12:50:53,371 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:50:53,374 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 12:50:53,374 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:50:53,375 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:50:53,380 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:50:53,380 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:21 [2018-11-10 12:50:53,414 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 30 treesize of output 34 [2018-11-10 12:50:53,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-11-10 12:50:53,417 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:50:53,420 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:50:53,424 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 12:50:53,424 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:42, output treesize:34 [2018-11-10 12:50:53,458 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 19 [2018-11-10 12:50:53,459 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 12 treesize of output 4 [2018-11-10 12:50:53,460 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:50:53,464 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 7 treesize of output 1 [2018-11-10 12:50:53,464 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 12:50:53,465 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:50:53,468 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:50:53,468 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:38, output treesize:14 [2018-11-10 12:50:53,520 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 23 treesize of output 24 [2018-11-10 12:50:53,522 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:50:53,522 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:50:53,525 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:50:53,529 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:50:53,530 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:23 [2018-11-10 12:50:53,582 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 32 treesize of output 63 [2018-11-10 12:50:53,591 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 39 [2018-11-10 12:50:53,591 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:50:53,667 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:50:53,668 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 12:50:53,688 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:50:53,692 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 30 treesize of output 43 [2018-11-10 12:50:53,693 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-11-10 12:50:53,707 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 12:50:53,718 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2018-11-10 12:50:53,719 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:36, output treesize:56 [2018-11-10 12:50:53,840 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2018-11-10 12:50:53,846 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 7 treesize of output 1 [2018-11-10 12:50:53,846 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:50:53,853 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:50:53,854 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 12:50:53,857 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:50:53,870 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 26 [2018-11-10 12:50:53,872 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 7 treesize of output 1 [2018-11-10 12:50:53,873 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-10 12:50:53,877 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:50:53,878 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-10 12:50:53,880 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:50:53,886 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:50:53,886 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 10 variables, input treesize:65, output treesize:3 [2018-11-10 12:50:53,906 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:50:53,923 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 12:50:53,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 16] total 37 [2018-11-10 12:50:53,923 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-11-10 12:50:53,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-11-10 12:50:53,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=1166, Unknown=0, NotChecked=0, Total=1332 [2018-11-10 12:50:53,924 INFO L87 Difference]: Start difference. First operand 162 states and 169 transitions. Second operand 37 states. [2018-11-10 12:50:55,517 WARN L179 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 56 [2018-11-10 12:50:55,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:50:55,595 INFO L93 Difference]: Finished difference Result 269 states and 281 transitions. [2018-11-10 12:50:55,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-10 12:50:55,595 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 61 [2018-11-10 12:50:55,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:50:55,596 INFO L225 Difference]: With dead ends: 269 [2018-11-10 12:50:55,596 INFO L226 Difference]: Without dead ends: 267 [2018-11-10 12:50:55,597 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 819 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=714, Invalid=3068, Unknown=0, NotChecked=0, Total=3782 [2018-11-10 12:50:55,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2018-11-10 12:50:55,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 207. [2018-11-10 12:50:55,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2018-11-10 12:50:55,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 217 transitions. [2018-11-10 12:50:55,603 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 217 transitions. Word has length 61 [2018-11-10 12:50:55,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:50:55,603 INFO L481 AbstractCegarLoop]: Abstraction has 207 states and 217 transitions. [2018-11-10 12:50:55,603 INFO L482 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-11-10 12:50:55,603 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 217 transitions. [2018-11-10 12:50:55,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-10 12:50:55,604 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:50:55,604 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:50:55,605 INFO L424 AbstractCegarLoop]: === Iteration 11 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:50:55,605 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:50:55,605 INFO L82 PathProgramCache]: Analyzing trace with hash -1867499255, now seen corresponding path program 1 times [2018-11-10 12:50:55,605 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:50:55,605 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:50:55,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:50:55,606 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:50:55,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:50:55,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:50:55,946 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:50:55,946 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 12:50:55,946 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8a846bc7-7dcb-4774-967e-8eda370dcf3e/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 12:50:55,954 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:50:55,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:50:55,981 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:50:55,994 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 6 treesize of output 5 [2018-11-10 12:50:55,994 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 12:50:55,996 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:50:55,996 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-10 12:50:56,021 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:50:56,022 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:50:56,023 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 0 case distinctions, treesize of input 17 treesize of output 21 [2018-11-10 12:50:56,023 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 12:50:56,027 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:50:56,027 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:15 [2018-11-10 12:50:56,078 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:50:56,079 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:50:56,080 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:50:56,080 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 34 [2018-11-10 12:50:56,080 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 12:50:56,086 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:50:56,086 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:28 [2018-11-10 12:50:56,108 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 11 treesize of output 8 [2018-11-10 12:50:56,109 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 12:50:56,110 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:50:56,111 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:50:56,117 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:50:56,117 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:40 [2018-11-10 12:50:56,164 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 43 [2018-11-10 12:50:56,166 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-11-10 12:50:56,166 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:50:56,171 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:50:56,184 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 12:50:56,185 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:61, output treesize:53 [2018-11-10 12:50:56,216 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 32 [2018-11-10 12:50:56,218 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 14 [2018-11-10 12:50:56,218 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:50:56,223 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 7 treesize of output 1 [2018-11-10 12:50:56,223 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 12:50:56,226 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:50:56,231 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 12:50:56,231 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:60, output treesize:28 [2018-11-10 12:50:56,292 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:50:56,293 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:50:56,294 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:50:56,294 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:50:56,295 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2018-11-10 12:50:56,296 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 12:50:56,300 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:50:56,301 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:33, output treesize:13 [2018-11-10 12:50:56,319 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 11 treesize of output 8 [2018-11-10 12:50:56,321 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 12:50:56,321 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:50:56,322 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:50:56,325 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:50:56,325 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:21 [2018-11-10 12:50:56,365 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2018-11-10 12:50:56,366 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-11-10 12:50:56,366 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:50:56,370 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:50:56,375 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 12:50:56,375 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:42, output treesize:34 [2018-11-10 12:50:56,401 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 25 [2018-11-10 12:50:56,405 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 9 [2018-11-10 12:50:56,406 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:50:56,409 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 7 treesize of output 1 [2018-11-10 12:50:56,409 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 12:50:56,411 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:50:56,414 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:50:56,414 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:41, output treesize:4 [2018-11-10 12:50:56,436 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:50:56,451 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 12:50:56,451 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19] total 35 [2018-11-10 12:50:56,452 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-11-10 12:50:56,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-11-10 12:50:56,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=1047, Unknown=0, NotChecked=0, Total=1190 [2018-11-10 12:50:56,453 INFO L87 Difference]: Start difference. First operand 207 states and 217 transitions. Second operand 35 states. [2018-11-10 12:50:57,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:50:57,939 INFO L93 Difference]: Finished difference Result 225 states and 234 transitions. [2018-11-10 12:50:57,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-10 12:50:57,939 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 66 [2018-11-10 12:50:57,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:50:57,940 INFO L225 Difference]: With dead ends: 225 [2018-11-10 12:50:57,940 INFO L226 Difference]: Without dead ends: 223 [2018-11-10 12:50:57,941 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 561 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=771, Invalid=2421, Unknown=0, NotChecked=0, Total=3192 [2018-11-10 12:50:57,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2018-11-10 12:50:57,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 196. [2018-11-10 12:50:57,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2018-11-10 12:50:57,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 205 transitions. [2018-11-10 12:50:57,948 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 205 transitions. Word has length 66 [2018-11-10 12:50:57,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:50:57,948 INFO L481 AbstractCegarLoop]: Abstraction has 196 states and 205 transitions. [2018-11-10 12:50:57,948 INFO L482 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-11-10 12:50:57,948 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 205 transitions. [2018-11-10 12:50:57,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-11-10 12:50:57,949 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:50:57,949 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:50:57,949 INFO L424 AbstractCegarLoop]: === Iteration 12 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:50:57,950 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:50:57,950 INFO L82 PathProgramCache]: Analyzing trace with hash 1098529262, now seen corresponding path program 1 times [2018-11-10 12:50:57,950 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:50:57,950 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:50:57,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:50:57,950 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:50:57,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:50:57,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:50:58,730 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:50:58,731 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 12:50:58,731 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8a846bc7-7dcb-4774-967e-8eda370dcf3e/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 12:50:58,737 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:50:58,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:50:58,754 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:50:58,766 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 6 treesize of output 5 [2018-11-10 12:50:58,766 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 12:50:58,771 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:50:58,771 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-10 12:50:58,844 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:50:58,844 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:50:58,845 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-10 12:50:58,845 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 12:50:58,849 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:50:58,849 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:17 [2018-11-10 12:50:58,872 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:50:58,874 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 12:50:58,874 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:50:58,876 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:50:58,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 11 treesize of output 8 [2018-11-10 12:50:58,888 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:50:58,888 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 12:50:58,889 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:50:58,895 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:50:58,895 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:36, output treesize:25 [2018-11-10 12:50:58,945 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:50:58,948 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 51 treesize of output 55 [2018-11-10 12:50:58,950 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:50:58,950 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:50:58,954 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:50:58,963 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:50:58,965 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 29 treesize of output 30 [2018-11-10 12:50:58,967 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:50:58,967 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 12:50:58,971 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:50:58,983 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 12:50:58,983 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:67, output treesize:51 [2018-11-10 12:50:59,116 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 48 [2018-11-10 12:50:59,124 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 31 [2018-11-10 12:50:59,124 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-10 12:50:59,136 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 12:50:59,159 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 73 [2018-11-10 12:50:59,161 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 12:50:59,162 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 21 [2018-11-10 12:50:59,162 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 12:50:59,171 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:50:59,176 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 91 [2018-11-10 12:50:59,184 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 51 [2018-11-10 12:50:59,184 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-11-10 12:50:59,198 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 12:50:59,224 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-10 12:50:59,224 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:78, output treesize:131 [2018-11-10 12:50:59,260 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 25 treesize of output 18 [2018-11-10 12:50:59,261 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 18 treesize of output 17 [2018-11-10 12:50:59,261 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:50:59,263 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:50:59,267 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:50:59,267 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:56, output treesize:48 [2018-11-10 12:50:59,327 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 48 treesize of output 40 [2018-11-10 12:50:59,329 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 40 treesize of output 29 [2018-11-10 12:50:59,330 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:50:59,349 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:50:59,374 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 33 [2018-11-10 12:50:59,376 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 29 treesize of output 18 [2018-11-10 12:50:59,377 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 12:50:59,383 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 5 treesize of output 3 [2018-11-10 12:50:59,384 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-10 12:50:59,387 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:50:59,392 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:50:59,392 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:62, output treesize:13 [2018-11-10 12:50:59,445 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:50:59,447 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:50:59,447 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:50:59,449 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:50:59,450 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:50:59,451 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-11-10 12:50:59,489 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:50:59,515 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 12:50:59,515 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 19] total 43 [2018-11-10 12:50:59,516 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-11-10 12:50:59,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-11-10 12:50:59,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=1624, Unknown=0, NotChecked=0, Total=1806 [2018-11-10 12:50:59,516 INFO L87 Difference]: Start difference. First operand 196 states and 205 transitions. Second operand 43 states. [2018-11-10 12:51:02,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:51:02,520 INFO L93 Difference]: Finished difference Result 338 states and 355 transitions. [2018-11-10 12:51:02,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-11-10 12:51:02,521 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 67 [2018-11-10 12:51:02,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:51:02,522 INFO L225 Difference]: With dead ends: 338 [2018-11-10 12:51:02,522 INFO L226 Difference]: Without dead ends: 319 [2018-11-10 12:51:02,523 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 51 SyntacticMatches, 5 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1459 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=1068, Invalid=5574, Unknown=0, NotChecked=0, Total=6642 [2018-11-10 12:51:02,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2018-11-10 12:51:02,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 250. [2018-11-10 12:51:02,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2018-11-10 12:51:02,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 262 transitions. [2018-11-10 12:51:02,530 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 262 transitions. Word has length 67 [2018-11-10 12:51:02,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:51:02,530 INFO L481 AbstractCegarLoop]: Abstraction has 250 states and 262 transitions. [2018-11-10 12:51:02,530 INFO L482 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-11-10 12:51:02,530 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 262 transitions. [2018-11-10 12:51:02,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-11-10 12:51:02,531 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:51:02,531 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:51:02,531 INFO L424 AbstractCegarLoop]: === Iteration 13 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:51:02,531 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:51:02,531 INFO L82 PathProgramCache]: Analyzing trace with hash -2022347208, now seen corresponding path program 2 times [2018-11-10 12:51:02,531 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:51:02,532 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:51:02,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:51:02,532 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:51:02,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:51:02,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:51:02,806 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:51:02,806 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 12:51:02,806 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8a846bc7-7dcb-4774-967e-8eda370dcf3e/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 12:51:02,812 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-10 12:51:02,834 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-10 12:51:02,834 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 12:51:02,837 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:51:02,862 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 6 treesize of output 5 [2018-11-10 12:51:02,862 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 12:51:02,865 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:51:02,865 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-11-10 12:51:02,912 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:51:02,913 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:51:02,913 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-10 12:51:02,913 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 12:51:02,918 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:51:02,918 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:20 [2018-11-10 12:51:02,938 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:51:02,940 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 12:51:02,940 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:51:02,941 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:51:02,954 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:51:02,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 8 treesize of output 7 [2018-11-10 12:51:02,956 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 12:51:02,957 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:51:02,964 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:51:02,964 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:39, output treesize:28 [2018-11-10 12:51:03,018 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:51:03,021 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 29 treesize of output 30 [2018-11-10 12:51:03,023 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:51:03,023 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:51:03,027 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:51:03,037 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:51:03,039 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 43 treesize of output 47 [2018-11-10 12:51:03,041 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:51:03,041 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 12:51:03,046 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:51:03,053 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 12:51:03,053 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:70, output treesize:54 [2018-11-10 12:51:03,175 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 81 treesize of output 71 [2018-11-10 12:51:03,184 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 39 [2018-11-10 12:51:03,184 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-10 12:51:03,198 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 12:51:03,225 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 80 treesize of output 67 [2018-11-10 12:51:03,228 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 12:51:03,228 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 43 [2018-11-10 12:51:03,229 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 12:51:03,238 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:51:03,241 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 12:51:03,242 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 76 treesize of output 72 [2018-11-10 12:51:03,247 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 33 treesize of output 39 [2018-11-10 12:51:03,248 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-10 12:51:03,258 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:51:03,280 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-10 12:51:03,280 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:94, output treesize:131 [2018-11-10 12:51:03,535 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:51:03,536 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 66 [2018-11-10 12:51:03,542 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 45 [2018-11-10 12:51:03,543 INFO L267 ElimStorePlain]: Start of recursive call 3: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-11-10 12:51:03,562 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 1 case distinctions, treesize of input 55 treesize of output 50 [2018-11-10 12:51:03,563 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-10 12:51:03,564 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 49 treesize of output 34 [2018-11-10 12:51:03,565 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 12:51:03,580 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-10 12:51:03,595 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 31 [2018-11-10 12:51:03,596 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:51:03,596 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-10 12:51:03,602 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 5 treesize of output 1 [2018-11-10 12:51:03,602 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-10 12:51:03,605 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:51:03,607 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 31 [2018-11-10 12:51:03,609 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 20 treesize of output 11 [2018-11-10 12:51:03,609 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-10 12:51:03,615 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:51:03,616 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-10 12:51:03,619 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:51:03,630 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:51:03,630 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 3 variables, input treesize:87, output treesize:10 [2018-11-10 12:51:03,700 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:51:03,725 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 12:51:03,726 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20] total 39 [2018-11-10 12:51:03,726 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-11-10 12:51:03,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-11-10 12:51:03,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=1325, Unknown=0, NotChecked=0, Total=1482 [2018-11-10 12:51:03,727 INFO L87 Difference]: Start difference. First operand 250 states and 262 transitions. Second operand 39 states. [2018-11-10 12:51:04,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:51:04,853 INFO L93 Difference]: Finished difference Result 297 states and 310 transitions. [2018-11-10 12:51:04,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-10 12:51:04,854 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 73 [2018-11-10 12:51:04,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:51:04,855 INFO L225 Difference]: With dead ends: 297 [2018-11-10 12:51:04,855 INFO L226 Difference]: Without dead ends: 256 [2018-11-10 12:51:04,856 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1004 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=664, Invalid=3496, Unknown=0, NotChecked=0, Total=4160 [2018-11-10 12:51:04,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2018-11-10 12:51:04,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 250. [2018-11-10 12:51:04,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2018-11-10 12:51:04,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 261 transitions. [2018-11-10 12:51:04,865 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 261 transitions. Word has length 73 [2018-11-10 12:51:04,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:51:04,865 INFO L481 AbstractCegarLoop]: Abstraction has 250 states and 261 transitions. [2018-11-10 12:51:04,865 INFO L482 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-11-10 12:51:04,865 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 261 transitions. [2018-11-10 12:51:04,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-11-10 12:51:04,866 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:51:04,866 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:51:04,866 INFO L424 AbstractCegarLoop]: === Iteration 14 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:51:04,866 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:51:04,866 INFO L82 PathProgramCache]: Analyzing trace with hash 140320045, now seen corresponding path program 1 times [2018-11-10 12:51:04,866 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:51:04,867 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:51:04,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:51:04,867 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:51:04,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:51:04,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:51:04,982 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:51:04,982 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 12:51:04,982 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8a846bc7-7dcb-4774-967e-8eda370dcf3e/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 12:51:04,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:51:05,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:51:05,012 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:51:05,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 6 treesize of output 5 [2018-11-10 12:51:05,014 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 12:51:05,015 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:51:05,016 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-10 12:51:05,021 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:51:05,022 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:51:05,022 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 0 case distinctions, treesize of input 17 treesize of output 21 [2018-11-10 12:51:05,022 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 12:51:05,039 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:51:05,039 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:15 [2018-11-10 12:51:05,074 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:51:05,075 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:51:05,078 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:51:05,079 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 34 [2018-11-10 12:51:05,079 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 12:51:05,086 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:51:05,087 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:28 [2018-11-10 12:51:05,102 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 11 treesize of output 8 [2018-11-10 12:51:05,104 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 12:51:05,104 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:51:05,105 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:51:05,112 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:51:05,113 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:40 [2018-11-10 12:51:05,148 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 43 [2018-11-10 12:51:05,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-11-10 12:51:05,150 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:51:05,155 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:51:05,163 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 12:51:05,163 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:61, output treesize:53 [2018-11-10 12:51:05,191 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 32 [2018-11-10 12:51:05,192 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 7 treesize of output 1 [2018-11-10 12:51:05,193 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:51:05,212 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 14 [2018-11-10 12:51:05,213 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 12:51:05,216 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:51:05,221 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 12:51:05,222 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:60, output treesize:28 [2018-11-10 12:51:05,254 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:51:05,258 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:51:05,258 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:51:05,259 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:51:05,260 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 51 [2018-11-10 12:51:05,260 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 12:51:05,275 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 12:51:05,276 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:45 [2018-11-10 12:51:05,303 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-10 12:51:05,306 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 12:51:05,306 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:51:05,307 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:51:05,319 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 12:51:05,319 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:56, output treesize:61 [2018-11-10 12:51:05,397 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 51 [2018-11-10 12:51:05,399 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-11-10 12:51:05,399 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:51:05,405 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:51:05,418 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:51:05,418 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:82, output treesize:74 [2018-11-10 12:51:05,457 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 38 [2018-11-10 12:51:05,460 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 18 [2018-11-10 12:51:05,460 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:51:05,467 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 7 treesize of output 1 [2018-11-10 12:51:05,467 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 12:51:05,472 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:51:05,482 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-10 12:51:05,482 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:81, output treesize:45 [2018-11-10 12:51:05,555 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:51:05,557 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:51:05,558 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:51:05,559 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:51:05,560 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:51:05,561 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2018-11-10 12:51:05,561 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 12:51:05,572 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:51:05,573 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:13 [2018-11-10 12:51:05,592 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 11 treesize of output 8 [2018-11-10 12:51:05,594 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 12:51:05,594 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:51:05,596 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:51:05,601 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:51:05,602 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:21 [2018-11-10 12:51:05,649 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2018-11-10 12:51:05,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, 1 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:51:05,652 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:51:05,657 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:51:05,662 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 12:51:05,662 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:42, output treesize:34 [2018-11-10 12:51:05,687 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 25 [2018-11-10 12:51:05,689 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 9 [2018-11-10 12:51:05,690 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:51:05,695 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 7 treesize of output 1 [2018-11-10 12:51:05,695 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 12:51:05,698 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:51:05,704 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:51:05,704 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:41, output treesize:4 [2018-11-10 12:51:05,733 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:51:05,752 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 12:51:05,752 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 25] total 29 [2018-11-10 12:51:05,752 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-11-10 12:51:05,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-11-10 12:51:05,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=653, Unknown=0, NotChecked=0, Total=812 [2018-11-10 12:51:05,753 INFO L87 Difference]: Start difference. First operand 250 states and 261 transitions. Second operand 29 states. [2018-11-10 12:51:08,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:51:08,674 INFO L93 Difference]: Finished difference Result 256 states and 267 transitions. [2018-11-10 12:51:08,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-10 12:51:08,682 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 75 [2018-11-10 12:51:08,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:51:08,683 INFO L225 Difference]: With dead ends: 256 [2018-11-10 12:51:08,683 INFO L226 Difference]: Without dead ends: 254 [2018-11-10 12:51:08,684 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 58 SyntacticMatches, 5 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 583 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=749, Invalid=2113, Unknown=0, NotChecked=0, Total=2862 [2018-11-10 12:51:08,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2018-11-10 12:51:08,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 193. [2018-11-10 12:51:08,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-11-10 12:51:08,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 201 transitions. [2018-11-10 12:51:08,691 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 201 transitions. Word has length 75 [2018-11-10 12:51:08,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:51:08,691 INFO L481 AbstractCegarLoop]: Abstraction has 193 states and 201 transitions. [2018-11-10 12:51:08,691 INFO L482 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-11-10 12:51:08,691 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 201 transitions. [2018-11-10 12:51:08,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-11-10 12:51:08,692 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:51:08,692 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:51:08,692 INFO L424 AbstractCegarLoop]: === Iteration 15 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:51:08,692 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:51:08,692 INFO L82 PathProgramCache]: Analyzing trace with hash -1083581878, now seen corresponding path program 1 times [2018-11-10 12:51:08,692 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:51:08,692 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:51:08,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:51:08,693 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:51:08,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:51:08,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:51:09,341 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:51:09,341 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 12:51:09,341 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8a846bc7-7dcb-4774-967e-8eda370dcf3e/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 12:51:09,347 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:51:09,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:51:09,368 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:51:09,413 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 6 treesize of output 5 [2018-11-10 12:51:09,414 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 12:51:09,416 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:51:09,416 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-10 12:51:09,482 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:51:09,483 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:51:09,483 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 0 case distinctions, treesize of input 17 treesize of output 21 [2018-11-10 12:51:09,483 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 12:51:09,489 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:51:09,489 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:24 [2018-11-10 12:51:09,518 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:51:09,520 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 12:51:09,520 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:51:09,521 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:51:09,527 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:51:09,527 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:32 [2018-11-10 12:51:09,589 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:51:09,591 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 39 treesize of output 43 [2018-11-10 12:51:09,593 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:51:09,593 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:51:09,599 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:51:09,607 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 12:51:09,607 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:53, output treesize:45 [2018-11-10 12:51:09,780 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 40 [2018-11-10 12:51:09,788 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 31 [2018-11-10 12:51:09,789 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-10 12:51:09,801 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 12:51:09,824 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:51:09,827 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 63 treesize of output 68 [2018-11-10 12:51:09,829 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 15 [2018-11-10 12:51:09,829 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 12:51:09,839 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:51:09,840 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:51:09,843 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 63 treesize of output 80 [2018-11-10 12:51:09,846 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 21 [2018-11-10 12:51:09,846 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-10 12:51:09,855 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:51:09,879 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-10 12:51:09,879 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:75, output treesize:160 [2018-11-10 12:51:09,970 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:51:09,971 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:51:09,973 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:51:09,974 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 21 [2018-11-10 12:51:09,974 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 12:51:09,989 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:51:09,989 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:74, output treesize:67 [2018-11-10 12:51:10,039 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 12:51:10,042 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 56 [2018-11-10 12:51:10,044 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 27 treesize of output 26 [2018-11-10 12:51:10,044 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:51:10,050 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:51:10,062 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:51:10,065 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 60 [2018-11-10 12:51:10,067 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2018-11-10 12:51:10,067 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 12:51:10,075 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:51:10,084 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:51:10,084 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:86, output treesize:69 [2018-11-10 12:51:10,174 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:51:10,175 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:51:10,181 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 93 [2018-11-10 12:51:10,183 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:51:10,183 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:51:10,192 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:51:10,207 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:51:10,214 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:51:10,220 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 105 [2018-11-10 12:51:10,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, 1 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:51:10,222 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 12:51:10,233 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:51:10,244 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 12:51:10,244 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:111, output treesize:87 [2018-11-10 12:51:10,462 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 143 treesize of output 146 [2018-11-10 12:51:10,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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 51 [2018-11-10 12:51:10,470 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-10 12:51:10,489 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 12:51:10,531 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 158 treesize of output 148 [2018-11-10 12:51:10,539 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 51 [2018-11-10 12:51:10,539 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-11-10 12:51:10,566 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 12:51:10,574 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 162 treesize of output 152 [2018-11-10 12:51:10,576 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 12:51:10,577 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 25 [2018-11-10 12:51:10,577 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-10 12:51:10,590 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:51:10,626 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-10 12:51:10,626 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:165, output treesize:265 [2018-11-10 12:51:10,734 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 22 [2018-11-10 12:51:10,738 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:51:10,739 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:51:10,741 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:51:10,755 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:51:10,755 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:132, output treesize:140 [2018-11-10 12:51:11,161 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 170 treesize of output 133 [2018-11-10 12:51:11,163 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 9 treesize of output 7 [2018-11-10 12:51:11,163 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:51:11,176 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 103 treesize of output 82 [2018-11-10 12:51:11,176 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 12:51:11,185 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 42 treesize of output 31 [2018-11-10 12:51:11,185 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 12:51:11,193 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:51:11,203 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:51:11,203 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:194, output treesize:95 [2018-11-10 12:51:11,321 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:51:11,323 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 48 [2018-11-10 12:51:11,325 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 5 treesize of output 1 [2018-11-10 12:51:11,325 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:51:11,331 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 7 treesize of output 1 [2018-11-10 12:51:11,331 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 12:51:11,333 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 7 treesize of output 1 [2018-11-10 12:51:11,333 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 12:51:11,334 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:51:11,340 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:51:11,340 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:104, output treesize:71 [2018-11-10 12:51:11,391 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 42 [2018-11-10 12:51:11,392 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 15 [2018-11-10 12:51:11,393 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:51:11,398 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 9 [2018-11-10 12:51:11,398 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 12:51:11,401 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 5 treesize of output 1 [2018-11-10 12:51:11,401 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 12:51:11,403 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:51:11,405 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:51:11,405 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:75, output treesize:4 [2018-11-10 12:51:11,447 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:51:11,463 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 12:51:11,463 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 32] total 57 [2018-11-10 12:51:11,464 INFO L460 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-11-10 12:51:11,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-11-10 12:51:11,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=3006, Unknown=0, NotChecked=0, Total=3192 [2018-11-10 12:51:11,465 INFO L87 Difference]: Start difference. First operand 193 states and 201 transitions. Second operand 57 states. [2018-11-10 12:51:12,907 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 73 [2018-11-10 12:51:13,187 WARN L179 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 77 [2018-11-10 12:51:15,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:51:15,420 INFO L93 Difference]: Finished difference Result 274 states and 285 transitions. [2018-11-10 12:51:15,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-11-10 12:51:15,420 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 76 [2018-11-10 12:51:15,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:51:15,421 INFO L225 Difference]: With dead ends: 274 [2018-11-10 12:51:15,421 INFO L226 Difference]: Without dead ends: 272 [2018-11-10 12:51:15,424 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 48 SyntacticMatches, 3 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1974 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=1055, Invalid=8065, Unknown=0, NotChecked=0, Total=9120 [2018-11-10 12:51:15,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2018-11-10 12:51:15,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 229. [2018-11-10 12:51:15,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2018-11-10 12:51:15,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 239 transitions. [2018-11-10 12:51:15,436 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 239 transitions. Word has length 76 [2018-11-10 12:51:15,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:51:15,436 INFO L481 AbstractCegarLoop]: Abstraction has 229 states and 239 transitions. [2018-11-10 12:51:15,436 INFO L482 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-11-10 12:51:15,436 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 239 transitions. [2018-11-10 12:51:15,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-10 12:51:15,437 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:51:15,437 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:51:15,437 INFO L424 AbstractCegarLoop]: === Iteration 16 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:51:15,438 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:51:15,438 INFO L82 PathProgramCache]: Analyzing trace with hash -292622321, now seen corresponding path program 1 times [2018-11-10 12:51:15,438 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:51:15,438 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:51:15,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:51:15,439 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:51:15,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:51:15,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:51:15,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:51:15,483 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-11-10 12:51:15,524 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 12:51:15 BoogieIcfgContainer [2018-11-10 12:51:15,524 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-10 12:51:15,525 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 12:51:15,525 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 12:51:15,525 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 12:51:15,525 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:50:49" (3/4) ... [2018-11-10 12:51:15,527 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-10 12:51:15,569 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_8a846bc7-7dcb-4774-967e-8eda370dcf3e/bin-2019/uautomizer/witness.graphml [2018-11-10 12:51:15,570 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 12:51:15,570 INFO L168 Benchmark]: Toolchain (without parser) took 27070.86 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 439.4 MB). Free memory was 957.6 MB in the beginning and 1.1 GB in the end (delta: -116.8 MB). Peak memory consumption was 322.5 MB. Max. memory is 11.5 GB. [2018-11-10 12:51:15,571 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 12:51:15,571 INFO L168 Benchmark]: CACSL2BoogieTranslator took 280.98 ms. Allocated memory is still 1.0 GB. Free memory was 957.6 MB in the beginning and 933.5 MB in the end (delta: 24.2 MB). Peak memory consumption was 24.2 MB. Max. memory is 11.5 GB. [2018-11-10 12:51:15,571 INFO L168 Benchmark]: Boogie Preprocessor took 85.82 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 933.5 MB in the beginning and 1.1 GB in the end (delta: -203.2 MB). Peak memory consumption was 15.9 MB. Max. memory is 11.5 GB. [2018-11-10 12:51:15,571 INFO L168 Benchmark]: RCFGBuilder took 426.91 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: 53.1 MB). Peak memory consumption was 53.1 MB. Max. memory is 11.5 GB. [2018-11-10 12:51:15,571 INFO L168 Benchmark]: TraceAbstraction took 26228.93 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 299.4 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -5.2 MB). Peak memory consumption was 294.1 MB. Max. memory is 11.5 GB. [2018-11-10 12:51:15,572 INFO L168 Benchmark]: Witness Printer took 45.05 ms. Allocated memory is still 1.5 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 11.7 MB). Peak memory consumption was 11.7 MB. Max. memory is 11.5 GB. [2018-11-10 12:51:15,573 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.10 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 280.98 ms. Allocated memory is still 1.0 GB. Free memory was 957.6 MB in the beginning and 933.5 MB in the end (delta: 24.2 MB). Peak memory consumption was 24.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 85.82 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 933.5 MB in the beginning and 1.1 GB in the end (delta: -203.2 MB). Peak memory consumption was 15.9 MB. Max. memory is 11.5 GB. * RCFGBuilder took 426.91 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: 53.1 MB). Peak memory consumption was 53.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 26228.93 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 299.4 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -5.2 MB). Peak memory consumption was 294.1 MB. Max. memory is 11.5 GB. * Witness Printer took 45.05 ms. Allocated memory is still 1.5 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 11.7 MB). Peak memory consumption was 11.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1038]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L987] EXPR, FCALL malloc(sizeof(struct TSLL)) VAL [malloc(sizeof(struct TSLL))={15:0}] [L987] struct TSLL* null = malloc(sizeof(struct TSLL)); VAL [malloc(sizeof(struct TSLL))={15:0}, null={15:0}] [L988] FCALL null->next = ((void*)0) VAL [malloc(sizeof(struct TSLL))={15:0}, null={15:0}] [L989] FCALL null->prev = ((void*)0) VAL [malloc(sizeof(struct TSLL))={15:0}, null={15:0}] [L990] FCALL null->colour = BLACK VAL [malloc(sizeof(struct TSLL))={15:0}, null={15:0}] [L992] EXPR, FCALL malloc(sizeof(struct TSLL)) VAL [malloc(sizeof(struct TSLL))={17:0}, malloc(sizeof(struct TSLL))={15:0}, null={15:0}] [L992] struct TSLL* list = malloc(sizeof(struct TSLL)); VAL [list={17:0}, malloc(sizeof(struct TSLL))={17:0}, malloc(sizeof(struct TSLL))={15:0}, null={15:0}] [L993] FCALL list->next = null VAL [list={17:0}, malloc(sizeof(struct TSLL))={17:0}, malloc(sizeof(struct TSLL))={15:0}, null={15:0}] [L994] FCALL list->prev = null VAL [list={17:0}, malloc(sizeof(struct TSLL))={17:0}, malloc(sizeof(struct TSLL))={15:0}, null={15:0}] [L995] FCALL list->colour = BLACK VAL [list={17:0}, malloc(sizeof(struct TSLL))={17:0}, malloc(sizeof(struct TSLL))={15:0}, null={15:0}] [L997] struct TSLL* end = list; VAL [end={17:0}, list={17:0}, malloc(sizeof(struct TSLL))={17:0}, malloc(sizeof(struct TSLL))={15:0}, null={15:0}] [L1000] COND TRUE __VERIFIER_nondet_int() [L1003] EXPR, FCALL malloc(sizeof(struct TSLL)) VAL [end={17:0}, list={17:0}, malloc(sizeof(struct TSLL))={17:0}, malloc(sizeof(struct TSLL))={16:0}, malloc(sizeof(struct TSLL))={15:0}, null={15:0}] [L1003] FCALL end->next = malloc(sizeof(struct TSLL)) VAL [end={17:0}, list={17:0}, malloc(sizeof(struct TSLL))={17:0}, malloc(sizeof(struct TSLL))={16:0}, malloc(sizeof(struct TSLL))={15:0}, null={15:0}] [L1004] EXPR, FCALL end->next VAL [end={17:0}, end->next={16:0}, list={17:0}, malloc(sizeof(struct TSLL))={17:0}, malloc(sizeof(struct TSLL))={16:0}, malloc(sizeof(struct TSLL))={15:0}, null={15:0}] [L1004] FCALL end->next->prev = end VAL [end={17:0}, end->next={16:0}, list={17:0}, malloc(sizeof(struct TSLL))={17:0}, malloc(sizeof(struct TSLL))={16:0}, malloc(sizeof(struct TSLL))={15:0}, null={15:0}] [L1005] EXPR, FCALL end->next VAL [end={17:0}, end->next={16:0}, list={17:0}, malloc(sizeof(struct TSLL))={17:0}, malloc(sizeof(struct TSLL))={16:0}, malloc(sizeof(struct TSLL))={15:0}, null={15:0}] [L1005] end = end->next [L1006] FCALL end->next = null VAL [end={16:0}, list={17:0}, malloc(sizeof(struct TSLL))={17:0}, malloc(sizeof(struct TSLL))={16:0}, malloc(sizeof(struct TSLL))={15:0}, null={15:0}] [L1008] COND FALSE !(__VERIFIER_nondet_int()) [L1014] FCALL end->colour = RED VAL [end={16:0}, list={17:0}, malloc(sizeof(struct TSLL))={17:0}, malloc(sizeof(struct TSLL))={16:0}, malloc(sizeof(struct TSLL))={15:0}, null={15:0}] [L1015] EXPR, FCALL malloc(sizeof(struct TSLL)) VAL [end={16:0}, list={17:0}, malloc(sizeof(struct TSLL))={17:0}, malloc(sizeof(struct TSLL))={16:0}, malloc(sizeof(struct TSLL))={15:0}, malloc(sizeof(struct TSLL))={14:0}, null={15:0}] [L1015] FCALL end->next = malloc(sizeof(struct TSLL)) VAL [end={16:0}, list={17:0}, malloc(sizeof(struct TSLL))={17:0}, malloc(sizeof(struct TSLL))={16:0}, malloc(sizeof(struct TSLL))={15:0}, malloc(sizeof(struct TSLL))={14:0}, null={15:0}] [L1016] EXPR, FCALL end->next VAL [end={16:0}, end->next={14:0}, list={17:0}, malloc(sizeof(struct TSLL))={17:0}, malloc(sizeof(struct TSLL))={16:0}, malloc(sizeof(struct TSLL))={15:0}, malloc(sizeof(struct TSLL))={14:0}, null={15:0}] [L1016] FCALL end->next->prev = end VAL [end={16:0}, end->next={14:0}, list={17:0}, malloc(sizeof(struct TSLL))={17:0}, malloc(sizeof(struct TSLL))={16:0}, malloc(sizeof(struct TSLL))={15:0}, malloc(sizeof(struct TSLL))={14:0}, null={15:0}] [L1017] EXPR, FCALL end->next VAL [end={16:0}, end->next={14:0}, list={17:0}, malloc(sizeof(struct TSLL))={17:0}, malloc(sizeof(struct TSLL))={16:0}, malloc(sizeof(struct TSLL))={15:0}, malloc(sizeof(struct TSLL))={14:0}, null={15:0}] [L1017] end = end->next [L1018] FCALL end->next = null VAL [end={14:0}, list={17:0}, malloc(sizeof(struct TSLL))={17:0}, malloc(sizeof(struct TSLL))={16:0}, malloc(sizeof(struct TSLL))={15:0}, malloc(sizeof(struct TSLL))={14:0}, null={15:0}] [L1019] FCALL end->colour = BLACK VAL [end={14:0}, list={17:0}, malloc(sizeof(struct TSLL))={17:0}, malloc(sizeof(struct TSLL))={16:0}, malloc(sizeof(struct TSLL))={15:0}, malloc(sizeof(struct TSLL))={14:0}, null={15:0}] [L1021] EXPR, FCALL end->colour VAL [end={14:0}, end->colour=1, list={17:0}, malloc(sizeof(struct TSLL))={17:0}, malloc(sizeof(struct TSLL))={16:0}, malloc(sizeof(struct TSLL))={15:0}, malloc(sizeof(struct TSLL))={14:0}, null={15:0}] [L1021] COND FALSE !(!(BLACK == end->colour)) [L1021] COND FALSE !(0) VAL [end={14:0}, list={17:0}, malloc(sizeof(struct TSLL))={17:0}, malloc(sizeof(struct TSLL))={16:0}, malloc(sizeof(struct TSLL))={15:0}, malloc(sizeof(struct TSLL))={14:0}, null={15:0}] [L1022] EXPR, FCALL end->next VAL [end={14:0}, end->next={15:0}, list={17:0}, malloc(sizeof(struct TSLL))={17:0}, malloc(sizeof(struct TSLL))={16:0}, malloc(sizeof(struct TSLL))={15:0}, malloc(sizeof(struct TSLL))={14:0}, null={15:0}] [L1022] COND FALSE !(!(null == end->next)) [L1022] COND FALSE !(0) VAL [end={14:0}, list={17:0}, malloc(sizeof(struct TSLL))={17:0}, malloc(sizeof(struct TSLL))={16:0}, malloc(sizeof(struct TSLL))={15:0}, malloc(sizeof(struct TSLL))={14:0}, null={15:0}] [L1023] COND FALSE !(!(null != end)) VAL [end={14:0}, list={17:0}, malloc(sizeof(struct TSLL))={17:0}, malloc(sizeof(struct TSLL))={16:0}, malloc(sizeof(struct TSLL))={15:0}, malloc(sizeof(struct TSLL))={14:0}, null={15:0}] [L1023] COND FALSE !(0) VAL [end={14:0}, list={17:0}, malloc(sizeof(struct TSLL))={17:0}, malloc(sizeof(struct TSLL))={16:0}, malloc(sizeof(struct TSLL))={15:0}, malloc(sizeof(struct TSLL))={14:0}, null={15:0}] [L1000] COND FALSE !(__VERIFIER_nondet_int()) [L1026] end = null [L1027] end = list VAL [end={17:0}, list={17:0}, malloc(sizeof(struct TSLL))={17:0}, malloc(sizeof(struct TSLL))={16:0}, malloc(sizeof(struct TSLL))={15:0}, malloc(sizeof(struct TSLL))={14:0}, null={15:0}] [L1030] COND FALSE !(!(null != end)) VAL [end={17:0}, list={17:0}, malloc(sizeof(struct TSLL))={17:0}, malloc(sizeof(struct TSLL))={16:0}, malloc(sizeof(struct TSLL))={15:0}, malloc(sizeof(struct TSLL))={14:0}, null={15:0}] [L1030] COND FALSE !(0) VAL [end={17:0}, list={17:0}, malloc(sizeof(struct TSLL))={17:0}, malloc(sizeof(struct TSLL))={16:0}, malloc(sizeof(struct TSLL))={15:0}, malloc(sizeof(struct TSLL))={14:0}, null={15:0}] [L1031] EXPR, FCALL end->colour VAL [end={17:0}, end->colour=1, list={17:0}, malloc(sizeof(struct TSLL))={17:0}, malloc(sizeof(struct TSLL))={16:0}, malloc(sizeof(struct TSLL))={15:0}, malloc(sizeof(struct TSLL))={14:0}, null={15:0}] [L1031] COND FALSE !(!(BLACK == end->colour)) [L1031] COND FALSE !(0) VAL [end={17:0}, list={17:0}, malloc(sizeof(struct TSLL))={17:0}, malloc(sizeof(struct TSLL))={16:0}, malloc(sizeof(struct TSLL))={15:0}, malloc(sizeof(struct TSLL))={14:0}, null={15:0}] [L1032] COND TRUE null != end VAL [end={17:0}, list={17:0}, malloc(sizeof(struct TSLL))={17:0}, malloc(sizeof(struct TSLL))={16:0}, malloc(sizeof(struct TSLL))={15:0}, malloc(sizeof(struct TSLL))={14:0}, null={15:0}] [L1034] EXPR, FCALL end->colour VAL [end={17:0}, end->colour=1, list={17:0}, malloc(sizeof(struct TSLL))={17:0}, malloc(sizeof(struct TSLL))={16:0}, malloc(sizeof(struct TSLL))={15:0}, malloc(sizeof(struct TSLL))={14:0}, null={15:0}] [L1034] COND FALSE !(RED == end->colour) [L1041] EXPR, FCALL end->next VAL [end={17:0}, end->next={16:0}, list={17:0}, malloc(sizeof(struct TSLL))={17:0}, malloc(sizeof(struct TSLL))={16:0}, malloc(sizeof(struct TSLL))={15:0}, malloc(sizeof(struct TSLL))={14:0}, null={15:0}] [L1041] end = end->next [L1032] COND TRUE null != end VAL [end={16:0}, list={17:0}, malloc(sizeof(struct TSLL))={17:0}, malloc(sizeof(struct TSLL))={16:0}, malloc(sizeof(struct TSLL))={15:0}, malloc(sizeof(struct TSLL))={14:0}, null={15:0}] [L1034] EXPR, FCALL end->colour VAL [end={16:0}, end->colour=0, list={17:0}, malloc(sizeof(struct TSLL))={17:0}, malloc(sizeof(struct TSLL))={16:0}, malloc(sizeof(struct TSLL))={15:0}, malloc(sizeof(struct TSLL))={14:0}, null={15:0}] [L1034] COND TRUE RED == end->colour [L1036] EXPR, FCALL end->next VAL [end={16:0}, end->next={14:0}, list={17:0}, malloc(sizeof(struct TSLL))={17:0}, malloc(sizeof(struct TSLL))={16:0}, malloc(sizeof(struct TSLL))={15:0}, malloc(sizeof(struct TSLL))={14:0}, null={15:0}] [L1036] end = end->next [L1037] COND FALSE !(!(null != end)) VAL [end={14:0}, list={17:0}, malloc(sizeof(struct TSLL))={17:0}, malloc(sizeof(struct TSLL))={16:0}, malloc(sizeof(struct TSLL))={15:0}, malloc(sizeof(struct TSLL))={14:0}, null={15:0}] [L1037] COND FALSE !(0) VAL [end={14:0}, list={17:0}, malloc(sizeof(struct TSLL))={17:0}, malloc(sizeof(struct TSLL))={16:0}, malloc(sizeof(struct TSLL))={15:0}, malloc(sizeof(struct TSLL))={14:0}, null={15:0}] [L1038] EXPR, FCALL end->colour VAL [end={14:0}, end->colour=1, list={17:0}, malloc(sizeof(struct TSLL))={17:0}, malloc(sizeof(struct TSLL))={16:0}, malloc(sizeof(struct TSLL))={15:0}, malloc(sizeof(struct TSLL))={14:0}, null={15:0}] [L1038] COND TRUE !(BLACK != end->colour) [L1038] __VERIFIER_error() VAL [end={14:0}, list={17:0}, malloc(sizeof(struct TSLL))={17:0}, malloc(sizeof(struct TSLL))={16:0}, malloc(sizeof(struct TSLL))={15:0}, malloc(sizeof(struct TSLL))={14:0}, null={15:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 107 locations, 7 error locations. UNSAFE Result, 26.1s OverallTime, 16 OverallIterations, 3 TraceHistogramMax, 16.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 984 SDtfs, 8576 SDslu, 7247 SDs, 0 SdLazy, 8068 SolverSat, 1317 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 5.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 895 GetRequests, 368 SyntacticMatches, 20 SemanticMatches, 507 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6665 ImplicationChecksByTransitivity, 15.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=250occurred in iteration=12, 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: 0.1s AutomataMinimizationTime, 15 MinimizatonAttempts, 398 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 9.1s InterpolantComputationTime, 1270 NumberOfCodeBlocks, 1270 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 1168 ConstructedInterpolants, 116 QuantifiedInterpolants, 1726143 SizeOfPredicates, 133 NumberOfNonLiveVariables, 1217 ConjunctsInSsa, 303 ConjunctsInUnsatCore, 22 InterpolantComputations, 8 PerfectInterpolantSequences, 26/170 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...