./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/memsafety-ext2/length_test03_true-valid-memsafety.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_4369ccf2-83a9-42f3-87f7-0dd3089303ed/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_4369ccf2-83a9-42f3-87f7-0dd3089303ed/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_4369ccf2-83a9-42f3-87f7-0dd3089303ed/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_4369ccf2-83a9-42f3-87f7-0dd3089303ed/bin-2019/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety-ext2/length_test03_true-valid-memsafety.i -s /tmp/vcloud-vcloud-master/worker/working_dir_4369ccf2-83a9-42f3-87f7-0dd3089303ed/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_4369ccf2-83a9-42f3-87f7-0dd3089303ed/bin-2019/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7db66fa755812d372ccac4d56a0ec85104dbcc6e ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_4369ccf2-83a9-42f3-87f7-0dd3089303ed/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_4369ccf2-83a9-42f3-87f7-0dd3089303ed/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_4369ccf2-83a9-42f3-87f7-0dd3089303ed/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_4369ccf2-83a9-42f3-87f7-0dd3089303ed/bin-2019/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety-ext2/length_test03_true-valid-memsafety.i -s /tmp/vcloud-vcloud-master/worker/working_dir_4369ccf2-83a9-42f3-87f7-0dd3089303ed/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_4369ccf2-83a9-42f3-87f7-0dd3089303ed/bin-2019/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7db66fa755812d372ccac4d56a0ec85104dbcc6e ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: UnsupportedOperationException: nested self-update not yet implemented: (store v_prenex_131 (bvadd v_prenex_76 (_ bv1 32)) (_ bv0 32)) --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 01:25:28,971 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 01:25:28,972 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 01:25:28,979 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 01:25:28,979 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 01:25:28,980 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 01:25:28,980 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 01:25:28,982 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 01:25:28,983 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 01:25:28,983 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 01:25:28,984 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 01:25:28,984 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 01:25:28,985 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 01:25:28,985 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 01:25:28,986 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 01:25:28,986 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 01:25:28,987 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 01:25:28,988 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 01:25:28,989 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 01:25:28,990 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 01:25:28,991 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 01:25:28,992 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 01:25:28,993 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 01:25:28,994 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 01:25:28,994 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 01:25:28,995 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 01:25:28,995 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 01:25:28,996 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 01:25:28,996 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 01:25:28,997 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 01:25:28,997 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 01:25:28,998 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 01:25:28,998 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 01:25:28,998 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 01:25:28,998 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 01:25:28,999 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 01:25:28,999 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_4369ccf2-83a9-42f3-87f7-0dd3089303ed/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2018-11-23 01:25:29,009 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 01:25:29,009 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 01:25:29,010 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 01:25:29,010 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 01:25:29,010 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-23 01:25:29,010 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-23 01:25:29,010 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-23 01:25:29,010 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-23 01:25:29,011 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-23 01:25:29,011 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-23 01:25:29,011 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-23 01:25:29,011 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-23 01:25:29,011 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-23 01:25:29,011 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 01:25:29,011 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 01:25:29,012 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 01:25:29,012 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 01:25:29,012 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 01:25:29,012 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 01:25:29,012 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 01:25:29,012 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 01:25:29,012 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-11-23 01:25:29,012 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-11-23 01:25:29,013 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-11-23 01:25:29,013 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 01:25:29,013 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 01:25:29,013 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 01:25:29,013 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 01:25:29,013 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 01:25:29,013 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 01:25:29,013 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 01:25:29,013 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 01:25:29,013 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 01:25:29,014 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 01:25:29,014 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-23 01:25:29,014 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 01:25:29,014 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 01:25:29,014 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_4369ccf2-83a9-42f3-87f7-0dd3089303ed/bin-2019/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7db66fa755812d372ccac4d56a0ec85104dbcc6e [2018-11-23 01:25:29,034 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 01:25:29,042 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 01:25:29,043 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 01:25:29,044 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 01:25:29,045 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 01:25:29,045 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_4369ccf2-83a9-42f3-87f7-0dd3089303ed/bin-2019/utaipan/../../sv-benchmarks/c/memsafety-ext2/length_test03_true-valid-memsafety.i [2018-11-23 01:25:29,080 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4369ccf2-83a9-42f3-87f7-0dd3089303ed/bin-2019/utaipan/data/84d32103b/93989a154120407da03db8a65567f606/FLAGfaea58977 [2018-11-23 01:25:29,524 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 01:25:29,524 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_4369ccf2-83a9-42f3-87f7-0dd3089303ed/sv-benchmarks/c/memsafety-ext2/length_test03_true-valid-memsafety.i [2018-11-23 01:25:29,532 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4369ccf2-83a9-42f3-87f7-0dd3089303ed/bin-2019/utaipan/data/84d32103b/93989a154120407da03db8a65567f606/FLAGfaea58977 [2018-11-23 01:25:29,541 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_4369ccf2-83a9-42f3-87f7-0dd3089303ed/bin-2019/utaipan/data/84d32103b/93989a154120407da03db8a65567f606 [2018-11-23 01:25:29,543 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 01:25:29,544 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 01:25:29,545 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 01:25:29,545 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 01:25:29,548 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 01:25:29,548 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:25:29" (1/1) ... [2018-11-23 01:25:29,550 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28603259 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:25:29, skipping insertion in model container [2018-11-23 01:25:29,551 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:25:29" (1/1) ... [2018-11-23 01:25:29,559 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 01:25:29,589 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 01:25:29,775 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 01:25:29,782 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 01:25:29,858 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 01:25:29,881 INFO L195 MainTranslator]: Completed translation [2018-11-23 01:25:29,882 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:25:29 WrapperNode [2018-11-23 01:25:29,882 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 01:25:29,882 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 01:25:29,882 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 01:25:29,883 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 01:25:29,887 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:25:29" (1/1) ... [2018-11-23 01:25:29,898 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:25:29" (1/1) ... [2018-11-23 01:25:29,905 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 01:25:29,905 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 01:25:29,905 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 01:25:29,905 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 01:25:29,912 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:25:29" (1/1) ... [2018-11-23 01:25:29,912 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:25:29" (1/1) ... [2018-11-23 01:25:29,914 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:25:29" (1/1) ... [2018-11-23 01:25:29,914 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:25:29" (1/1) ... [2018-11-23 01:25:29,924 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:25:29" (1/1) ... [2018-11-23 01:25:29,927 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:25:29" (1/1) ... [2018-11-23 01:25:29,928 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:25:29" (1/1) ... [2018-11-23 01:25:29,930 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 01:25:29,930 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 01:25:29,930 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 01:25:29,930 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 01:25:29,931 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:25:29" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4369ccf2-83a9-42f3-87f7-0dd3089303ed/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 01:25:29,962 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 01:25:29,962 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 01:25:29,962 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 01:25:29,962 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 01:25:29,962 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 01:25:29,962 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 01:25:29,963 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-23 01:25:29,963 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-23 01:25:29,963 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 01:25:29,963 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 01:25:29,963 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 01:25:29,963 INFO L130 BoogieDeclarations]: Found specification of procedure append [2018-11-23 01:25:29,963 INFO L138 BoogieDeclarations]: Found implementation of procedure append [2018-11-23 01:25:30,310 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 01:25:30,311 INFO L280 CfgBuilder]: Removed 4 assue(true) statements. [2018-11-23 01:25:30,311 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:25:30 BoogieIcfgContainer [2018-11-23 01:25:30,311 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 01:25:30,312 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 01:25:30,312 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 01:25:30,314 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 01:25:30,314 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 01:25:29" (1/3) ... [2018-11-23 01:25:30,315 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e2f6a96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:25:30, skipping insertion in model container [2018-11-23 01:25:30,315 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:25:29" (2/3) ... [2018-11-23 01:25:30,315 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e2f6a96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:25:30, skipping insertion in model container [2018-11-23 01:25:30,316 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:25:30" (3/3) ... [2018-11-23 01:25:30,317 INFO L112 eAbstractionObserver]: Analyzing ICFG length_test03_true-valid-memsafety.i [2018-11-23 01:25:30,325 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 01:25:30,331 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 55 error locations. [2018-11-23 01:25:30,341 INFO L257 AbstractCegarLoop]: Starting to check reachability of 55 error locations. [2018-11-23 01:25:30,359 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 01:25:30,360 INFO L383 AbstractCegarLoop]: Hoare is false [2018-11-23 01:25:30,360 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 01:25:30,360 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 01:25:30,360 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 01:25:30,360 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 01:25:30,360 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 01:25:30,360 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 01:25:30,372 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states. [2018-11-23 01:25:30,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-11-23 01:25:30,378 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:25:30,379 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-23 01:25:30,380 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr24ASSERT_VIOLATIONMEMORY_FREE, appendErr21REQUIRES_VIOLATION, appendErr22REQUIRES_VIOLATION, appendErr23REQUIRES_VIOLATION, appendErr18REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr19REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr20REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr24REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr25REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr16REQUIRES_VIOLATION, appendErr17REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION]=== [2018-11-23 01:25:30,384 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:25:30,385 INFO L82 PathProgramCache]: Analyzing trace with hash 668399984, now seen corresponding path program 1 times [2018-11-23 01:25:30,387 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 01:25:30,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:25:30,420 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:25:30,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:25:30,421 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 01:25:30,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:25:30,491 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-23 01:25:30,492 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:25:30,492 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 01:25:30,493 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 01:25:30,495 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 01:25:30,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 01:25:30,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 01:25:30,505 INFO L87 Difference]: Start difference. First operand 125 states. Second operand 3 states. [2018-11-23 01:25:30,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:25:30,642 INFO L93 Difference]: Finished difference Result 156 states and 165 transitions. [2018-11-23 01:25:30,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 01:25:30,643 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-11-23 01:25:30,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:25:30,649 INFO L225 Difference]: With dead ends: 156 [2018-11-23 01:25:30,649 INFO L226 Difference]: Without dead ends: 153 [2018-11-23 01:25:30,650 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 01:25:30,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-11-23 01:25:30,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 120. [2018-11-23 01:25:30,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-11-23 01:25:30,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 126 transitions. [2018-11-23 01:25:30,677 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 126 transitions. Word has length 7 [2018-11-23 01:25:30,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:25:30,677 INFO L480 AbstractCegarLoop]: Abstraction has 120 states and 126 transitions. [2018-11-23 01:25:30,677 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 01:25:30,678 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 126 transitions. [2018-11-23 01:25:30,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-11-23 01:25:30,678 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:25:30,678 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-23 01:25:30,678 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr24ASSERT_VIOLATIONMEMORY_FREE, appendErr21REQUIRES_VIOLATION, appendErr22REQUIRES_VIOLATION, appendErr23REQUIRES_VIOLATION, appendErr18REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr19REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr20REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr24REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr25REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr16REQUIRES_VIOLATION, appendErr17REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION]=== [2018-11-23 01:25:30,679 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:25:30,679 INFO L82 PathProgramCache]: Analyzing trace with hash 668399985, now seen corresponding path program 1 times [2018-11-23 01:25:30,679 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 01:25:30,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:25:30,680 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:25:30,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:25:30,680 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 01:25:30,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:25:30,711 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-23 01:25:30,711 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:25:30,711 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 01:25:30,712 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 01:25:30,713 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 01:25:30,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 01:25:30,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 01:25:30,713 INFO L87 Difference]: Start difference. First operand 120 states and 126 transitions. Second operand 3 states. [2018-11-23 01:25:30,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:25:30,789 INFO L93 Difference]: Finished difference Result 120 states and 127 transitions. [2018-11-23 01:25:30,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 01:25:30,790 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-11-23 01:25:30,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:25:30,791 INFO L225 Difference]: With dead ends: 120 [2018-11-23 01:25:30,791 INFO L226 Difference]: Without dead ends: 120 [2018-11-23 01:25:30,791 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 01:25:30,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-11-23 01:25:30,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 118. [2018-11-23 01:25:30,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-11-23 01:25:30,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 124 transitions. [2018-11-23 01:25:30,798 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 124 transitions. Word has length 7 [2018-11-23 01:25:30,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:25:30,798 INFO L480 AbstractCegarLoop]: Abstraction has 118 states and 124 transitions. [2018-11-23 01:25:30,798 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 01:25:30,799 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 124 transitions. [2018-11-23 01:25:30,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-23 01:25:30,799 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:25:30,799 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 01:25:30,799 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr24ASSERT_VIOLATIONMEMORY_FREE, appendErr21REQUIRES_VIOLATION, appendErr22REQUIRES_VIOLATION, appendErr23REQUIRES_VIOLATION, appendErr18REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr19REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr20REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr24REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr25REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr16REQUIRES_VIOLATION, appendErr17REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION]=== [2018-11-23 01:25:30,800 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:25:30,800 INFO L82 PathProgramCache]: Analyzing trace with hash 835518332, now seen corresponding path program 1 times [2018-11-23 01:25:30,800 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 01:25:30,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:25:30,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:25:30,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:25:30,801 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 01:25:30,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:25:30,835 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-23 01:25:30,835 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:25:30,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 01:25:30,835 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 01:25:30,835 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 01:25:30,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 01:25:30,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 01:25:30,836 INFO L87 Difference]: Start difference. First operand 118 states and 124 transitions. Second operand 3 states. [2018-11-23 01:25:30,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:25:30,942 INFO L93 Difference]: Finished difference Result 131 states and 139 transitions. [2018-11-23 01:25:30,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 01:25:30,942 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-11-23 01:25:30,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:25:30,943 INFO L225 Difference]: With dead ends: 131 [2018-11-23 01:25:30,943 INFO L226 Difference]: Without dead ends: 131 [2018-11-23 01:25:30,944 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 01:25:30,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-11-23 01:25:30,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 120. [2018-11-23 01:25:30,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-11-23 01:25:30,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 128 transitions. [2018-11-23 01:25:30,950 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 128 transitions. Word has length 10 [2018-11-23 01:25:30,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:25:30,951 INFO L480 AbstractCegarLoop]: Abstraction has 120 states and 128 transitions. [2018-11-23 01:25:30,951 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 01:25:30,951 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 128 transitions. [2018-11-23 01:25:30,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-23 01:25:30,951 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:25:30,951 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 01:25:30,952 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr24ASSERT_VIOLATIONMEMORY_FREE, appendErr21REQUIRES_VIOLATION, appendErr22REQUIRES_VIOLATION, appendErr23REQUIRES_VIOLATION, appendErr18REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr19REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr20REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr24REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr25REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr16REQUIRES_VIOLATION, appendErr17REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION]=== [2018-11-23 01:25:30,952 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:25:30,952 INFO L82 PathProgramCache]: Analyzing trace with hash 835518333, now seen corresponding path program 1 times [2018-11-23 01:25:30,952 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 01:25:30,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:25:30,953 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:25:30,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:25:30,953 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 01:25:30,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:25:30,988 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-23 01:25:30,988 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:25:30,988 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 01:25:30,988 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 01:25:30,988 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 01:25:30,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 01:25:30,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 01:25:30,989 INFO L87 Difference]: Start difference. First operand 120 states and 128 transitions. Second operand 3 states. [2018-11-23 01:25:31,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:25:31,043 INFO L93 Difference]: Finished difference Result 120 states and 129 transitions. [2018-11-23 01:25:31,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 01:25:31,044 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-11-23 01:25:31,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:25:31,044 INFO L225 Difference]: With dead ends: 120 [2018-11-23 01:25:31,044 INFO L226 Difference]: Without dead ends: 120 [2018-11-23 01:25:31,045 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 01:25:31,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-11-23 01:25:31,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 118. [2018-11-23 01:25:31,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-11-23 01:25:31,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 126 transitions. [2018-11-23 01:25:31,050 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 126 transitions. Word has length 10 [2018-11-23 01:25:31,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:25:31,051 INFO L480 AbstractCegarLoop]: Abstraction has 118 states and 126 transitions. [2018-11-23 01:25:31,051 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 01:25:31,051 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 126 transitions. [2018-11-23 01:25:31,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 01:25:31,051 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:25:31,051 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 01:25:31,051 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr24ASSERT_VIOLATIONMEMORY_FREE, appendErr21REQUIRES_VIOLATION, appendErr22REQUIRES_VIOLATION, appendErr23REQUIRES_VIOLATION, appendErr18REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr19REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr20REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr24REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr25REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr16REQUIRES_VIOLATION, appendErr17REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION]=== [2018-11-23 01:25:31,051 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:25:31,052 INFO L82 PathProgramCache]: Analyzing trace with hash -2066310278, now seen corresponding path program 1 times [2018-11-23 01:25:31,052 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 01:25:31,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:25:31,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:25:31,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:25:31,052 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 01:25:31,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:25:31,090 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-23 01:25:31,091 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:25:31,091 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 01:25:31,091 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 01:25:31,091 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 01:25:31,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 01:25:31,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 01:25:31,091 INFO L87 Difference]: Start difference. First operand 118 states and 126 transitions. Second operand 3 states. [2018-11-23 01:25:31,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:25:31,148 INFO L93 Difference]: Finished difference Result 113 states and 121 transitions. [2018-11-23 01:25:31,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 01:25:31,149 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-11-23 01:25:31,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:25:31,149 INFO L225 Difference]: With dead ends: 113 [2018-11-23 01:25:31,149 INFO L226 Difference]: Without dead ends: 113 [2018-11-23 01:25:31,150 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 01:25:31,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-11-23 01:25:31,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2018-11-23 01:25:31,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-11-23 01:25:31,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 121 transitions. [2018-11-23 01:25:31,154 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 121 transitions. Word has length 16 [2018-11-23 01:25:31,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:25:31,155 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 121 transitions. [2018-11-23 01:25:31,155 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 01:25:31,155 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 121 transitions. [2018-11-23 01:25:31,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 01:25:31,155 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:25:31,155 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 01:25:31,156 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr24ASSERT_VIOLATIONMEMORY_FREE, appendErr21REQUIRES_VIOLATION, appendErr22REQUIRES_VIOLATION, appendErr23REQUIRES_VIOLATION, appendErr18REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr19REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr20REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr24REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr25REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr16REQUIRES_VIOLATION, appendErr17REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION]=== [2018-11-23 01:25:31,156 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:25:31,156 INFO L82 PathProgramCache]: Analyzing trace with hash -2066310277, now seen corresponding path program 1 times [2018-11-23 01:25:31,156 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 01:25:31,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:25:31,157 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:25:31,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:25:31,157 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 01:25:31,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:25:31,187 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-23 01:25:31,187 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:25:31,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 01:25:31,187 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 01:25:31,187 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 01:25:31,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 01:25:31,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 01:25:31,188 INFO L87 Difference]: Start difference. First operand 113 states and 121 transitions. Second operand 3 states. [2018-11-23 01:25:31,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:25:31,234 INFO L93 Difference]: Finished difference Result 108 states and 116 transitions. [2018-11-23 01:25:31,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 01:25:31,235 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-11-23 01:25:31,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:25:31,235 INFO L225 Difference]: With dead ends: 108 [2018-11-23 01:25:31,235 INFO L226 Difference]: Without dead ends: 108 [2018-11-23 01:25:31,236 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 01:25:31,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-11-23 01:25:31,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2018-11-23 01:25:31,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-11-23 01:25:31,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 116 transitions. [2018-11-23 01:25:31,240 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 116 transitions. Word has length 16 [2018-11-23 01:25:31,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:25:31,240 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 116 transitions. [2018-11-23 01:25:31,240 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 01:25:31,240 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 116 transitions. [2018-11-23 01:25:31,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 01:25:31,241 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:25:31,241 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 01:25:31,241 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr24ASSERT_VIOLATIONMEMORY_FREE, appendErr21REQUIRES_VIOLATION, appendErr22REQUIRES_VIOLATION, appendErr23REQUIRES_VIOLATION, appendErr18REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr19REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr20REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr24REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr25REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr16REQUIRES_VIOLATION, appendErr17REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION]=== [2018-11-23 01:25:31,242 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:25:31,242 INFO L82 PathProgramCache]: Analyzing trace with hash 368890914, now seen corresponding path program 1 times [2018-11-23 01:25:31,242 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 01:25:31,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:25:31,243 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:25:31,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:25:31,243 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 01:25:31,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:25:31,313 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-23 01:25:31,314 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:25:31,314 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 01:25:31,314 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 01:25:31,314 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 01:25:31,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 01:25:31,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-23 01:25:31,314 INFO L87 Difference]: Start difference. First operand 108 states and 116 transitions. Second operand 6 states. [2018-11-23 01:25:31,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:25:31,464 INFO L93 Difference]: Finished difference Result 167 states and 180 transitions. [2018-11-23 01:25:31,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 01:25:31,465 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-11-23 01:25:31,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:25:31,465 INFO L225 Difference]: With dead ends: 167 [2018-11-23 01:25:31,466 INFO L226 Difference]: Without dead ends: 167 [2018-11-23 01:25:31,466 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-23 01:25:31,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-11-23 01:25:31,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 126. [2018-11-23 01:25:31,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-11-23 01:25:31,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 146 transitions. [2018-11-23 01:25:31,471 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 146 transitions. Word has length 17 [2018-11-23 01:25:31,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:25:31,471 INFO L480 AbstractCegarLoop]: Abstraction has 126 states and 146 transitions. [2018-11-23 01:25:31,471 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 01:25:31,471 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 146 transitions. [2018-11-23 01:25:31,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 01:25:31,472 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:25:31,472 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 01:25:31,472 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr24ASSERT_VIOLATIONMEMORY_FREE, appendErr21REQUIRES_VIOLATION, appendErr22REQUIRES_VIOLATION, appendErr23REQUIRES_VIOLATION, appendErr18REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr19REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr20REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr24REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr25REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr16REQUIRES_VIOLATION, appendErr17REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION]=== [2018-11-23 01:25:31,472 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:25:31,472 INFO L82 PathProgramCache]: Analyzing trace with hash 368890915, now seen corresponding path program 1 times [2018-11-23 01:25:31,473 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 01:25:31,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:25:31,473 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:25:31,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:25:31,473 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 01:25:31,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:25:31,553 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-23 01:25:31,553 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:25:31,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 01:25:31,553 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 01:25:31,553 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 01:25:31,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 01:25:31,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-23 01:25:31,554 INFO L87 Difference]: Start difference. First operand 126 states and 146 transitions. Second operand 6 states. [2018-11-23 01:25:31,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:25:31,666 INFO L93 Difference]: Finished difference Result 152 states and 174 transitions. [2018-11-23 01:25:31,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 01:25:31,666 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-11-23 01:25:31,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:25:31,667 INFO L225 Difference]: With dead ends: 152 [2018-11-23 01:25:31,667 INFO L226 Difference]: Without dead ends: 152 [2018-11-23 01:25:31,668 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-23 01:25:31,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-11-23 01:25:31,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 150. [2018-11-23 01:25:31,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-11-23 01:25:31,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 174 transitions. [2018-11-23 01:25:31,672 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 174 transitions. Word has length 17 [2018-11-23 01:25:31,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:25:31,672 INFO L480 AbstractCegarLoop]: Abstraction has 150 states and 174 transitions. [2018-11-23 01:25:31,672 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 01:25:31,672 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 174 transitions. [2018-11-23 01:25:31,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 01:25:31,673 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:25:31,673 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 01:25:31,673 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr24ASSERT_VIOLATIONMEMORY_FREE, appendErr21REQUIRES_VIOLATION, appendErr22REQUIRES_VIOLATION, appendErr23REQUIRES_VIOLATION, appendErr18REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr19REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr20REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr24REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr25REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr16REQUIRES_VIOLATION, appendErr17REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION]=== [2018-11-23 01:25:31,673 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:25:31,674 INFO L82 PathProgramCache]: Analyzing trace with hash 972093909, now seen corresponding path program 1 times [2018-11-23 01:25:31,674 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 01:25:31,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:25:31,674 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:25:31,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:25:31,674 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 01:25:31,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:25:31,897 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-23 01:25:31,897 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:25:31,898 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-23 01:25:31,898 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 01:25:31,898 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 01:25:31,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 01:25:31,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-11-23 01:25:31,899 INFO L87 Difference]: Start difference. First operand 150 states and 174 transitions. Second operand 10 states. [2018-11-23 01:25:32,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:25:32,082 INFO L93 Difference]: Finished difference Result 182 states and 205 transitions. [2018-11-23 01:25:32,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 01:25:32,082 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 26 [2018-11-23 01:25:32,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:25:32,083 INFO L225 Difference]: With dead ends: 182 [2018-11-23 01:25:32,083 INFO L226 Difference]: Without dead ends: 182 [2018-11-23 01:25:32,083 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2018-11-23 01:25:32,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-11-23 01:25:32,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 150. [2018-11-23 01:25:32,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-11-23 01:25:32,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 173 transitions. [2018-11-23 01:25:32,086 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 173 transitions. Word has length 26 [2018-11-23 01:25:32,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:25:32,087 INFO L480 AbstractCegarLoop]: Abstraction has 150 states and 173 transitions. [2018-11-23 01:25:32,087 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 01:25:32,087 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 173 transitions. [2018-11-23 01:25:32,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-23 01:25:32,087 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:25:32,087 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 01:25:32,087 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr24ASSERT_VIOLATIONMEMORY_FREE, appendErr21REQUIRES_VIOLATION, appendErr22REQUIRES_VIOLATION, appendErr23REQUIRES_VIOLATION, appendErr18REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr19REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr20REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr24REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr25REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr16REQUIRES_VIOLATION, appendErr17REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION]=== [2018-11-23 01:25:32,088 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:25:32,088 INFO L82 PathProgramCache]: Analyzing trace with hash 240644120, now seen corresponding path program 1 times [2018-11-23 01:25:32,088 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 01:25:32,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:25:32,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:25:32,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:25:32,089 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 01:25:32,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:25:32,277 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-23 01:25:32,277 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:25:32,277 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-23 01:25:32,278 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 01:25:32,278 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 01:25:32,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 01:25:32,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-23 01:25:32,279 INFO L87 Difference]: Start difference. First operand 150 states and 173 transitions. Second operand 9 states. [2018-11-23 01:25:32,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:25:32,453 INFO L93 Difference]: Finished difference Result 142 states and 162 transitions. [2018-11-23 01:25:32,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 01:25:32,453 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 28 [2018-11-23 01:25:32,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:25:32,454 INFO L225 Difference]: With dead ends: 142 [2018-11-23 01:25:32,454 INFO L226 Difference]: Without dead ends: 142 [2018-11-23 01:25:32,455 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 8 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2018-11-23 01:25:32,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-11-23 01:25:32,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2018-11-23 01:25:32,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-11-23 01:25:32,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 162 transitions. [2018-11-23 01:25:32,457 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 162 transitions. Word has length 28 [2018-11-23 01:25:32,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:25:32,457 INFO L480 AbstractCegarLoop]: Abstraction has 142 states and 162 transitions. [2018-11-23 01:25:32,457 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 01:25:32,457 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 162 transitions. [2018-11-23 01:25:32,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-23 01:25:32,458 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:25:32,458 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 01:25:32,458 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr24ASSERT_VIOLATIONMEMORY_FREE, appendErr21REQUIRES_VIOLATION, appendErr22REQUIRES_VIOLATION, appendErr23REQUIRES_VIOLATION, appendErr18REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr19REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr20REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr24REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr25REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr16REQUIRES_VIOLATION, appendErr17REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION]=== [2018-11-23 01:25:32,459 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:25:32,459 INFO L82 PathProgramCache]: Analyzing trace with hash -779933572, now seen corresponding path program 1 times [2018-11-23 01:25:32,459 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 01:25:32,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:25:32,459 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:25:32,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:25:32,460 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 01:25:32,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:25:32,498 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-23 01:25:32,498 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:25:32,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 01:25:32,499 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 01:25:32,499 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 01:25:32,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 01:25:32,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 01:25:32,499 INFO L87 Difference]: Start difference. First operand 142 states and 162 transitions. Second operand 3 states. [2018-11-23 01:25:32,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:25:32,507 INFO L93 Difference]: Finished difference Result 149 states and 166 transitions. [2018-11-23 01:25:32,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 01:25:32,508 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2018-11-23 01:25:32,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:25:32,508 INFO L225 Difference]: With dead ends: 149 [2018-11-23 01:25:32,509 INFO L226 Difference]: Without dead ends: 149 [2018-11-23 01:25:32,509 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 01:25:32,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-11-23 01:25:32,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 138. [2018-11-23 01:25:32,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-11-23 01:25:32,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 154 transitions. [2018-11-23 01:25:32,512 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 154 transitions. Word has length 33 [2018-11-23 01:25:32,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:25:32,512 INFO L480 AbstractCegarLoop]: Abstraction has 138 states and 154 transitions. [2018-11-23 01:25:32,512 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 01:25:32,512 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 154 transitions. [2018-11-23 01:25:32,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-23 01:25:32,513 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:25:32,513 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 01:25:32,513 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr24ASSERT_VIOLATIONMEMORY_FREE, appendErr21REQUIRES_VIOLATION, appendErr22REQUIRES_VIOLATION, appendErr23REQUIRES_VIOLATION, appendErr18REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr19REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr20REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr24REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr25REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr16REQUIRES_VIOLATION, appendErr17REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION]=== [2018-11-23 01:25:32,514 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:25:32,514 INFO L82 PathProgramCache]: Analyzing trace with hash -2141558323, now seen corresponding path program 1 times [2018-11-23 01:25:32,514 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 01:25:32,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:25:32,514 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:25:32,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:25:32,515 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 01:25:32,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:25:32,662 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 01:25:32,662 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 01:25:32,662 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 01:25:32,663 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 36 with the following transitions: [2018-11-23 01:25:32,664 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [6], [9], [12], [13], [16], [19], [23], [26], [31], [118], [119], [122], [124], [125], [128], [129], [132], [138], [139], [142], [145], [148], [172], [173], [174], [175], [177], [178] [2018-11-23 01:25:32,685 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 01:25:32,685 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 01:25:32,818 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-23 01:25:32,818 INFO L272 AbstractInterpreter]: Visited 31 different actions 31 times. Never merged. Never widened. Performed 282 root evaluator evaluations with a maximum evaluation depth of 3. Performed 282 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 29 variables. [2018-11-23 01:25:32,823 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:25:32,824 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-23 01:25:32,824 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 01:25:32,824 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4369ccf2-83a9-42f3-87f7-0dd3089303ed/bin-2019/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 01:25:32,833 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:25:32,833 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-23 01:25:32,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:25:32,880 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 01:25:33,001 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 01:25:33,002 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 01:25:33,006 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-23 01:25:33,006 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 01:25:33,016 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-11-23 01:25:33,017 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 01:25:33,024 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 01:25:33,024 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:18 [2018-11-23 01:25:33,054 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 01:25:33,054 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 01:25:33,216 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2018-11-23 01:25:33,216 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 01:25:33,222 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 01:25:33,223 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 01:25:33,223 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 7 [2018-11-23 01:25:33,223 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 01:25:33,227 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 01:25:33,227 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:7 [2018-11-23 01:25:33,262 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 01:25:33,262 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 01:25:33,263 INFO L478 Elim1Store]: Elim1 did not use 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 13 [2018-11-23 01:25:33,263 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 01:25:33,267 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-23 01:25:33,267 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2018-11-23 01:25:33,287 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 01:25:33,287 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 01:25:33,287 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 3 [2018-11-23 01:25:33,287 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 01:25:33,290 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-23 01:25:33,291 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:3 [2018-11-23 01:25:33,302 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 01:25:33,317 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 01:25:33,317 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 21 [2018-11-23 01:25:33,317 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 01:25:33,317 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-23 01:25:33,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-23 01:25:33,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=394, Unknown=0, NotChecked=0, Total=462 [2018-11-23 01:25:33,318 INFO L87 Difference]: Start difference. First operand 138 states and 154 transitions. Second operand 17 states. [2018-11-23 01:25:33,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:25:33,742 INFO L93 Difference]: Finished difference Result 172 states and 183 transitions. [2018-11-23 01:25:33,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 01:25:33,743 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 35 [2018-11-23 01:25:33,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:25:33,744 INFO L225 Difference]: With dead ends: 172 [2018-11-23 01:25:33,744 INFO L226 Difference]: Without dead ends: 172 [2018-11-23 01:25:33,744 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 55 SyntacticMatches, 4 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=116, Invalid=534, Unknown=0, NotChecked=0, Total=650 [2018-11-23 01:25:33,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-11-23 01:25:33,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 137. [2018-11-23 01:25:33,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-11-23 01:25:33,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 146 transitions. [2018-11-23 01:25:33,748 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 146 transitions. Word has length 35 [2018-11-23 01:25:33,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:25:33,749 INFO L480 AbstractCegarLoop]: Abstraction has 137 states and 146 transitions. [2018-11-23 01:25:33,749 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-23 01:25:33,749 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 146 transitions. [2018-11-23 01:25:33,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-23 01:25:33,752 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:25:33,752 INFO L402 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] [2018-11-23 01:25:33,753 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr24ASSERT_VIOLATIONMEMORY_FREE, appendErr21REQUIRES_VIOLATION, appendErr22REQUIRES_VIOLATION, appendErr23REQUIRES_VIOLATION, appendErr18REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr19REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr20REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr24REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr25REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr16REQUIRES_VIOLATION, appendErr17REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION]=== [2018-11-23 01:25:33,753 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:25:33,753 INFO L82 PathProgramCache]: Analyzing trace with hash 777775617, now seen corresponding path program 1 times [2018-11-23 01:25:33,753 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 01:25:33,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:25:33,754 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:25:33,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:25:33,754 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 01:25:33,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:25:33,817 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-23 01:25:33,818 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 01:25:33,818 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 01:25:33,818 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 37 with the following transitions: [2018-11-23 01:25:33,818 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [6], [9], [12], [13], [16], [19], [23], [26], [29], [35], [43], [118], [119], [122], [123], [125], [128], [129], [132], [138], [139], [142], [145], [148], [172], [173], [174], [175], [177], [178], [179] [2018-11-23 01:25:33,819 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 01:25:33,820 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 01:25:33,889 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-23 01:25:33,889 INFO L272 AbstractInterpreter]: Visited 34 different actions 48 times. Never merged. Never widened. Performed 448 root evaluator evaluations with a maximum evaluation depth of 3. Performed 448 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 30 variables. [2018-11-23 01:25:33,901 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:25:33,902 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-23 01:25:33,902 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 01:25:33,902 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4369ccf2-83a9-42f3-87f7-0dd3089303ed/bin-2019/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 01:25:33,914 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:25:33,914 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-23 01:25:33,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:25:33,952 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 01:25:35,510 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-23 01:25:35,510 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 01:25:35,513 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-23 01:25:35,513 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:11 [2018-11-23 01:25:35,517 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-23 01:25:35,517 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 01:25:35,519 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 01:25:35,519 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-11-23 01:25:35,984 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 01:25:35,984 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 01:25:36,077 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-23 01:25:36,102 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 01:25:36,102 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 7] total 13 [2018-11-23 01:25:36,102 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 01:25:36,102 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 01:25:36,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 01:25:36,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=135, Unknown=5, NotChecked=0, Total=182 [2018-11-23 01:25:36,103 INFO L87 Difference]: Start difference. First operand 137 states and 146 transitions. Second operand 11 states. [2018-11-23 01:25:57,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:25:57,390 INFO L93 Difference]: Finished difference Result 157 states and 165 transitions. [2018-11-23 01:25:57,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 01:25:57,391 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 36 [2018-11-23 01:25:57,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:25:57,391 INFO L225 Difference]: With dead ends: 157 [2018-11-23 01:25:57,391 INFO L226 Difference]: Without dead ends: 157 [2018-11-23 01:25:57,392 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 59 SyntacticMatches, 8 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=102, Invalid=273, Unknown=5, NotChecked=0, Total=380 [2018-11-23 01:25:57,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-11-23 01:25:57,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 138. [2018-11-23 01:25:57,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-11-23 01:25:57,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 149 transitions. [2018-11-23 01:25:57,395 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 149 transitions. Word has length 36 [2018-11-23 01:25:57,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:25:57,396 INFO L480 AbstractCegarLoop]: Abstraction has 138 states and 149 transitions. [2018-11-23 01:25:57,396 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 01:25:57,396 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 149 transitions. [2018-11-23 01:25:57,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-23 01:25:57,396 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:25:57,396 INFO L402 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] [2018-11-23 01:25:57,397 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr24ASSERT_VIOLATIONMEMORY_FREE, appendErr21REQUIRES_VIOLATION, appendErr22REQUIRES_VIOLATION, appendErr23REQUIRES_VIOLATION, appendErr18REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr19REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr20REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr24REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr25REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr16REQUIRES_VIOLATION, appendErr17REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION]=== [2018-11-23 01:25:57,397 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:25:57,397 INFO L82 PathProgramCache]: Analyzing trace with hash 777775618, now seen corresponding path program 1 times [2018-11-23 01:25:57,397 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 01:25:57,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:25:57,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:25:57,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:25:57,398 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 01:25:57,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:25:57,526 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-23 01:25:57,526 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 01:25:57,526 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 01:25:57,526 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 37 with the following transitions: [2018-11-23 01:25:57,527 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [6], [9], [12], [13], [16], [19], [23], [26], [29], [35], [43], [118], [119], [122], [124], [125], [128], [129], [132], [138], [139], [142], [145], [148], [172], [173], [174], [175], [177], [178], [179] [2018-11-23 01:25:57,528 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 01:25:57,528 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 01:25:57,576 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-23 01:25:57,576 INFO L272 AbstractInterpreter]: Visited 34 different actions 48 times. Never merged. Never widened. Performed 452 root evaluator evaluations with a maximum evaluation depth of 3. Performed 452 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 30 variables. [2018-11-23 01:25:57,578 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:25:57,578 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-23 01:25:57,578 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 01:25:57,578 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4369ccf2-83a9-42f3-87f7-0dd3089303ed/bin-2019/utaipan/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-23 01:25:57,606 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:25:57,607 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-23 01:25:57,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:25:57,636 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 01:25:57,691 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 01:25:57,692 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-11-23 01:25:57,693 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 01:25:57,709 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 01:25:57,710 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 01:25:57,711 INFO L478 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-23 01:25:57,711 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 01:25:57,719 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 01:25:57,719 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:33, output treesize:30 [2018-11-23 01:25:57,763 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 01:25:57,763 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 01:25:57,766 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 30 [2018-11-23 01:25:57,766 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 01:25:57,782 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 01:25:57,783 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 01:25:57,784 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 01:25:57,784 INFO L478 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 16 treesize of output 13 [2018-11-23 01:25:57,785 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 01:25:57,792 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 01:25:57,792 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:41, output treesize:33 [2018-11-23 01:25:57,810 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-23 01:25:57,811 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 01:25:57,942 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 40 [2018-11-23 01:25:58,631 INFO L267 ElimStorePlain]: Start of recursive call 1: End of recursive call: and 1 xjuncts. [2018-11-23 01:25:58,632 INFO L202 ElimStorePlain]: Needed 1 recursive calls to eliminate 4 variables, input treesize:42, output treesize:1 [2018-11-23 01:25:58,638 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-23 01:25:58,656 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 01:25:58,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 19 [2018-11-23 01:25:58,656 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 01:25:58,656 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 01:25:58,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 01:25:58,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=317, Unknown=0, NotChecked=0, Total=380 [2018-11-23 01:25:58,657 INFO L87 Difference]: Start difference. First operand 138 states and 149 transitions. Second operand 14 states. [2018-11-23 01:25:59,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:25:59,545 INFO L93 Difference]: Finished difference Result 161 states and 169 transitions. [2018-11-23 01:25:59,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 01:25:59,545 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 36 [2018-11-23 01:25:59,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:25:59,546 INFO L225 Difference]: With dead ends: 161 [2018-11-23 01:25:59,546 INFO L226 Difference]: Without dead ends: 161 [2018-11-23 01:25:59,546 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=92, Invalid=414, Unknown=0, NotChecked=0, Total=506 [2018-11-23 01:25:59,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-11-23 01:25:59,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 129. [2018-11-23 01:25:59,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-11-23 01:25:59,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 139 transitions. [2018-11-23 01:25:59,549 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 139 transitions. Word has length 36 [2018-11-23 01:25:59,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:25:59,550 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 139 transitions. [2018-11-23 01:25:59,550 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 01:25:59,550 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 139 transitions. [2018-11-23 01:25:59,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-23 01:25:59,550 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:25:59,551 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 01:25:59,551 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr24ASSERT_VIOLATIONMEMORY_FREE, appendErr21REQUIRES_VIOLATION, appendErr22REQUIRES_VIOLATION, appendErr23REQUIRES_VIOLATION, appendErr18REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr19REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr20REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr24REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr25REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr16REQUIRES_VIOLATION, appendErr17REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION]=== [2018-11-23 01:25:59,551 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:25:59,551 INFO L82 PathProgramCache]: Analyzing trace with hash 533734251, now seen corresponding path program 1 times [2018-11-23 01:25:59,551 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 01:25:59,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:25:59,552 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:25:59,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:25:59,552 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 01:25:59,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:25:59,864 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 01:25:59,864 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 01:25:59,865 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 01:25:59,865 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 45 with the following transitions: [2018-11-23 01:25:59,865 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [6], [9], [12], [13], [16], [19], [23], [26], [31], [118], [119], [122], [125], [128], [129], [132], [134], [138], [139], [142], [145], [148], [151], [152], [155], [158], [159], [162], [166], [172], [173], [174], [175], [177], [178] [2018-11-23 01:25:59,867 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 01:25:59,867 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 01:25:59,905 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-23 01:25:59,905 INFO L272 AbstractInterpreter]: Visited 38 different actions 40 times. Merged at 1 different actions 1 times. Never widened. Performed 333 root evaluator evaluations with a maximum evaluation depth of 3. Performed 333 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 33 variables. [2018-11-23 01:25:59,918 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:25:59,918 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-23 01:25:59,918 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 01:25:59,918 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4369ccf2-83a9-42f3-87f7-0dd3089303ed/bin-2019/utaipan/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-23 01:25:59,932 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:25:59,932 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-23 01:25:59,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:25:59,961 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 01:26:00,004 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-23 01:26:00,004 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 01:26:00,008 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 01:26:00,008 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-11-23 01:26:00,110 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-23 01:26:00,112 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-23 01:26:00,112 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 01:26:00,114 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 01:26:00,148 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 01:26:00,148 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2018-11-23 01:26:00,201 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 35 [2018-11-23 01:26:00,204 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2018-11-23 01:26:00,204 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 01:26:00,226 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 30 [2018-11-23 01:26:00,226 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-23 01:26:00,239 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 01:26:00,251 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 01:26:00,251 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:38, output treesize:70 [2018-11-23 01:26:00,310 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2018-11-23 01:26:00,313 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 01:26:00,314 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-23 01:26:00,315 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 01:26:00,322 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 01:26:00,360 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 68 treesize of output 65 [2018-11-23 01:26:00,365 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 01:26:00,375 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 3 case distinctions, treesize of input 52 treesize of output 53 [2018-11-23 01:26:00,376 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-11-23 01:26:00,418 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 01:26:00,419 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 66 [2018-11-23 01:26:00,419 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 01:26:00,440 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 01:26:00,461 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 3 xjuncts. [2018-11-23 01:26:00,461 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:102, output treesize:115 [2018-11-23 01:26:00,539 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-11-23 01:26:00,540 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 01:26:00,564 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 01:26:00,565 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 01:26:00,565 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 10 [2018-11-23 01:26:00,565 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 01:26:00,573 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 01:26:00,574 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:139, output treesize:60 [2018-11-23 01:26:00,635 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 01:26:00,635 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 01:26:00,636 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 01:26:00,636 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 52 [2018-11-23 01:26:00,637 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 01:26:00,648 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 01:26:00,648 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:74, output treesize:82 [2018-11-23 01:26:00,680 INFO L478 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 77 treesize of output 75 [2018-11-23 01:26:00,681 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2018-11-23 01:26:00,681 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 01:26:00,687 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 01:26:00,697 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-23 01:26:00,697 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:97, output treesize:82 [2018-11-23 01:26:00,765 INFO L478 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 75 treesize of output 73 [2018-11-23 01:26:00,768 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-23 01:26:00,768 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 01:26:00,780 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 01:26:00,796 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 01:26:00,796 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:98, output treesize:85 [2018-11-23 01:26:00,844 INFO L478 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 75 treesize of output 73 [2018-11-23 01:26:00,847 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-23 01:26:00,847 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 01:26:00,859 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 01:26:00,881 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-11-23 01:26:00,881 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:98, output treesize:94 [2018-11-23 01:26:00,930 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 65 [2018-11-23 01:26:00,934 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 01:26:00,935 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-11-23 01:26:00,935 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 01:26:00,948 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 01:26:00,950 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2018-11-23 01:26:00,950 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 01:26:00,960 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-11-23 01:26:00,960 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 01:26:00,965 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 01:26:00,978 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 01:26:00,979 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:103, output treesize:28 [2018-11-23 01:26:01,025 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 01:26:01,025 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 01:26:01,250 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 01:26:01,253 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 01:26:01,254 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 01:26:01,258 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 01:26:01,259 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 01:26:01,262 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 01:26:01,276 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 8 dim-0 vars, and 3 xjuncts. [2018-11-23 01:26:01,276 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:52, output treesize:124 [2018-11-23 01:26:01,574 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 01:26:01,575 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 01:26:01,578 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 01:26:01,579 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 271 [2018-11-23 01:26:01,579 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 01:26:01,600 INFO L478 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 262 treesize of output 153 [2018-11-23 01:26:01,653 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-11-23 01:26:01,653 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 01:26:01,694 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 107 treesize of output 101 [2018-11-23 01:26:01,805 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 65 [2018-11-23 01:26:01,807 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 66 [2018-11-23 01:26:01,809 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 01:26:01,809 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 28 [2018-11-23 01:26:01,810 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 01:26:01,823 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 01:26:01,867 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 59 [2018-11-23 01:26:01,869 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 01:26:01,869 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 58 [2018-11-23 01:26:01,870 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-23 01:26:01,893 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 01:26:01,903 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 69 [2018-11-23 01:26:01,903 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-11-23 01:26:01,931 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-23 01:26:01,982 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 43 [2018-11-23 01:26:01,984 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 01:26:01,985 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 01:26:01,989 INFO L478 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 33 [2018-11-23 01:26:01,990 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 2 xjuncts. [2018-11-23 01:26:02,005 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 01:26:02,007 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 43 [2018-11-23 01:26:02,018 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 01:26:02,022 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 01:26:02,028 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 01:26:02,043 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 39 treesize of output 72 [2018-11-23 01:26:02,044 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 3 xjuncts. [2018-11-23 01:26:02,074 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-23 01:26:02,075 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 43 [2018-11-23 01:26:02,077 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 01:26:02,085 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 38 [2018-11-23 01:26:02,086 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 2 xjuncts. [2018-11-23 01:26:02,096 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 01:26:02,154 INFO L478 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 1 case distinctions, treesize of input 56 treesize of output 52 [2018-11-23 01:26:02,156 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 20 [2018-11-23 01:26:02,156 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-11-23 01:26:02,366 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 01:26:02,366 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.UnsupportedOperationException: nested self-update not yet implemented: (store v_arrayElimCell_27 (+ v_append_~node~0.offset_34 1) 0) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.DerPreprocessor.constructReplacementForStoreCase(DerPreprocessor.java:248) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.DerPreprocessor.constructReplacement(DerPreprocessor.java:219) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.DerPreprocessor.constructReplacement(DerPreprocessor.java:208) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.DerPreprocessor.convert(DerPreprocessor.java:191) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.cacheConvert(TermTransformer.java:131) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.access$0(TermTransformer.java:127) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$Convert.walk(TermTransformer.java:79) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:122) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:113) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.transform(TermTransformer.java:253) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.Elim1Store.elim1(Elim1Store.java:211) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:221) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.elimAllRec(ElimStorePlain.java:199) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:293) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:245) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:383) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:290) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:188) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseTaipanRefinementStrategy.getTraceCheck(BaseTaipanRefinementStrategy.java:214) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:456) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-11-23 01:26:02,369 INFO L168 Benchmark]: Toolchain (without parser) took 32825.32 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 197.7 MB). Free memory was 956.5 MB in the beginning and 1.1 GB in the end (delta: -118.3 MB). Peak memory consumption was 321.9 MB. Max. memory is 11.5 GB. [2018-11-23 01:26:02,369 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 01:26:02,370 INFO L168 Benchmark]: CACSL2BoogieTranslator took 337.44 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 124.8 MB). Free memory was 956.5 MB in the beginning and 1.1 GB in the end (delta: -157.0 MB). Peak memory consumption was 29.2 MB. Max. memory is 11.5 GB. [2018-11-23 01:26:02,370 INFO L168 Benchmark]: Boogie Procedure Inliner took 22.53 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-23 01:26:02,370 INFO L168 Benchmark]: Boogie Preprocessor took 24.79 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-23 01:26:02,370 INFO L168 Benchmark]: RCFGBuilder took 381.20 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: 39.6 MB). Peak memory consumption was 39.6 MB. Max. memory is 11.5 GB. [2018-11-23 01:26:02,371 INFO L168 Benchmark]: TraceAbstraction took 32056.54 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 72.9 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -6.2 MB). Peak memory consumption was 309.1 MB. Max. memory is 11.5 GB. [2018-11-23 01:26:02,372 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 337.44 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 124.8 MB). Free memory was 956.5 MB in the beginning and 1.1 GB in the end (delta: -157.0 MB). Peak memory consumption was 29.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 22.53 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 24.79 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 381.20 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: 39.6 MB). Peak memory consumption was 39.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 32056.54 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 72.9 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -6.2 MB). Peak memory consumption was 309.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: UnsupportedOperationException: nested self-update not yet implemented: (store v_arrayElimCell_27 (+ v_append_~node~0.offset_34 1) 0) de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: UnsupportedOperationException: nested self-update not yet implemented: (store v_arrayElimCell_27 (+ v_append_~node~0.offset_34 1) 0): de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.DerPreprocessor.constructReplacementForStoreCase(DerPreprocessor.java:248) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.23-aa41828 [2018-11-23 01:26:03,702 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 01:26:03,703 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 01:26:03,710 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 01:26:03,710 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 01:26:03,711 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 01:26:03,712 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 01:26:03,713 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 01:26:03,714 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 01:26:03,715 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 01:26:03,715 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 01:26:03,716 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 01:26:03,716 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 01:26:03,717 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 01:26:03,718 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 01:26:03,719 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 01:26:03,719 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 01:26:03,720 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 01:26:03,722 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 01:26:03,723 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 01:26:03,724 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 01:26:03,725 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 01:26:03,727 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 01:26:03,727 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 01:26:03,727 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 01:26:03,728 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 01:26:03,728 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 01:26:03,729 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 01:26:03,730 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 01:26:03,730 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 01:26:03,730 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 01:26:03,731 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 01:26:03,731 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 01:26:03,731 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 01:26:03,732 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 01:26:03,732 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 01:26:03,733 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_4369ccf2-83a9-42f3-87f7-0dd3089303ed/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2018-11-23 01:26:03,743 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 01:26:03,743 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 01:26:03,744 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 01:26:03,744 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 01:26:03,744 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-23 01:26:03,744 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-23 01:26:03,744 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-23 01:26:03,745 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-23 01:26:03,745 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-23 01:26:03,745 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-23 01:26:03,745 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 01:26:03,745 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 01:26:03,746 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 01:26:03,746 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 01:26:03,746 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 01:26:03,746 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 01:26:03,746 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 01:26:03,747 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 01:26:03,747 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-11-23 01:26:03,747 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-11-23 01:26:03,747 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-11-23 01:26:03,747 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 01:26:03,747 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 01:26:03,747 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 01:26:03,747 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 01:26:03,747 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 01:26:03,747 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 01:26:03,748 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 01:26:03,748 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 01:26:03,748 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 01:26:03,748 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 01:26:03,748 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 01:26:03,748 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 01:26:03,748 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-11-23 01:26:03,748 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 01:26:03,748 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 01:26:03,748 INFO L133 SettingsManager]: * Logic for external solver=AUFBV 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_4369ccf2-83a9-42f3-87f7-0dd3089303ed/bin-2019/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7db66fa755812d372ccac4d56a0ec85104dbcc6e [2018-11-23 01:26:03,781 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 01:26:03,790 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 01:26:03,792 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 01:26:03,793 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 01:26:03,794 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 01:26:03,794 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_4369ccf2-83a9-42f3-87f7-0dd3089303ed/bin-2019/utaipan/../../sv-benchmarks/c/memsafety-ext2/length_test03_true-valid-memsafety.i [2018-11-23 01:26:03,838 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4369ccf2-83a9-42f3-87f7-0dd3089303ed/bin-2019/utaipan/data/6e5be5e7d/0c1fd4abf01e4df1a823dadd2777741b/FLAGaec00fb05 [2018-11-23 01:26:04,184 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 01:26:04,184 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_4369ccf2-83a9-42f3-87f7-0dd3089303ed/sv-benchmarks/c/memsafety-ext2/length_test03_true-valid-memsafety.i [2018-11-23 01:26:04,193 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4369ccf2-83a9-42f3-87f7-0dd3089303ed/bin-2019/utaipan/data/6e5be5e7d/0c1fd4abf01e4df1a823dadd2777741b/FLAGaec00fb05 [2018-11-23 01:26:04,201 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_4369ccf2-83a9-42f3-87f7-0dd3089303ed/bin-2019/utaipan/data/6e5be5e7d/0c1fd4abf01e4df1a823dadd2777741b [2018-11-23 01:26:04,204 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 01:26:04,205 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 01:26:04,205 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 01:26:04,205 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 01:26:04,208 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 01:26:04,209 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:26:04" (1/1) ... [2018-11-23 01:26:04,211 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48b80d44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:26:04, skipping insertion in model container [2018-11-23 01:26:04,211 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:26:04" (1/1) ... [2018-11-23 01:26:04,219 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 01:26:04,247 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 01:26:04,457 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 01:26:04,467 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 01:26:04,557 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 01:26:04,595 INFO L195 MainTranslator]: Completed translation [2018-11-23 01:26:04,596 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:26:04 WrapperNode [2018-11-23 01:26:04,596 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 01:26:04,596 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 01:26:04,596 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 01:26:04,597 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 01:26:04,603 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:26:04" (1/1) ... [2018-11-23 01:26:04,612 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:26:04" (1/1) ... [2018-11-23 01:26:04,616 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 01:26:04,616 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 01:26:04,616 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 01:26:04,617 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 01:26:04,622 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:26:04" (1/1) ... [2018-11-23 01:26:04,622 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:26:04" (1/1) ... [2018-11-23 01:26:04,624 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:26:04" (1/1) ... [2018-11-23 01:26:04,625 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:26:04" (1/1) ... [2018-11-23 01:26:04,633 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:26:04" (1/1) ... [2018-11-23 01:26:04,636 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:26:04" (1/1) ... [2018-11-23 01:26:04,637 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:26:04" (1/1) ... [2018-11-23 01:26:04,639 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 01:26:04,639 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 01:26:04,639 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 01:26:04,639 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 01:26:04,640 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:26:04" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4369ccf2-83a9-42f3-87f7-0dd3089303ed/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 01:26:04,670 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 01:26:04,670 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 01:26:04,670 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 01:26:04,670 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 01:26:04,670 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 01:26:04,670 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-23 01:26:04,671 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-23 01:26:04,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2018-11-23 01:26:04,671 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 01:26:04,671 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 01:26:04,671 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 01:26:04,671 INFO L130 BoogieDeclarations]: Found specification of procedure append [2018-11-23 01:26:04,671 INFO L138 BoogieDeclarations]: Found implementation of procedure append [2018-11-23 01:26:05,172 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 01:26:05,172 INFO L280 CfgBuilder]: Removed 4 assue(true) statements. [2018-11-23 01:26:05,173 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:26:05 BoogieIcfgContainer [2018-11-23 01:26:05,173 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 01:26:05,173 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 01:26:05,173 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 01:26:05,175 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 01:26:05,175 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 01:26:04" (1/3) ... [2018-11-23 01:26:05,176 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41489baa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:26:05, skipping insertion in model container [2018-11-23 01:26:05,176 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:26:04" (2/3) ... [2018-11-23 01:26:05,176 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41489baa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:26:05, skipping insertion in model container [2018-11-23 01:26:05,176 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:26:05" (3/3) ... [2018-11-23 01:26:05,177 INFO L112 eAbstractionObserver]: Analyzing ICFG length_test03_true-valid-memsafety.i [2018-11-23 01:26:05,183 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 01:26:05,190 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 55 error locations. [2018-11-23 01:26:05,199 INFO L257 AbstractCegarLoop]: Starting to check reachability of 55 error locations. [2018-11-23 01:26:05,215 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 01:26:05,216 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 01:26:05,216 INFO L383 AbstractCegarLoop]: Hoare is false [2018-11-23 01:26:05,216 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 01:26:05,216 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 01:26:05,216 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 01:26:05,216 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 01:26:05,216 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 01:26:05,217 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 01:26:05,228 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states. [2018-11-23 01:26:05,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-11-23 01:26:05,234 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:26:05,235 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-23 01:26:05,236 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr16REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, appendErr22REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr21REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr23REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr19REQUIRES_VIOLATION, appendErr20REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr24REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr25REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr16REQUIRES_VIOLATION, appendErr18REQUIRES_VIOLATION, appendErr17REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION]=== [2018-11-23 01:26:05,240 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:26:05,240 INFO L82 PathProgramCache]: Analyzing trace with hash -219134449, now seen corresponding path program 1 times [2018-11-23 01:26:05,242 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 01:26:05,243 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4369ccf2-83a9-42f3-87f7-0dd3089303ed/bin-2019/utaipan/cvc4nyu Starting monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 01:26:05,261 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:26:05,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:26:05,289 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 01:26:05,317 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-23 01:26:05,319 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 01:26:05,326 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 01:26:05,326 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-23 01:26:05,334 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-23 01:26:05,334 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 01:26:05,336 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:26:05,337 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 01:26:05,339 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 01:26:05,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 01:26:05,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 01:26:05,348 INFO L87 Difference]: Start difference. First operand 124 states. Second operand 3 states. [2018-11-23 01:26:05,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:26:05,611 INFO L93 Difference]: Finished difference Result 155 states and 164 transitions. [2018-11-23 01:26:05,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 01:26:05,612 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-11-23 01:26:05,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:26:05,622 INFO L225 Difference]: With dead ends: 155 [2018-11-23 01:26:05,623 INFO L226 Difference]: Without dead ends: 152 [2018-11-23 01:26:05,624 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 01:26:05,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-11-23 01:26:05,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 119. [2018-11-23 01:26:05,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-11-23 01:26:05,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 125 transitions. [2018-11-23 01:26:05,661 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 125 transitions. Word has length 7 [2018-11-23 01:26:05,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:26:05,661 INFO L480 AbstractCegarLoop]: Abstraction has 119 states and 125 transitions. [2018-11-23 01:26:05,662 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 01:26:05,662 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 125 transitions. [2018-11-23 01:26:05,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-11-23 01:26:05,662 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:26:05,662 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-23 01:26:05,663 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr16REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, appendErr22REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr21REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr23REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr19REQUIRES_VIOLATION, appendErr20REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr24REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr25REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr16REQUIRES_VIOLATION, appendErr18REQUIRES_VIOLATION, appendErr17REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION]=== [2018-11-23 01:26:05,663 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:26:05,663 INFO L82 PathProgramCache]: Analyzing trace with hash -219134448, now seen corresponding path program 1 times [2018-11-23 01:26:05,663 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 01:26:05,663 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4369ccf2-83a9-42f3-87f7-0dd3089303ed/bin-2019/utaipan/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 01:26:05,679 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:26:05,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:26:05,695 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 01:26:05,702 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-23 01:26:05,702 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 01:26:05,712 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 01:26:05,713 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-23 01:26:05,724 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-23 01:26:05,724 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 01:26:05,725 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:26:05,725 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 01:26:05,726 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 01:26:05,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 01:26:05,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 01:26:05,726 INFO L87 Difference]: Start difference. First operand 119 states and 125 transitions. Second operand 3 states. [2018-11-23 01:26:05,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:26:05,924 INFO L93 Difference]: Finished difference Result 119 states and 126 transitions. [2018-11-23 01:26:05,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 01:26:05,925 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-11-23 01:26:05,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:26:05,925 INFO L225 Difference]: With dead ends: 119 [2018-11-23 01:26:05,926 INFO L226 Difference]: Without dead ends: 119 [2018-11-23 01:26:05,926 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 01:26:05,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-11-23 01:26:05,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 117. [2018-11-23 01:26:05,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-11-23 01:26:05,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 123 transitions. [2018-11-23 01:26:05,933 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 123 transitions. Word has length 7 [2018-11-23 01:26:05,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:26:05,933 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 123 transitions. [2018-11-23 01:26:05,934 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 01:26:05,934 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 123 transitions. [2018-11-23 01:26:05,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-23 01:26:05,934 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:26:05,934 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 01:26:05,935 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr16REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, appendErr22REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr21REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr23REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr19REQUIRES_VIOLATION, appendErr20REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr24REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr25REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr16REQUIRES_VIOLATION, appendErr18REQUIRES_VIOLATION, appendErr17REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION]=== [2018-11-23 01:26:05,935 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:26:05,935 INFO L82 PathProgramCache]: Analyzing trace with hash 115899005, now seen corresponding path program 1 times [2018-11-23 01:26:05,935 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 01:26:05,936 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4369ccf2-83a9-42f3-87f7-0dd3089303ed/bin-2019/utaipan/cvc4nyu Starting monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 01:26:05,947 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:26:05,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:26:05,976 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 01:26:05,995 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-23 01:26:05,996 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 01:26:06,001 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-23 01:26:06,002 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2018-11-23 01:26:06,018 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-23 01:26:06,018 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 01:26:06,019 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:26:06,020 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 01:26:06,020 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 01:26:06,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 01:26:06,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 01:26:06,020 INFO L87 Difference]: Start difference. First operand 117 states and 123 transitions. Second operand 4 states. [2018-11-23 01:26:06,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:26:06,272 INFO L93 Difference]: Finished difference Result 137 states and 146 transitions. [2018-11-23 01:26:06,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 01:26:06,273 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-11-23 01:26:06,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:26:06,274 INFO L225 Difference]: With dead ends: 137 [2018-11-23 01:26:06,274 INFO L226 Difference]: Without dead ends: 137 [2018-11-23 01:26:06,274 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 01:26:06,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-11-23 01:26:06,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 119. [2018-11-23 01:26:06,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-11-23 01:26:06,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 127 transitions. [2018-11-23 01:26:06,279 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 127 transitions. Word has length 10 [2018-11-23 01:26:06,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:26:06,279 INFO L480 AbstractCegarLoop]: Abstraction has 119 states and 127 transitions. [2018-11-23 01:26:06,279 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 01:26:06,279 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 127 transitions. [2018-11-23 01:26:06,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-23 01:26:06,279 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:26:06,279 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 01:26:06,280 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr16REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, appendErr22REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr21REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr23REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr19REQUIRES_VIOLATION, appendErr20REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr24REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr25REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr16REQUIRES_VIOLATION, appendErr18REQUIRES_VIOLATION, appendErr17REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION]=== [2018-11-23 01:26:06,280 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:26:06,280 INFO L82 PathProgramCache]: Analyzing trace with hash 115899006, now seen corresponding path program 1 times [2018-11-23 01:26:06,280 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 01:26:06,280 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4369ccf2-83a9-42f3-87f7-0dd3089303ed/bin-2019/utaipan/cvc4nyu Starting monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 01:26:06,291 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:26:06,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:26:06,316 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 01:26:06,321 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-23 01:26:06,321 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 01:26:06,325 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 01:26:06,326 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-23 01:26:06,330 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-23 01:26:06,331 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 01:26:06,331 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:26:06,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 01:26:06,332 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 01:26:06,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 01:26:06,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 01:26:06,332 INFO L87 Difference]: Start difference. First operand 119 states and 127 transitions. Second operand 3 states. [2018-11-23 01:26:06,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:26:06,506 INFO L93 Difference]: Finished difference Result 119 states and 128 transitions. [2018-11-23 01:26:06,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 01:26:06,506 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-11-23 01:26:06,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:26:06,507 INFO L225 Difference]: With dead ends: 119 [2018-11-23 01:26:06,507 INFO L226 Difference]: Without dead ends: 119 [2018-11-23 01:26:06,507 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 01:26:06,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-11-23 01:26:06,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 117. [2018-11-23 01:26:06,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-11-23 01:26:06,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 125 transitions. [2018-11-23 01:26:06,513 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 125 transitions. Word has length 10 [2018-11-23 01:26:06,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:26:06,513 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 125 transitions. [2018-11-23 01:26:06,513 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 01:26:06,513 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 125 transitions. [2018-11-23 01:26:06,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 01:26:06,514 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:26:06,514 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 01:26:06,514 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr16REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, appendErr22REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr21REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr23REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr19REQUIRES_VIOLATION, appendErr20REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr24REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr25REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr16REQUIRES_VIOLATION, appendErr18REQUIRES_VIOLATION, appendErr17REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION]=== [2018-11-23 01:26:06,514 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:26:06,514 INFO L82 PathProgramCache]: Analyzing trace with hash -1391456806, now seen corresponding path program 1 times [2018-11-23 01:26:06,515 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 01:26:06,515 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4369ccf2-83a9-42f3-87f7-0dd3089303ed/bin-2019/utaipan/cvc4nyu Starting monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 01:26:06,526 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:26:06,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:26:06,578 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 01:26:06,584 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-23 01:26:06,584 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 01:26:06,586 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 01:26:06,586 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-23 01:26:06,589 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-23 01:26:06,589 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 01:26:06,592 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:26:06,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 01:26:06,593 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 01:26:06,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 01:26:06,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 01:26:06,593 INFO L87 Difference]: Start difference. First operand 117 states and 125 transitions. Second operand 3 states. [2018-11-23 01:26:06,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:26:06,735 INFO L93 Difference]: Finished difference Result 112 states and 120 transitions. [2018-11-23 01:26:06,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 01:26:06,735 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-11-23 01:26:06,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:26:06,736 INFO L225 Difference]: With dead ends: 112 [2018-11-23 01:26:06,736 INFO L226 Difference]: Without dead ends: 112 [2018-11-23 01:26:06,736 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 01:26:06,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-11-23 01:26:06,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2018-11-23 01:26:06,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-11-23 01:26:06,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 120 transitions. [2018-11-23 01:26:06,739 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 120 transitions. Word has length 16 [2018-11-23 01:26:06,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:26:06,739 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 120 transitions. [2018-11-23 01:26:06,739 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 01:26:06,739 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 120 transitions. [2018-11-23 01:26:06,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 01:26:06,740 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:26:06,740 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 01:26:06,740 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr16REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, appendErr22REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr21REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr23REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr19REQUIRES_VIOLATION, appendErr20REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr24REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr25REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr16REQUIRES_VIOLATION, appendErr18REQUIRES_VIOLATION, appendErr17REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION]=== [2018-11-23 01:26:06,740 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:26:06,740 INFO L82 PathProgramCache]: Analyzing trace with hash -1391456805, now seen corresponding path program 1 times [2018-11-23 01:26:06,741 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 01:26:06,741 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4369ccf2-83a9-42f3-87f7-0dd3089303ed/bin-2019/utaipan/cvc4nyu Starting monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 01:26:06,753 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:26:06,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:26:06,790 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 01:26:06,794 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-23 01:26:06,794 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 01:26:06,798 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 01:26:06,798 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-23 01:26:06,803 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-23 01:26:06,803 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 01:26:06,804 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:26:06,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 01:26:06,804 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 01:26:06,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 01:26:06,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 01:26:06,805 INFO L87 Difference]: Start difference. First operand 112 states and 120 transitions. Second operand 3 states. [2018-11-23 01:26:06,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:26:06,952 INFO L93 Difference]: Finished difference Result 107 states and 115 transitions. [2018-11-23 01:26:06,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 01:26:06,953 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-11-23 01:26:06,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:26:06,953 INFO L225 Difference]: With dead ends: 107 [2018-11-23 01:26:06,953 INFO L226 Difference]: Without dead ends: 107 [2018-11-23 01:26:06,954 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 01:26:06,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-11-23 01:26:06,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2018-11-23 01:26:06,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-11-23 01:26:06,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 115 transitions. [2018-11-23 01:26:06,957 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 115 transitions. Word has length 16 [2018-11-23 01:26:06,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:26:06,957 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 115 transitions. [2018-11-23 01:26:06,957 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 01:26:06,957 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 115 transitions. [2018-11-23 01:26:06,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 01:26:06,958 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:26:06,958 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 01:26:06,958 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr16REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, appendErr22REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr21REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr23REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr19REQUIRES_VIOLATION, appendErr20REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr24REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr25REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr16REQUIRES_VIOLATION, appendErr18REQUIRES_VIOLATION, appendErr17REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION]=== [2018-11-23 01:26:06,958 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:26:06,958 INFO L82 PathProgramCache]: Analyzing trace with hash -185487935, now seen corresponding path program 1 times [2018-11-23 01:26:06,958 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 01:26:06,958 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4369ccf2-83a9-42f3-87f7-0dd3089303ed/bin-2019/utaipan/cvc4nyu Starting monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 01:26:06,971 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:26:07,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:26:07,019 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 01:26:07,022 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-23 01:26:07,022 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 01:26:07,024 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 01:26:07,024 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-23 01:26:07,029 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 01:26:07,030 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 01:26:07,030 INFO L478 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-23 01:26:07,031 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 01:26:07,037 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-23 01:26:07,037 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2018-11-23 01:26:07,074 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 19 treesize of output 20 [2018-11-23 01:26:07,075 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 01:26:07,083 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 01:26:07,083 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:20 [2018-11-23 01:26:07,099 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-23 01:26:07,099 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 01:26:07,100 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:26:07,100 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 01:26:07,100 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 01:26:07,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 01:26:07,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-23 01:26:07,101 INFO L87 Difference]: Start difference. First operand 107 states and 115 transitions. Second operand 6 states. [2018-11-23 01:26:07,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:26:07,757 INFO L93 Difference]: Finished difference Result 207 states and 222 transitions. [2018-11-23 01:26:07,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 01:26:07,758 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-11-23 01:26:07,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:26:07,759 INFO L225 Difference]: With dead ends: 207 [2018-11-23 01:26:07,759 INFO L226 Difference]: Without dead ends: 207 [2018-11-23 01:26:07,760 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-23 01:26:07,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2018-11-23 01:26:07,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 131. [2018-11-23 01:26:07,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-11-23 01:26:07,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 151 transitions. [2018-11-23 01:26:07,766 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 151 transitions. Word has length 17 [2018-11-23 01:26:07,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:26:07,766 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 151 transitions. [2018-11-23 01:26:07,766 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 01:26:07,766 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 151 transitions. [2018-11-23 01:26:07,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 01:26:07,766 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:26:07,767 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 01:26:07,767 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr16REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, appendErr22REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr21REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr23REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr19REQUIRES_VIOLATION, appendErr20REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr24REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr25REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr16REQUIRES_VIOLATION, appendErr18REQUIRES_VIOLATION, appendErr17REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION]=== [2018-11-23 01:26:07,767 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:26:07,767 INFO L82 PathProgramCache]: Analyzing trace with hash -185487934, now seen corresponding path program 1 times [2018-11-23 01:26:07,768 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 01:26:07,768 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4369ccf2-83a9-42f3-87f7-0dd3089303ed/bin-2019/utaipan/cvc4nyu Starting monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 01:26:07,787 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:26:07,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:26:07,857 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 01:26:07,863 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-23 01:26:07,866 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 01:26:07,873 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-23 01:26:07,873 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 01:26:07,880 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 01:26:07,880 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-11-23 01:26:07,891 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 01:26:07,892 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 01:26:07,892 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-23 01:26:07,893 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 01:26:07,904 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-11-23 01:26:07,905 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 01:26:07,912 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 01:26:07,912 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:18 [2018-11-23 01:26:07,959 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 01:26:07,975 INFO L478 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 4 case distinctions, treesize of input 19 treesize of output 28 [2018-11-23 01:26:07,976 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts. [2018-11-23 01:26:08,008 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-11-23 01:26:08,008 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:26, output treesize:52 [2018-11-23 01:26:08,050 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-23 01:26:08,051 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 01:26:08,058 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:26:08,058 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 01:26:08,059 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 01:26:08,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 01:26:08,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-23 01:26:08,059 INFO L87 Difference]: Start difference. First operand 131 states and 151 transitions. Second operand 6 states. [2018-11-23 01:26:08,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:26:08,681 INFO L93 Difference]: Finished difference Result 157 states and 179 transitions. [2018-11-23 01:26:08,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 01:26:08,681 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-11-23 01:26:08,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:26:08,682 INFO L225 Difference]: With dead ends: 157 [2018-11-23 01:26:08,682 INFO L226 Difference]: Without dead ends: 157 [2018-11-23 01:26:08,682 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-23 01:26:08,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-11-23 01:26:08,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 155. [2018-11-23 01:26:08,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-11-23 01:26:08,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 179 transitions. [2018-11-23 01:26:08,686 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 179 transitions. Word has length 17 [2018-11-23 01:26:08,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:26:08,686 INFO L480 AbstractCegarLoop]: Abstraction has 155 states and 179 transitions. [2018-11-23 01:26:08,686 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 01:26:08,687 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 179 transitions. [2018-11-23 01:26:08,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 01:26:08,687 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:26:08,687 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 01:26:08,687 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr16REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, appendErr22REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr21REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr23REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr19REQUIRES_VIOLATION, appendErr20REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr24REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr25REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr16REQUIRES_VIOLATION, appendErr18REQUIRES_VIOLATION, appendErr17REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION]=== [2018-11-23 01:26:08,688 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:26:08,688 INFO L82 PathProgramCache]: Analyzing trace with hash -1255259243, now seen corresponding path program 1 times [2018-11-23 01:26:08,688 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 01:26:08,688 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4369ccf2-83a9-42f3-87f7-0dd3089303ed/bin-2019/utaipan/cvc4nyu Starting monitored process 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 01:26:08,700 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:26:08,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:26:08,797 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 01:26:08,800 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-23 01:26:08,801 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 01:26:08,804 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 01:26:08,804 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-23 01:26:08,813 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-23 01:26:08,816 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 01:26:08,816 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 01:26:08,818 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 01:26:08,829 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-23 01:26:08,831 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 01:26:08,831 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 01:26:08,833 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 01:26:08,838 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 01:26:08,838 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:31, output treesize:23 [2018-11-23 01:26:08,853 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-11-23 01:26:08,856 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 01:26:08,857 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-11-23 01:26:08,857 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 01:26:08,864 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 01:26:08,881 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-11-23 01:26:08,885 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 01:26:08,885 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-11-23 01:26:08,886 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 01:26:08,890 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 01:26:08,899 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 01:26:08,899 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:49, output treesize:41 [2018-11-23 01:26:08,917 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 01:26:08,918 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 01:26:08,918 INFO L478 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-23 01:26:08,919 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 01:26:08,932 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 01:26:08,932 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:52, output treesize:50 [2018-11-23 01:26:08,965 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-11-23 01:26:08,968 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 01:26:08,968 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 01:26:08,976 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 01:26:09,012 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-11-23 01:26:09,014 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 01:26:09,015 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 01:26:09,022 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 01:26:09,042 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 01:26:09,042 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:74, output treesize:66 [2018-11-23 01:26:09,096 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 36 [2018-11-23 01:26:09,105 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 01:26:09,106 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-11-23 01:26:09,107 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 01:26:09,122 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 01:26:09,162 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 36 [2018-11-23 01:26:09,167 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 01:26:09,167 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-11-23 01:26:09,168 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 01:26:09,179 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 01:26:09,212 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 01:26:09,212 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:92, output treesize:84 [2018-11-23 01:26:09,309 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 01:26:09,310 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 01:26:09,311 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 01:26:09,312 INFO L478 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 18 treesize of output 13 [2018-11-23 01:26:09,312 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 01:26:09,341 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 01:26:09,342 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:85, output treesize:76 [2018-11-23 01:26:09,415 INFO L478 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 46 treesize of output 55 [2018-11-23 01:26:09,422 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2018-11-23 01:26:09,422 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 01:26:09,442 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 01:26:09,505 INFO L478 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 46 treesize of output 55 [2018-11-23 01:26:09,509 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2018-11-23 01:26:09,509 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 01:26:09,521 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 01:26:09,548 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 01:26:09,548 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:106, output treesize:76 [2018-11-23 01:26:09,635 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-23 01:26:09,635 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 01:26:09,636 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:26:09,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-11-23 01:26:09,637 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 01:26:09,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 01:26:09,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-11-23 01:26:09,637 INFO L87 Difference]: Start difference. First operand 155 states and 179 transitions. Second operand 12 states. [2018-11-23 01:26:12,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:26:12,835 INFO L93 Difference]: Finished difference Result 157 states and 178 transitions. [2018-11-23 01:26:12,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 01:26:12,835 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 26 [2018-11-23 01:26:12,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:26:12,836 INFO L225 Difference]: With dead ends: 157 [2018-11-23 01:26:12,836 INFO L226 Difference]: Without dead ends: 157 [2018-11-23 01:26:12,836 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2018-11-23 01:26:12,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-11-23 01:26:12,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 155. [2018-11-23 01:26:12,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-11-23 01:26:12,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 178 transitions. [2018-11-23 01:26:12,840 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 178 transitions. Word has length 26 [2018-11-23 01:26:12,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:26:12,840 INFO L480 AbstractCegarLoop]: Abstraction has 155 states and 178 transitions. [2018-11-23 01:26:12,840 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 01:26:12,840 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 178 transitions. [2018-11-23 01:26:12,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-23 01:26:12,840 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:26:12,840 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 01:26:12,841 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr16REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, appendErr22REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr21REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr23REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr19REQUIRES_VIOLATION, appendErr20REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr24REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr25REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr16REQUIRES_VIOLATION, appendErr18REQUIRES_VIOLATION, appendErr17REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION]=== [2018-11-23 01:26:12,841 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:26:12,841 INFO L82 PathProgramCache]: Analyzing trace with hash -1352021576, now seen corresponding path program 1 times [2018-11-23 01:26:12,841 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 01:26:12,841 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4369ccf2-83a9-42f3-87f7-0dd3089303ed/bin-2019/utaipan/cvc4nyu Starting monitored process 11 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 01:26:12,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:26:12,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:26:12,961 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 01:26:12,966 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-23 01:26:12,966 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 01:26:12,970 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 01:26:12,970 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-23 01:26:12,983 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-23 01:26:12,985 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-23 01:26:12,985 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 01:26:12,988 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 01:26:13,002 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-23 01:26:13,004 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-23 01:26:13,004 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 01:26:13,006 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 01:26:13,018 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 01:26:13,018 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:35, output treesize:27 [2018-11-23 01:26:13,033 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 01:26:13,033 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 01:26:13,034 INFO L478 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-23 01:26:13,034 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 01:26:13,045 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 01:26:13,046 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:36 [2018-11-23 01:26:13,072 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22 [2018-11-23 01:26:13,075 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 01:26:13,075 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 01:26:13,081 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 01:26:13,107 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22 [2018-11-23 01:26:13,109 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 01:26:13,110 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 01:26:13,117 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 01:26:13,136 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 01:26:13,136 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:60, output treesize:52 [2018-11-23 01:26:13,184 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 29 [2018-11-23 01:26:13,190 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 01:26:13,191 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-11-23 01:26:13,191 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 01:26:13,207 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 01:26:13,252 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 29 [2018-11-23 01:26:13,257 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 01:26:13,258 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-11-23 01:26:13,258 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 01:26:13,277 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 01:26:13,306 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 01:26:13,306 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:78, output treesize:70 [2018-11-23 01:26:13,377 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 01:26:13,378 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 01:26:13,379 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 01:26:13,380 INFO L478 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 18 treesize of output 13 [2018-11-23 01:26:13,380 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 01:26:13,409 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 01:26:13,409 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:75, output treesize:66 [2018-11-23 01:26:13,485 INFO L478 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 41 treesize of output 50 [2018-11-23 01:26:13,493 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2018-11-23 01:26:13,493 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 01:26:13,510 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 01:26:13,570 INFO L478 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 41 treesize of output 50 [2018-11-23 01:26:13,575 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2018-11-23 01:26:13,575 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 01:26:13,587 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 01:26:13,615 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 01:26:13,615 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:96, output treesize:66 [2018-11-23 01:26:13,745 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-23 01:26:13,745 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 01:26:13,747 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:26:13,747 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-23 01:26:13,748 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 01:26:13,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 01:26:13,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-11-23 01:26:13,748 INFO L87 Difference]: Start difference. First operand 155 states and 178 transitions. Second operand 11 states. [2018-11-23 01:26:16,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:26:16,854 INFO L93 Difference]: Finished difference Result 147 states and 167 transitions. [2018-11-23 01:26:16,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 01:26:16,854 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2018-11-23 01:26:16,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:26:16,855 INFO L225 Difference]: With dead ends: 147 [2018-11-23 01:26:16,855 INFO L226 Difference]: Without dead ends: 147 [2018-11-23 01:26:16,855 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2018-11-23 01:26:16,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-11-23 01:26:16,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2018-11-23 01:26:16,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-11-23 01:26:16,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 167 transitions. [2018-11-23 01:26:16,858 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 167 transitions. Word has length 28 [2018-11-23 01:26:16,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:26:16,858 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 167 transitions. [2018-11-23 01:26:16,858 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 01:26:16,858 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 167 transitions. [2018-11-23 01:26:16,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-23 01:26:16,859 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:26:16,859 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 01:26:16,859 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr16REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, appendErr22REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr21REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr23REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr19REQUIRES_VIOLATION, appendErr20REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr24REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr25REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr16REQUIRES_VIOLATION, appendErr18REQUIRES_VIOLATION, appendErr17REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION]=== [2018-11-23 01:26:16,859 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:26:16,860 INFO L82 PathProgramCache]: Analyzing trace with hash -199248768, now seen corresponding path program 1 times [2018-11-23 01:26:16,860 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 01:26:16,860 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4369ccf2-83a9-42f3-87f7-0dd3089303ed/bin-2019/utaipan/cvc4nyu Starting monitored process 12 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 01:26:16,883 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:26:16,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:26:16,946 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 01:26:16,951 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-23 01:26:16,952 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 01:26:16,954 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:26:16,955 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 01:26:16,955 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 01:26:16,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 01:26:16,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 01:26:16,955 INFO L87 Difference]: Start difference. First operand 147 states and 167 transitions. Second operand 3 states. [2018-11-23 01:26:16,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:26:16,971 INFO L93 Difference]: Finished difference Result 154 states and 171 transitions. [2018-11-23 01:26:16,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 01:26:16,971 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-11-23 01:26:16,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:26:16,972 INFO L225 Difference]: With dead ends: 154 [2018-11-23 01:26:16,972 INFO L226 Difference]: Without dead ends: 154 [2018-11-23 01:26:16,972 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 01:26:16,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-11-23 01:26:16,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 143. [2018-11-23 01:26:16,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-11-23 01:26:16,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 159 transitions. [2018-11-23 01:26:16,975 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 159 transitions. Word has length 32 [2018-11-23 01:26:16,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:26:16,976 INFO L480 AbstractCegarLoop]: Abstraction has 143 states and 159 transitions. [2018-11-23 01:26:16,976 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 01:26:16,976 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 159 transitions. [2018-11-23 01:26:16,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-23 01:26:16,976 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:26:16,976 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 01:26:16,977 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr16REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, appendErr22REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr21REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr23REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr19REQUIRES_VIOLATION, appendErr20REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr24REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr25REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr16REQUIRES_VIOLATION, appendErr18REQUIRES_VIOLATION, appendErr17REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION]=== [2018-11-23 01:26:16,977 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:26:16,977 INFO L82 PathProgramCache]: Analyzing trace with hash 1846680626, now seen corresponding path program 1 times [2018-11-23 01:26:16,977 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 01:26:16,977 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4369ccf2-83a9-42f3-87f7-0dd3089303ed/bin-2019/utaipan/cvc4nyu Starting monitored process 13 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 01:26:16,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:26:17,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:26:17,127 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 01:26:17,140 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-23 01:26:17,140 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 01:26:17,149 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-23 01:26:17,149 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:12 [2018-11-23 01:26:17,327 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 01:26:17,327 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 01:26:17,328 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-11-23 01:26:17,328 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 01:26:17,338 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-11-23 01:26:17,339 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 01:26:17,347 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 01:26:17,347 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:20 [2018-11-23 01:26:17,381 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 01:26:17,381 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 01:26:17,828 WARN L180 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 51 [2018-11-23 01:26:17,830 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 25 [2018-11-23 01:26:17,831 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 01:26:17,833 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 23 [2018-11-23 01:26:17,833 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 01:26:17,913 INFO L478 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 23 treesize of output 17 [2018-11-23 01:26:17,913 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 01:26:17,918 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 01:26:17,918 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 01:26:17,919 INFO L478 Elim1Store]: Elim1 did not use 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 16 [2018-11-23 01:26:17,919 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 01:26:18,024 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 25 [2018-11-23 01:26:18,025 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 01:26:18,028 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 29 [2018-11-23 01:26:18,029 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 01:26:18,112 INFO L478 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 25 treesize of output 19 [2018-11-23 01:26:18,113 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-23 01:26:18,118 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 01:26:18,118 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 01:26:18,119 INFO L478 Elim1Store]: Elim1 did not use 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 18 [2018-11-23 01:26:18,120 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-23 01:26:18,186 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-1 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2018-11-23 01:26:18,186 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 12 variables, input treesize:124, output treesize:45 [2018-11-23 01:26:18,671 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 26 [2018-11-23 01:26:18,673 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-11-23 01:26:18,678 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-11-23 01:26:18,678 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 01:26:18,762 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 11 dim-0 vars, and 5 xjuncts. [2018-11-23 01:26:18,763 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:51, output treesize:233 [2018-11-23 01:26:19,176 WARN L180 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 55 [2018-11-23 01:26:19,195 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 01:26:19,198 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 01:26:19,198 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4369ccf2-83a9-42f3-87f7-0dd3089303ed/bin-2019/utaipan/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 01:26:19,218 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:26:19,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:26:19,256 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 01:26:19,497 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 01:26:19,498 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 01:26:19,499 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-11-23 01:26:19,499 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 01:26:19,517 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-11-23 01:26:19,517 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 01:26:19,525 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 01:26:19,525 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:20 [2018-11-23 01:26:19,528 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 01:26:19,528 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 01:26:19,765 INFO L267 ElimStorePlain]: Start of recursive call 1: End of recursive call: and 1 xjuncts. [2018-11-23 01:26:19,765 INFO L202 ElimStorePlain]: Needed 1 recursive calls to eliminate 8 variables, input treesize:94, output treesize:1 [2018-11-23 01:26:20,260 WARN L180 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 71 [2018-11-23 01:26:20,274 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 57 [2018-11-23 01:26:20,275 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-11-23 01:26:20,278 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 48 [2018-11-23 01:26:20,278 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 01:26:20,290 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 55 [2018-11-23 01:26:20,292 INFO L267 ElimStorePlain]: Start of recursive call 4: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-11-23 01:26:20,532 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 01:26:20,532 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 01:26:20,533 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 35 [2018-11-23 01:26:20,533 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 01:26:20,768 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 33 [2018-11-23 01:26:20,769 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 01:26:21,021 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 01:26:21,022 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 01:26:21,022 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 38 [2018-11-23 01:26:21,023 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 01:26:21,026 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 01:26:21,026 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 01:26:21,027 INFO L478 Elim1Store]: Elim1 did not use 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 36 [2018-11-23 01:26:21,028 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-23 01:26:21,031 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 01:26:21,032 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 01:26:21,032 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 37 [2018-11-23 01:26:21,033 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-23 01:26:21,036 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 01:26:21,037 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 01:26:21,037 INFO L478 Elim1Store]: Elim1 did not use 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 41 [2018-11-23 01:26:21,038 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-23 01:26:21,045 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 01:26:21,046 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 01:26:21,046 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 39 [2018-11-23 01:26:21,047 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-23 01:26:21,263 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 42 [2018-11-23 01:26:21,264 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 01:26:21,480 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 01:26:21,480 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 01:26:21,481 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 31 [2018-11-23 01:26:21,481 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-23 01:26:21,694 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 6 dim-1 vars, End of recursive call: 9 dim-0 vars, and 7 xjuncts. [2018-11-23 01:26:21,694 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 9 variables, input treesize:160, output treesize:228 [2018-11-23 01:26:22,120 WARN L180 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 30 [2018-11-23 01:26:22,141 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 01:26:22,156 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-11-23 01:26:22,156 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8, 6] total 22 [2018-11-23 01:26:22,156 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-23 01:26:22,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-23 01:26:22,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=413, Unknown=0, NotChecked=0, Total=506 [2018-11-23 01:26:22,157 INFO L87 Difference]: Start difference. First operand 143 states and 159 transitions. Second operand 23 states. [2018-11-23 01:26:29,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:26:29,151 INFO L93 Difference]: Finished difference Result 166 states and 176 transitions. [2018-11-23 01:26:29,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 01:26:29,153 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 34 [2018-11-23 01:26:29,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:26:29,153 INFO L225 Difference]: With dead ends: 166 [2018-11-23 01:26:29,153 INFO L226 Difference]: Without dead ends: 166 [2018-11-23 01:26:29,154 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 109 SyntacticMatches, 4 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=165, Invalid=591, Unknown=0, NotChecked=0, Total=756 [2018-11-23 01:26:29,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-11-23 01:26:29,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 137. [2018-11-23 01:26:29,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-11-23 01:26:29,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 147 transitions. [2018-11-23 01:26:29,157 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 147 transitions. Word has length 34 [2018-11-23 01:26:29,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:26:29,157 INFO L480 AbstractCegarLoop]: Abstraction has 137 states and 147 transitions. [2018-11-23 01:26:29,157 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-23 01:26:29,157 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 147 transitions. [2018-11-23 01:26:29,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-23 01:26:29,158 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:26:29,158 INFO L402 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] [2018-11-23 01:26:29,158 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr16REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, appendErr22REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr21REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr23REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr19REQUIRES_VIOLATION, appendErr20REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr24REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr25REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr16REQUIRES_VIOLATION, appendErr18REQUIRES_VIOLATION, appendErr17REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION]=== [2018-11-23 01:26:29,159 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:26:29,159 INFO L82 PathProgramCache]: Analyzing trace with hash -169497700, now seen corresponding path program 1 times [2018-11-23 01:26:29,161 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 01:26:29,161 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4369ccf2-83a9-42f3-87f7-0dd3089303ed/bin-2019/utaipan/cvc4nyu Starting monitored process 15 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 01:26:29,173 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:26:29,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:26:29,282 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 01:26:29,288 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-23 01:26:29,288 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 01:26:29,294 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-23 01:26:29,294 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2018-11-23 01:26:31,307 WARN L854 $PredicateComparison]: unable to prove that (exists ((|append_#t~malloc2.base| (_ BitVec 32))) (and (= |c_#valid| (store |c_old(#valid)| |append_#t~malloc2.base| (_ bv1 1))) (= (select |c_old(#valid)| |append_#t~malloc2.base|) (_ bv0 1)))) is different from true [2018-11-23 01:26:31,318 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 01:26:31,322 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 01:26:31,323 INFO L478 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-23 01:26:31,323 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 01:26:31,332 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-23 01:26:31,332 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:16 [2018-11-23 01:26:31,365 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 01:26:31,365 INFO L478 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 20 treesize of output 20 [2018-11-23 01:26:31,366 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 01:26:31,372 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 01:26:31,372 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:24, output treesize:20 [2018-11-23 01:26:31,389 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2018-11-23 01:26:31,390 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 01:26:31,447 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 01:26:31,447 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4369ccf2-83a9-42f3-87f7-0dd3089303ed/bin-2019/utaipan/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 01:26:31,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:26:31,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:26:31,511 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 01:26:31,514 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-23 01:26:31,514 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 01:26:31,521 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 01:26:31,522 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-23 01:26:31,539 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 01:26:31,540 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 01:26:31,541 INFO L478 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-23 01:26:31,541 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 01:26:31,546 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-23 01:26:31,547 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:16 [2018-11-23 01:26:31,552 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 01:26:31,553 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 01:26:31,553 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 01:26:31,554 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 44 [2018-11-23 01:26:31,554 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 01:26:31,566 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 01:26:31,566 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:29, output treesize:31 [2018-11-23 01:26:31,593 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2018-11-23 01:26:31,593 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 01:26:31,683 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 01:26:31,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 9 [2018-11-23 01:26:31,683 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 01:26:31,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 01:26:31,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=136, Unknown=1, NotChecked=24, Total=210 [2018-11-23 01:26:31,684 INFO L87 Difference]: Start difference. First operand 137 states and 147 transitions. Second operand 10 states. [2018-11-23 01:26:33,837 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification. DAG size of input: 16 DAG size of output: 11 [2018-11-23 01:26:34,268 WARN L180 SmtUtils]: Spent 232.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-11-23 01:26:34,787 WARN L180 SmtUtils]: Spent 423.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 27 [2018-11-23 01:26:35,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:26:35,539 INFO L93 Difference]: Finished difference Result 250 states and 271 transitions. [2018-11-23 01:26:35,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 01:26:35,539 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 35 [2018-11-23 01:26:35,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:26:35,540 INFO L225 Difference]: With dead ends: 250 [2018-11-23 01:26:35,540 INFO L226 Difference]: Without dead ends: 250 [2018-11-23 01:26:35,541 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 69 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=84, Invalid=261, Unknown=1, NotChecked=34, Total=380 [2018-11-23 01:26:35,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2018-11-23 01:26:35,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 184. [2018-11-23 01:26:35,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-11-23 01:26:35,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 214 transitions. [2018-11-23 01:26:35,544 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 214 transitions. Word has length 35 [2018-11-23 01:26:35,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:26:35,545 INFO L480 AbstractCegarLoop]: Abstraction has 184 states and 214 transitions. [2018-11-23 01:26:35,545 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 01:26:35,545 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 214 transitions. [2018-11-23 01:26:35,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-23 01:26:35,545 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:26:35,546 INFO L402 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] [2018-11-23 01:26:35,546 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr16REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, appendErr22REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr21REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr23REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr19REQUIRES_VIOLATION, appendErr20REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr24REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr25REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr16REQUIRES_VIOLATION, appendErr18REQUIRES_VIOLATION, appendErr17REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION]=== [2018-11-23 01:26:35,546 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:26:35,546 INFO L82 PathProgramCache]: Analyzing trace with hash -169497699, now seen corresponding path program 1 times [2018-11-23 01:26:35,549 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 01:26:35,549 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4369ccf2-83a9-42f3-87f7-0dd3089303ed/bin-2019/utaipan/cvc4nyu Starting monitored process 17 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 01:26:35,565 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:26:35,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:26:35,673 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 01:26:35,678 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-23 01:26:35,678 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 01:26:35,697 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-23 01:26:35,697 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 01:26:35,705 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 01:26:35,705 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-11-23 01:26:37,277 WARN L854 $PredicateComparison]: unable to prove that (exists ((|append_#t~malloc2.base| (_ BitVec 32))) (and (= |c_#length| (store |c_old(#length)| |append_#t~malloc2.base| (_ bv9 32))) (= (select |c_old(#valid)| |append_#t~malloc2.base|) (_ bv0 1)))) is different from true [2018-11-23 01:26:37,286 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 01:26:37,287 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 01:26:37,288 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-11-23 01:26:37,288 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 01:26:37,299 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 01:26:37,300 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 01:26:37,300 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-23 01:26:37,300 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 01:26:37,307 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 01:26:37,307 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:14 [2018-11-23 01:26:37,331 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 01:26:37,336 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 01:26:37,342 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 24 [2018-11-23 01:26:37,342 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-11-23 01:26:37,369 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-11-23 01:26:37,369 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:38 [2018-11-23 01:26:37,409 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2018-11-23 01:26:37,409 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 01:26:37,691 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 01:26:37,691 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4369ccf2-83a9-42f3-87f7-0dd3089303ed/bin-2019/utaipan/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 01:26:37,696 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:26:37,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:26:37,729 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 01:26:37,731 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-23 01:26:37,732 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 01:26:37,739 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-23 01:26:37,739 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 01:26:37,743 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 01:26:37,743 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-11-23 01:26:37,757 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 01:26:37,758 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 01:26:37,759 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-11-23 01:26:37,759 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 01:26:37,769 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 01:26:37,770 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 01:26:37,770 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-11-23 01:26:37,770 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 01:26:37,776 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 01:26:37,776 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:14 [2018-11-23 01:26:37,781 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 01:26:37,785 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 01:26:37,790 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 24 [2018-11-23 01:26:37,791 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-11-23 01:26:37,809 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-23 01:26:37,809 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:41 [2018-11-23 01:26:37,919 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2018-11-23 01:26:37,919 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 01:26:38,278 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 01:26:38,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 8 [2018-11-23 01:26:38,278 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 01:26:38,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 01:26:38,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=121, Unknown=2, NotChecked=22, Total=182 [2018-11-23 01:26:38,279 INFO L87 Difference]: Start difference. First operand 184 states and 214 transitions. Second operand 9 states. [2018-11-23 01:26:41,405 WARN L180 SmtUtils]: Spent 908.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2018-11-23 01:26:42,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:26:42,252 INFO L93 Difference]: Finished difference Result 230 states and 266 transitions. [2018-11-23 01:26:42,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 01:26:42,253 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 35 [2018-11-23 01:26:42,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:26:42,254 INFO L225 Difference]: With dead ends: 230 [2018-11-23 01:26:42,254 INFO L226 Difference]: Without dead ends: 230 [2018-11-23 01:26:42,255 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 68 SyntacticMatches, 4 SemanticMatches, 14 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=48, Invalid=163, Unknown=3, NotChecked=26, Total=240 [2018-11-23 01:26:42,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2018-11-23 01:26:42,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 210. [2018-11-23 01:26:42,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2018-11-23 01:26:42,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 245 transitions. [2018-11-23 01:26:42,259 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 245 transitions. Word has length 35 [2018-11-23 01:26:42,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:26:42,260 INFO L480 AbstractCegarLoop]: Abstraction has 210 states and 245 transitions. [2018-11-23 01:26:42,260 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 01:26:42,260 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 245 transitions. [2018-11-23 01:26:42,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-23 01:26:42,261 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:26:42,261 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 01:26:42,261 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr16REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, appendErr22REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr21REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr23REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr19REQUIRES_VIOLATION, appendErr20REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr24REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr25REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr16REQUIRES_VIOLATION, appendErr18REQUIRES_VIOLATION, appendErr17REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION]=== [2018-11-23 01:26:42,261 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:26:42,261 INFO L82 PathProgramCache]: Analyzing trace with hash -288681179, now seen corresponding path program 1 times [2018-11-23 01:26:42,262 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 01:26:42,262 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4369ccf2-83a9-42f3-87f7-0dd3089303ed/bin-2019/utaipan/cvc4nyu Starting monitored process 19 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 01:26:42,277 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:26:42,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:26:42,418 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 01:26:42,420 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-23 01:26:42,420 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 01:26:42,424 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 01:26:42,424 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-23 01:26:42,432 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-23 01:26:42,432 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 01:26:42,438 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-23 01:26:42,438 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2018-11-23 01:26:42,480 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-23 01:26:42,482 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-23 01:26:42,482 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 01:26:42,484 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 01:26:42,493 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 01:26:42,493 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:32, output treesize:28 [2018-11-23 01:26:42,545 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 35 [2018-11-23 01:26:42,549 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2018-11-23 01:26:42,549 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 01:26:44,176 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 30 [2018-11-23 01:26:44,176 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-23 01:26:44,203 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 01:26:44,235 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 01:26:44,235 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:41, output treesize:76 [2018-11-23 01:26:44,372 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 71 treesize of output 68 [2018-11-23 01:26:44,377 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 01:26:44,377 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 79 [2018-11-23 01:26:44,378 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 01:26:44,454 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 01:26:50,212 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 55 [2018-11-23 01:26:50,213 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-23 01:26:50,273 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 01:26:50,372 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 29 [2018-11-23 01:26:50,376 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 01:26:50,376 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-23 01:26:50,376 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 01:26:50,389 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 01:26:50,467 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 3 xjuncts. [2018-11-23 01:26:50,467 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:106, output treesize:120 [2018-11-23 01:26:50,576 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 01:26:50,577 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 01:26:50,578 INFO L478 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 69 treesize of output 73 [2018-11-23 01:26:50,578 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 01:26:50,646 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 01:26:50,647 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:144, output treesize:62 [2018-11-23 01:26:50,751 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 01:26:50,752 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 01:26:50,753 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 01:26:50,754 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 54 [2018-11-23 01:26:50,754 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 01:26:50,781 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-23 01:26:50,781 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:67, output treesize:72 [2018-11-23 01:26:50,867 INFO L478 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 68 treesize of output 68 [2018-11-23 01:26:50,871 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2018-11-23 01:26:50,871 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 01:26:50,888 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 01:26:50,913 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-23 01:26:50,913 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:87, output treesize:72 [2018-11-23 01:26:51,079 INFO L478 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 72 treesize of output 72 [2018-11-23 01:26:51,083 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-11-23 01:26:51,083 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 01:26:51,107 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 01:26:51,152 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-23 01:26:51,152 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:91, output treesize:87 [2018-11-23 01:26:51,305 INFO L478 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 81 treesize of output 79 [2018-11-23 01:26:51,313 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 01:26:51,317 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 33 [2018-11-23 01:26:51,317 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 01:26:51,350 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 01:26:51,397 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-11-23 01:26:51,397 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:100, output treesize:96 [2018-11-23 01:26:51,516 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 60 [2018-11-23 01:26:51,526 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 01:26:51,529 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 8 [2018-11-23 01:26:51,529 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 01:26:51,555 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 01:26:51,556 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-11-23 01:26:51,556 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 01:26:51,565 INFO L478 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 26 treesize of output 15 [2018-11-23 01:26:51,565 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 01:26:51,570 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 01:26:51,577 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-23 01:26:51,577 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:98, output treesize:31 [2018-11-23 01:26:51,645 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 01:26:51,645 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 01:26:52,026 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 01:26:52,030 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 01:26:52,031 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 01:26:52,036 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 01:26:52,061 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 4 xjuncts. [2018-11-23 01:26:52,061 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:40, output treesize:84 [2018-11-23 01:27:04,608 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2018-11-23 01:27:04,776 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2018-11-23 01:27:04,875 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 69 [2018-11-23 01:27:05,004 WARN L180 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 47 [2018-11-23 01:27:05,013 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-11-23 01:27:05,013 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 01:27:05,059 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 01:27:05,060 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 01:27:05,063 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 01:27:05,070 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 72 [2018-11-23 01:27:05,157 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 01:27:06,097 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 40 [2018-11-23 01:27:06,102 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 01:27:06,102 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 01:27:06,123 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 01:27:06,123 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 01:27:06,125 INFO L478 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 31 treesize of output 55 [2018-11-23 01:27:06,125 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 01:27:08,767 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 01:27:08,768 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 36 [2018-11-23 01:27:08,769 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 01:27:08,820 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 01:27:08,879 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 40 [2018-11-23 01:27:08,897 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 01:27:08,898 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 01:27:08,899 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 01:27:08,900 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2018-11-23 01:27:08,900 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-23 01:27:08,912 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 01:27:08,925 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 40 [2018-11-23 01:27:08,937 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 01:27:08,938 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 01:27:08,939 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 27 [2018-11-23 01:27:08,939 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-23 01:27:08,948 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 01:27:08,973 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 01:27:09,001 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 01:27:09,057 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 01:27:09,058 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 6 variables, input treesize:127, output treesize:29 [2018-11-23 01:27:09,130 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 01:27:09,130 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4369ccf2-83a9-42f3-87f7-0dd3089303ed/bin-2019/utaipan/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 01:27:09,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:27:09,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:27:09,189 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 01:27:09,191 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-23 01:27:09,191 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 01:27:09,194 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 01:27:09,195 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-23 01:27:09,197 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 01:27:09,198 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 01:27:09,198 INFO L478 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-23 01:27:09,198 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 01:27:09,207 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-23 01:27:09,208 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:18 [2018-11-23 01:27:11,604 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-23 01:27:11,606 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-23 01:27:11,606 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 01:27:11,609 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 01:27:11,621 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 01:27:11,621 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:37 [2018-11-23 01:27:11,739 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 35 [2018-11-23 01:27:11,742 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2018-11-23 01:27:11,742 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 01:27:13,392 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 30 [2018-11-23 01:27:13,393 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-23 01:27:13,421 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 01:27:13,468 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 01:27:13,468 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:50, output treesize:94 [2018-11-23 01:27:13,704 WARN L180 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 37 [2018-11-23 01:27:13,711 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 38 [2018-11-23 01:27:13,714 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 01:27:13,715 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-23 01:27:13,715 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 01:27:13,730 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 01:27:13,873 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 80 treesize of output 77 [2018-11-23 01:27:13,892 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 01:27:17,454 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 3 case distinctions, treesize of input 62 treesize of output 68 [2018-11-23 01:27:17,454 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-11-23 01:27:17,574 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 01:27:17,574 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 78 [2018-11-23 01:27:17,575 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 01:27:17,634 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 01:27:17,694 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 3 xjuncts. [2018-11-23 01:27:17,694 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:124, output treesize:147 [2018-11-23 01:27:17,880 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-11-23 01:27:17,880 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 01:27:17,949 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 01:27:17,950 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 01:27:17,952 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 01:27:17,952 INFO L478 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 26 treesize of output 25 [2018-11-23 01:27:17,953 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 01:27:17,980 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 01:27:17,981 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:210, output treesize:64 [2018-11-23 01:27:18,023 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 01:27:18,025 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 01:27:18,027 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 01:27:18,028 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 54 [2018-11-23 01:27:18,028 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 01:27:18,056 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-23 01:27:18,056 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:67, output treesize:72 [2018-11-23 01:27:18,078 INFO L478 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 68 treesize of output 68 [2018-11-23 01:27:18,083 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2018-11-23 01:27:18,083 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 01:27:18,100 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 01:27:18,127 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-23 01:27:18,127 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:87, output treesize:72 [2018-11-23 01:27:18,299 INFO L478 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 66 treesize of output 66 [2018-11-23 01:27:18,303 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-23 01:27:18,304 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 01:27:18,332 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 01:27:18,371 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-23 01:27:18,372 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:85, output treesize:72 [2018-11-23 01:27:18,443 INFO L478 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 66 treesize of output 66 [2018-11-23 01:27:18,447 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-23 01:27:18,448 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 01:27:18,470 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 01:27:18,505 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-11-23 01:27:18,505 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:85, output treesize:81 [2018-11-23 01:27:18,680 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 51 [2018-11-23 01:27:18,685 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-11-23 01:27:18,685 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 01:27:18,716 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 01:27:18,717 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-11-23 01:27:18,717 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 01:27:18,725 INFO L478 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 26 treesize of output 15 [2018-11-23 01:27:18,725 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 01:27:18,729 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 01:27:18,737 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-23 01:27:18,737 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:85, output treesize:31 [2018-11-23 01:27:18,750 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 01:27:18,750 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 01:27:21,328 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 01:27:21,336 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 01:27:21,337 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 01:27:21,353 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 01:27:21,354 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 01:27:21,374 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 01:27:21,446 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 8 dim-0 vars, and 3 xjuncts. [2018-11-23 01:27:21,447 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:53, output treesize:129 [2018-11-23 01:27:29,041 WARN L180 SmtUtils]: Spent 1.06 s on a formula simplification that was a NOOP. DAG size: 42 [2018-11-23 01:27:31,369 WARN L180 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2018-11-23 01:27:31,584 WARN L180 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2018-11-23 01:27:31,705 WARN L180 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2018-11-23 01:27:31,991 WARN L180 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 62 [2018-11-23 01:27:32,017 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 01:27:32,024 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 01:27:32,028 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 01:27:32,032 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 01:27:32,033 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 171 treesize of output 296 [2018-11-23 01:27:32,034 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 01:27:32,135 INFO L478 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 289 treesize of output 180 [2018-11-23 01:27:32,464 WARN L180 SmtUtils]: Spent 328.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 57 [2018-11-23 01:27:32,470 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-11-23 01:27:32,471 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 01:27:32,566 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 01:27:32,576 INFO L478 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 119 treesize of output 123 [2018-11-23 01:27:32,708 WARN L180 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 41 [2018-11-23 01:27:32,741 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 01:27:36,002 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 40 [2018-11-23 01:27:36,009 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 01:27:36,011 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 39 [2018-11-23 01:27:36,011 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 01:27:36,402 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 01:27:36,439 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 01:27:36,439 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 01:27:36,440 INFO L478 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 28 treesize of output 52 [2018-11-23 01:27:36,441 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-23 01:27:38,505 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 01:27:40,022 INFO L478 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 91 treesize of output 82 [2018-11-23 01:27:40,042 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 41 [2018-11-23 01:27:40,076 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 01:27:40,081 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 44 [2018-11-23 01:27:40,168 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 01:27:40,172 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 12 [2018-11-23 01:27:40,172 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-23 01:27:40,210 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 01:27:40,234 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 34 [2018-11-23 01:27:40,235 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 4 xjuncts. [2018-11-23 01:27:41,699 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-23 01:27:41,743 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-23 01:27:41,846 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 01:27:41,847 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 01:27:41,848 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 22 [2018-11-23 01:27:41,848 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-23 01:27:41,900 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-23 01:27:41,913 INFO L478 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 91 treesize of output 82 [2018-11-23 01:27:41,929 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 01:27:41,930 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 01:27:41,932 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 01:27:41,933 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 29 [2018-11-23 01:27:41,933 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-11-23 01:27:41,971 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 41 [2018-11-23 01:27:41,978 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 01:27:41,982 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 44 [2018-11-23 01:27:42,028 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 01:27:42,032 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 12 [2018-11-23 01:27:42,032 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-11-23 01:27:42,041 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 01:27:42,068 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 34 [2018-11-23 01:27:42,069 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 4 xjuncts. [2018-11-23 01:27:42,131 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-23 01:27:42,163 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-23 01:27:42,209 INFO L267 ElimStorePlain]: Start of recursive call 15: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-23 01:27:42,330 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 6 xjuncts. [2018-11-23 01:27:42,454 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 6 xjuncts. [2018-11-23 01:27:42,597 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 01:27:42,597 INFO L202 ElimStorePlain]: Needed 20 recursive calls to eliminate 8 variables, input treesize:193, output treesize:20 [2018-11-23 01:27:49,827 WARN L180 SmtUtils]: Spent 180.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2018-11-23 01:28:17,430 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 179 treesize of output 130 [2018-11-23 01:28:17,817 WARN L180 SmtUtils]: Spent 385.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 74 [2018-11-23 01:28:17,828 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-11-23 01:28:17,828 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 01:28:18,144 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 163 treesize of output 177 [2018-11-23 01:28:21,859 WARN L180 SmtUtils]: Spent 3.71 s on a formula simplification. DAG size of input: 373 DAG size of output: 361 [2018-11-23 01:28:27,629 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 151 treesize of output 168 [2018-11-23 01:28:27,642 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 01:28:27,643 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 152 treesize of output 154 [2018-11-23 01:28:27,644 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 01:28:29,103 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 01:28:29,113 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 01:28:29,118 INFO L303 Elim1Store]: Index analysis took 171 ms [2018-11-23 01:28:29,182 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 123 treesize of output 135 [2018-11-23 01:28:29,183 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-23 01:28:29,944 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 01:28:36,618 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 128 treesize of output 159 [2018-11-23 01:28:36,618 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 3 xjuncts. [2018-11-23 01:28:38,091 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 01:28:38,101 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 01:28:38,152 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 125 treesize of output 137 [2018-11-23 01:28:38,154 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-23 01:28:38,336 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 01:28:38,348 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 01:28:38,358 INFO L303 Elim1Store]: Index analysis took 203 ms [2018-11-23 01:28:38,398 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 123 treesize of output 135 [2018-11-23 01:28:38,399 INFO L267 ElimStorePlain]: Start of recursive call 10: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-23 01:28:40,482 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 01:28:49,712 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 126 treesize of output 157 [2018-11-23 01:28:49,713 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 4 xjuncts. [2018-11-23 01:28:52,668 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 121 treesize of output 123 [2018-11-23 01:28:52,669 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-23 01:28:52,717 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 123 treesize of output 125 [2018-11-23 01:28:52,718 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-23 01:28:52,858 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 01:28:52,863 INFO L303 Elim1Store]: Index analysis took 144 ms [2018-11-23 01:28:52,863 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 111 [2018-11-23 01:28:52,864 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 01:28:54,880 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 01:28:57,669 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 3 case distinctions, treesize of input 118 treesize of output 141 [2018-11-23 01:28:58,173 WARN L180 SmtUtils]: Spent 503.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 92 [2018-11-23 01:28:58,183 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 01:28:58,276 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 111 treesize of output 122 [2018-11-23 01:28:58,277 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 4 xjuncts. [2018-11-23 01:28:58,283 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 01:28:58,447 INFO L303 Elim1Store]: Index analysis took 169 ms [2018-11-23 01:28:59,485 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 116 treesize of output 127 [2018-11-23 01:28:59,486 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 4 xjuncts. [2018-11-23 01:29:32,366 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 01:29:32,369 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 01:29:32,379 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 117 [2018-11-23 01:29:32,379 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-11-23 01:29:32,844 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 6 xjuncts. [2018-11-23 01:29:34,643 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 01:29:34,644 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 106 [2018-11-23 01:29:34,645 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-11-23 01:29:34,651 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 01:29:34,653 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 103 [2018-11-23 01:29:34,653 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-11-23 01:29:34,659 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 01:29:34,661 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 108 [2018-11-23 01:29:34,661 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-11-23 01:29:34,667 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 01:29:34,669 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 96 [2018-11-23 01:29:34,669 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-11-23 01:29:34,675 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 01:29:34,676 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 101 [2018-11-23 01:29:34,676 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-11-23 01:29:34,683 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 01:29:34,684 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 101 [2018-11-23 01:29:34,685 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-11-23 01:29:36,517 INFO L267 ElimStorePlain]: Start of recursive call 5: 8 dim-1 vars, End of recursive call: 11 dim-0 vars, and 18 xjuncts. [2018-11-23 01:29:36,535 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 01:29:36,569 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 141 treesize of output 153 [2018-11-23 01:29:36,585 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 01:29:36,587 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 146 treesize of output 150 [2018-11-23 01:29:36,587 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-11-23 01:29:36,750 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 01:29:40,804 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 3 case distinctions, treesize of input 108 treesize of output 131 [2018-11-23 01:29:41,225 WARN L180 SmtUtils]: Spent 419.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 89 [2018-11-23 01:29:41,231 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 01:29:41,280 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 103 treesize of output 114 [2018-11-23 01:29:41,281 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 4 xjuncts. [2018-11-23 01:29:41,283 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-23 01:29:41,284 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-11-23 01:30:13,715 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 01:30:13,718 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 01:30:13,742 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 107 [2018-11-23 01:30:13,742 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-11-23 01:30:13,957 INFO L267 ElimStorePlain]: Start of recursive call 27: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-11-23 01:30:14,259 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 01:30:14,260 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 88 treesize of output 95 [2018-11-23 01:30:14,261 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-11-23 01:30:14,279 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 01:30:14,280 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 83 treesize of output 90 [2018-11-23 01:30:14,281 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2018-11-23 01:30:14,295 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 01:30:14,296 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 90 treesize of output 97 [2018-11-23 01:30:14,296 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-11-23 01:30:14,670 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 01:30:14,679 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 01:30:14,686 INFO L303 Elim1Store]: Index analysis took 140 ms [2018-11-23 01:30:14,740 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 115 treesize of output 127 [2018-11-23 01:30:14,741 INFO L267 ElimStorePlain]: Start of recursive call 34: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-23 01:30:16,157 INFO L267 ElimStorePlain]: Start of recursive call 25: 4 dim-1 vars, End of recursive call: 3 dim-0 vars, and 5 xjuncts. [2018-11-23 01:30:16,177 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 01:30:22,266 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 114 treesize of output 158 [2018-11-23 01:30:22,282 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 01:30:24,091 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 3 case distinctions, treesize of input 133 treesize of output 150 [2018-11-23 01:30:28,574 WARN L180 SmtUtils]: Spent 4.48 s on a formula simplification. DAG size of input: 96 DAG size of output: 89 [2018-11-23 01:30:28,589 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 01:30:28,632 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 114 treesize of output 119 [2018-11-23 01:30:28,633 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 4 xjuncts. [2018-11-23 01:30:28,648 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 01:30:28,793 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 01:30:28,816 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 01:30:28,825 INFO L303 Elim1Store]: Index analysis took 191 ms [2018-11-23 01:30:28,906 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 122 treesize of output 155 [2018-11-23 01:30:28,909 INFO L267 ElimStorePlain]: Start of recursive call 38: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 10 xjuncts. [2018-11-23 01:30:31,832 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 01:30:31,914 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 115 treesize of output 126 [2018-11-23 01:30:31,915 INFO L267 ElimStorePlain]: Start of recursive call 39: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 4 xjuncts. [2018-11-23 01:30:31,921 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 01:30:31,926 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 97 [2018-11-23 01:30:31,927 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 1 xjuncts. [2018-11-23 01:30:39,412 INFO L267 ElimStorePlain]: Start of recursive call 36: 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 12 xjuncts. [2018-11-23 01:30:51,918 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 01:30:51,919 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 123 treesize of output 128 [2018-11-23 01:30:51,919 INFO L267 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 1 xjuncts. [2018-11-23 01:30:53,689 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 01:30:54,945 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 3 case distinctions, treesize of input 121 treesize of output 138 [2018-11-23 01:30:55,533 WARN L180 SmtUtils]: Spent 586.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 87 [2018-11-23 01:30:55,752 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 01:30:55,761 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 01:30:55,768 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 01:30:55,778 INFO L303 Elim1Store]: Index analysis took 244 ms [2018-11-23 01:30:55,878 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 115 treesize of output 148 [2018-11-23 01:30:55,881 INFO L267 ElimStorePlain]: Start of recursive call 43: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 10 xjuncts. [2018-11-23 01:30:55,895 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 01:30:55,936 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 107 treesize of output 112 [2018-11-23 01:30:55,937 INFO L267 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 4 xjuncts. [2018-11-23 01:30:58,383 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 01:30:58,387 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 93 [2018-11-23 01:30:58,387 INFO L267 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 1 xjuncts. [2018-11-23 01:30:58,400 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 01:30:58,473 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 111 treesize of output 122 [2018-11-23 01:30:58,474 INFO L267 ElimStorePlain]: Start of recursive call 46: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 4 xjuncts. [2018-11-23 01:31:00,408 INFO L267 ElimStorePlain]: Start of recursive call 42: 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 12 xjuncts. [2018-11-23 01:31:03,035 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 01:31:03,036 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 126 [2018-11-23 01:31:03,037 INFO L267 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:08,146 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 01:31:08,151 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 119 treesize of output 129 [2018-11-23 01:31:08,408 WARN L180 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 70 [2018-11-23 01:31:08,416 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 01:31:08,482 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 40 [2018-11-23 01:31:08,482 INFO L267 ElimStorePlain]: Start of recursive call 49: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 4 xjuncts. [2018-11-23 01:31:08,489 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 01:31:08,498 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 14 [2018-11-23 01:31:08,498 INFO L267 ElimStorePlain]: Start of recursive call 50: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:09,093 INFO L267 ElimStorePlain]: Start of recursive call 48: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 4 xjuncts. [2018-11-23 01:31:47,060 WARN L670 Elim1Store]: solver failed to check if following equality is implied: (= (bvadd append_~head.offset (_ bv4 32)) (bvadd v_prenex_76 (_ bv1 32))) [2018-11-23 01:31:47,069 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 01:31:47,070 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 01:31:47,071 INFO L303 Elim1Store]: Index analysis took 2022 ms [2018-11-23 01:31:47,861 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 121 treesize of output 153 [2018-11-23 01:31:47,861 INFO L267 ElimStorePlain]: Start of recursive call 51: End of recursive call: and 2 xjuncts. [2018-11-23 01:31:54,258 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 01:31:54,262 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 128 treesize of output 138 [2018-11-23 01:31:57,664 WARN L180 SmtUtils]: Spent 3.40 s on a formula simplification. DAG size of input: 77 DAG size of output: 69 [2018-11-23 01:31:57,670 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 01:31:57,709 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 40 [2018-11-23 01:31:57,710 INFO L267 ElimStorePlain]: Start of recursive call 53: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 4 xjuncts. [2018-11-23 01:31:57,719 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 01:31:57,727 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 14 [2018-11-23 01:31:57,727 INFO L267 ElimStorePlain]: Start of recursive call 54: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:59,154 INFO L267 ElimStorePlain]: Start of recursive call 52: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 4 xjuncts. [2018-11-23 01:31:59,160 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 01:31:59,166 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 119 treesize of output 129 [2018-11-23 01:31:59,419 WARN L180 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 68 [2018-11-23 01:31:59,426 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 01:31:59,439 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 14 [2018-11-23 01:31:59,439 INFO L267 ElimStorePlain]: Start of recursive call 56: End of recursive call: and 1 xjuncts. [2018-11-23 01:31:59,445 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 01:31:59,482 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 40 [2018-11-23 01:31:59,482 INFO L267 ElimStorePlain]: Start of recursive call 57: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 4 xjuncts. [2018-11-23 01:32:00,840 INFO L267 ElimStorePlain]: Start of recursive call 55: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 4 xjuncts. [2018-11-23 01:32:28,182 WARN L670 Elim1Store]: solver failed to check if following equality is implied: (= (bvadd append_~head.offset (_ bv4 32)) (bvadd v_prenex_76 (_ bv1 32))) [2018-11-23 01:32:28,190 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 01:32:28,190 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 01:32:28,191 INFO L303 Elim1Store]: Index analysis took 2027 ms [2018-11-23 01:32:33,339 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 108 treesize of output 140 [2018-11-23 01:32:33,340 INFO L267 ElimStorePlain]: Start of recursive call 58: End of recursive call: and 2 xjuncts. [2018-11-23 01:32:35,355 WARN L670 Elim1Store]: solver failed to check if following equality is implied: (= (bvadd append_~head.offset (_ bv4 32)) (bvadd v_prenex_76 (_ bv1 32))) [2018-11-23 01:32:35,364 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 01:32:35,364 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 01:32:35,365 INFO L303 Elim1Store]: Index analysis took 2024 ms [2018-11-23 01:32:36,414 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 98 treesize of output 130 [2018-11-23 01:32:36,415 INFO L267 ElimStorePlain]: Start of recursive call 59: End of recursive call: and 2 xjuncts. [2018-11-23 01:32:36,548 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 01:32:36,553 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 01:32:36,564 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 01:32:36,565 INFO L303 Elim1Store]: Index analysis took 150 ms [2018-11-23 01:32:37,971 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 86 treesize of output 118 [2018-11-23 01:32:37,971 INFO L267 ElimStorePlain]: Start of recursive call 60: End of recursive call: and 2 xjuncts. [2018-11-23 01:32:39,983 WARN L670 Elim1Store]: solver failed to check if following equality is implied: (= (bvadd append_~head.offset (_ bv4 32)) (bvadd v_prenex_76 (_ bv1 32))) [2018-11-23 01:32:39,991 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 01:32:39,992 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 01:32:39,993 INFO L303 Elim1Store]: Index analysis took 2020 ms [2018-11-23 01:32:41,627 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 97 treesize of output 129 [2018-11-23 01:32:41,628 INFO L267 ElimStorePlain]: Start of recursive call 61: End of recursive call: and 2 xjuncts. [2018-11-23 01:32:43,636 WARN L670 Elim1Store]: solver failed to check if following equality is implied: (= (bvadd append_~head.offset (_ bv4 32)) (bvadd v_prenex_76 (_ bv1 32))) [2018-11-23 01:32:43,643 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 01:32:43,644 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 01:32:43,645 INFO L303 Elim1Store]: Index analysis took 2016 ms [2018-11-23 01:32:45,459 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 112 treesize of output 144 [2018-11-23 01:32:45,459 INFO L267 ElimStorePlain]: Start of recursive call 62: End of recursive call: and 2 xjuncts. [2018-11-23 01:32:46,090 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 01:32:46,096 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 01:32:46,096 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 01:32:46,097 INFO L303 Elim1Store]: Index analysis took 637 ms [2018-11-23 01:32:52,150 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 97 treesize of output 147 [2018-11-23 01:32:52,151 INFO L267 ElimStorePlain]: Start of recursive call 63: End of recursive call: and 3 xjuncts. [2018-11-23 01:32:54,166 WARN L670 Elim1Store]: solver failed to check if following equality is implied: (= (bvadd append_~head.offset (_ bv4 32)) (bvadd v_prenex_76 (_ bv1 32))) [2018-11-23 01:32:54,174 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 01:32:54,174 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 01:32:54,175 INFO L303 Elim1Store]: Index analysis took 2023 ms [2018-11-23 01:32:55,183 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 109 treesize of output 141 [2018-11-23 01:32:55,183 INFO L267 ElimStorePlain]: Start of recursive call 64: End of recursive call: and 2 xjuncts. [2018-11-23 01:32:55,366 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 01:32:55,371 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 01:32:55,371 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 01:32:55,372 INFO L303 Elim1Store]: Index analysis took 188 ms [2018-11-23 01:33:01,423 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 100 treesize of output 150 [2018-11-23 01:33:01,423 INFO L267 ElimStorePlain]: Start of recursive call 65: End of recursive call: and 3 xjuncts. [2018-11-23 01:33:03,437 WARN L670 Elim1Store]: solver failed to check if following equality is implied: (= (bvadd append_~head.offset (_ bv4 32)) (bvadd v_prenex_76 (_ bv1 32))) [2018-11-23 01:33:03,444 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 01:33:03,445 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 01:33:03,446 INFO L303 Elim1Store]: Index analysis took 2021 ms [2018-11-23 01:33:07,061 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 111 treesize of output 143 [2018-11-23 01:33:07,062 INFO L267 ElimStorePlain]: Start of recursive call 66: End of recursive call: and 2 xjuncts. [2018-11-23 01:34:24,774 INFO L267 ElimStorePlain]: Start of recursive call 35: 12 dim-1 vars, End of recursive call: 18 dim-0 vars, and 34 xjuncts. [2018-11-23 01:36:22,040 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 115 [2018-11-23 01:36:22,046 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 01:36:22,047 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 57 [2018-11-23 01:36:22,047 INFO L267 ElimStorePlain]: Start of recursive call 68: End of recursive call: and 1 xjuncts. [2018-11-23 01:36:22,111 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 01:36:22,116 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 39 [2018-11-23 01:36:22,156 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 01:36:22,194 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 36 [2018-11-23 01:36:22,195 INFO L267 ElimStorePlain]: Start of recursive call 70: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 4 xjuncts. [2018-11-23 01:36:22,201 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 01:36:22,207 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 12 [2018-11-23 01:36:22,208 INFO L267 ElimStorePlain]: Start of recursive call 71: End of recursive call: and 1 xjuncts. [2018-11-23 01:36:22,839 INFO L267 ElimStorePlain]: Start of recursive call 69: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 4 xjuncts. [2018-11-23 01:36:22,941 INFO L267 ElimStorePlain]: Start of recursive call 67: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 4 xjuncts. [2018-11-23 01:36:22,948 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 95 [2018-11-23 01:36:22,953 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 01:36:22,954 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 76 [2018-11-23 01:36:22,954 INFO L267 ElimStorePlain]: Start of recursive call 73: End of recursive call: and 1 xjuncts. [2018-11-23 01:36:23,007 INFO L267 ElimStorePlain]: Start of recursive call 72: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 01:37:39,322 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 100 treesize of output 123 [2018-11-23 01:37:39,342 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 01:37:39,343 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 106 treesize of output 109 [2018-11-23 01:37:39,344 INFO L267 ElimStorePlain]: Start of recursive call 75: End of recursive call: and 1 xjuncts. [2018-11-23 01:37:43,568 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 01:37:43,575 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 01:37:44,623 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 105 treesize of output 121 [2018-11-23 01:37:44,624 INFO L267 ElimStorePlain]: Start of recursive call 76: End of recursive call: and 2 xjuncts. [2018-11-23 01:37:46,888 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 01:37:46,889 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 103 [2018-11-23 01:37:46,889 INFO L267 ElimStorePlain]: Start of recursive call 77: End of recursive call: and 1 xjuncts. [2018-11-23 01:37:47,078 INFO L267 ElimStorePlain]: Start of recursive call 74: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-23 01:37:47,087 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 01:37:47,859 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 67 treesize of output 77 [2018-11-23 01:37:47,865 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 01:37:47,866 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 73 [2018-11-23 01:37:47,866 INFO L267 ElimStorePlain]: Start of recursive call 79: End of recursive call: and 1 xjuncts. [2018-11-23 01:37:48,305 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 01:37:48,313 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 01:37:48,313 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 01:37:48,314 INFO L303 Elim1Store]: Index analysis took 301 ms [2018-11-23 01:37:51,540 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 65 treesize of output 97 [2018-11-23 01:37:51,540 INFO L267 ElimStorePlain]: Start of recursive call 80: End of recursive call: and 2 xjuncts. [2018-11-23 01:37:51,689 INFO L267 ElimStorePlain]: Start of recursive call 78: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-23 01:37:54,414 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 115 treesize of output 122 [2018-11-23 01:37:54,431 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 01:37:56,071 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 113 treesize of output 129 [2018-11-23 01:37:56,072 INFO L267 ElimStorePlain]: Start of recursive call 82: End of recursive call: and 2 xjuncts. [2018-11-23 01:37:56,302 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 01:37:56,303 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 113 treesize of output 118 [2018-11-23 01:37:56,303 INFO L267 ElimStorePlain]: Start of recursive call 83: End of recursive call: and 1 xjuncts. [2018-11-23 01:37:56,515 INFO L267 ElimStorePlain]: Start of recursive call 81: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-23 01:38:44,408 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 73 [2018-11-23 01:38:44,416 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 01:38:44,418 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 28 [2018-11-23 01:38:44,418 INFO L267 ElimStorePlain]: Start of recursive call 85: End of recursive call: and 1 xjuncts. [2018-11-23 01:38:44,490 INFO L267 ElimStorePlain]: Start of recursive call 84: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 01:38:44,499 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 114 [2018-11-23 01:38:44,508 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 01:38:44,509 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 57 [2018-11-23 01:38:44,510 INFO L267 ElimStorePlain]: Start of recursive call 87: End of recursive call: and 1 xjuncts. [2018-11-23 01:38:44,590 INFO L267 ElimStorePlain]: Start of recursive call 86: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 01:38:44,599 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 99 [2018-11-23 01:38:44,607 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 01:38:44,609 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 45 [2018-11-23 01:38:44,609 INFO L267 ElimStorePlain]: Start of recursive call 89: End of recursive call: and 1 xjuncts. [2018-11-23 01:38:44,688 INFO L267 ElimStorePlain]: Start of recursive call 88: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 01:39:33,062 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 71 treesize of output 79 [2018-11-23 01:39:33,264 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 01:39:33,265 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.UnsupportedOperationException: nested self-update not yet implemented: (store v_prenex_131 (bvadd v_prenex_76 (_ bv1 32)) (_ bv0 32)) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.DerPreprocessor.constructReplacementForStoreCase(DerPreprocessor.java:248) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.DerPreprocessor.constructReplacement(DerPreprocessor.java:219) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.DerPreprocessor.constructReplacement(DerPreprocessor.java:210) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.DerPreprocessor.convert(DerPreprocessor.java:191) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.cacheConvert(TermTransformer.java:131) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.access$0(TermTransformer.java:127) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$Convert.walk(TermTransformer.java:79) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:122) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:113) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.transform(TermTransformer.java:253) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.Elim1Store.elim1(Elim1Store.java:211) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:221) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.elimAllRec(ElimStorePlain.java:199) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:293) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:245) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:418) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:290) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:188) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:232) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:456) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-11-23 01:39:33,267 INFO L168 Benchmark]: Toolchain (without parser) took 809062.79 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 191.9 MB). Free memory was 944.3 MB in the beginning and 1.1 GB in the end (delta: -138.6 MB). Peak memory consumption was 443.8 MB. Max. memory is 11.5 GB. [2018-11-23 01:39:33,267 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 01:39:33,267 INFO L168 Benchmark]: CACSL2BoogieTranslator took 390.74 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.1 MB). Free memory was 944.3 MB in the beginning and 1.1 GB in the end (delta: -188.4 MB). Peak memory consumption was 33.8 MB. Max. memory is 11.5 GB. [2018-11-23 01:39:33,268 INFO L168 Benchmark]: Boogie Procedure Inliner took 19.90 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 01:39:33,268 INFO L168 Benchmark]: Boogie Preprocessor took 22.28 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 01:39:33,268 INFO L168 Benchmark]: RCFGBuilder took 533.78 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: 46.6 MB). Peak memory consumption was 46.6 MB. Max. memory is 11.5 GB. [2018-11-23 01:39:33,268 INFO L168 Benchmark]: TraceAbstraction took 808093.35 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 38.8 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.1 MB). Peak memory consumption was 432.4 MB. Max. memory is 11.5 GB. [2018-11-23 01:39:33,269 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 390.74 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.1 MB). Free memory was 944.3 MB in the beginning and 1.1 GB in the end (delta: -188.4 MB). Peak memory consumption was 33.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 19.90 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 22.28 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 533.78 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: 46.6 MB). Peak memory consumption was 46.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 808093.35 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 38.8 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.1 MB). Peak memory consumption was 432.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: UnsupportedOperationException: nested self-update not yet implemented: (store v_prenex_131 (bvadd v_prenex_76 (_ bv1 32)) (_ bv0 32)) de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: UnsupportedOperationException: nested self-update not yet implemented: (store v_prenex_131 (bvadd v_prenex_76 (_ bv1 32)) (_ bv0 32)): de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.DerPreprocessor.constructReplacementForStoreCase(DerPreprocessor.java:248) RESULT: Ultimate could not prove your program: Toolchain returned no result. [MP z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process Received shutdown request...