./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/heap-manipulation/merge_sort_true-unreach-call_true-valid-memsafety.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_4740aade-a493-4198-b34c-4c4f6f881e09/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_4740aade-a493-4198-b34c-4c4f6f881e09/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_4740aade-a493-4198-b34c-4c4f6f881e09/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_4740aade-a493-4198-b34c-4c4f6f881e09/bin-2019/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/heap-manipulation/merge_sort_true-unreach-call_true-valid-memsafety.i -s /tmp/vcloud-vcloud-master/worker/working_dir_4740aade-a493-4198-b34c-4c4f6f881e09/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_4740aade-a493-4198-b34c-4c4f6f881e09/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 e6399ca05df7547b7620299987a8a06e9e2c006b ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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_4740aade-a493-4198-b34c-4c4f6f881e09/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_4740aade-a493-4198-b34c-4c4f6f881e09/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_4740aade-a493-4198-b34c-4c4f6f881e09/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_4740aade-a493-4198-b34c-4c4f6f881e09/bin-2019/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/heap-manipulation/merge_sort_true-unreach-call_true-valid-memsafety.i -s /tmp/vcloud-vcloud-master/worker/working_dir_4740aade-a493-4198-b34c-4c4f6f881e09/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_4740aade-a493-4198-b34c-4c4f6f881e09/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 e6399ca05df7547b7620299987a8a06e9e2c006b ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-08 17:35:32,103 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-08 17:35:32,104 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-08 17:35:32,111 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-08 17:35:32,112 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-08 17:35:32,112 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-08 17:35:32,113 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-08 17:35:32,114 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-08 17:35:32,115 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-08 17:35:32,116 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-08 17:35:32,116 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-08 17:35:32,116 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-08 17:35:32,117 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-08 17:35:32,117 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-08 17:35:32,118 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-08 17:35:32,119 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-08 17:35:32,119 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-08 17:35:32,120 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-08 17:35:32,122 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-08 17:35:32,123 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-08 17:35:32,123 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-08 17:35:32,124 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-08 17:35:32,126 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-08 17:35:32,126 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-08 17:35:32,126 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-08 17:35:32,127 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-08 17:35:32,127 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-08 17:35:32,128 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-08 17:35:32,128 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-08 17:35:32,129 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-08 17:35:32,129 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-08 17:35:32,130 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-08 17:35:32,130 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-08 17:35:32,130 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-08 17:35:32,131 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-08 17:35:32,131 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-08 17:35:32,131 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_4740aade-a493-4198-b34c-4c4f6f881e09/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2018-12-08 17:35:32,142 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-08 17:35:32,142 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-08 17:35:32,142 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-08 17:35:32,142 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-08 17:35:32,143 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-08 17:35:32,143 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-08 17:35:32,143 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-08 17:35:32,143 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-08 17:35:32,143 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-08 17:35:32,143 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-08 17:35:32,143 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-08 17:35:32,143 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-08 17:35:32,143 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-08 17:35:32,144 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-08 17:35:32,144 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-08 17:35:32,144 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-08 17:35:32,144 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-08 17:35:32,144 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-08 17:35:32,144 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-08 17:35:32,145 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-08 17:35:32,145 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-08 17:35:32,145 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-12-08 17:35:32,145 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-12-08 17:35:32,145 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-12-08 17:35:32,145 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-08 17:35:32,145 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-08 17:35:32,145 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-08 17:35:32,145 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-08 17:35:32,145 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-08 17:35:32,145 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-08 17:35:32,146 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-08 17:35:32,146 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-08 17:35:32,146 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-08 17:35:32,146 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-08 17:35:32,146 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-08 17:35:32,146 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-08 17:35:32,146 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_4740aade-a493-4198-b34c-4c4f6f881e09/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 -> e6399ca05df7547b7620299987a8a06e9e2c006b [2018-12-08 17:35:32,169 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-08 17:35:32,179 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-08 17:35:32,181 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-08 17:35:32,183 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-08 17:35:32,183 INFO L276 PluginConnector]: CDTParser initialized [2018-12-08 17:35:32,183 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_4740aade-a493-4198-b34c-4c4f6f881e09/bin-2019/utaipan/../../sv-benchmarks/c/heap-manipulation/merge_sort_true-unreach-call_true-valid-memsafety.i [2018-12-08 17:35:32,224 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4740aade-a493-4198-b34c-4c4f6f881e09/bin-2019/utaipan/data/56f9edd85/2a5de8a8c6bc4c54a7d27bc0a329aabb/FLAGea0d0ff1d [2018-12-08 17:35:32,660 INFO L307 CDTParser]: Found 1 translation units. [2018-12-08 17:35:32,661 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_4740aade-a493-4198-b34c-4c4f6f881e09/sv-benchmarks/c/heap-manipulation/merge_sort_true-unreach-call_true-valid-memsafety.i [2018-12-08 17:35:32,667 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4740aade-a493-4198-b34c-4c4f6f881e09/bin-2019/utaipan/data/56f9edd85/2a5de8a8c6bc4c54a7d27bc0a329aabb/FLAGea0d0ff1d [2018-12-08 17:35:32,675 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_4740aade-a493-4198-b34c-4c4f6f881e09/bin-2019/utaipan/data/56f9edd85/2a5de8a8c6bc4c54a7d27bc0a329aabb [2018-12-08 17:35:32,677 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-08 17:35:32,678 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-08 17:35:32,679 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-08 17:35:32,679 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-08 17:35:32,681 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-08 17:35:32,681 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 05:35:32" (1/1) ... [2018-12-08 17:35:32,683 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75090e67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:35:32, skipping insertion in model container [2018-12-08 17:35:32,683 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 05:35:32" (1/1) ... [2018-12-08 17:35:32,687 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-08 17:35:32,706 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-08 17:35:32,866 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 17:35:32,872 INFO L191 MainTranslator]: Completed pre-run [2018-12-08 17:35:32,942 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 17:35:32,964 INFO L195 MainTranslator]: Completed translation [2018-12-08 17:35:32,964 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:35:32 WrapperNode [2018-12-08 17:35:32,964 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-08 17:35:32,964 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-08 17:35:32,965 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-08 17:35:32,965 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-08 17:35:32,969 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:35:32" (1/1) ... [2018-12-08 17:35:32,978 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:35:32" (1/1) ... [2018-12-08 17:35:32,983 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-08 17:35:32,983 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-08 17:35:32,983 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-08 17:35:32,983 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-08 17:35:32,989 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:35:32" (1/1) ... [2018-12-08 17:35:32,989 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:35:32" (1/1) ... [2018-12-08 17:35:32,992 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:35:32" (1/1) ... [2018-12-08 17:35:32,992 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:35:32" (1/1) ... [2018-12-08 17:35:33,000 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:35:32" (1/1) ... [2018-12-08 17:35:33,006 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:35:32" (1/1) ... [2018-12-08 17:35:33,007 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:35:32" (1/1) ... [2018-12-08 17:35:33,009 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-08 17:35:33,009 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-08 17:35:33,010 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-08 17:35:33,010 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-08 17:35:33,010 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:35:32" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4740aade-a493-4198-b34c-4c4f6f881e09/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-08 17:35:33,040 INFO L130 BoogieDeclarations]: Found specification of procedure inspect_before [2018-12-08 17:35:33,040 INFO L138 BoogieDeclarations]: Found implementation of procedure inspect_before [2018-12-08 17:35:33,040 INFO L130 BoogieDeclarations]: Found specification of procedure inspect_after [2018-12-08 17:35:33,040 INFO L138 BoogieDeclarations]: Found implementation of procedure inspect_after [2018-12-08 17:35:33,040 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-08 17:35:33,040 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-08 17:35:33,040 INFO L130 BoogieDeclarations]: Found specification of procedure merge_single_node [2018-12-08 17:35:33,040 INFO L138 BoogieDeclarations]: Found implementation of procedure merge_single_node [2018-12-08 17:35:33,040 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2018-12-08 17:35:33,041 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2018-12-08 17:35:33,041 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-08 17:35:33,041 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-08 17:35:33,041 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-08 17:35:33,041 INFO L130 BoogieDeclarations]: Found specification of procedure merge_pair [2018-12-08 17:35:33,041 INFO L138 BoogieDeclarations]: Found implementation of procedure merge_pair [2018-12-08 17:35:33,041 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-08 17:35:33,041 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-08 17:35:33,041 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-08 17:35:33,041 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-08 17:35:33,041 INFO L130 BoogieDeclarations]: Found specification of procedure seq_sort_core [2018-12-08 17:35:33,041 INFO L138 BoogieDeclarations]: Found implementation of procedure seq_sort_core [2018-12-08 17:35:33,041 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-08 17:35:33,041 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-08 17:35:33,041 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-08 17:35:33,452 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-08 17:35:33,452 INFO L280 CfgBuilder]: Removed 33 assue(true) statements. [2018-12-08 17:35:33,452 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 05:35:33 BoogieIcfgContainer [2018-12-08 17:35:33,452 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-08 17:35:33,453 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-08 17:35:33,453 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-08 17:35:33,454 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-08 17:35:33,454 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.12 05:35:32" (1/3) ... [2018-12-08 17:35:33,455 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7817ea0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 05:35:33, skipping insertion in model container [2018-12-08 17:35:33,455 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:35:32" (2/3) ... [2018-12-08 17:35:33,455 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7817ea0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 05:35:33, skipping insertion in model container [2018-12-08 17:35:33,455 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 05:35:33" (3/3) ... [2018-12-08 17:35:33,456 INFO L112 eAbstractionObserver]: Analyzing ICFG merge_sort_true-unreach-call_true-valid-memsafety.i [2018-12-08 17:35:33,462 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-08 17:35:33,466 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 101 error locations. [2018-12-08 17:35:33,474 INFO L257 AbstractCegarLoop]: Starting to check reachability of 101 error locations. [2018-12-08 17:35:33,489 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-08 17:35:33,489 INFO L383 AbstractCegarLoop]: Hoare is false [2018-12-08 17:35:33,489 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-08 17:35:33,489 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-08 17:35:33,490 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-08 17:35:33,490 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-08 17:35:33,490 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-08 17:35:33,490 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-08 17:35:33,502 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states. [2018-12-08 17:35:33,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-08 17:35:33,508 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:35:33,508 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:35:33,510 INFO L423 AbstractCegarLoop]: === Iteration 1 === [merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION]=== [2018-12-08 17:35:33,513 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:35:33,513 INFO L82 PathProgramCache]: Analyzing trace with hash -1197190748, now seen corresponding path program 1 times [2018-12-08 17:35:33,514 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:35:33,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:35:33,546 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:35:33,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:35:33,547 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:35:33,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:35:33,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:35:33,584 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:35:33,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-08 17:35:33,584 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:35:33,587 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-12-08 17:35:33,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-08 17:35:33,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-08 17:35:33,596 INFO L87 Difference]: Start difference. First operand 272 states. Second operand 2 states. [2018-12-08 17:35:33,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:35:33,616 INFO L93 Difference]: Finished difference Result 270 states and 295 transitions. [2018-12-08 17:35:33,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-08 17:35:33,616 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 9 [2018-12-08 17:35:33,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:35:33,624 INFO L225 Difference]: With dead ends: 270 [2018-12-08 17:35:33,624 INFO L226 Difference]: Without dead ends: 253 [2018-12-08 17:35:33,625 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-08 17:35:33,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2018-12-08 17:35:33,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 253. [2018-12-08 17:35:33,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2018-12-08 17:35:33,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 266 transitions. [2018-12-08 17:35:33,655 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 266 transitions. Word has length 9 [2018-12-08 17:35:33,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:35:33,655 INFO L480 AbstractCegarLoop]: Abstraction has 253 states and 266 transitions. [2018-12-08 17:35:33,655 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-12-08 17:35:33,655 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 266 transitions. [2018-12-08 17:35:33,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-08 17:35:33,656 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:35:33,656 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:35:33,656 INFO L423 AbstractCegarLoop]: === Iteration 2 === [merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION]=== [2018-12-08 17:35:33,656 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:35:33,656 INFO L82 PathProgramCache]: Analyzing trace with hash 1540745701, now seen corresponding path program 1 times [2018-12-08 17:35:33,656 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:35:33,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:35:33,657 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:35:33,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:35:33,657 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:35:33,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:35:33,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:35:33,685 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:35:33,686 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-08 17:35:33,686 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:35:33,686 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 17:35:33,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 17:35:33,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 17:35:33,687 INFO L87 Difference]: Start difference. First operand 253 states and 266 transitions. Second operand 3 states. [2018-12-08 17:35:33,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:35:33,840 INFO L93 Difference]: Finished difference Result 271 states and 289 transitions. [2018-12-08 17:35:33,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 17:35:33,840 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-12-08 17:35:33,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:35:33,842 INFO L225 Difference]: With dead ends: 271 [2018-12-08 17:35:33,842 INFO L226 Difference]: Without dead ends: 271 [2018-12-08 17:35:33,843 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-12-08 17:35:33,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2018-12-08 17:35:33,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 251. [2018-12-08 17:35:33,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2018-12-08 17:35:33,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 264 transitions. [2018-12-08 17:35:33,858 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 264 transitions. Word has length 10 [2018-12-08 17:35:33,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:35:33,858 INFO L480 AbstractCegarLoop]: Abstraction has 251 states and 264 transitions. [2018-12-08 17:35:33,858 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 17:35:33,858 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 264 transitions. [2018-12-08 17:35:33,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-08 17:35:33,859 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:35:33,859 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:35:33,859 INFO L423 AbstractCegarLoop]: === Iteration 3 === [merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION]=== [2018-12-08 17:35:33,859 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:35:33,860 INFO L82 PathProgramCache]: Analyzing trace with hash 1540745702, now seen corresponding path program 1 times [2018-12-08 17:35:33,860 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:35:33,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:35:33,861 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:35:33,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:35:33,861 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:35:33,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:35:33,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:35:33,907 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:35:33,907 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-08 17:35:33,907 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:35:33,907 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 17:35:33,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 17:35:33,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 17:35:33,908 INFO L87 Difference]: Start difference. First operand 251 states and 264 transitions. Second operand 3 states. [2018-12-08 17:35:33,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:35:33,999 INFO L93 Difference]: Finished difference Result 279 states and 298 transitions. [2018-12-08 17:35:33,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 17:35:33,999 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-12-08 17:35:33,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:35:34,000 INFO L225 Difference]: With dead ends: 279 [2018-12-08 17:35:34,000 INFO L226 Difference]: Without dead ends: 279 [2018-12-08 17:35:34,000 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 17:35:34,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2018-12-08 17:35:34,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 249. [2018-12-08 17:35:34,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2018-12-08 17:35:34,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 262 transitions. [2018-12-08 17:35:34,007 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 262 transitions. Word has length 10 [2018-12-08 17:35:34,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:35:34,008 INFO L480 AbstractCegarLoop]: Abstraction has 249 states and 262 transitions. [2018-12-08 17:35:34,008 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 17:35:34,008 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 262 transitions. [2018-12-08 17:35:34,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-08 17:35:34,008 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:35:34,008 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:35:34,009 INFO L423 AbstractCegarLoop]: === Iteration 4 === [merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION]=== [2018-12-08 17:35:34,009 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:35:34,009 INFO L82 PathProgramCache]: Analyzing trace with hash 1540744723, now seen corresponding path program 1 times [2018-12-08 17:35:34,009 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:35:34,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:35:34,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:35:34,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:35:34,011 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:35:34,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:35:34,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:35:34,023 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:35:34,023 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-08 17:35:34,024 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:35:34,024 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 17:35:34,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 17:35:34,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 17:35:34,024 INFO L87 Difference]: Start difference. First operand 249 states and 262 transitions. Second operand 3 states. [2018-12-08 17:35:34,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:35:34,141 INFO L93 Difference]: Finished difference Result 289 states and 311 transitions. [2018-12-08 17:35:34,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 17:35:34,142 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-12-08 17:35:34,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:35:34,143 INFO L225 Difference]: With dead ends: 289 [2018-12-08 17:35:34,143 INFO L226 Difference]: Without dead ends: 288 [2018-12-08 17:35:34,143 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-12-08 17:35:34,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2018-12-08 17:35:34,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 252. [2018-12-08 17:35:34,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2018-12-08 17:35:34,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 266 transitions. [2018-12-08 17:35:34,152 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 266 transitions. Word has length 10 [2018-12-08 17:35:34,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:35:34,153 INFO L480 AbstractCegarLoop]: Abstraction has 252 states and 266 transitions. [2018-12-08 17:35:34,153 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 17:35:34,153 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 266 transitions. [2018-12-08 17:35:34,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-08 17:35:34,153 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:35:34,153 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:35:34,154 INFO L423 AbstractCegarLoop]: === Iteration 5 === [merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION]=== [2018-12-08 17:35:34,154 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:35:34,154 INFO L82 PathProgramCache]: Analyzing trace with hash 551922422, now seen corresponding path program 1 times [2018-12-08 17:35:34,154 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:35:34,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:35:34,156 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:35:34,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:35:34,156 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:35:34,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:35:34,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:35:34,172 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:35:34,172 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 17:35:34,172 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:35:34,173 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 17:35:34,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 17:35:34,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 17:35:34,173 INFO L87 Difference]: Start difference. First operand 252 states and 266 transitions. Second operand 3 states. [2018-12-08 17:35:34,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:35:34,187 INFO L93 Difference]: Finished difference Result 267 states and 279 transitions. [2018-12-08 17:35:34,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 17:35:34,187 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-12-08 17:35:34,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:35:34,188 INFO L225 Difference]: With dead ends: 267 [2018-12-08 17:35:34,188 INFO L226 Difference]: Without dead ends: 266 [2018-12-08 17:35:34,188 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 17:35:34,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2018-12-08 17:35:34,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 251. [2018-12-08 17:35:34,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2018-12-08 17:35:34,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 264 transitions. [2018-12-08 17:35:34,193 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 264 transitions. Word has length 14 [2018-12-08 17:35:34,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:35:34,193 INFO L480 AbstractCegarLoop]: Abstraction has 251 states and 264 transitions. [2018-12-08 17:35:34,193 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 17:35:34,193 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 264 transitions. [2018-12-08 17:35:34,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-08 17:35:34,193 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:35:34,194 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:35:34,194 INFO L423 AbstractCegarLoop]: === Iteration 6 === [merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION]=== [2018-12-08 17:35:34,194 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:35:34,194 INFO L82 PathProgramCache]: Analyzing trace with hash -274852995, now seen corresponding path program 1 times [2018-12-08 17:35:34,194 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:35:34,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:35:34,195 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:35:34,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:35:34,195 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:35:34,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:35:34,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:35:34,214 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:35:34,214 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-08 17:35:34,214 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:35:34,214 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 17:35:34,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 17:35:34,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 17:35:34,215 INFO L87 Difference]: Start difference. First operand 251 states and 264 transitions. Second operand 3 states. [2018-12-08 17:35:34,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:35:34,309 INFO L93 Difference]: Finished difference Result 270 states and 285 transitions. [2018-12-08 17:35:34,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 17:35:34,309 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-12-08 17:35:34,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:35:34,310 INFO L225 Difference]: With dead ends: 270 [2018-12-08 17:35:34,310 INFO L226 Difference]: Without dead ends: 270 [2018-12-08 17:35:34,310 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-12-08 17:35:34,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2018-12-08 17:35:34,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 249. [2018-12-08 17:35:34,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2018-12-08 17:35:34,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 262 transitions. [2018-12-08 17:35:34,313 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 262 transitions. Word has length 15 [2018-12-08 17:35:34,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:35:34,314 INFO L480 AbstractCegarLoop]: Abstraction has 249 states and 262 transitions. [2018-12-08 17:35:34,314 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 17:35:34,314 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 262 transitions. [2018-12-08 17:35:34,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-08 17:35:34,314 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:35:34,314 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:35:34,314 INFO L423 AbstractCegarLoop]: === Iteration 7 === [merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION]=== [2018-12-08 17:35:34,314 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:35:34,314 INFO L82 PathProgramCache]: Analyzing trace with hash -274852994, now seen corresponding path program 1 times [2018-12-08 17:35:34,314 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:35:34,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:35:34,315 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:35:34,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:35:34,315 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:35:34,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:35:34,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:35:34,339 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:35:34,339 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-08 17:35:34,339 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:35:34,340 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 17:35:34,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 17:35:34,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 17:35:34,340 INFO L87 Difference]: Start difference. First operand 249 states and 262 transitions. Second operand 3 states. [2018-12-08 17:35:34,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:35:34,426 INFO L93 Difference]: Finished difference Result 278 states and 294 transitions. [2018-12-08 17:35:34,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 17:35:34,426 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-12-08 17:35:34,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:35:34,427 INFO L225 Difference]: With dead ends: 278 [2018-12-08 17:35:34,427 INFO L226 Difference]: Without dead ends: 278 [2018-12-08 17:35:34,427 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 17:35:34,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2018-12-08 17:35:34,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 247. [2018-12-08 17:35:34,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2018-12-08 17:35:34,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 260 transitions. [2018-12-08 17:35:34,432 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 260 transitions. Word has length 15 [2018-12-08 17:35:34,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:35:34,432 INFO L480 AbstractCegarLoop]: Abstraction has 247 states and 260 transitions. [2018-12-08 17:35:34,432 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 17:35:34,432 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 260 transitions. [2018-12-08 17:35:34,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-08 17:35:34,433 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:35:34,433 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:35:34,433 INFO L423 AbstractCegarLoop]: === Iteration 8 === [merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION]=== [2018-12-08 17:35:34,433 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:35:34,433 INFO L82 PathProgramCache]: Analyzing trace with hash 47797589, now seen corresponding path program 1 times [2018-12-08 17:35:34,434 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:35:34,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:35:34,435 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:35:34,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:35:34,435 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:35:34,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:35:34,462 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:35:34,462 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:35:34,462 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 17:35:34,463 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:35:34,463 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 17:35:34,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 17:35:34,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 17:35:34,463 INFO L87 Difference]: Start difference. First operand 247 states and 260 transitions. Second operand 4 states. [2018-12-08 17:35:34,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:35:34,494 INFO L93 Difference]: Finished difference Result 282 states and 298 transitions. [2018-12-08 17:35:34,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 17:35:34,495 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2018-12-08 17:35:34,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:35:34,496 INFO L225 Difference]: With dead ends: 282 [2018-12-08 17:35:34,496 INFO L226 Difference]: Without dead ends: 282 [2018-12-08 17:35:34,496 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-08 17:35:34,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2018-12-08 17:35:34,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 247. [2018-12-08 17:35:34,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2018-12-08 17:35:34,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 259 transitions. [2018-12-08 17:35:34,500 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 259 transitions. Word has length 21 [2018-12-08 17:35:34,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:35:34,501 INFO L480 AbstractCegarLoop]: Abstraction has 247 states and 259 transitions. [2018-12-08 17:35:34,501 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 17:35:34,501 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 259 transitions. [2018-12-08 17:35:34,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-08 17:35:34,501 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:35:34,502 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:35:34,502 INFO L423 AbstractCegarLoop]: === Iteration 9 === [merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION]=== [2018-12-08 17:35:34,502 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:35:34,502 INFO L82 PathProgramCache]: Analyzing trace with hash -1371821768, now seen corresponding path program 1 times [2018-12-08 17:35:34,502 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:35:34,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:35:34,503 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:35:34,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:35:34,504 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:35:34,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:35:34,564 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:35:34,564 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:35:34,564 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 17:35:34,564 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:35:34,565 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 17:35:34,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 17:35:34,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-08 17:35:34,565 INFO L87 Difference]: Start difference. First operand 247 states and 259 transitions. Second operand 6 states. [2018-12-08 17:35:34,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:35:34,839 INFO L93 Difference]: Finished difference Result 321 states and 337 transitions. [2018-12-08 17:35:34,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 17:35:34,839 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2018-12-08 17:35:34,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:35:34,840 INFO L225 Difference]: With dead ends: 321 [2018-12-08 17:35:34,840 INFO L226 Difference]: Without dead ends: 321 [2018-12-08 17:35:34,840 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-08 17:35:34,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2018-12-08 17:35:34,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 277. [2018-12-08 17:35:34,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2018-12-08 17:35:34,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 304 transitions. [2018-12-08 17:35:34,845 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 304 transitions. Word has length 25 [2018-12-08 17:35:34,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:35:34,845 INFO L480 AbstractCegarLoop]: Abstraction has 277 states and 304 transitions. [2018-12-08 17:35:34,845 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 17:35:34,845 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 304 transitions. [2018-12-08 17:35:34,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-08 17:35:34,846 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:35:34,846 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:35:34,846 INFO L423 AbstractCegarLoop]: === Iteration 10 === [merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION]=== [2018-12-08 17:35:34,846 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:35:34,846 INFO L82 PathProgramCache]: Analyzing trace with hash -1371821769, now seen corresponding path program 1 times [2018-12-08 17:35:34,846 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:35:34,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:35:34,847 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:35:34,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:35:34,848 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:35:34,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:35:34,881 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:35:34,881 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:35:34,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 17:35:34,882 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:35:34,882 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 17:35:34,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 17:35:34,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-08 17:35:34,882 INFO L87 Difference]: Start difference. First operand 277 states and 304 transitions. Second operand 6 states. [2018-12-08 17:35:35,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:35:35,093 INFO L93 Difference]: Finished difference Result 279 states and 297 transitions. [2018-12-08 17:35:35,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-08 17:35:35,094 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2018-12-08 17:35:35,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:35:35,095 INFO L225 Difference]: With dead ends: 279 [2018-12-08 17:35:35,095 INFO L226 Difference]: Without dead ends: 279 [2018-12-08 17:35:35,095 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-08 17:35:35,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2018-12-08 17:35:35,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 268. [2018-12-08 17:35:35,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2018-12-08 17:35:35,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 285 transitions. [2018-12-08 17:35:35,100 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 285 transitions. Word has length 25 [2018-12-08 17:35:35,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:35:35,100 INFO L480 AbstractCegarLoop]: Abstraction has 268 states and 285 transitions. [2018-12-08 17:35:35,100 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 17:35:35,100 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 285 transitions. [2018-12-08 17:35:35,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-08 17:35:35,101 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:35:35,101 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:35:35,101 INFO L423 AbstractCegarLoop]: === Iteration 11 === [merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION]=== [2018-12-08 17:35:35,101 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:35:35,101 INFO L82 PathProgramCache]: Analyzing trace with hash -2140859640, now seen corresponding path program 1 times [2018-12-08 17:35:35,102 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:35:35,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:35:35,102 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:35:35,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:35:35,103 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:35:35,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:35:35,229 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:35:35,229 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:35:35,229 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-08 17:35:35,229 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:35:35,229 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-08 17:35:35,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-08 17:35:35,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-12-08 17:35:35,230 INFO L87 Difference]: Start difference. First operand 268 states and 285 transitions. Second operand 11 states. [2018-12-08 17:35:35,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:35:35,663 INFO L93 Difference]: Finished difference Result 293 states and 309 transitions. [2018-12-08 17:35:35,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-08 17:35:35,663 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 36 [2018-12-08 17:35:35,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:35:35,664 INFO L225 Difference]: With dead ends: 293 [2018-12-08 17:35:35,665 INFO L226 Difference]: Without dead ends: 293 [2018-12-08 17:35:35,665 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2018-12-08 17:35:35,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2018-12-08 17:35:35,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 269. [2018-12-08 17:35:35,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2018-12-08 17:35:35,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 287 transitions. [2018-12-08 17:35:35,671 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 287 transitions. Word has length 36 [2018-12-08 17:35:35,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:35:35,671 INFO L480 AbstractCegarLoop]: Abstraction has 269 states and 287 transitions. [2018-12-08 17:35:35,671 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-08 17:35:35,671 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 287 transitions. [2018-12-08 17:35:35,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-08 17:35:35,672 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:35:35,672 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:35:35,673 INFO L423 AbstractCegarLoop]: === Iteration 12 === [merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION]=== [2018-12-08 17:35:35,673 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:35:35,673 INFO L82 PathProgramCache]: Analyzing trace with hash -2140859639, now seen corresponding path program 1 times [2018-12-08 17:35:35,673 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:35:35,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:35:35,674 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:35:35,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:35:35,674 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:35:35,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:35:35,781 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:35:35,781 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:35:35,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-08 17:35:35,781 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:35:35,781 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-08 17:35:35,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-08 17:35:35,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-08 17:35:35,782 INFO L87 Difference]: Start difference. First operand 269 states and 287 transitions. Second operand 8 states. [2018-12-08 17:35:36,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:35:36,146 INFO L93 Difference]: Finished difference Result 292 states and 308 transitions. [2018-12-08 17:35:36,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-08 17:35:36,147 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 36 [2018-12-08 17:35:36,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:35:36,148 INFO L225 Difference]: With dead ends: 292 [2018-12-08 17:35:36,148 INFO L226 Difference]: Without dead ends: 292 [2018-12-08 17:35:36,148 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2018-12-08 17:35:36,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2018-12-08 17:35:36,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 269. [2018-12-08 17:35:36,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2018-12-08 17:35:36,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 286 transitions. [2018-12-08 17:35:36,152 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 286 transitions. Word has length 36 [2018-12-08 17:35:36,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:35:36,153 INFO L480 AbstractCegarLoop]: Abstraction has 269 states and 286 transitions. [2018-12-08 17:35:36,153 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-08 17:35:36,153 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 286 transitions. [2018-12-08 17:35:36,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-08 17:35:36,153 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:35:36,153 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:35:36,153 INFO L423 AbstractCegarLoop]: === Iteration 13 === [merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION]=== [2018-12-08 17:35:36,154 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:35:36,154 INFO L82 PathProgramCache]: Analyzing trace with hash -47369046, now seen corresponding path program 1 times [2018-12-08 17:35:36,154 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:35:36,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:35:36,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:35:36,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:35:36,155 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:35:36,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:35:36,279 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:35:36,279 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:35:36,279 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-08 17:35:36,279 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:35:36,279 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-08 17:35:36,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-08 17:35:36,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-12-08 17:35:36,280 INFO L87 Difference]: Start difference. First operand 269 states and 286 transitions. Second operand 11 states. [2018-12-08 17:35:36,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:35:36,644 INFO L93 Difference]: Finished difference Result 291 states and 307 transitions. [2018-12-08 17:35:36,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-08 17:35:36,645 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 36 [2018-12-08 17:35:36,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:35:36,646 INFO L225 Difference]: With dead ends: 291 [2018-12-08 17:35:36,646 INFO L226 Difference]: Without dead ends: 291 [2018-12-08 17:35:36,646 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2018-12-08 17:35:36,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2018-12-08 17:35:36,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 269. [2018-12-08 17:35:36,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2018-12-08 17:35:36,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 285 transitions. [2018-12-08 17:35:36,651 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 285 transitions. Word has length 36 [2018-12-08 17:35:36,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:35:36,651 INFO L480 AbstractCegarLoop]: Abstraction has 269 states and 285 transitions. [2018-12-08 17:35:36,651 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-08 17:35:36,651 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 285 transitions. [2018-12-08 17:35:36,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-08 17:35:36,651 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:35:36,652 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:35:36,652 INFO L423 AbstractCegarLoop]: === Iteration 14 === [merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION]=== [2018-12-08 17:35:36,652 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:35:36,652 INFO L82 PathProgramCache]: Analyzing trace with hash -47369045, now seen corresponding path program 1 times [2018-12-08 17:35:36,652 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:35:36,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:35:36,653 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:35:36,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:35:36,653 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:35:36,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:35:36,754 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:35:36,754 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:35:36,755 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-08 17:35:36,755 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:35:36,755 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-08 17:35:36,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-08 17:35:36,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-08 17:35:36,755 INFO L87 Difference]: Start difference. First operand 269 states and 285 transitions. Second operand 8 states. [2018-12-08 17:35:37,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:35:37,111 INFO L93 Difference]: Finished difference Result 290 states and 306 transitions. [2018-12-08 17:35:37,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-08 17:35:37,111 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 36 [2018-12-08 17:35:37,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:35:37,112 INFO L225 Difference]: With dead ends: 290 [2018-12-08 17:35:37,112 INFO L226 Difference]: Without dead ends: 290 [2018-12-08 17:35:37,112 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2018-12-08 17:35:37,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2018-12-08 17:35:37,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 269. [2018-12-08 17:35:37,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2018-12-08 17:35:37,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 284 transitions. [2018-12-08 17:35:37,115 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 284 transitions. Word has length 36 [2018-12-08 17:35:37,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:35:37,115 INFO L480 AbstractCegarLoop]: Abstraction has 269 states and 284 transitions. [2018-12-08 17:35:37,115 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-08 17:35:37,115 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 284 transitions. [2018-12-08 17:35:37,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-12-08 17:35:37,116 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:35:37,116 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:35:37,116 INFO L423 AbstractCegarLoop]: === Iteration 15 === [merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION]=== [2018-12-08 17:35:37,116 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:35:37,116 INFO L82 PathProgramCache]: Analyzing trace with hash 486782864, now seen corresponding path program 1 times [2018-12-08 17:35:37,116 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:35:37,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:35:37,117 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:35:37,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:35:37,117 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:35:37,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:35:37,294 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:35:37,294 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 17:35:37,294 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-08 17:35:37,295 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 42 with the following transitions: [2018-12-08 17:35:37,296 INFO L205 CegarAbsIntRunner]: [74], [83], [87], [94], [96], [101], [110], [114], [121], [129], [133], [140], [148], [152], [159], [162], [170], [174], [179], [182], [263], [268], [271], [273], [278], [280], [283], [284], [287], [292], [294], [297], [300], [307], [460], [461], [567], [585], [586], [587] [2018-12-08 17:35:37,315 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-08 17:35:37,315 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-08 17:35:37,470 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-08 17:35:37,471 INFO L272 AbstractInterpreter]: Visited 40 different actions 70 times. Merged at 29 different actions 29 times. Never widened. Performed 624 root evaluator evaluations with a maximum evaluation depth of 3. Performed 624 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 30 variables. [2018-12-08 17:35:37,476 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:35:37,477 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-08 17:35:37,477 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 17:35:37,477 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4740aade-a493-4198-b34c-4c4f6f881e09/bin-2019/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 17:35:37,486 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:35:37,486 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-08 17:35:37,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:35:37,509 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 17:35:37,565 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-08 17:35:37,567 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-08 17:35:37,567 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:35:37,568 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:35:37,574 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-08 17:35:37,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 10 treesize of output 9 [2018-12-08 17:35:37,575 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 17:35:37,576 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:35:37,579 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:35:37,580 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:30, output treesize:22 [2018-12-08 17:35:37,606 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 19 treesize of output 15 [2018-12-08 17:35:37,607 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:35:37,608 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-12-08 17:35:37,608 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:35:37,610 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:35:37,616 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 19 treesize of output 15 [2018-12-08 17:35:37,617 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:35:37,617 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-12-08 17:35:37,618 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 17:35:37,619 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:35:37,622 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:35:37,622 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:40, output treesize:10 [2018-12-08 17:35:37,636 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:35:37,636 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 17:35:37,737 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:35:37,752 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-08 17:35:37,752 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10] total 20 [2018-12-08 17:35:37,752 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-08 17:35:37,753 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-08 17:35:37,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-08 17:35:37,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=322, Unknown=0, NotChecked=0, Total=380 [2018-12-08 17:35:37,753 INFO L87 Difference]: Start difference. First operand 269 states and 284 transitions. Second operand 15 states. [2018-12-08 17:35:38,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:35:38,030 INFO L93 Difference]: Finished difference Result 325 states and 344 transitions. [2018-12-08 17:35:38,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-08 17:35:38,030 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 41 [2018-12-08 17:35:38,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:35:38,031 INFO L225 Difference]: With dead ends: 325 [2018-12-08 17:35:38,031 INFO L226 Difference]: Without dead ends: 325 [2018-12-08 17:35:38,031 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 67 SyntacticMatches, 12 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=89, Invalid=463, Unknown=0, NotChecked=0, Total=552 [2018-12-08 17:35:38,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2018-12-08 17:35:38,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 301. [2018-12-08 17:35:38,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2018-12-08 17:35:38,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 317 transitions. [2018-12-08 17:35:38,036 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 317 transitions. Word has length 41 [2018-12-08 17:35:38,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:35:38,036 INFO L480 AbstractCegarLoop]: Abstraction has 301 states and 317 transitions. [2018-12-08 17:35:38,036 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-08 17:35:38,036 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 317 transitions. [2018-12-08 17:35:38,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-08 17:35:38,037 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:35:38,037 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:35:38,037 INFO L423 AbstractCegarLoop]: === Iteration 16 === [merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION]=== [2018-12-08 17:35:38,037 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:35:38,037 INFO L82 PathProgramCache]: Analyzing trace with hash 787947303, now seen corresponding path program 1 times [2018-12-08 17:35:38,037 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:35:38,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:35:38,038 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:35:38,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:35:38,038 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:35:38,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:35:38,065 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:35:38,065 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:35:38,065 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 17:35:38,065 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:35:38,065 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 17:35:38,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 17:35:38,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-08 17:35:38,066 INFO L87 Difference]: Start difference. First operand 301 states and 317 transitions. Second operand 6 states. [2018-12-08 17:35:38,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:35:38,347 INFO L93 Difference]: Finished difference Result 322 states and 344 transitions. [2018-12-08 17:35:38,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-08 17:35:38,347 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 46 [2018-12-08 17:35:38,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:35:38,348 INFO L225 Difference]: With dead ends: 322 [2018-12-08 17:35:38,348 INFO L226 Difference]: Without dead ends: 322 [2018-12-08 17:35:38,349 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-08 17:35:38,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2018-12-08 17:35:38,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 301. [2018-12-08 17:35:38,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2018-12-08 17:35:38,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 319 transitions. [2018-12-08 17:35:38,353 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 319 transitions. Word has length 46 [2018-12-08 17:35:38,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:35:38,353 INFO L480 AbstractCegarLoop]: Abstraction has 301 states and 319 transitions. [2018-12-08 17:35:38,353 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 17:35:38,353 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 319 transitions. [2018-12-08 17:35:38,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-08 17:35:38,354 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:35:38,354 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:35:38,354 INFO L423 AbstractCegarLoop]: === Iteration 17 === [merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION]=== [2018-12-08 17:35:38,354 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:35:38,354 INFO L82 PathProgramCache]: Analyzing trace with hash 787947304, now seen corresponding path program 1 times [2018-12-08 17:35:38,355 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:35:38,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:35:38,356 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:35:38,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:35:38,356 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:35:38,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:35:38,406 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:35:38,406 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:35:38,406 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 17:35:38,406 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:35:38,406 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 17:35:38,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 17:35:38,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-08 17:35:38,407 INFO L87 Difference]: Start difference. First operand 301 states and 319 transitions. Second operand 6 states. [2018-12-08 17:35:38,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:35:38,665 INFO L93 Difference]: Finished difference Result 331 states and 353 transitions. [2018-12-08 17:35:38,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-08 17:35:38,665 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 46 [2018-12-08 17:35:38,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:35:38,666 INFO L225 Difference]: With dead ends: 331 [2018-12-08 17:35:38,666 INFO L226 Difference]: Without dead ends: 331 [2018-12-08 17:35:38,667 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-08 17:35:38,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2018-12-08 17:35:38,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 313. [2018-12-08 17:35:38,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 313 states. [2018-12-08 17:35:38,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 334 transitions. [2018-12-08 17:35:38,671 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 334 transitions. Word has length 46 [2018-12-08 17:35:38,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:35:38,671 INFO L480 AbstractCegarLoop]: Abstraction has 313 states and 334 transitions. [2018-12-08 17:35:38,671 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 17:35:38,671 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 334 transitions. [2018-12-08 17:35:38,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-08 17:35:38,672 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:35:38,672 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:35:38,672 INFO L423 AbstractCegarLoop]: === Iteration 18 === [merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION]=== [2018-12-08 17:35:38,672 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:35:38,672 INFO L82 PathProgramCache]: Analyzing trace with hash -1388628246, now seen corresponding path program 1 times [2018-12-08 17:35:38,672 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:35:38,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:35:38,673 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:35:38,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:35:38,674 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:35:38,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:35:38,691 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-08 17:35:38,692 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:35:38,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 17:35:38,692 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:35:38,692 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 17:35:38,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 17:35:38,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 17:35:38,692 INFO L87 Difference]: Start difference. First operand 313 states and 334 transitions. Second operand 5 states. [2018-12-08 17:35:38,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:35:38,833 INFO L93 Difference]: Finished difference Result 310 states and 331 transitions. [2018-12-08 17:35:38,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 17:35:38,834 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2018-12-08 17:35:38,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:35:38,835 INFO L225 Difference]: With dead ends: 310 [2018-12-08 17:35:38,835 INFO L226 Difference]: Without dead ends: 310 [2018-12-08 17:35:38,835 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-08 17:35:38,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2018-12-08 17:35:38,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 310. [2018-12-08 17:35:38,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 310 states. [2018-12-08 17:35:38,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 331 transitions. [2018-12-08 17:35:38,839 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 331 transitions. Word has length 47 [2018-12-08 17:35:38,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:35:38,839 INFO L480 AbstractCegarLoop]: Abstraction has 310 states and 331 transitions. [2018-12-08 17:35:38,839 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 17:35:38,839 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 331 transitions. [2018-12-08 17:35:38,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-08 17:35:38,840 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:35:38,840 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:35:38,840 INFO L423 AbstractCegarLoop]: === Iteration 19 === [merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION]=== [2018-12-08 17:35:38,840 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:35:38,841 INFO L82 PathProgramCache]: Analyzing trace with hash -1388628245, now seen corresponding path program 1 times [2018-12-08 17:35:38,841 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:35:38,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:35:38,841 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:35:38,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:35:38,842 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:35:38,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:35:38,885 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:35:38,886 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:35:38,886 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 17:35:38,886 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:35:38,886 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 17:35:38,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 17:35:38,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-08 17:35:38,886 INFO L87 Difference]: Start difference. First operand 310 states and 331 transitions. Second operand 6 states. [2018-12-08 17:35:39,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:35:39,134 INFO L93 Difference]: Finished difference Result 350 states and 371 transitions. [2018-12-08 17:35:39,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 17:35:39,134 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 47 [2018-12-08 17:35:39,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:35:39,136 INFO L225 Difference]: With dead ends: 350 [2018-12-08 17:35:39,136 INFO L226 Difference]: Without dead ends: 350 [2018-12-08 17:35:39,136 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-08 17:35:39,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2018-12-08 17:35:39,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 331. [2018-12-08 17:35:39,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 331 states. [2018-12-08 17:35:39,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 358 transitions. [2018-12-08 17:35:39,141 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 358 transitions. Word has length 47 [2018-12-08 17:35:39,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:35:39,142 INFO L480 AbstractCegarLoop]: Abstraction has 331 states and 358 transitions. [2018-12-08 17:35:39,142 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 17:35:39,142 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 358 transitions. [2018-12-08 17:35:39,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-08 17:35:39,142 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:35:39,142 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:35:39,143 INFO L423 AbstractCegarLoop]: === Iteration 20 === [merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION]=== [2018-12-08 17:35:39,143 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:35:39,143 INFO L82 PathProgramCache]: Analyzing trace with hash -1860015083, now seen corresponding path program 1 times [2018-12-08 17:35:39,143 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:35:39,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:35:39,144 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:35:39,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:35:39,144 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:35:39,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:35:39,166 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:35:39,166 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:35:39,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 17:35:39,166 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:35:39,166 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 17:35:39,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 17:35:39,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-08 17:35:39,166 INFO L87 Difference]: Start difference. First operand 331 states and 358 transitions. Second operand 6 states. [2018-12-08 17:35:39,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:35:39,244 INFO L93 Difference]: Finished difference Result 375 states and 402 transitions. [2018-12-08 17:35:39,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 17:35:39,244 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 50 [2018-12-08 17:35:39,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:35:39,245 INFO L225 Difference]: With dead ends: 375 [2018-12-08 17:35:39,245 INFO L226 Difference]: Without dead ends: 372 [2018-12-08 17:35:39,245 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-08 17:35:39,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2018-12-08 17:35:39,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 338. [2018-12-08 17:35:39,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 338 states. [2018-12-08 17:35:39,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 366 transitions. [2018-12-08 17:35:39,249 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 366 transitions. Word has length 50 [2018-12-08 17:35:39,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:35:39,249 INFO L480 AbstractCegarLoop]: Abstraction has 338 states and 366 transitions. [2018-12-08 17:35:39,249 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 17:35:39,249 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 366 transitions. [2018-12-08 17:35:39,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-08 17:35:39,249 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:35:39,249 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:35:39,250 INFO L423 AbstractCegarLoop]: === Iteration 21 === [merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION]=== [2018-12-08 17:35:39,250 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:35:39,250 INFO L82 PathProgramCache]: Analyzing trace with hash -1837526797, now seen corresponding path program 1 times [2018-12-08 17:35:39,250 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:35:39,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:35:39,250 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:35:39,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:35:39,251 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:35:39,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:35:39,368 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:35:39,368 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 17:35:39,368 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-08 17:35:39,368 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 51 with the following transitions: [2018-12-08 17:35:39,369 INFO L205 CegarAbsIntRunner]: [26], [35], [36], [39], [48], [49], [53], [74], [83], [87], [94], [99], [193], [197], [204], [212], [216], [223], [231], [235], [242], [245], [253], [257], [262], [263], [268], [271], [273], [278], [280], [283], [284], [287], [292], [294], [297], [300], [307], [313], [320], [460], [461], [567], [568], [569], [585], [586], [587] [2018-12-08 17:35:39,370 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-08 17:35:39,370 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-08 17:35:39,417 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-08 17:35:39,417 INFO L272 AbstractInterpreter]: Visited 49 different actions 62 times. Merged at 12 different actions 12 times. Never widened. Performed 520 root evaluator evaluations with a maximum evaluation depth of 3. Performed 520 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 28 variables. [2018-12-08 17:35:39,419 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:35:39,419 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-08 17:35:39,419 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 17:35:39,419 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4740aade-a493-4198-b34c-4c4f6f881e09/bin-2019/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 17:35:39,429 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:35:39,429 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-08 17:35:39,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:35:39,451 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 17:35:39,468 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-08 17:35:39,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 10 treesize of output 9 [2018-12-08 17:35:39,470 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:35:39,471 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:35:39,491 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-08 17:35:39,492 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-08 17:35:39,492 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 17:35:39,494 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:35:39,497 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:35:39,498 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:30, output treesize:22 [2018-12-08 17:35:39,532 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 15 treesize of output 11 [2018-12-08 17:35:39,534 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-08 17:35:39,534 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:35:39,535 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:35:39,539 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 15 treesize of output 11 [2018-12-08 17:35:39,540 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-08 17:35:39,540 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 17:35:39,541 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:35:39,543 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:35:39,544 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:29, output treesize:7 [2018-12-08 17:35:39,561 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:35:39,561 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 17:35:39,604 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:35:39,630 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-08 17:35:39,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 7] total 15 [2018-12-08 17:35:39,630 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-08 17:35:39,630 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-08 17:35:39,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-08 17:35:39,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2018-12-08 17:35:39,631 INFO L87 Difference]: Start difference. First operand 338 states and 366 transitions. Second operand 12 states. [2018-12-08 17:35:39,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:35:39,854 INFO L93 Difference]: Finished difference Result 388 states and 417 transitions. [2018-12-08 17:35:39,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-08 17:35:39,855 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 50 [2018-12-08 17:35:39,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:35:39,855 INFO L225 Difference]: With dead ends: 388 [2018-12-08 17:35:39,856 INFO L226 Difference]: Without dead ends: 388 [2018-12-08 17:35:39,856 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 90 SyntacticMatches, 9 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=233, Unknown=0, NotChecked=0, Total=306 [2018-12-08 17:35:39,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2018-12-08 17:35:39,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 340. [2018-12-08 17:35:39,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2018-12-08 17:35:39,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 368 transitions. [2018-12-08 17:35:39,859 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 368 transitions. Word has length 50 [2018-12-08 17:35:39,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:35:39,859 INFO L480 AbstractCegarLoop]: Abstraction has 340 states and 368 transitions. [2018-12-08 17:35:39,859 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-08 17:35:39,859 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 368 transitions. [2018-12-08 17:35:39,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-08 17:35:39,860 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:35:39,860 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:35:39,860 INFO L423 AbstractCegarLoop]: === Iteration 22 === [merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION]=== [2018-12-08 17:35:39,860 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:35:39,860 INFO L82 PathProgramCache]: Analyzing trace with hash 1573052430, now seen corresponding path program 2 times [2018-12-08 17:35:39,860 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:35:39,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:35:39,861 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:35:39,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:35:39,861 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:35:39,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:35:40,078 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:35:40,078 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 17:35:40,078 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-08 17:35:40,079 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-08 17:35:40,079 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-08 17:35:40,079 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 17:35:40,079 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4740aade-a493-4198-b34c-4c4f6f881e09/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-12-08 17:35:40,085 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-08 17:35:40,086 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-08 17:35:40,112 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-08 17:35:40,112 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-08 17:35:40,116 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 17:35:40,119 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-12-08 17:35:40,119 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 17:35:40,122 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:35:40,122 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-08 17:35:40,168 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-12-08 17:35:40,169 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 17:35:40,173 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-12-08 17:35:40,173 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:17 [2018-12-08 17:35:40,189 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-12-08 17:35:40,189 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 17:35:40,194 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:35:40,194 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:20 [2018-12-08 17:35:40,226 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-08 17:35:40,228 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-08 17:35:40,228 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:35:40,230 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:35:40,239 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-08 17:35:40,241 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-08 17:35:40,241 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 17:35:40,242 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:35:40,250 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:35:40,250 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:49, output treesize:41 [2018-12-08 17:35:40,408 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 21 treesize of output 17 [2018-12-08 17:35:40,410 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:35:40,411 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-12-08 17:35:40,411 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:35:40,414 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:35:40,426 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 28 treesize of output 22 [2018-12-08 17:35:40,428 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:35:40,428 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-12-08 17:35:40,428 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 17:35:40,432 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:35:40,441 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 17:35:40,441 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:65, output treesize:17 [2018-12-08 17:35:40,501 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:35:40,502 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 17:35:40,736 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 36 treesize of output 34 [2018-12-08 17:35:40,746 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 22 treesize of output 18 [2018-12-08 17:35:40,746 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 17:35:40,756 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-12-08 17:35:40,776 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 26 treesize of output 24 [2018-12-08 17:35:40,784 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-08 17:35:40,786 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 43 treesize of output 39 [2018-12-08 17:35:40,799 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 23 treesize of output 15 [2018-12-08 17:35:40,799 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-08 17:35:40,807 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-08 17:35:40,808 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 28 treesize of output 26 [2018-12-08 17:35:40,819 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 11 treesize of output 7 [2018-12-08 17:35:40,819 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-08 17:35:40,821 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:35:40,835 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 23 treesize of output 21 [2018-12-08 17:35:40,843 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 9 treesize of output 5 [2018-12-08 17:35:40,843 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-08 17:35:40,847 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-08 17:35:40,860 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-08 17:35:40,861 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:60, output treesize:28 [2018-12-08 17:35:41,151 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:35:41,166 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-08 17:35:41,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 38 [2018-12-08 17:35:41,166 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-08 17:35:41,167 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-12-08 17:35:41,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-12-08 17:35:41,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=1326, Unknown=0, NotChecked=0, Total=1482 [2018-12-08 17:35:41,167 INFO L87 Difference]: Start difference. First operand 340 states and 368 transitions. Second operand 27 states. [2018-12-08 17:35:44,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:35:44,109 INFO L93 Difference]: Finished difference Result 414 states and 444 transitions. [2018-12-08 17:35:44,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-08 17:35:44,109 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 52 [2018-12-08 17:35:44,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:35:44,112 INFO L225 Difference]: With dead ends: 414 [2018-12-08 17:35:44,112 INFO L226 Difference]: Without dead ends: 414 [2018-12-08 17:35:44,113 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 79 SyntacticMatches, 6 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 562 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=343, Invalid=2107, Unknown=0, NotChecked=0, Total=2450 [2018-12-08 17:35:44,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2018-12-08 17:35:44,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 365. [2018-12-08 17:35:44,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 365 states. [2018-12-08 17:35:44,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 397 transitions. [2018-12-08 17:35:44,122 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 397 transitions. Word has length 52 [2018-12-08 17:35:44,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:35:44,122 INFO L480 AbstractCegarLoop]: Abstraction has 365 states and 397 transitions. [2018-12-08 17:35:44,123 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-12-08 17:35:44,123 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 397 transitions. [2018-12-08 17:35:44,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-08 17:35:44,124 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:35:44,124 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:35:44,124 INFO L423 AbstractCegarLoop]: === Iteration 23 === [merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION]=== [2018-12-08 17:35:44,125 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:35:44,125 INFO L82 PathProgramCache]: Analyzing trace with hash 1573052429, now seen corresponding path program 1 times [2018-12-08 17:35:44,125 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:35:44,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:35:44,127 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 17:35:44,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:35:44,127 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:35:44,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:35:44,285 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:35:44,285 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 17:35:44,285 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-08 17:35:44,285 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 53 with the following transitions: [2018-12-08 17:35:44,285 INFO L205 CegarAbsIntRunner]: [74], [83], [87], [94], [95], [101], [110], [114], [121], [129], [133], [140], [148], [152], [159], [162], [170], [174], [179], [182], [263], [268], [271], [273], [278], [280], [283], [284], [287], [292], [294], [297], [300], [307], [460], [461], [567], [585], [586], [587] [2018-12-08 17:35:44,286 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-08 17:35:44,286 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-08 17:35:44,355 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-08 17:35:44,355 INFO L272 AbstractInterpreter]: Visited 40 different actions 70 times. Merged at 29 different actions 29 times. Never widened. Performed 620 root evaluator evaluations with a maximum evaluation depth of 3. Performed 620 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 30 variables. [2018-12-08 17:35:44,357 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:35:44,357 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-08 17:35:44,358 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 17:35:44,358 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4740aade-a493-4198-b34c-4c4f6f881e09/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-12-08 17:35:44,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:35:44,367 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-08 17:35:44,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:35:44,388 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 17:35:44,394 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-12-08 17:35:44,394 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 17:35:44,397 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:35:44,398 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-08 17:35:44,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, 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-12-08 17:35:44,419 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 17:35:44,423 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:35:44,423 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-12-08 17:35:44,459 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-08 17:35:44,461 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-08 17:35:44,461 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:35:44,462 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:35:44,468 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:35:44,468 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:23 [2018-12-08 17:35:44,527 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 21 treesize of output 17 [2018-12-08 17:35:44,529 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 17 treesize of output 5 [2018-12-08 17:35:44,529 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:35:44,530 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:35:44,546 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-12-08 17:35:44,546 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:11 [2018-12-08 17:35:44,558 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 15 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:35:44,558 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 17:35:44,689 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:35:44,704 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-08 17:35:44,704 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 13] total 27 [2018-12-08 17:35:44,705 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-08 17:35:44,705 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-08 17:35:44,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-08 17:35:44,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=655, Unknown=0, NotChecked=0, Total=756 [2018-12-08 17:35:44,705 INFO L87 Difference]: Start difference. First operand 365 states and 397 transitions. Second operand 20 states. [2018-12-08 17:35:45,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:35:45,408 INFO L93 Difference]: Finished difference Result 380 states and 412 transitions. [2018-12-08 17:35:45,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-08 17:35:45,408 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 52 [2018-12-08 17:35:45,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:35:45,409 INFO L225 Difference]: With dead ends: 380 [2018-12-08 17:35:45,409 INFO L226 Difference]: Without dead ends: 380 [2018-12-08 17:35:45,409 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 88 SyntacticMatches, 9 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 262 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=227, Invalid=1179, Unknown=0, NotChecked=0, Total=1406 [2018-12-08 17:35:45,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2018-12-08 17:35:45,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 365. [2018-12-08 17:35:45,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 365 states. [2018-12-08 17:35:45,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 396 transitions. [2018-12-08 17:35:45,414 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 396 transitions. Word has length 52 [2018-12-08 17:35:45,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:35:45,414 INFO L480 AbstractCegarLoop]: Abstraction has 365 states and 396 transitions. [2018-12-08 17:35:45,414 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-08 17:35:45,414 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 396 transitions. [2018-12-08 17:35:45,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-08 17:35:45,415 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:35:45,415 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:35:45,415 INFO L423 AbstractCegarLoop]: === Iteration 24 === [merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION]=== [2018-12-08 17:35:45,415 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:35:45,415 INFO L82 PathProgramCache]: Analyzing trace with hash 2105399978, now seen corresponding path program 1 times [2018-12-08 17:35:45,415 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:35:45,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:35:45,416 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:35:45,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:35:45,416 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:35:45,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:35:45,475 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-08 17:35:45,475 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:35:45,475 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-08 17:35:45,475 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:35:45,475 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-08 17:35:45,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-08 17:35:45,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-12-08 17:35:45,476 INFO L87 Difference]: Start difference. First operand 365 states and 396 transitions. Second operand 10 states. [2018-12-08 17:35:45,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:35:45,981 INFO L93 Difference]: Finished difference Result 402 states and 435 transitions. [2018-12-08 17:35:45,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-08 17:35:45,982 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 56 [2018-12-08 17:35:45,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:35:45,983 INFO L225 Difference]: With dead ends: 402 [2018-12-08 17:35:45,983 INFO L226 Difference]: Without dead ends: 402 [2018-12-08 17:35:45,984 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2018-12-08 17:35:45,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2018-12-08 17:35:45,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 392. [2018-12-08 17:35:45,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2018-12-08 17:35:45,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 428 transitions. [2018-12-08 17:35:45,990 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 428 transitions. Word has length 56 [2018-12-08 17:35:45,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:35:45,990 INFO L480 AbstractCegarLoop]: Abstraction has 392 states and 428 transitions. [2018-12-08 17:35:45,990 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-08 17:35:45,991 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 428 transitions. [2018-12-08 17:35:45,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-08 17:35:45,991 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:35:45,991 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:35:45,992 INFO L423 AbstractCegarLoop]: === Iteration 25 === [merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION]=== [2018-12-08 17:35:45,992 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:35:45,992 INFO L82 PathProgramCache]: Analyzing trace with hash 2105399979, now seen corresponding path program 1 times [2018-12-08 17:35:45,992 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:35:45,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:35:45,993 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:35:45,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:35:45,993 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:35:46,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:35:46,108 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:35:46,108 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:35:46,108 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-08 17:35:46,108 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:35:46,108 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-08 17:35:46,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-08 17:35:46,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2018-12-08 17:35:46,109 INFO L87 Difference]: Start difference. First operand 392 states and 428 transitions. Second operand 13 states. [2018-12-08 17:35:46,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:35:46,646 INFO L93 Difference]: Finished difference Result 434 states and 468 transitions. [2018-12-08 17:35:46,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-08 17:35:46,646 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 56 [2018-12-08 17:35:46,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:35:46,648 INFO L225 Difference]: With dead ends: 434 [2018-12-08 17:35:46,648 INFO L226 Difference]: Without dead ends: 434 [2018-12-08 17:35:46,649 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=389, Unknown=0, NotChecked=0, Total=462 [2018-12-08 17:35:46,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2018-12-08 17:35:46,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 395. [2018-12-08 17:35:46,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2018-12-08 17:35:46,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 431 transitions. [2018-12-08 17:35:46,656 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 431 transitions. Word has length 56 [2018-12-08 17:35:46,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:35:46,656 INFO L480 AbstractCegarLoop]: Abstraction has 395 states and 431 transitions. [2018-12-08 17:35:46,656 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-08 17:35:46,656 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 431 transitions. [2018-12-08 17:35:46,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-08 17:35:46,657 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:35:46,657 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:35:46,658 INFO L423 AbstractCegarLoop]: === Iteration 26 === [merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION]=== [2018-12-08 17:35:46,658 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:35:46,658 INFO L82 PathProgramCache]: Analyzing trace with hash -2129139328, now seen corresponding path program 1 times [2018-12-08 17:35:46,658 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:35:46,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:35:46,659 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:35:46,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:35:46,660 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:35:46,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:35:46,784 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-08 17:35:46,785 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:35:46,785 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-08 17:35:46,785 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:35:46,785 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-08 17:35:46,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-08 17:35:46,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-12-08 17:35:46,786 INFO L87 Difference]: Start difference. First operand 395 states and 431 transitions. Second operand 12 states. [2018-12-08 17:35:47,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:35:47,195 INFO L93 Difference]: Finished difference Result 406 states and 438 transitions. [2018-12-08 17:35:47,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-08 17:35:47,196 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 60 [2018-12-08 17:35:47,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:35:47,196 INFO L225 Difference]: With dead ends: 406 [2018-12-08 17:35:47,196 INFO L226 Difference]: Without dead ends: 406 [2018-12-08 17:35:47,197 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2018-12-08 17:35:47,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2018-12-08 17:35:47,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 389. [2018-12-08 17:35:47,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2018-12-08 17:35:47,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 419 transitions. [2018-12-08 17:35:47,202 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 419 transitions. Word has length 60 [2018-12-08 17:35:47,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:35:47,202 INFO L480 AbstractCegarLoop]: Abstraction has 389 states and 419 transitions. [2018-12-08 17:35:47,202 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-08 17:35:47,202 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 419 transitions. [2018-12-08 17:35:47,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-12-08 17:35:47,203 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:35:47,203 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:35:47,203 INFO L423 AbstractCegarLoop]: === Iteration 27 === [merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION]=== [2018-12-08 17:35:47,203 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:35:47,203 INFO L82 PathProgramCache]: Analyzing trace with hash 1852642869, now seen corresponding path program 2 times [2018-12-08 17:35:47,203 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:35:47,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:35:47,204 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:35:47,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:35:47,205 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:35:47,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:35:47,387 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:35:47,388 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 17:35:47,388 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-08 17:35:47,388 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-08 17:35:47,388 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-08 17:35:47,388 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 17:35:47,388 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4740aade-a493-4198-b34c-4c4f6f881e09/bin-2019/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 17:35:47,395 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-08 17:35:47,396 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-08 17:35:47,411 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2018-12-08 17:35:47,411 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-08 17:35:47,414 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 17:35:47,480 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 19 treesize of output 15 [2018-12-08 17:35:47,481 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 15 treesize of output 3 [2018-12-08 17:35:47,481 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:35:47,482 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:35:47,486 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 19 treesize of output 15 [2018-12-08 17:35:47,488 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 15 treesize of output 3 [2018-12-08 17:35:47,488 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 17:35:47,489 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:35:47,495 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:35:47,495 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:37, output treesize:7 [2018-12-08 17:35:47,521 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-12-08 17:35:47,521 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 17:35:47,567 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 30 treesize of output 28 [2018-12-08 17:35:47,569 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2018-12-08 17:35:47,569 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:35:47,572 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:35:47,584 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 24 [2018-12-08 17:35:47,586 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 19 treesize of output 15 [2018-12-08 17:35:47,587 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 17:35:47,593 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2018-12-08 17:35:47,594 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-08 17:35:47,598 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 12 treesize of output 3 [2018-12-08 17:35:47,598 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-08 17:35:47,600 INFO L267 ElimStorePlain]: Start of recursive call 4: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-08 17:35:47,607 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-08 17:35:47,607 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:61, output treesize:11 [2018-12-08 17:35:47,612 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-12-08 17:35:47,627 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-08 17:35:47,627 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10, 10] imperfect sequences [14] total 23 [2018-12-08 17:35:47,627 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:35:47,627 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-08 17:35:47,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-08 17:35:47,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=451, Unknown=0, NotChecked=0, Total=506 [2018-12-08 17:35:47,628 INFO L87 Difference]: Start difference. First operand 389 states and 419 transitions. Second operand 10 states. [2018-12-08 17:35:48,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:35:48,001 INFO L93 Difference]: Finished difference Result 418 states and 450 transitions. [2018-12-08 17:35:48,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-08 17:35:48,002 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 61 [2018-12-08 17:35:48,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:35:48,003 INFO L225 Difference]: With dead ends: 418 [2018-12-08 17:35:48,003 INFO L226 Difference]: Without dead ends: 418 [2018-12-08 17:35:48,004 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 115 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=87, Invalid=669, Unknown=0, NotChecked=0, Total=756 [2018-12-08 17:35:48,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2018-12-08 17:35:48,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 395. [2018-12-08 17:35:48,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2018-12-08 17:35:48,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 426 transitions. [2018-12-08 17:35:48,014 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 426 transitions. Word has length 61 [2018-12-08 17:35:48,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:35:48,014 INFO L480 AbstractCegarLoop]: Abstraction has 395 states and 426 transitions. [2018-12-08 17:35:48,014 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-08 17:35:48,014 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 426 transitions. [2018-12-08 17:35:48,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-08 17:35:48,015 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:35:48,015 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:35:48,016 INFO L423 AbstractCegarLoop]: === Iteration 28 === [merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION]=== [2018-12-08 17:35:48,016 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:35:48,016 INFO L82 PathProgramCache]: Analyzing trace with hash -1914676622, now seen corresponding path program 1 times [2018-12-08 17:35:48,016 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:35:48,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:35:48,017 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 17:35:48,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:35:48,018 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:35:48,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:35:48,541 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:35:48,541 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 17:35:48,541 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-08 17:35:48,542 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 64 with the following transitions: [2018-12-08 17:35:48,542 INFO L205 CegarAbsIntRunner]: [74], [83], [87], [94], [99], [101], [110], [114], [121], [129], [133], [140], [148], [152], [159], [162], [170], [174], [179], [182], [193], [197], [204], [212], [216], [223], [231], [235], [242], [246], [263], [268], [271], [273], [278], [280], [283], [284], [287], [292], [294], [297], [300], [307], [460], [461], [567], [585], [586], [587] [2018-12-08 17:35:48,543 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-08 17:35:48,543 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-08 17:35:48,591 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-08 17:35:48,591 INFO L272 AbstractInterpreter]: Visited 50 different actions 90 times. Merged at 39 different actions 39 times. Never widened. Performed 756 root evaluator evaluations with a maximum evaluation depth of 3. Performed 756 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 36 variables. [2018-12-08 17:35:48,592 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:35:48,593 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-08 17:35:48,593 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 17:35:48,593 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4740aade-a493-4198-b34c-4c4f6f881e09/bin-2019/utaipan/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 17:35:48,601 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:35:48,602 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-08 17:35:48,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:35:48,627 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 17:35:48,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, 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-12-08 17:35:48,644 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 17:35:48,647 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:35:48,647 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-12-08 17:35:48,669 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-12-08 17:35:48,670 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-12-08 17:35:48,671 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:35:48,672 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:35:48,676 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:35:48,676 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:21 [2018-12-08 17:35:48,681 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 28 treesize of output 23 [2018-12-08 17:35:48,685 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:35:48,686 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 25 [2018-12-08 17:35:48,686 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:35:48,689 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:35:48,697 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:35:48,697 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:18 [2018-12-08 17:35:48,711 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:35:48,712 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:35:48,712 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:35:48,713 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 26 treesize of output 38 [2018-12-08 17:35:48,713 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 17:35:48,720 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:35:48,720 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:35 [2018-12-08 17:35:48,750 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-12-08 17:35:48,752 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-12-08 17:35:48,752 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:35:48,756 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:35:48,762 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:35:48,762 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:46, output treesize:42 [2018-12-08 17:35:48,791 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 43 [2018-12-08 17:35:48,793 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:35:48,801 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 22 treesize of output 14 [2018-12-08 17:35:48,801 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:35:48,806 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:35:48,812 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-12-08 17:35:48,812 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:61, output treesize:42 [2018-12-08 17:35:48,843 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:35:48,844 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:35:48,845 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:35:48,845 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:35:48,846 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 59 [2018-12-08 17:35:48,846 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 17:35:48,859 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-12-08 17:35:48,859 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:56, output treesize:66 [2018-12-08 17:35:48,902 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:35:48,904 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 62 [2018-12-08 17:35:48,906 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2018-12-08 17:35:48,906 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:35:48,915 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:35:48,929 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-12-08 17:35:48,929 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:80, output treesize:85 [2018-12-08 17:35:48,970 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:35:48,973 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:35:48,974 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:35:48,975 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 90 [2018-12-08 17:35:48,981 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:35:48,996 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 66 treesize of output 93 [2018-12-08 17:35:48,996 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-08 17:35:49,017 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:35:49,033 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-08 17:35:49,034 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-08 17:35:49,034 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 17:35:49,036 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:35:49,049 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 17:35:49,049 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:108, output treesize:121 [2018-12-08 17:35:49,312 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 19 treesize of output 15 [2018-12-08 17:35:49,314 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 15 treesize of output 3 [2018-12-08 17:35:49,315 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:35:49,316 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:35:49,335 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-12-08 17:35:49,335 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:139, output treesize:124 [2018-12-08 17:35:49,468 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:35:49,469 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:35:49,470 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 88 [2018-12-08 17:35:49,475 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 30 [2018-12-08 17:35:49,476 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-08 17:35:49,490 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 5 treesize of output 1 [2018-12-08 17:35:49,490 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-08 17:35:49,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, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 33 [2018-12-08 17:35:49,499 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-08 17:35:49,506 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-08 17:35:49,515 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-12-08 17:35:49,516 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:125, output treesize:41 [2018-12-08 17:35:49,567 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 15 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:35:49,568 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 17:35:50,020 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 17:35:50,025 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 17:35:50,026 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 17:35:50,031 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 17:35:50,051 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2018-12-08 17:35:50,051 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:88, output treesize:184 [2018-12-08 17:35:50,851 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 98 treesize of output 75 [2018-12-08 17:35:50,869 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 9 treesize of output 8 [2018-12-08 17:35:50,869 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:35:50,877 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 24 treesize of output 20 [2018-12-08 17:35:50,878 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 20 treesize of output 11 [2018-12-08 17:35:50,878 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 17:35:50,880 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:35:50,881 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:35:50,890 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-08 17:35:50,890 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:144, output treesize:37 [2018-12-08 17:35:50,979 INFO L267 ElimStorePlain]: Start of recursive call 1: End of recursive call: and 1 xjuncts. [2018-12-08 17:35:50,979 INFO L202 ElimStorePlain]: Needed 1 recursive calls to eliminate 4 variables, input treesize:42, output treesize:1 [2018-12-08 17:35:50,997 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:35:51,011 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-08 17:35:51,012 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 21] total 53 [2018-12-08 17:35:51,012 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-08 17:35:51,012 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-12-08 17:35:51,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-12-08 17:35:51,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=264, Invalid=2598, Unknown=0, NotChecked=0, Total=2862 [2018-12-08 17:35:51,013 INFO L87 Difference]: Start difference. First operand 395 states and 426 transitions. Second operand 35 states. [2018-12-08 17:35:56,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:35:56,226 INFO L93 Difference]: Finished difference Result 424 states and 454 transitions. [2018-12-08 17:35:56,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-08 17:35:56,227 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 63 [2018-12-08 17:35:56,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:35:56,229 INFO L225 Difference]: With dead ends: 424 [2018-12-08 17:35:56,229 INFO L226 Difference]: Without dead ends: 424 [2018-12-08 17:35:56,230 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 91 SyntacticMatches, 11 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1282 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=649, Invalid=4607, Unknown=0, NotChecked=0, Total=5256 [2018-12-08 17:35:56,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2018-12-08 17:35:56,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 396. [2018-12-08 17:35:56,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2018-12-08 17:35:56,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 428 transitions. [2018-12-08 17:35:56,237 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 428 transitions. Word has length 63 [2018-12-08 17:35:56,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:35:56,237 INFO L480 AbstractCegarLoop]: Abstraction has 396 states and 428 transitions. [2018-12-08 17:35:56,238 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-12-08 17:35:56,238 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 428 transitions. [2018-12-08 17:35:56,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-08 17:35:56,239 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:35:56,239 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:35:56,240 INFO L423 AbstractCegarLoop]: === Iteration 29 === [merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION]=== [2018-12-08 17:35:56,240 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:35:56,240 INFO L82 PathProgramCache]: Analyzing trace with hash -1914676621, now seen corresponding path program 1 times [2018-12-08 17:35:56,241 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:35:56,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:35:56,242 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:35:56,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:35:56,242 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:35:56,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:35:56,885 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:35:56,885 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 17:35:56,886 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-08 17:35:56,886 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 64 with the following transitions: [2018-12-08 17:35:56,886 INFO L205 CegarAbsIntRunner]: [74], [83], [87], [94], [99], [101], [110], [114], [121], [129], [133], [140], [148], [152], [159], [162], [170], [174], [179], [182], [193], [197], [204], [212], [216], [223], [231], [235], [242], [247], [263], [268], [271], [273], [278], [280], [283], [284], [287], [292], [294], [297], [300], [307], [460], [461], [567], [585], [586], [587] [2018-12-08 17:35:56,887 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-08 17:35:56,887 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-08 17:35:56,939 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-08 17:35:56,939 INFO L272 AbstractInterpreter]: Visited 50 different actions 90 times. Merged at 39 different actions 39 times. Never widened. Performed 762 root evaluator evaluations with a maximum evaluation depth of 3. Performed 762 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 36 variables. [2018-12-08 17:35:56,942 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:35:56,942 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-08 17:35:56,942 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 17:35:56,942 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4740aade-a493-4198-b34c-4c4f6f881e09/bin-2019/utaipan/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 17:35:56,950 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:35:56,951 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-08 17:35:56,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:35:56,974 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 17:35:56,976 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-12-08 17:35:56,976 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 17:35:56,985 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:35:56,985 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-08 17:35:57,008 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-12-08 17:35:57,008 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 17:35:57,015 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-12-08 17:35:57,015 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:35:57,024 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:35:57,024 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:27 [2018-12-08 17:35:57,049 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-12-08 17:35:57,051 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-12-08 17:35:57,051 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:35:57,052 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:35:57,062 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-12-08 17:35:57,063 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-12-08 17:35:57,063 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 17:35:57,065 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:35:57,072 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:35:57,073 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:49, output treesize:42 [2018-12-08 17:35:57,099 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 32 treesize of output 25 [2018-12-08 17:35:57,105 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:35:57,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 25 treesize of output 34 [2018-12-08 17:35:57,106 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:35:57,111 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:35:57,126 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-12-08 17:35:57,127 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:35:57,128 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-12-08 17:35:57,129 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 17:35:57,133 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:35:57,142 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:35:57,142 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:68, output treesize:42 [2018-12-08 17:35:57,169 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:35:57,170 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:35:57,170 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 21 treesize of output 32 [2018-12-08 17:35:57,170 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 17:35:57,184 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:35:57,185 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:35:57,186 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:35:57,186 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 26 treesize of output 38 [2018-12-08 17:35:57,186 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:35:57,197 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:35:57,198 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:59, output treesize:64 [2018-12-08 17:35:57,236 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 39 [2018-12-08 17:35:57,238 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-12-08 17:35:57,239 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:35:57,244 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:35:57,261 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-12-08 17:35:57,263 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-12-08 17:35:57,263 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 17:35:57,266 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:35:57,279 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:35:57,279 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:86, output treesize:78 [2018-12-08 17:35:57,328 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 52 [2018-12-08 17:35:57,331 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:35:57,332 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 22 treesize of output 14 [2018-12-08 17:35:57,332 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:35:57,339 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:35:57,359 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 33 [2018-12-08 17:35:57,362 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:35:57,363 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 22 treesize of output 14 [2018-12-08 17:35:57,363 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 17:35:57,369 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:35:57,382 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:35:57,382 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:116, output treesize:78 [2018-12-08 17:35:57,386 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:35:57,387 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:35:57,387 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:35:57,388 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 53 [2018-12-08 17:35:57,388 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 17:35:57,413 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:35:57,414 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:35:57,415 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:35:57,415 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:35:57,416 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 29 [2018-12-08 17:35:57,416 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:35:57,432 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:35:57,432 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:92, output treesize:83 [2018-12-08 17:35:57,492 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:35:57,495 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 62 [2018-12-08 17:35:57,496 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2018-12-08 17:35:57,496 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:35:57,505 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:35:57,530 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:35:57,534 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 39 [2018-12-08 17:35:57,536 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-12-08 17:35:57,536 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 17:35:57,541 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:35:57,560 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:35:57,560 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:108, output treesize:114 [2018-12-08 17:35:57,608 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:35:57,609 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:35:57,611 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:35:57,617 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 107 [2018-12-08 17:35:57,621 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:35:57,629 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 83 treesize of output 112 [2018-12-08 17:35:57,630 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-08 17:35:57,662 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:35:57,686 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:35:57,691 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 70 [2018-12-08 17:35:57,694 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:35:57,695 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 37 treesize of output 46 [2018-12-08 17:35:57,695 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 17:35:57,702 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:35:57,722 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:35:57,722 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:140, output treesize:186 [2018-12-08 17:35:58,067 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:35:58,069 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:35:58,070 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 195 treesize of output 163 [2018-12-08 17:35:58,080 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 106 treesize of output 102 [2018-12-08 17:35:58,082 INFO L267 ElimStorePlain]: Start of recursive call 3: 8 dim-0 vars, End of recursive call: 8 dim-0 vars, and 3 xjuncts. [2018-12-08 17:35:58,133 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 108 treesize of output 73 [2018-12-08 17:35:58,133 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-08 17:35:58,135 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:35:58,137 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 118 treesize of output 91 [2018-12-08 17:35:58,137 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 17:35:58,143 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 1 case distinctions, treesize of input 120 treesize of output 97 [2018-12-08 17:35:58,144 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-12-08 17:35:58,204 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 9 treesize of output 1 [2018-12-08 17:35:58,204 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-08 17:35:58,252 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 6 dim-0 vars, and 3 xjuncts. [2018-12-08 17:35:58,299 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 75 [2018-12-08 17:35:58,301 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:35:58,302 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 28 [2018-12-08 17:35:58,303 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-08 17:35:58,317 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-08 17:35:58,317 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-08 17:35:58,329 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 5 treesize of output 1 [2018-12-08 17:35:58,329 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-08 17:35:58,338 INFO L267 ElimStorePlain]: Start of recursive call 8: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:35:58,342 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 75 [2018-12-08 17:35:58,343 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-12-08 17:35:58,344 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-08 17:35:58,356 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 19 treesize of output 3 [2018-12-08 17:35:58,356 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-12-08 17:35:58,367 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 15 treesize of output 7 [2018-12-08 17:35:58,367 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-08 17:35:58,375 INFO L267 ElimStorePlain]: Start of recursive call 12: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:35:58,378 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 75 [2018-12-08 17:35:58,380 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-12-08 17:35:58,380 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-12-08 17:35:58,395 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 19 treesize of output 3 [2018-12-08 17:35:58,395 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-12-08 17:35:58,406 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 15 treesize of output 7 [2018-12-08 17:35:58,406 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-12-08 17:35:58,414 INFO L267 ElimStorePlain]: Start of recursive call 16: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:35:58,443 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 9 dim-0 vars, and 3 xjuncts. [2018-12-08 17:35:58,443 INFO L202 ElimStorePlain]: Needed 19 recursive calls to eliminate 4 variables, input treesize:224, output treesize:133 [2018-12-08 17:35:58,527 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:35:58,527 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 17:35:59,068 WARN L180 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 96 [2018-12-08 17:35:59,069 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 17:35:59,078 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 17:35:59,079 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 17:35:59,091 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 17:35:59,092 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 17:35:59,103 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 17:35:59,238 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 17:35:59,251 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 17:35:59,252 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 17:35:59,261 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 17:35:59,353 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 17:35:59,360 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 17:35:59,361 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 17:35:59,370 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 17:35:59,448 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-12-08 17:35:59,455 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:35:59,456 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-12-08 17:35:59,466 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:35:59,466 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-12-08 17:35:59,473 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:35:59,528 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-2 vars, End of recursive call: 13 dim-0 vars, and 5 xjuncts. [2018-12-08 17:35:59,528 INFO L202 ElimStorePlain]: Needed 21 recursive calls to eliminate 8 variables, input treesize:171, output treesize:236 [2018-12-08 17:36:00,155 WARN L180 SmtUtils]: Spent 265.00 ms on a formula simplification that was a NOOP. DAG size: 111 [2018-12-08 17:36:01,135 WARN L180 SmtUtils]: Spent 857.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 66 [2018-12-08 17:36:03,928 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:36:03,932 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 102 [2018-12-08 17:36:03,956 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 14 treesize of output 18 [2018-12-08 17:36:03,958 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:36:03,959 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 24 [2018-12-08 17:36:03,959 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-08 17:36:03,964 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:36:03,975 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 66 treesize of output 60 [2018-12-08 17:36:03,978 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:36:03,979 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 60 treesize of output 49 [2018-12-08 17:36:03,979 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-08 17:36:03,983 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:36:03,992 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:36:04,013 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:36:04,016 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 62 [2018-12-08 17:36:04,046 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 14 treesize of output 18 [2018-12-08 17:36:04,048 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:36:04,048 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 24 [2018-12-08 17:36:04,049 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-08 17:36:04,052 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:36:04,061 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 26 treesize of output 20 [2018-12-08 17:36:04,062 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:36:04,063 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 20 treesize of output 9 [2018-12-08 17:36:04,063 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-08 17:36:04,065 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:36:04,070 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:36:04,088 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:36:04,091 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 72 [2018-12-08 17:36:04,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 18 [2018-12-08 17:36:04,113 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:36:04,114 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 24 [2018-12-08 17:36:04,115 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-12-08 17:36:04,118 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:36:04,126 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 36 treesize of output 30 [2018-12-08 17:36:04,128 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:36:04,129 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 30 treesize of output 19 [2018-12-08 17:36:04,129 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-12-08 17:36:04,131 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:36:04,139 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:36:04,151 INFO L267 ElimStorePlain]: Start of recursive call 1: 12 dim-0 vars, 3 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-12-08 17:36:04,151 INFO L202 ElimStorePlain]: Needed 16 recursive calls to eliminate 15 variables, input treesize:204, output treesize:67 [2018-12-08 17:36:04,522 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:36:04,522 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:36:04,523 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:36:04,523 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:36:04,524 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 37 [2018-12-08 17:36:04,536 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:36:04,536 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:36:04,537 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:36:04,537 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 22 treesize of output 10 [2018-12-08 17:36:04,537 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:36:04,541 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:36:04,548 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-08 17:36:04,548 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:55, output treesize:33 [2018-12-08 17:36:04,662 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:36:04,677 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-08 17:36:04,677 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17, 21] total 54 [2018-12-08 17:36:04,677 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-08 17:36:04,677 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-12-08 17:36:04,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-12-08 17:36:04,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=235, Invalid=2734, Unknown=1, NotChecked=0, Total=2970 [2018-12-08 17:36:04,678 INFO L87 Difference]: Start difference. First operand 396 states and 428 transitions. Second operand 35 states. [2018-12-08 17:36:05,539 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 57 [2018-12-08 17:36:05,846 WARN L180 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 55 [2018-12-08 17:36:06,191 WARN L180 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 61 [2018-12-08 17:36:06,535 WARN L180 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 73 [2018-12-08 17:36:06,910 WARN L180 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 94 [2018-12-08 17:36:07,371 WARN L180 SmtUtils]: Spent 350.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 112 [2018-12-08 17:36:09,624 WARN L180 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 114 [2018-12-08 17:36:10,097 WARN L180 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 89 [2018-12-08 17:36:12,773 WARN L180 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 102 [2018-12-08 17:36:13,224 WARN L180 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 102 [2018-12-08 17:36:13,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:36:13,326 INFO L93 Difference]: Finished difference Result 447 states and 477 transitions. [2018-12-08 17:36:13,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-08 17:36:13,326 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 63 [2018-12-08 17:36:13,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:36:13,327 INFO L225 Difference]: With dead ends: 447 [2018-12-08 17:36:13,327 INFO L226 Difference]: Without dead ends: 447 [2018-12-08 17:36:13,328 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 91 SyntacticMatches, 10 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1331 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=664, Invalid=4591, Unknown=1, NotChecked=0, Total=5256 [2018-12-08 17:36:13,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2018-12-08 17:36:13,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 396. [2018-12-08 17:36:13,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2018-12-08 17:36:13,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 427 transitions. [2018-12-08 17:36:13,331 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 427 transitions. Word has length 63 [2018-12-08 17:36:13,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:36:13,331 INFO L480 AbstractCegarLoop]: Abstraction has 396 states and 427 transitions. [2018-12-08 17:36:13,331 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-12-08 17:36:13,331 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 427 transitions. [2018-12-08 17:36:13,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-08 17:36:13,331 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:36:13,332 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:36:13,332 INFO L423 AbstractCegarLoop]: === Iteration 30 === [merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION]=== [2018-12-08 17:36:13,332 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:36:13,332 INFO L82 PathProgramCache]: Analyzing trace with hash 178813972, now seen corresponding path program 1 times [2018-12-08 17:36:13,332 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:36:13,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:36:13,332 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:36:13,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:36:13,333 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:36:13,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:36:13,786 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 4 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:36:13,786 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 17:36:13,787 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-08 17:36:13,787 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 64 with the following transitions: [2018-12-08 17:36:13,787 INFO L205 CegarAbsIntRunner]: [74], [83], [87], [94], [101], [110], [114], [121], [129], [133], [140], [148], [152], [159], [162], [163], [170], [174], [179], [182], [263], [268], [271], [273], [278], [280], [283], [284], [287], [292], [294], [297], [300], [307], [460], [461], [567], [585], [586], [587] [2018-12-08 17:36:13,788 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-08 17:36:13,788 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-08 17:36:13,833 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-08 17:36:13,833 INFO L272 AbstractInterpreter]: Visited 40 different actions 70 times. Merged at 29 different actions 29 times. Never widened. Performed 620 root evaluator evaluations with a maximum evaluation depth of 3. Performed 620 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 30 variables. [2018-12-08 17:36:13,835 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:36:13,835 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-08 17:36:13,835 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 17:36:13,835 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4740aade-a493-4198-b34c-4c4f6f881e09/bin-2019/utaipan/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 17:36:13,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:36:13,842 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-08 17:36:13,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:36:13,865 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 17:36:13,918 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-08 17:36:13,920 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-08 17:36:13,920 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:36:13,921 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:36:13,928 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-08 17:36:13,929 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-08 17:36:13,929 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 17:36:13,931 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:36:13,939 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:36:13,939 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:38, output treesize:30 [2018-12-08 17:36:13,985 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:36:13,986 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:36:13,986 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-12-08 17:36:13,987 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 17:36:13,994 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:36:13,994 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:41, output treesize:39 [2018-12-08 17:36:14,028 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-12-08 17:36:14,029 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-12-08 17:36:14,029 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:36:14,033 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:36:14,047 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-12-08 17:36:14,048 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-12-08 17:36:14,048 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 17:36:14,051 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:36:14,060 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:36:14,061 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:61, output treesize:53 [2018-12-08 17:36:14,101 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 36 treesize of output 35 [2018-12-08 17:36:14,103 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:36:14,104 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 22 treesize of output 14 [2018-12-08 17:36:14,104 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:36:14,109 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:36:14,124 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 36 treesize of output 35 [2018-12-08 17:36:14,126 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:36:14,127 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 22 treesize of output 14 [2018-12-08 17:36:14,127 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 17:36:14,131 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:36:14,140 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:36:14,140 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:91, output treesize:53 [2018-12-08 17:36:14,142 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:36:14,143 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:36:14,143 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:36:14,144 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-12-08 17:36:14,144 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 17:36:14,154 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:36:14,154 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:61, output treesize:54 [2018-12-08 17:36:14,197 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 28 treesize of output 37 [2018-12-08 17:36:14,199 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-08 17:36:14,199 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:36:14,205 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:36:14,226 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 28 treesize of output 41 [2018-12-08 17:36:14,228 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-12-08 17:36:14,228 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 17:36:14,234 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:36:14,248 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:36:14,248 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:79, output treesize:81 [2018-12-08 17:36:14,304 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 69 treesize of output 65 [2018-12-08 17:36:14,306 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:36:14,307 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 62 [2018-12-08 17:36:14,307 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:36:14,319 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:36:14,341 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 53 treesize of output 72 [2018-12-08 17:36:14,343 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:36:14,344 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 37 treesize of output 46 [2018-12-08 17:36:14,344 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 17:36:14,352 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:36:14,366 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:36:14,367 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:107, output treesize:129 [2018-12-08 17:36:14,713 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 5 new quantified variables, introduced 0 case distinctions, treesize of input 135 treesize of output 111 [2018-12-08 17:36:14,715 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 54 [2018-12-08 17:36:14,715 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-08 17:36:14,726 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:36:14,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, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-12-08 17:36:14,727 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-08 17:36:14,736 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 9 treesize of output 1 [2018-12-08 17:36:14,736 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 17:36:14,743 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-08 17:36:14,758 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 63 treesize of output 59 [2018-12-08 17:36:14,759 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-12-08 17:36:14,760 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-08 17:36:14,768 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:36:14,768 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-12-08 17:36:14,768 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-08 17:36:14,774 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 22 treesize of output 7 [2018-12-08 17:36:14,774 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-08 17:36:14,779 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:36:14,786 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:36:14,786 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:168, output treesize:13 [2018-12-08 17:36:14,834 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 10 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:36:14,834 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 17:36:15,499 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2018-12-08 17:36:15,500 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:36:15,509 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:36:15,510 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 17:36:15,518 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:36:15,519 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-08 17:36:15,528 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:36:15,599 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 17:36:15,606 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 17:36:15,607 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 17:36:15,614 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 17:36:15,673 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-08 17:36:15,681 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:36:15,681 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-08 17:36:15,691 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:36:15,739 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 17:36:15,749 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 17:36:15,749 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 17:36:15,757 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 17:36:15,803 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-2 vars, End of recursive call: 9 dim-0 vars, and 4 xjuncts. [2018-12-08 17:36:15,803 INFO L202 ElimStorePlain]: Needed 19 recursive calls to eliminate 8 variables, input treesize:157, output treesize:170 [2018-12-08 17:36:16,520 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 64 treesize of output 55 [2018-12-08 17:36:16,535 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-12-08 17:36:16,535 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:36:16,547 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2018-12-08 17:36:16,549 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 16 treesize of output 3 [2018-12-08 17:36:16,549 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 17:36:16,551 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:36:16,556 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 39 [2018-12-08 17:36:16,557 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 34 treesize of output 37 [2018-12-08 17:36:16,567 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-08 17:36:16,567 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-08 17:36:16,569 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2018-12-08 17:36:16,569 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-08 17:36:16,578 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-08 17:36:16,598 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 27 treesize of output 15 [2018-12-08 17:36:16,598 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-08 17:36:16,599 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 27 treesize of output 15 [2018-12-08 17:36:16,599 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-08 17:36:16,615 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:36:16,616 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 39 [2018-12-08 17:36:16,629 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 9 [2018-12-08 17:36:16,629 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-08 17:36:16,634 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-08 17:36:16,644 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-08 17:36:16,646 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 32 treesize of output 28 [2018-12-08 17:36:16,647 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:36:16,648 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 24 treesize of output 32 [2018-12-08 17:36:16,663 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:36:16,664 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 19 treesize of output 10 [2018-12-08 17:36:16,664 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-12-08 17:36:16,665 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 9 [2018-12-08 17:36:16,666 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-12-08 17:36:16,676 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-08 17:36:16,686 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-08 17:36:16,703 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-08 17:36:16,740 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 64 treesize of output 55 [2018-12-08 17:36:16,754 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-12-08 17:36:16,754 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-12-08 17:36:16,768 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 32 treesize of output 28 [2018-12-08 17:36:16,778 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:36:16,779 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 24 treesize of output 32 [2018-12-08 17:36:16,794 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 9 [2018-12-08 17:36:16,794 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-12-08 17:36:16,796 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:36:16,797 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 19 treesize of output 10 [2018-12-08 17:36:16,797 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-12-08 17:36:16,805 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-08 17:36:16,817 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-08 17:36:16,818 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2018-12-08 17:36:16,819 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 16 treesize of output 3 [2018-12-08 17:36:16,820 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-12-08 17:36:16,822 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:36:16,827 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 39 [2018-12-08 17:36:16,828 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:36:16,829 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 39 [2018-12-08 17:36:16,841 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 9 [2018-12-08 17:36:16,842 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-12-08 17:36:16,846 INFO L267 ElimStorePlain]: Start of recursive call 27: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-08 17:36:16,869 INFO L267 ElimStorePlain]: Start of recursive call 26: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-08 17:36:16,887 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-08 17:36:16,936 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 2 dim-2 vars, End of recursive call: 10 dim-0 vars, and 6 xjuncts. [2018-12-08 17:36:16,936 INFO L202 ElimStorePlain]: Needed 28 recursive calls to eliminate 10 variables, input treesize:129, output treesize:145 [2018-12-08 17:36:17,080 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:36:17,080 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:36:17,080 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:36:17,081 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 28 treesize of output 16 [2018-12-08 17:36:17,081 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 17:36:17,092 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:36:17,093 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:36:17,093 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:36:17,093 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 28 treesize of output 16 [2018-12-08 17:36:17,094 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:36:17,104 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-08 17:36:17,104 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:103, output treesize:15 [2018-12-08 17:36:17,165 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 10 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:36:17,180 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-08 17:36:17,180 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 21] total 54 [2018-12-08 17:36:17,180 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-08 17:36:17,180 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-12-08 17:36:17,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-12-08 17:36:17,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=2709, Unknown=2, NotChecked=0, Total=2862 [2018-12-08 17:36:17,181 INFO L87 Difference]: Start difference. First operand 396 states and 427 transitions. Second operand 36 states. [2018-12-08 17:36:18,362 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 81 [2018-12-08 17:36:18,583 WARN L180 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 96 [2018-12-08 17:36:19,162 WARN L180 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 82 [2018-12-08 17:36:21,108 WARN L180 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 93 [2018-12-08 17:36:23,188 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 83 [2018-12-08 17:36:23,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:36:23,722 INFO L93 Difference]: Finished difference Result 510 states and 549 transitions. [2018-12-08 17:36:23,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-12-08 17:36:23,723 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 63 [2018-12-08 17:36:23,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:36:23,724 INFO L225 Difference]: With dead ends: 510 [2018-12-08 17:36:23,724 INFO L226 Difference]: Without dead ends: 510 [2018-12-08 17:36:23,725 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 97 SyntacticMatches, 6 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1384 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=643, Invalid=7727, Unknown=2, NotChecked=0, Total=8372 [2018-12-08 17:36:23,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2018-12-08 17:36:23,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 458. [2018-12-08 17:36:23,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 458 states. [2018-12-08 17:36:23,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 490 transitions. [2018-12-08 17:36:23,730 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 490 transitions. Word has length 63 [2018-12-08 17:36:23,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:36:23,730 INFO L480 AbstractCegarLoop]: Abstraction has 458 states and 490 transitions. [2018-12-08 17:36:23,730 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-12-08 17:36:23,730 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 490 transitions. [2018-12-08 17:36:23,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-08 17:36:23,730 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:36:23,730 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:36:23,731 INFO L423 AbstractCegarLoop]: === Iteration 31 === [merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION]=== [2018-12-08 17:36:23,731 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:36:23,731 INFO L82 PathProgramCache]: Analyzing trace with hash -1102875357, now seen corresponding path program 1 times [2018-12-08 17:36:23,731 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:36:23,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:36:23,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:36:23,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:36:23,732 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:36:23,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:36:23,766 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-12-08 17:36:23,766 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:36:23,766 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 17:36:23,766 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:36:23,766 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-08 17:36:23,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 17:36:23,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-08 17:36:23,766 INFO L87 Difference]: Start difference. First operand 458 states and 490 transitions. Second operand 7 states. [2018-12-08 17:36:23,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:36:23,979 INFO L93 Difference]: Finished difference Result 467 states and 500 transitions. [2018-12-08 17:36:23,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-08 17:36:23,980 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 66 [2018-12-08 17:36:23,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:36:23,980 INFO L225 Difference]: With dead ends: 467 [2018-12-08 17:36:23,981 INFO L226 Difference]: Without dead ends: 467 [2018-12-08 17:36:23,981 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-12-08 17:36:23,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2018-12-08 17:36:23,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 466. [2018-12-08 17:36:23,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 466 states. [2018-12-08 17:36:23,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 500 transitions. [2018-12-08 17:36:23,984 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 500 transitions. Word has length 66 [2018-12-08 17:36:23,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:36:23,984 INFO L480 AbstractCegarLoop]: Abstraction has 466 states and 500 transitions. [2018-12-08 17:36:23,984 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-08 17:36:23,984 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 500 transitions. [2018-12-08 17:36:23,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-08 17:36:23,985 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:36:23,985 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:36:23,985 INFO L423 AbstractCegarLoop]: === Iteration 32 === [merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION]=== [2018-12-08 17:36:23,985 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:36:23,985 INFO L82 PathProgramCache]: Analyzing trace with hash -1102875356, now seen corresponding path program 1 times [2018-12-08 17:36:23,985 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:36:23,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:36:23,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:36:23,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:36:23,986 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:36:23,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:36:24,047 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-08 17:36:24,047 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:36:24,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-08 17:36:24,047 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:36:24,048 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-08 17:36:24,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-08 17:36:24,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-12-08 17:36:24,048 INFO L87 Difference]: Start difference. First operand 466 states and 500 transitions. Second operand 9 states. [2018-12-08 17:36:24,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:36:24,510 INFO L93 Difference]: Finished difference Result 523 states and 569 transitions. [2018-12-08 17:36:24,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-08 17:36:24,510 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 66 [2018-12-08 17:36:24,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:36:24,511 INFO L225 Difference]: With dead ends: 523 [2018-12-08 17:36:24,511 INFO L226 Difference]: Without dead ends: 523 [2018-12-08 17:36:24,511 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2018-12-08 17:36:24,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2018-12-08 17:36:24,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 471. [2018-12-08 17:36:24,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 471 states. [2018-12-08 17:36:24,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 511 transitions. [2018-12-08 17:36:24,516 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 511 transitions. Word has length 66 [2018-12-08 17:36:24,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:36:24,516 INFO L480 AbstractCegarLoop]: Abstraction has 471 states and 511 transitions. [2018-12-08 17:36:24,516 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-08 17:36:24,516 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 511 transitions. [2018-12-08 17:36:24,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-08 17:36:24,516 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:36:24,516 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:36:24,516 INFO L423 AbstractCegarLoop]: === Iteration 33 === [merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION]=== [2018-12-08 17:36:24,517 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:36:24,517 INFO L82 PathProgramCache]: Analyzing trace with hash 502179060, now seen corresponding path program 1 times [2018-12-08 17:36:24,517 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:36:24,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:36:24,517 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:36:24,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:36:24,517 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:36:24,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:36:24,603 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:36:24,604 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:36:24,604 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-12-08 17:36:24,604 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:36:24,604 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-08 17:36:24,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-08 17:36:24,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2018-12-08 17:36:24,605 INFO L87 Difference]: Start difference. First operand 471 states and 511 transitions. Second operand 14 states. [2018-12-08 17:36:25,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:36:25,105 INFO L93 Difference]: Finished difference Result 499 states and 539 transitions. [2018-12-08 17:36:25,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-08 17:36:25,106 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 68 [2018-12-08 17:36:25,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:36:25,107 INFO L225 Difference]: With dead ends: 499 [2018-12-08 17:36:25,107 INFO L226 Difference]: Without dead ends: 499 [2018-12-08 17:36:25,107 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=139, Invalid=617, Unknown=0, NotChecked=0, Total=756 [2018-12-08 17:36:25,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2018-12-08 17:36:25,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 476. [2018-12-08 17:36:25,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 476 states. [2018-12-08 17:36:25,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 476 states to 476 states and 518 transitions. [2018-12-08 17:36:25,111 INFO L78 Accepts]: Start accepts. Automaton has 476 states and 518 transitions. Word has length 68 [2018-12-08 17:36:25,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:36:25,111 INFO L480 AbstractCegarLoop]: Abstraction has 476 states and 518 transitions. [2018-12-08 17:36:25,111 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-08 17:36:25,111 INFO L276 IsEmpty]: Start isEmpty. Operand 476 states and 518 transitions. [2018-12-08 17:36:25,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-08 17:36:25,111 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:36:25,111 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:36:25,112 INFO L423 AbstractCegarLoop]: === Iteration 34 === [merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION]=== [2018-12-08 17:36:25,112 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:36:25,112 INFO L82 PathProgramCache]: Analyzing trace with hash 502179061, now seen corresponding path program 1 times [2018-12-08 17:36:25,112 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:36:25,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:36:25,112 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:36:25,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:36:25,112 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:36:25,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:36:25,242 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:36:25,242 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:36:25,242 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-08 17:36:25,242 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:36:25,242 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-08 17:36:25,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-08 17:36:25,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2018-12-08 17:36:25,243 INFO L87 Difference]: Start difference. First operand 476 states and 518 transitions. Second operand 13 states. [2018-12-08 17:36:25,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:36:25,653 INFO L93 Difference]: Finished difference Result 522 states and 570 transitions. [2018-12-08 17:36:25,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-08 17:36:25,654 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 68 [2018-12-08 17:36:25,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:36:25,655 INFO L225 Difference]: With dead ends: 522 [2018-12-08 17:36:25,655 INFO L226 Difference]: Without dead ends: 522 [2018-12-08 17:36:25,655 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=378, Unknown=0, NotChecked=0, Total=462 [2018-12-08 17:36:25,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2018-12-08 17:36:25,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 484. [2018-12-08 17:36:25,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 484 states. [2018-12-08 17:36:25,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 527 transitions. [2018-12-08 17:36:25,661 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 527 transitions. Word has length 68 [2018-12-08 17:36:25,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:36:25,661 INFO L480 AbstractCegarLoop]: Abstraction has 484 states and 527 transitions. [2018-12-08 17:36:25,661 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-08 17:36:25,661 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 527 transitions. [2018-12-08 17:36:25,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-08 17:36:25,662 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:36:25,662 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:36:25,662 INFO L423 AbstractCegarLoop]: === Iteration 35 === [merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION]=== [2018-12-08 17:36:25,662 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:36:25,662 INFO L82 PathProgramCache]: Analyzing trace with hash -1612319579, now seen corresponding path program 1 times [2018-12-08 17:36:25,663 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:36:25,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:36:25,663 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:36:25,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:36:25,663 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:36:25,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:36:25,742 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:36:25,742 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:36:25,742 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-08 17:36:25,742 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:36:25,743 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-08 17:36:25,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-08 17:36:25,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2018-12-08 17:36:25,743 INFO L87 Difference]: Start difference. First operand 484 states and 527 transitions. Second operand 12 states. [2018-12-08 17:36:25,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:36:25,962 INFO L93 Difference]: Finished difference Result 497 states and 537 transitions. [2018-12-08 17:36:25,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-08 17:36:25,963 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 69 [2018-12-08 17:36:25,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:36:25,963 INFO L225 Difference]: With dead ends: 497 [2018-12-08 17:36:25,963 INFO L226 Difference]: Without dead ends: 497 [2018-12-08 17:36:25,964 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2018-12-08 17:36:25,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2018-12-08 17:36:25,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 484. [2018-12-08 17:36:25,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 484 states. [2018-12-08 17:36:25,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 525 transitions. [2018-12-08 17:36:25,969 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 525 transitions. Word has length 69 [2018-12-08 17:36:25,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:36:25,969 INFO L480 AbstractCegarLoop]: Abstraction has 484 states and 525 transitions. [2018-12-08 17:36:25,969 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-08 17:36:25,969 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 525 transitions. [2018-12-08 17:36:25,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-12-08 17:36:25,969 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:36:25,970 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:36:25,970 INFO L423 AbstractCegarLoop]: === Iteration 36 === [merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION]=== [2018-12-08 17:36:25,970 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:36:25,970 INFO L82 PathProgramCache]: Analyzing trace with hash -1488789886, now seen corresponding path program 1 times [2018-12-08 17:36:25,970 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:36:25,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:36:25,971 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:36:25,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:36:25,971 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:36:25,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:36:26,046 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-08 17:36:26,046 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 17:36:26,046 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-08 17:36:26,046 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 72 with the following transitions: [2018-12-08 17:36:26,047 INFO L205 CegarAbsIntRunner]: [26], [35], [36], [38], [39], [42], [43], [46], [72], [73], [74], [83], [87], [94], [99], [193], [197], [204], [212], [216], [223], [231], [235], [242], [245], [253], [257], [262], [263], [268], [271], [273], [278], [280], [283], [284], [287], [292], [294], [297], [300], [307], [313], [320], [322], [460], [461], [567], [568], [569], [570], [585], [586], [587] [2018-12-08 17:36:26,048 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-08 17:36:26,048 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-08 17:36:26,075 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-08 17:36:26,075 INFO L272 AbstractInterpreter]: Visited 54 different actions 67 times. Merged at 12 different actions 12 times. Never widened. Performed 525 root evaluator evaluations with a maximum evaluation depth of 3. Performed 525 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 30 variables. [2018-12-08 17:36:26,077 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:36:26,077 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-08 17:36:26,077 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 17:36:26,077 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4740aade-a493-4198-b34c-4c4f6f881e09/bin-2019/utaipan/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 17:36:26,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:36:26,090 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-08 17:36:26,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:36:26,118 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 17:36:26,222 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-08 17:36:26,222 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 17:36:26,373 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 8 treesize of output 6 [2018-12-08 17:36:26,373 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 17:36:26,374 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:36:26,374 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2018-12-08 17:36:26,390 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-12-08 17:36:26,405 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-08 17:36:26,405 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [10, 13] total 28 [2018-12-08 17:36:26,405 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:36:26,405 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-08 17:36:26,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-08 17:36:26,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=707, Unknown=0, NotChecked=0, Total=812 [2018-12-08 17:36:26,405 INFO L87 Difference]: Start difference. First operand 484 states and 525 transitions. Second operand 12 states. [2018-12-08 17:36:28,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:36:28,394 INFO L93 Difference]: Finished difference Result 504 states and 543 transitions. [2018-12-08 17:36:28,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-08 17:36:28,395 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 71 [2018-12-08 17:36:28,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:36:28,396 INFO L225 Difference]: With dead ends: 504 [2018-12-08 17:36:28,397 INFO L226 Difference]: Without dead ends: 504 [2018-12-08 17:36:28,397 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 122 SyntacticMatches, 5 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 402 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=171, Invalid=1311, Unknown=0, NotChecked=0, Total=1482 [2018-12-08 17:36:28,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2018-12-08 17:36:28,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 485. [2018-12-08 17:36:28,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 485 states. [2018-12-08 17:36:28,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 524 transitions. [2018-12-08 17:36:28,404 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 524 transitions. Word has length 71 [2018-12-08 17:36:28,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:36:28,404 INFO L480 AbstractCegarLoop]: Abstraction has 485 states and 524 transitions. [2018-12-08 17:36:28,404 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-08 17:36:28,405 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 524 transitions. [2018-12-08 17:36:28,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-08 17:36:28,405 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:36:28,406 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:36:28,406 INFO L423 AbstractCegarLoop]: === Iteration 37 === [merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION]=== [2018-12-08 17:36:28,406 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:36:28,406 INFO L82 PathProgramCache]: Analyzing trace with hash 1046962897, now seen corresponding path program 1 times [2018-12-08 17:36:28,406 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:36:28,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:36:28,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:36:28,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:36:28,407 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:36:28,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:36:28,478 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-08 17:36:28,478 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:36:28,478 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-08 17:36:28,478 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:36:28,478 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-08 17:36:28,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-08 17:36:28,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-12-08 17:36:28,478 INFO L87 Difference]: Start difference. First operand 485 states and 524 transitions. Second operand 11 states. [2018-12-08 17:36:28,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:36:28,751 INFO L93 Difference]: Finished difference Result 577 states and 629 transitions. [2018-12-08 17:36:28,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-08 17:36:28,751 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 72 [2018-12-08 17:36:28,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:36:28,752 INFO L225 Difference]: With dead ends: 577 [2018-12-08 17:36:28,752 INFO L226 Difference]: Without dead ends: 577 [2018-12-08 17:36:28,753 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2018-12-08 17:36:28,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2018-12-08 17:36:28,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 522. [2018-12-08 17:36:28,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 522 states. [2018-12-08 17:36:28,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 579 transitions. [2018-12-08 17:36:28,757 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 579 transitions. Word has length 72 [2018-12-08 17:36:28,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:36:28,757 INFO L480 AbstractCegarLoop]: Abstraction has 522 states and 579 transitions. [2018-12-08 17:36:28,757 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-08 17:36:28,757 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 579 transitions. [2018-12-08 17:36:28,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-12-08 17:36:28,758 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:36:28,758 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:36:28,759 INFO L423 AbstractCegarLoop]: === Iteration 38 === [merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION]=== [2018-12-08 17:36:28,759 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:36:28,759 INFO L82 PathProgramCache]: Analyzing trace with hash 1587751402, now seen corresponding path program 1 times [2018-12-08 17:36:28,759 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:36:28,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:36:28,760 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:36:28,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:36:28,760 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:36:28,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:36:28,822 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-08 17:36:28,823 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 17:36:28,823 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-08 17:36:28,823 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 75 with the following transitions: [2018-12-08 17:36:28,823 INFO L205 CegarAbsIntRunner]: [26], [35], [36], [39], [42], [43], [46], [48], [51], [72], [73], [74], [83], [87], [94], [99], [193], [197], [204], [212], [216], [223], [231], [235], [242], [245], [253], [257], [262], [263], [268], [271], [273], [278], [280], [283], [284], [287], [292], [294], [297], [300], [307], [313], [320], [322], [460], [461], [567], [568], [569], [570], [585], [586], [587] [2018-12-08 17:36:28,824 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-08 17:36:28,824 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-08 17:36:28,854 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-08 17:36:28,854 INFO L272 AbstractInterpreter]: Visited 55 different actions 68 times. Merged at 12 different actions 12 times. Never widened. Performed 532 root evaluator evaluations with a maximum evaluation depth of 3. Performed 532 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 30 variables. [2018-12-08 17:36:28,856 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:36:28,856 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-08 17:36:28,856 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 17:36:28,856 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4740aade-a493-4198-b34c-4c4f6f881e09/bin-2019/utaipan/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 17:36:28,865 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:36:28,865 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-08 17:36:28,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:36:28,891 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 17:36:28,978 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-12-08 17:36:28,978 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 17:36:28,991 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-12-08 17:36:28,991 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 17:36:28,994 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 8 treesize of output 6 [2018-12-08 17:36:28,995 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:36:28,995 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:36:28,995 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:3 [2018-12-08 17:36:29,074 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-12-08 17:36:29,089 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-08 17:36:29,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [10, 10] total 23 [2018-12-08 17:36:29,089 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:36:29,089 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-08 17:36:29,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-08 17:36:29,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=481, Unknown=0, NotChecked=0, Total=552 [2018-12-08 17:36:29,089 INFO L87 Difference]: Start difference. First operand 522 states and 579 transitions. Second operand 11 states. [2018-12-08 17:36:29,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:36:29,344 INFO L93 Difference]: Finished difference Result 597 states and 671 transitions. [2018-12-08 17:36:29,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-08 17:36:29,344 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 74 [2018-12-08 17:36:29,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:36:29,345 INFO L225 Difference]: With dead ends: 597 [2018-12-08 17:36:29,345 INFO L226 Difference]: Without dead ends: 597 [2018-12-08 17:36:29,346 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 132 SyntacticMatches, 6 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=169, Invalid=1091, Unknown=0, NotChecked=0, Total=1260 [2018-12-08 17:36:29,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2018-12-08 17:36:29,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 557. [2018-12-08 17:36:29,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 557 states. [2018-12-08 17:36:29,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 557 states and 632 transitions. [2018-12-08 17:36:29,351 INFO L78 Accepts]: Start accepts. Automaton has 557 states and 632 transitions. Word has length 74 [2018-12-08 17:36:29,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:36:29,351 INFO L480 AbstractCegarLoop]: Abstraction has 557 states and 632 transitions. [2018-12-08 17:36:29,351 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-08 17:36:29,351 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 632 transitions. [2018-12-08 17:36:29,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-12-08 17:36:29,351 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:36:29,351 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:36:29,352 INFO L423 AbstractCegarLoop]: === Iteration 39 === [merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION]=== [2018-12-08 17:36:29,352 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:36:29,352 INFO L82 PathProgramCache]: Analyzing trace with hash -201372468, now seen corresponding path program 1 times [2018-12-08 17:36:29,352 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:36:29,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:36:29,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:36:29,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:36:29,352 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:36:29,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:36:29,552 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:36:29,552 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 17:36:29,552 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-08 17:36:29,552 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 74 with the following transitions: [2018-12-08 17:36:29,552 INFO L205 CegarAbsIntRunner]: [74], [83], [87], [94], [99], [193], [197], [204], [212], [216], [223], [231], [235], [242], [245], [253], [257], [262], [263], [268], [271], [273], [278], [280], [283], [284], [287], [292], [294], [297], [300], [307], [313], [318], [327], [330], [332], [334], [343], [344], [345], [347], [349], [351], [358], [367], [371], [378], [386], [390], [397], [405], [409], [414], [415], [418], [422], [427], [440], [448], [452], [457], [460], [461], [567], [568], [571], [572], [585], [586], [587] [2018-12-08 17:36:29,553 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-08 17:36:29,553 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-08 17:36:29,580 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-08 17:36:29,580 INFO L272 AbstractInterpreter]: Visited 71 different actions 84 times. Merged at 12 different actions 12 times. Never widened. Performed 615 root evaluator evaluations with a maximum evaluation depth of 3. Performed 615 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 36 variables. [2018-12-08 17:36:29,583 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:36:29,583 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-08 17:36:29,583 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 17:36:29,583 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4740aade-a493-4198-b34c-4c4f6f881e09/bin-2019/utaipan/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 17:36:29,590 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:36:29,591 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-08 17:36:29,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:36:29,611 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 17:36:29,615 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-08 17:36:29,616 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-08 17:36:29,616 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:36:29,617 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:36:29,621 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-08 17:36:29,622 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-08 17:36:29,622 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 17:36:29,625 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:36:29,633 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:36:29,633 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:27, output treesize:1 [2018-12-08 17:36:29,797 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 50 [2018-12-08 17:36:29,799 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 43 treesize of output 37 [2018-12-08 17:36:29,799 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 17:36:29,818 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 41 [2018-12-08 17:36:29,819 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-08 17:36:29,835 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 33 [2018-12-08 17:36:29,836 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 17:36:29,849 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-12-08 17:36:29,878 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 35 [2018-12-08 17:36:29,881 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:36:29,881 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2018-12-08 17:36:29,882 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-08 17:36:29,893 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:36:29,895 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 25 [2018-12-08 17:36:29,896 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 13 treesize of output 5 [2018-12-08 17:36:29,896 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-08 17:36:29,901 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-08 17:36:29,902 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-08 17:36:29,904 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:36:29,909 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 29 [2018-12-08 17:36:29,910 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 16 [2018-12-08 17:36:29,911 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-12-08 17:36:29,924 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 15 [2018-12-08 17:36:29,924 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 2 xjuncts. [2018-12-08 17:36:29,931 INFO L267 ElimStorePlain]: Start of recursive call 11: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:36:29,939 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:36:29,939 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 4 variables, input treesize:69, output treesize:10 [2018-12-08 17:36:29,987 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-08 17:36:29,987 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 17:36:30,654 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-08 17:36:30,678 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-08 17:36:30,678 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15, 14] total 34 [2018-12-08 17:36:30,678 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-08 17:36:30,678 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-12-08 17:36:30,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-12-08 17:36:30,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=1018, Unknown=1, NotChecked=0, Total=1122 [2018-12-08 17:36:30,679 INFO L87 Difference]: Start difference. First operand 557 states and 632 transitions. Second operand 25 states. [2018-12-08 17:36:31,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:36:31,877 INFO L93 Difference]: Finished difference Result 576 states and 650 transitions. [2018-12-08 17:36:31,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-12-08 17:36:31,878 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 73 [2018-12-08 17:36:31,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:36:31,879 INFO L225 Difference]: With dead ends: 576 [2018-12-08 17:36:31,879 INFO L226 Difference]: Without dead ends: 576 [2018-12-08 17:36:31,880 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 125 SyntacticMatches, 13 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 436 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=300, Invalid=2249, Unknown=1, NotChecked=0, Total=2550 [2018-12-08 17:36:31,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2018-12-08 17:36:31,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 561. [2018-12-08 17:36:31,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 561 states. [2018-12-08 17:36:31,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 561 states and 636 transitions. [2018-12-08 17:36:31,885 INFO L78 Accepts]: Start accepts. Automaton has 561 states and 636 transitions. Word has length 73 [2018-12-08 17:36:31,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:36:31,885 INFO L480 AbstractCegarLoop]: Abstraction has 561 states and 636 transitions. [2018-12-08 17:36:31,885 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-12-08 17:36:31,885 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 636 transitions. [2018-12-08 17:36:31,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-12-08 17:36:31,885 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:36:31,885 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:36:31,886 INFO L423 AbstractCegarLoop]: === Iteration 40 === [merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION]=== [2018-12-08 17:36:31,886 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:36:31,886 INFO L82 PathProgramCache]: Analyzing trace with hash 1953164911, now seen corresponding path program 1 times [2018-12-08 17:36:31,886 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:36:31,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:36:31,886 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:36:31,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:36:31,886 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:36:31,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:36:31,922 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-12-08 17:36:31,923 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 17:36:31,923 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-08 17:36:31,923 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 76 with the following transitions: [2018-12-08 17:36:31,923 INFO L205 CegarAbsIntRunner]: [26], [33], [35], [36], [39], [42], [43], [46], [72], [73], [74], [83], [87], [94], [99], [193], [197], [204], [212], [216], [223], [231], [235], [242], [245], [253], [257], [262], [263], [268], [271], [273], [278], [280], [283], [284], [287], [292], [294], [297], [300], [307], [313], [314], [320], [322], [460], [461], [567], [568], [569], [570], [585], [586], [587] [2018-12-08 17:36:31,924 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-08 17:36:31,924 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-08 17:36:31,955 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-08 17:36:31,955 INFO L272 AbstractInterpreter]: Visited 55 different actions 68 times. Merged at 12 different actions 12 times. Never widened. Performed 525 root evaluator evaluations with a maximum evaluation depth of 3. Performed 525 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 30 variables. [2018-12-08 17:36:31,957 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:36:31,957 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-08 17:36:31,957 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 17:36:31,957 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4740aade-a493-4198-b34c-4c4f6f881e09/bin-2019/utaipan/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 17:36:31,963 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:36:31,963 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-08 17:36:31,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:36:31,989 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 17:36:32,017 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-12-08 17:36:32,017 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 17:36:32,089 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-12-08 17:36:32,104 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-08 17:36:32,104 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [9, 11] total 15 [2018-12-08 17:36:32,104 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:36:32,105 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-08 17:36:32,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-08 17:36:32,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2018-12-08 17:36:32,105 INFO L87 Difference]: Start difference. First operand 561 states and 636 transitions. Second operand 11 states. [2018-12-08 17:36:32,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:36:32,262 INFO L93 Difference]: Finished difference Result 635 states and 722 transitions. [2018-12-08 17:36:32,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-08 17:36:32,263 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 75 [2018-12-08 17:36:32,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:36:32,264 INFO L225 Difference]: With dead ends: 635 [2018-12-08 17:36:32,264 INFO L226 Difference]: Without dead ends: 635 [2018-12-08 17:36:32,264 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 138 SyntacticMatches, 11 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=342, Unknown=0, NotChecked=0, Total=420 [2018-12-08 17:36:32,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2018-12-08 17:36:32,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 561. [2018-12-08 17:36:32,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 561 states. [2018-12-08 17:36:32,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 561 states and 635 transitions. [2018-12-08 17:36:32,270 INFO L78 Accepts]: Start accepts. Automaton has 561 states and 635 transitions. Word has length 75 [2018-12-08 17:36:32,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:36:32,271 INFO L480 AbstractCegarLoop]: Abstraction has 561 states and 635 transitions. [2018-12-08 17:36:32,271 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-08 17:36:32,271 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 635 transitions. [2018-12-08 17:36:32,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-12-08 17:36:32,271 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:36:32,271 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:36:32,271 INFO L423 AbstractCegarLoop]: === Iteration 41 === [merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION]=== [2018-12-08 17:36:32,271 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:36:32,272 INFO L82 PathProgramCache]: Analyzing trace with hash 1975653197, now seen corresponding path program 1 times [2018-12-08 17:36:32,272 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:36:32,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:36:32,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:36:32,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:36:32,272 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:36:32,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:36:32,413 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-08 17:36:32,413 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 17:36:32,413 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-08 17:36:32,413 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 76 with the following transitions: [2018-12-08 17:36:32,413 INFO L205 CegarAbsIntRunner]: [26], [35], [36], [39], [42], [43], [46], [48], [49], [53], [72], [73], [74], [83], [87], [94], [99], [193], [197], [204], [212], [216], [223], [231], [235], [242], [245], [253], [257], [262], [263], [268], [271], [273], [278], [280], [283], [284], [287], [292], [294], [297], [300], [307], [313], [320], [322], [460], [461], [567], [568], [569], [570], [585], [586], [587] [2018-12-08 17:36:32,414 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-08 17:36:32,414 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-08 17:36:32,448 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-08 17:36:32,448 INFO L272 AbstractInterpreter]: Visited 56 different actions 69 times. Merged at 12 different actions 12 times. Never widened. Performed 550 root evaluator evaluations with a maximum evaluation depth of 3. Performed 550 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 30 variables. [2018-12-08 17:36:32,450 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:36:32,450 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-08 17:36:32,450 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 17:36:32,450 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4740aade-a493-4198-b34c-4c4f6f881e09/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-12-08 17:36:32,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:36:32,460 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-08 17:36:32,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:36:32,490 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 17:36:32,529 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-08 17:36:32,530 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 10 treesize of output 9 [2018-12-08 17:36:32,530 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:36:32,531 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:36:32,535 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:36:32,535 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:14 [2018-12-08 17:36:32,615 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-08 17:36:32,615 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 17:36:32,757 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-08 17:36:32,772 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-08 17:36:32,772 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 13] total 30 [2018-12-08 17:36:32,772 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-08 17:36:32,772 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-12-08 17:36:32,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-12-08 17:36:32,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=767, Unknown=0, NotChecked=0, Total=870 [2018-12-08 17:36:32,773 INFO L87 Difference]: Start difference. First operand 561 states and 635 transitions. Second operand 22 states. [2018-12-08 17:37:09,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:37:09,477 INFO L93 Difference]: Finished difference Result 584 states and 650 transitions. [2018-12-08 17:37:09,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-08 17:37:09,477 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 75 [2018-12-08 17:37:09,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:37:09,478 INFO L225 Difference]: With dead ends: 584 [2018-12-08 17:37:09,478 INFO L226 Difference]: Without dead ends: 556 [2018-12-08 17:37:09,479 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 131 SyntacticMatches, 10 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 379 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=212, Invalid=1194, Unknown=0, NotChecked=0, Total=1406 [2018-12-08 17:37:09,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2018-12-08 17:37:09,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 525. [2018-12-08 17:37:09,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 525 states. [2018-12-08 17:37:09,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 595 transitions. [2018-12-08 17:37:09,484 INFO L78 Accepts]: Start accepts. Automaton has 525 states and 595 transitions. Word has length 75 [2018-12-08 17:37:09,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:37:09,484 INFO L480 AbstractCegarLoop]: Abstraction has 525 states and 595 transitions. [2018-12-08 17:37:09,484 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-12-08 17:37:09,484 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 595 transitions. [2018-12-08 17:37:09,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-12-08 17:37:09,485 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:37:09,485 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:37:09,485 INFO L423 AbstractCegarLoop]: === Iteration 42 === [merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION]=== [2018-12-08 17:37:09,485 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:37:09,485 INFO L82 PathProgramCache]: Analyzing trace with hash -1947580467, now seen corresponding path program 1 times [2018-12-08 17:37:09,485 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:37:09,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:37:09,486 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:37:09,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:37:09,486 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:37:09,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:37:09,682 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:37:09,682 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 17:37:09,682 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-08 17:37:09,682 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 75 with the following transitions: [2018-12-08 17:37:09,682 INFO L205 CegarAbsIntRunner]: [74], [83], [87], [94], [99], [193], [197], [204], [212], [216], [223], [231], [235], [242], [245], [253], [257], [262], [263], [268], [271], [273], [278], [280], [283], [284], [287], [292], [294], [297], [300], [307], [313], [318], [327], [330], [332], [334], [341], [343], [344], [347], [349], [351], [355], [357], [358], [367], [371], [378], [386], [390], [397], [405], [409], [414], [415], [418], [422], [427], [440], [448], [452], [457], [460], [461], [567], [568], [571], [572], [585], [586], [587] [2018-12-08 17:37:09,683 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-08 17:37:09,683 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-08 17:37:09,709 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-08 17:37:09,709 INFO L272 AbstractInterpreter]: Visited 73 different actions 86 times. Merged at 12 different actions 12 times. Never widened. Performed 619 root evaluator evaluations with a maximum evaluation depth of 3. Performed 619 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 37 variables. [2018-12-08 17:37:09,711 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:37:09,711 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-08 17:37:09,711 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 17:37:09,711 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4740aade-a493-4198-b34c-4c4f6f881e09/bin-2019/utaipan/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 17:37:09,721 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:37:09,721 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-08 17:37:09,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:37:09,743 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 17:37:09,778 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-12-08 17:37:09,780 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-12-08 17:37:09,780 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:37:09,781 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:37:09,788 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:37:09,788 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:40, output treesize:41 [2018-12-08 17:37:09,807 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 48 treesize of output 39 [2018-12-08 17:37:09,809 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:37:09,810 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 39 treesize of output 50 [2018-12-08 17:37:09,811 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:37:09,818 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:37:09,824 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-12-08 17:37:09,824 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:54, output treesize:41 [2018-12-08 17:37:09,865 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:37:09,866 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-12-08 17:37:09,867 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:37:09,868 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 21 treesize of output 33 [2018-12-08 17:37:09,868 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:37:09,871 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:37:09,877 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-12-08 17:37:09,877 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:41, output treesize:29 [2018-12-08 17:37:09,947 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:37:09,948 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 35 [2018-12-08 17:37:09,949 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 27 treesize of output 23 [2018-12-08 17:37:09,949 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:37:09,952 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:37:09,957 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-12-08 17:37:09,957 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:41, output treesize:29 [2018-12-08 17:37:10,000 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 42 treesize of output 34 [2018-12-08 17:37:10,005 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 34 treesize of output 31 [2018-12-08 17:37:10,005 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-08 17:37:10,018 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-08 17:37:10,038 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 2 xjuncts. [2018-12-08 17:37:10,038 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:51, output treesize:62 [2018-12-08 17:37:14,654 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:37:14,654 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 17:37:15,103 WARN L832 $PredicateComparison]: unable to prove that (forall ((main_~data~0.offset Int)) (or (< 0 main_~data~0.offset) (< main_~data~0.offset 0) (= (store (store |c_#valid| c_main_~data~0.base 0) (select (select |c_#memory_$Pointer$.base| c_main_~data~0.base) main_~data~0.offset) 0) |c_old(#valid)|))) is different from false [2018-12-08 17:37:15,306 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 17:37:15,307 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: This case should habe been handled by DER at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.DerPreprocessor.constructReplacement(DerPreprocessor.java:217) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.DerPreprocessor.constructReplacement(DerPreprocessor.java:209) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.DerPreprocessor.convert(DerPreprocessor.java:190) 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.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.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-12-08 17:37:15,312 INFO L168 Benchmark]: Toolchain (without parser) took 102634.48 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 407.4 MB). Free memory was 948.1 MB in the beginning and 989.8 MB in the end (delta: -41.7 MB). Peak memory consumption was 365.7 MB. Max. memory is 11.5 GB. [2018-12-08 17:37:15,313 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 17:37:15,313 INFO L168 Benchmark]: CACSL2BoogieTranslator took 285.66 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.3 MB). Free memory was 948.1 MB in the beginning and 1.1 GB in the end (delta: -182.3 MB). Peak memory consumption was 33.4 MB. Max. memory is 11.5 GB. [2018-12-08 17:37:15,313 INFO L168 Benchmark]: Boogie Procedure Inliner took 18.27 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-12-08 17:37:15,314 INFO L168 Benchmark]: Boogie Preprocessor took 26.36 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: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2018-12-08 17:37:15,314 INFO L168 Benchmark]: RCFGBuilder took 442.63 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: 76.0 MB). Peak memory consumption was 76.0 MB. Max. memory is 11.5 GB. [2018-12-08 17:37:15,314 INFO L168 Benchmark]: TraceAbstraction took 101858.83 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 261.1 MB). Free memory was 1.0 GB in the beginning and 989.8 MB in the end (delta: 57.9 MB). Peak memory consumption was 319.0 MB. Max. memory is 11.5 GB. [2018-12-08 17:37:15,316 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.19 ms. Allocated memory is still 1.0 GB. Free memory is still 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 285.66 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.3 MB). Free memory was 948.1 MB in the beginning and 1.1 GB in the end (delta: -182.3 MB). Peak memory consumption was 33.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 18.27 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 26.36 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: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 442.63 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: 76.0 MB). Peak memory consumption was 76.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 101858.83 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 261.1 MB). Free memory was 1.0 GB in the beginning and 989.8 MB in the end (delta: 57.9 MB). Peak memory consumption was 319.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: This case should habe been handled by DER de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: This case should habe been handled by DER: de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.DerPreprocessor.constructReplacement(DerPreprocessor.java:217) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.23-635dfa2 [2018-12-08 17:37:16,505 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-08 17:37:16,506 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-08 17:37:16,512 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-08 17:37:16,513 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-08 17:37:16,513 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-08 17:37:16,514 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-08 17:37:16,514 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-08 17:37:16,515 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-08 17:37:16,516 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-08 17:37:16,517 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-08 17:37:16,517 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-08 17:37:16,517 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-08 17:37:16,518 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-08 17:37:16,518 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-08 17:37:16,519 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-08 17:37:16,519 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-08 17:37:16,520 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-08 17:37:16,521 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-08 17:37:16,522 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-08 17:37:16,522 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-08 17:37:16,523 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-08 17:37:16,524 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-08 17:37:16,524 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-08 17:37:16,525 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-08 17:37:16,525 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-08 17:37:16,526 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-08 17:37:16,526 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-08 17:37:16,527 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-08 17:37:16,527 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-08 17:37:16,527 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-08 17:37:16,528 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-08 17:37:16,528 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-08 17:37:16,528 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-08 17:37:16,529 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-08 17:37:16,529 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-08 17:37:16,530 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_4740aade-a493-4198-b34c-4c4f6f881e09/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2018-12-08 17:37:16,539 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-08 17:37:16,540 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-08 17:37:16,540 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-08 17:37:16,540 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-08 17:37:16,541 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-08 17:37:16,541 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-08 17:37:16,541 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-08 17:37:16,541 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-08 17:37:16,541 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-08 17:37:16,541 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-08 17:37:16,542 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-08 17:37:16,542 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-08 17:37:16,542 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-08 17:37:16,542 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-08 17:37:16,543 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-08 17:37:16,543 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-08 17:37:16,543 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-08 17:37:16,543 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-08 17:37:16,543 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-12-08 17:37:16,543 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-12-08 17:37:16,543 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-12-08 17:37:16,544 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-08 17:37:16,544 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-12-08 17:37:16,544 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-12-08 17:37:16,544 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-08 17:37:16,544 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-08 17:37:16,544 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-08 17:37:16,544 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-08 17:37:16,545 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-08 17:37:16,545 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-08 17:37:16,545 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-08 17:37:16,545 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-08 17:37:16,545 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-08 17:37:16,545 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-12-08 17:37:16,546 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-08 17:37:16,546 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2018-12-08 17:37:16,546 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_4740aade-a493-4198-b34c-4c4f6f881e09/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 -> e6399ca05df7547b7620299987a8a06e9e2c006b [2018-12-08 17:37:16,569 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-08 17:37:16,576 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-08 17:37:16,578 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-08 17:37:16,579 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-08 17:37:16,579 INFO L276 PluginConnector]: CDTParser initialized [2018-12-08 17:37:16,579 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_4740aade-a493-4198-b34c-4c4f6f881e09/bin-2019/utaipan/../../sv-benchmarks/c/heap-manipulation/merge_sort_true-unreach-call_true-valid-memsafety.i [2018-12-08 17:37:16,613 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4740aade-a493-4198-b34c-4c4f6f881e09/bin-2019/utaipan/data/8edf95e88/cdc4f6df68314a9b802b65bc12d03ac5/FLAGcafd0fd1e [2018-12-08 17:37:16,966 INFO L307 CDTParser]: Found 1 translation units. [2018-12-08 17:37:16,966 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_4740aade-a493-4198-b34c-4c4f6f881e09/sv-benchmarks/c/heap-manipulation/merge_sort_true-unreach-call_true-valid-memsafety.i [2018-12-08 17:37:16,972 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4740aade-a493-4198-b34c-4c4f6f881e09/bin-2019/utaipan/data/8edf95e88/cdc4f6df68314a9b802b65bc12d03ac5/FLAGcafd0fd1e [2018-12-08 17:37:17,342 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_4740aade-a493-4198-b34c-4c4f6f881e09/bin-2019/utaipan/data/8edf95e88/cdc4f6df68314a9b802b65bc12d03ac5 [2018-12-08 17:37:17,344 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-08 17:37:17,345 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-08 17:37:17,345 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-08 17:37:17,345 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-08 17:37:17,347 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-08 17:37:17,347 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 05:37:17" (1/1) ... [2018-12-08 17:37:17,349 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2657aed2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:37:17, skipping insertion in model container [2018-12-08 17:37:17,350 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 05:37:17" (1/1) ... [2018-12-08 17:37:17,355 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-08 17:37:17,382 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-08 17:37:17,550 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 17:37:17,557 INFO L191 MainTranslator]: Completed pre-run [2018-12-08 17:37:17,639 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 17:37:17,671 INFO L195 MainTranslator]: Completed translation [2018-12-08 17:37:17,671 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:37:17 WrapperNode [2018-12-08 17:37:17,671 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-08 17:37:17,672 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-08 17:37:17,672 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-08 17:37:17,672 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-08 17:37:17,676 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:37:17" (1/1) ... [2018-12-08 17:37:17,686 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:37:17" (1/1) ... [2018-12-08 17:37:17,691 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-08 17:37:17,692 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-08 17:37:17,692 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-08 17:37:17,692 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-08 17:37:17,697 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:37:17" (1/1) ... [2018-12-08 17:37:17,697 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:37:17" (1/1) ... [2018-12-08 17:37:17,700 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:37:17" (1/1) ... [2018-12-08 17:37:17,700 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:37:17" (1/1) ... [2018-12-08 17:37:17,711 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:37:17" (1/1) ... [2018-12-08 17:37:17,716 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:37:17" (1/1) ... [2018-12-08 17:37:17,718 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:37:17" (1/1) ... [2018-12-08 17:37:17,720 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-08 17:37:17,720 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-08 17:37:17,721 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-08 17:37:17,721 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-08 17:37:17,721 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:37:17" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4740aade-a493-4198-b34c-4c4f6f881e09/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-08 17:37:17,753 INFO L130 BoogieDeclarations]: Found specification of procedure inspect_before [2018-12-08 17:37:17,753 INFO L138 BoogieDeclarations]: Found implementation of procedure inspect_before [2018-12-08 17:37:17,753 INFO L130 BoogieDeclarations]: Found specification of procedure inspect_after [2018-12-08 17:37:17,753 INFO L138 BoogieDeclarations]: Found implementation of procedure inspect_after [2018-12-08 17:37:17,753 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-08 17:37:17,753 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-12-08 17:37:17,753 INFO L130 BoogieDeclarations]: Found specification of procedure merge_single_node [2018-12-08 17:37:17,753 INFO L138 BoogieDeclarations]: Found implementation of procedure merge_single_node [2018-12-08 17:37:17,754 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2018-12-08 17:37:17,754 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2018-12-08 17:37:17,754 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-08 17:37:17,754 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-08 17:37:17,754 INFO L130 BoogieDeclarations]: Found specification of procedure merge_pair [2018-12-08 17:37:17,754 INFO L138 BoogieDeclarations]: Found implementation of procedure merge_pair [2018-12-08 17:37:17,754 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-08 17:37:17,754 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-08 17:37:17,754 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-08 17:37:17,754 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-08 17:37:17,754 INFO L130 BoogieDeclarations]: Found specification of procedure seq_sort_core [2018-12-08 17:37:17,754 INFO L138 BoogieDeclarations]: Found implementation of procedure seq_sort_core [2018-12-08 17:37:17,754 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-12-08 17:37:17,754 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-08 17:37:17,754 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-08 17:37:17,754 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-08 17:37:18,399 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-08 17:37:18,399 INFO L280 CfgBuilder]: Removed 33 assue(true) statements. [2018-12-08 17:37:18,400 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 05:37:18 BoogieIcfgContainer [2018-12-08 17:37:18,400 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-08 17:37:18,400 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-08 17:37:18,400 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-08 17:37:18,402 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-08 17:37:18,402 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.12 05:37:17" (1/3) ... [2018-12-08 17:37:18,403 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d6afc94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 05:37:18, skipping insertion in model container [2018-12-08 17:37:18,403 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:37:17" (2/3) ... [2018-12-08 17:37:18,403 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d6afc94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 05:37:18, skipping insertion in model container [2018-12-08 17:37:18,403 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 05:37:18" (3/3) ... [2018-12-08 17:37:18,404 INFO L112 eAbstractionObserver]: Analyzing ICFG merge_sort_true-unreach-call_true-valid-memsafety.i [2018-12-08 17:37:18,410 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-08 17:37:18,415 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 101 error locations. [2018-12-08 17:37:18,424 INFO L257 AbstractCegarLoop]: Starting to check reachability of 101 error locations. [2018-12-08 17:37:18,439 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-08 17:37:18,440 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-08 17:37:18,440 INFO L383 AbstractCegarLoop]: Hoare is false [2018-12-08 17:37:18,440 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-08 17:37:18,440 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-08 17:37:18,440 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-08 17:37:18,440 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-08 17:37:18,440 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-08 17:37:18,440 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-08 17:37:18,452 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states. [2018-12-08 17:37:18,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-08 17:37:18,458 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:37:18,458 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:37:18,460 INFO L423 AbstractCegarLoop]: === Iteration 1 === [merge_pairErr19REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION]=== [2018-12-08 17:37:18,463 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:37:18,463 INFO L82 PathProgramCache]: Analyzing trace with hash 1392922230, now seen corresponding path program 1 times [2018-12-08 17:37:18,465 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 17:37:18,466 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4740aade-a493-4198-b34c-4c4f6f881e09/bin-2019/utaipan/cvc4 Starting monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-08 17:37:18,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:37:18,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:37:18,507 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 17:37:18,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:37:18,517 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-08 17:37:18,520 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:37:18,520 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-08 17:37:18,522 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-12-08 17:37:18,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-08 17:37:18,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-08 17:37:18,532 INFO L87 Difference]: Start difference. First operand 270 states. Second operand 2 states. [2018-12-08 17:37:18,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:37:18,552 INFO L93 Difference]: Finished difference Result 268 states and 293 transitions. [2018-12-08 17:37:18,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-08 17:37:18,553 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 9 [2018-12-08 17:37:18,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:37:18,561 INFO L225 Difference]: With dead ends: 268 [2018-12-08 17:37:18,561 INFO L226 Difference]: Without dead ends: 251 [2018-12-08 17:37:18,562 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-08 17:37:18,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2018-12-08 17:37:18,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 251. [2018-12-08 17:37:18,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2018-12-08 17:37:18,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 264 transitions. [2018-12-08 17:37:18,595 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 264 transitions. Word has length 9 [2018-12-08 17:37:18,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:37:18,595 INFO L480 AbstractCegarLoop]: Abstraction has 251 states and 264 transitions. [2018-12-08 17:37:18,595 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-12-08 17:37:18,595 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 264 transitions. [2018-12-08 17:37:18,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-08 17:37:18,595 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:37:18,596 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:37:18,596 INFO L423 AbstractCegarLoop]: === Iteration 2 === [merge_pairErr19REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION]=== [2018-12-08 17:37:18,596 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:37:18,596 INFO L82 PathProgramCache]: Analyzing trace with hash 1392922292, now seen corresponding path program 1 times [2018-12-08 17:37:18,596 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 17:37:18,596 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4740aade-a493-4198-b34c-4c4f6f881e09/bin-2019/utaipan/cvc4 Starting monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-08 17:37:18,617 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:37:18,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:37:18,629 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 17:37:18,648 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-08 17:37:18,650 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 17:37:18,654 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:37:18,654 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-08 17:37:18,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:37:18,659 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-08 17:37:18,660 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:37:18,660 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-08 17:37:18,661 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 17:37:18,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 17:37:18,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 17:37:18,661 INFO L87 Difference]: Start difference. First operand 251 states and 264 transitions. Second operand 3 states. [2018-12-08 17:37:18,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:37:18,964 INFO L93 Difference]: Finished difference Result 268 states and 286 transitions. [2018-12-08 17:37:18,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 17:37:18,964 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2018-12-08 17:37:18,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:37:18,965 INFO L225 Difference]: With dead ends: 268 [2018-12-08 17:37:18,965 INFO L226 Difference]: Without dead ends: 268 [2018-12-08 17:37:18,966 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 17:37:18,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2018-12-08 17:37:18,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 249. [2018-12-08 17:37:18,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2018-12-08 17:37:18,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 262 transitions. [2018-12-08 17:37:18,975 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 262 transitions. Word has length 9 [2018-12-08 17:37:18,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:37:18,975 INFO L480 AbstractCegarLoop]: Abstraction has 249 states and 262 transitions. [2018-12-08 17:37:18,975 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 17:37:18,975 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 262 transitions. [2018-12-08 17:37:18,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-08 17:37:18,975 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:37:18,975 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:37:18,976 INFO L423 AbstractCegarLoop]: === Iteration 3 === [merge_pairErr19REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION]=== [2018-12-08 17:37:18,976 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:37:18,976 INFO L82 PathProgramCache]: Analyzing trace with hash 1392922293, now seen corresponding path program 1 times [2018-12-08 17:37:18,976 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 17:37:18,976 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4740aade-a493-4198-b34c-4c4f6f881e09/bin-2019/utaipan/cvc4 Starting monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-08 17:37:18,990 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:37:19,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:37:19,008 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 17:37:19,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 6 treesize of output 5 [2018-12-08 17:37:19,014 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 17:37:19,018 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:37:19,018 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-08 17:37:19,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:37:19,024 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-08 17:37:19,025 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:37:19,025 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-08 17:37:19,025 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 17:37:19,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 17:37:19,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 17:37:19,026 INFO L87 Difference]: Start difference. First operand 249 states and 262 transitions. Second operand 3 states. [2018-12-08 17:37:19,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:37:19,362 INFO L93 Difference]: Finished difference Result 276 states and 295 transitions. [2018-12-08 17:37:19,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 17:37:19,363 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2018-12-08 17:37:19,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:37:19,364 INFO L225 Difference]: With dead ends: 276 [2018-12-08 17:37:19,364 INFO L226 Difference]: Without dead ends: 276 [2018-12-08 17:37:19,364 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 17:37:19,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2018-12-08 17:37:19,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 247. [2018-12-08 17:37:19,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2018-12-08 17:37:19,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 260 transitions. [2018-12-08 17:37:19,371 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 260 transitions. Word has length 9 [2018-12-08 17:37:19,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:37:19,371 INFO L480 AbstractCegarLoop]: Abstraction has 247 states and 260 transitions. [2018-12-08 17:37:19,371 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 17:37:19,371 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 260 transitions. [2018-12-08 17:37:19,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-08 17:37:19,371 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:37:19,372 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:37:19,372 INFO L423 AbstractCegarLoop]: === Iteration 4 === [merge_pairErr19REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION]=== [2018-12-08 17:37:19,372 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:37:19,372 INFO L82 PathProgramCache]: Analyzing trace with hash 1392921282, now seen corresponding path program 1 times [2018-12-08 17:37:19,372 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 17:37:19,373 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4740aade-a493-4198-b34c-4c4f6f881e09/bin-2019/utaipan/cvc4 Starting monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-08 17:37:19,393 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:37:19,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:37:19,402 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 17:37:19,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:37:19,408 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-08 17:37:19,408 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:37:19,409 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-08 17:37:19,409 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 17:37:19,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 17:37:19,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 17:37:19,409 INFO L87 Difference]: Start difference. First operand 247 states and 260 transitions. Second operand 3 states. [2018-12-08 17:37:19,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:37:19,679 INFO L93 Difference]: Finished difference Result 286 states and 308 transitions. [2018-12-08 17:37:19,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 17:37:19,680 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2018-12-08 17:37:19,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:37:19,680 INFO L225 Difference]: With dead ends: 286 [2018-12-08 17:37:19,681 INFO L226 Difference]: Without dead ends: 285 [2018-12-08 17:37:19,681 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 17:37:19,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2018-12-08 17:37:19,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 249. [2018-12-08 17:37:19,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2018-12-08 17:37:19,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 263 transitions. [2018-12-08 17:37:19,690 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 263 transitions. Word has length 9 [2018-12-08 17:37:19,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:37:19,690 INFO L480 AbstractCegarLoop]: Abstraction has 249 states and 263 transitions. [2018-12-08 17:37:19,690 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 17:37:19,690 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 263 transitions. [2018-12-08 17:37:19,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-08 17:37:19,691 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:37:19,691 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:37:19,691 INFO L423 AbstractCegarLoop]: === Iteration 5 === [merge_pairErr19REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION]=== [2018-12-08 17:37:19,692 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:37:19,692 INFO L82 PathProgramCache]: Analyzing trace with hash -1964629979, now seen corresponding path program 1 times [2018-12-08 17:37:19,692 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 17:37:19,692 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4740aade-a493-4198-b34c-4c4f6f881e09/bin-2019/utaipan/cvc4 Starting monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-08 17:37:19,705 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:37:19,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:37:19,715 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 17:37:19,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:37:19,721 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-08 17:37:19,723 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:37:19,723 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 17:37:19,724 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 17:37:19,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 17:37:19,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 17:37:19,724 INFO L87 Difference]: Start difference. First operand 249 states and 263 transitions. Second operand 3 states. [2018-12-08 17:37:19,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:37:19,758 INFO L93 Difference]: Finished difference Result 263 states and 275 transitions. [2018-12-08 17:37:19,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 17:37:19,758 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-12-08 17:37:19,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:37:19,759 INFO L225 Difference]: With dead ends: 263 [2018-12-08 17:37:19,759 INFO L226 Difference]: Without dead ends: 262 [2018-12-08 17:37:19,759 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 17:37:19,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2018-12-08 17:37:19,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 248. [2018-12-08 17:37:19,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2018-12-08 17:37:19,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 261 transitions. [2018-12-08 17:37:19,762 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 261 transitions. Word has length 13 [2018-12-08 17:37:19,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:37:19,763 INFO L480 AbstractCegarLoop]: Abstraction has 248 states and 261 transitions. [2018-12-08 17:37:19,763 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 17:37:19,763 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 261 transitions. [2018-12-08 17:37:19,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-08 17:37:19,763 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:37:19,763 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:37:19,763 INFO L423 AbstractCegarLoop]: === Iteration 6 === [merge_pairErr19REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION]=== [2018-12-08 17:37:19,763 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:37:19,763 INFO L82 PathProgramCache]: Analyzing trace with hash -1248968711, now seen corresponding path program 1 times [2018-12-08 17:37:19,764 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 17:37:19,764 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4740aade-a493-4198-b34c-4c4f6f881e09/bin-2019/utaipan/cvc4 Starting monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-08 17:37:19,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:37:19,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:37:19,804 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 17:37:19,813 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 14 treesize of output 11 [2018-12-08 17:37:19,813 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 17:37:19,822 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-12-08 17:37:19,822 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:11 [2018-12-08 17:37:19,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:37:19,830 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-08 17:37:19,831 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:37:19,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 17:37:19,831 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 17:37:19,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 17:37:19,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-08 17:37:19,832 INFO L87 Difference]: Start difference. First operand 248 states and 261 transitions. Second operand 4 states. [2018-12-08 17:37:20,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:37:20,272 INFO L93 Difference]: Finished difference Result 277 states and 294 transitions. [2018-12-08 17:37:20,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 17:37:20,272 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-12-08 17:37:20,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:37:20,273 INFO L225 Difference]: With dead ends: 277 [2018-12-08 17:37:20,273 INFO L226 Difference]: Without dead ends: 277 [2018-12-08 17:37:20,273 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 10 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-12-08 17:37:20,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2018-12-08 17:37:20,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 246. [2018-12-08 17:37:20,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 246 states. [2018-12-08 17:37:20,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 259 transitions. [2018-12-08 17:37:20,278 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 259 transitions. Word has length 13 [2018-12-08 17:37:20,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:37:20,279 INFO L480 AbstractCegarLoop]: Abstraction has 246 states and 259 transitions. [2018-12-08 17:37:20,279 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 17:37:20,279 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 259 transitions. [2018-12-08 17:37:20,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-08 17:37:20,279 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:37:20,279 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:37:20,280 INFO L423 AbstractCegarLoop]: === Iteration 7 === [merge_pairErr19REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION]=== [2018-12-08 17:37:20,280 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:37:20,280 INFO L82 PathProgramCache]: Analyzing trace with hash -1248968710, now seen corresponding path program 1 times [2018-12-08 17:37:20,280 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 17:37:20,280 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4740aade-a493-4198-b34c-4c4f6f881e09/bin-2019/utaipan/cvc4 Starting monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-08 17:37:20,294 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:37:20,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:37:20,323 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 17:37:20,327 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-12-08 17:37:20,327 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 17:37:20,331 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:37:20,332 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-08 17:37:20,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:37:20,342 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-08 17:37:20,343 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:37:20,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-08 17:37:20,343 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 17:37:20,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 17:37:20,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 17:37:20,344 INFO L87 Difference]: Start difference. First operand 246 states and 259 transitions. Second operand 3 states. [2018-12-08 17:37:20,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:37:20,645 INFO L93 Difference]: Finished difference Result 274 states and 290 transitions. [2018-12-08 17:37:20,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 17:37:20,646 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-12-08 17:37:20,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:37:20,647 INFO L225 Difference]: With dead ends: 274 [2018-12-08 17:37:20,647 INFO L226 Difference]: Without dead ends: 274 [2018-12-08 17:37:20,647 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 17:37:20,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2018-12-08 17:37:20,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 244. [2018-12-08 17:37:20,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states. [2018-12-08 17:37:20,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 257 transitions. [2018-12-08 17:37:20,651 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 257 transitions. Word has length 13 [2018-12-08 17:37:20,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:37:20,651 INFO L480 AbstractCegarLoop]: Abstraction has 244 states and 257 transitions. [2018-12-08 17:37:20,651 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 17:37:20,651 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 257 transitions. [2018-12-08 17:37:20,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-08 17:37:20,651 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:37:20,651 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:37:20,652 INFO L423 AbstractCegarLoop]: === Iteration 8 === [merge_pairErr19REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION]=== [2018-12-08 17:37:20,652 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:37:20,652 INFO L82 PathProgramCache]: Analyzing trace with hash -864312570, now seen corresponding path program 1 times [2018-12-08 17:37:20,652 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 17:37:20,652 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4740aade-a493-4198-b34c-4c4f6f881e09/bin-2019/utaipan/cvc4 Starting monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-08 17:37:20,667 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:37:20,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:37:20,686 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 17:37:20,693 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:37:20,693 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-08 17:37:20,694 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:37:20,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 17:37:20,695 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 17:37:20,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 17:37:20,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 17:37:20,695 INFO L87 Difference]: Start difference. First operand 244 states and 257 transitions. Second operand 4 states. [2018-12-08 17:37:20,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:37:20,765 INFO L93 Difference]: Finished difference Result 278 states and 294 transitions. [2018-12-08 17:37:20,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 17:37:20,765 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-12-08 17:37:20,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:37:20,766 INFO L225 Difference]: With dead ends: 278 [2018-12-08 17:37:20,766 INFO L226 Difference]: Without dead ends: 278 [2018-12-08 17:37:20,766 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-08 17:37:20,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2018-12-08 17:37:20,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 244. [2018-12-08 17:37:20,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states. [2018-12-08 17:37:20,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 256 transitions. [2018-12-08 17:37:20,771 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 256 transitions. Word has length 18 [2018-12-08 17:37:20,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:37:20,771 INFO L480 AbstractCegarLoop]: Abstraction has 244 states and 256 transitions. [2018-12-08 17:37:20,771 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 17:37:20,771 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 256 transitions. [2018-12-08 17:37:20,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-08 17:37:20,771 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:37:20,771 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] [2018-12-08 17:37:20,772 INFO L423 AbstractCegarLoop]: === Iteration 9 === [merge_pairErr19REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION]=== [2018-12-08 17:37:20,772 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:37:20,772 INFO L82 PathProgramCache]: Analyzing trace with hash 497923689, now seen corresponding path program 1 times [2018-12-08 17:37:20,772 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 17:37:20,772 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4740aade-a493-4198-b34c-4c4f6f881e09/bin-2019/utaipan/cvc4 Starting monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-08 17:37:20,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:37:20,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:37:20,827 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 17:37:20,830 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-12-08 17:37:20,831 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 17:37:20,834 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:37:20,835 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-08 17:37:20,867 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:37:20,867 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-08 17:37:20,869 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:37:20,869 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 17:37:20,869 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 17:37:20,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 17:37:20,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-08 17:37:20,869 INFO L87 Difference]: Start difference. First operand 244 states and 256 transitions. Second operand 6 states. [2018-12-08 17:37:21,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:37:21,843 INFO L93 Difference]: Finished difference Result 317 states and 333 transitions. [2018-12-08 17:37:21,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 17:37:21,843 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-12-08 17:37:21,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:37:21,844 INFO L225 Difference]: With dead ends: 317 [2018-12-08 17:37:21,844 INFO L226 Difference]: Without dead ends: 317 [2018-12-08 17:37:21,844 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-08 17:37:21,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2018-12-08 17:37:21,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 274. [2018-12-08 17:37:21,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2018-12-08 17:37:21,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 301 transitions. [2018-12-08 17:37:21,848 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 301 transitions. Word has length 22 [2018-12-08 17:37:21,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:37:21,848 INFO L480 AbstractCegarLoop]: Abstraction has 274 states and 301 transitions. [2018-12-08 17:37:21,848 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 17:37:21,848 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 301 transitions. [2018-12-08 17:37:21,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-08 17:37:21,848 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:37:21,848 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] [2018-12-08 17:37:21,848 INFO L423 AbstractCegarLoop]: === Iteration 10 === [merge_pairErr19REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION]=== [2018-12-08 17:37:21,849 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:37:21,849 INFO L82 PathProgramCache]: Analyzing trace with hash 497923688, now seen corresponding path program 1 times [2018-12-08 17:37:21,849 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 17:37:21,849 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4740aade-a493-4198-b34c-4c4f6f881e09/bin-2019/utaipan/cvc4 Starting monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-08 17:37:21,863 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:37:21,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:37:21,902 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 17:37:21,912 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 14 treesize of output 11 [2018-12-08 17:37:21,913 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 17:37:21,917 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-12-08 17:37:21,917 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:11 [2018-12-08 17:37:21,944 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:37:21,944 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-08 17:37:21,946 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:37:21,946 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 17:37:21,946 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-08 17:37:21,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 17:37:21,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-08 17:37:21,946 INFO L87 Difference]: Start difference. First operand 274 states and 301 transitions. Second operand 7 states. [2018-12-08 17:37:22,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:37:22,853 INFO L93 Difference]: Finished difference Result 286 states and 306 transitions. [2018-12-08 17:37:22,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-08 17:37:22,853 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2018-12-08 17:37:22,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:37:22,854 INFO L225 Difference]: With dead ends: 286 [2018-12-08 17:37:22,854 INFO L226 Difference]: Without dead ends: 286 [2018-12-08 17:37:22,854 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-12-08 17:37:22,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2018-12-08 17:37:22,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 265. [2018-12-08 17:37:22,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2018-12-08 17:37:22,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 282 transitions. [2018-12-08 17:37:22,858 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 282 transitions. Word has length 22 [2018-12-08 17:37:22,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:37:22,859 INFO L480 AbstractCegarLoop]: Abstraction has 265 states and 282 transitions. [2018-12-08 17:37:22,859 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-08 17:37:22,859 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 282 transitions. [2018-12-08 17:37:22,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-08 17:37:22,859 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:37:22,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, 1] [2018-12-08 17:37:22,859 INFO L423 AbstractCegarLoop]: === Iteration 11 === [merge_pairErr19REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION]=== [2018-12-08 17:37:22,860 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:37:22,860 INFO L82 PathProgramCache]: Analyzing trace with hash -736522953, now seen corresponding path program 1 times [2018-12-08 17:37:22,860 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 17:37:22,860 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4740aade-a493-4198-b34c-4c4f6f881e09/bin-2019/utaipan/cvc4 Starting monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-08 17:37:22,877 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:37:22,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:37:22,939 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 17:37:22,941 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-12-08 17:37:22,941 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 17:37:22,942 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:37:22,942 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-08 17:37:22,949 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 14 treesize of output 11 [2018-12-08 17:37:22,949 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 17:37:22,954 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:37:22,954 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:14 [2018-12-08 17:37:22,967 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-12-08 17:37:22,969 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-12-08 17:37:22,969 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:37:22,972 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:37:22,982 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:37:22,982 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:22 [2018-12-08 17:37:22,996 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 25 treesize of output 20 [2018-12-08 17:37:22,998 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:37:23,000 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 27 [2018-12-08 17:37:23,001 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:37:23,006 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:37:23,014 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:37:23,014 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:22 [2018-12-08 17:37:23,057 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 19 treesize of output 15 [2018-12-08 17:37:23,058 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 15 treesize of output 7 [2018-12-08 17:37:23,059 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:37:23,060 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:37:23,063 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-12-08 17:37:23,063 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:13 [2018-12-08 17:37:23,078 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:37:23,079 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-08 17:37:23,080 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:37:23,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-08 17:37:23,081 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-08 17:37:23,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-08 17:37:23,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-12-08 17:37:23,081 INFO L87 Difference]: Start difference. First operand 265 states and 282 transitions. Second operand 9 states. [2018-12-08 17:37:24,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:37:24,530 INFO L93 Difference]: Finished difference Result 280 states and 296 transitions. [2018-12-08 17:37:24,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-08 17:37:24,530 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 33 [2018-12-08 17:37:24,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:37:24,531 INFO L225 Difference]: With dead ends: 280 [2018-12-08 17:37:24,531 INFO L226 Difference]: Without dead ends: 280 [2018-12-08 17:37:24,531 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2018-12-08 17:37:24,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2018-12-08 17:37:24,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 266. [2018-12-08 17:37:24,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2018-12-08 17:37:24,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 284 transitions. [2018-12-08 17:37:24,535 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 284 transitions. Word has length 33 [2018-12-08 17:37:24,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:37:24,535 INFO L480 AbstractCegarLoop]: Abstraction has 266 states and 284 transitions. [2018-12-08 17:37:24,535 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-08 17:37:24,535 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 284 transitions. [2018-12-08 17:37:24,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-08 17:37:24,536 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:37:24,536 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-12-08 17:37:24,536 INFO L423 AbstractCegarLoop]: === Iteration 12 === [merge_pairErr19REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION]=== [2018-12-08 17:37:24,536 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:37:24,536 INFO L82 PathProgramCache]: Analyzing trace with hash -736522952, now seen corresponding path program 1 times [2018-12-08 17:37:24,537 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 17:37:24,537 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4740aade-a493-4198-b34c-4c4f6f881e09/bin-2019/utaipan/cvc4 Starting monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-08 17:37:24,556 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:37:24,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:37:24,633 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 17:37:24,638 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-12-08 17:37:24,638 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 17:37:24,646 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-12-08 17:37:24,646 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:37:24,650 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:37:24,650 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-08 17:37:24,660 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:37:24,661 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:37:24,661 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-12-08 17:37:24,661 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 17:37:24,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 14 treesize of output 17 [2018-12-08 17:37:24,677 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:37:24,685 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:37:24,686 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:23 [2018-12-08 17:37:24,705 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-08 17:37:24,707 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 8 treesize of output 7 [2018-12-08 17:37:24,708 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:37:24,710 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:37:24,728 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-08 17:37:24,730 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-12-08 17:37:24,731 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 17:37:24,733 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:37:24,743 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:37:24,743 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:44, output treesize:37 [2018-12-08 17:37:24,766 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 26 [2018-12-08 17:37:24,772 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:37:24,775 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 26 treesize of output 35 [2018-12-08 17:37:24,775 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:37:24,788 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:37:24,819 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-12-08 17:37:24,825 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:37:24,827 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-12-08 17:37:24,828 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 17:37:24,838 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:37:24,856 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:37:24,856 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:63, output treesize:37 [2018-12-08 17:37:24,924 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 15 treesize of output 11 [2018-12-08 17:37:24,926 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-08 17:37:24,926 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:37:24,928 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:37:24,939 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 27 treesize of output 21 [2018-12-08 17:37:24,941 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 21 treesize of output 12 [2018-12-08 17:37:24,941 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 17:37:24,945 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:37:24,951 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 17:37:24,951 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:46, output treesize:20 [2018-12-08 17:37:24,978 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:37:24,978 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-08 17:37:24,980 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:37:24,980 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-08 17:37:24,980 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-08 17:37:24,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-08 17:37:24,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-12-08 17:37:24,981 INFO L87 Difference]: Start difference. First operand 266 states and 284 transitions. Second operand 9 states. [2018-12-08 17:37:26,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:37:26,916 INFO L93 Difference]: Finished difference Result 289 states and 305 transitions. [2018-12-08 17:37:26,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-08 17:37:26,916 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 33 [2018-12-08 17:37:26,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:37:26,917 INFO L225 Difference]: With dead ends: 289 [2018-12-08 17:37:26,917 INFO L226 Difference]: Without dead ends: 289 [2018-12-08 17:37:26,917 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2018-12-08 17:37:26,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2018-12-08 17:37:26,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 266. [2018-12-08 17:37:26,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2018-12-08 17:37:26,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 283 transitions. [2018-12-08 17:37:26,922 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 283 transitions. Word has length 33 [2018-12-08 17:37:26,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:37:26,922 INFO L480 AbstractCegarLoop]: Abstraction has 266 states and 283 transitions. [2018-12-08 17:37:26,922 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-08 17:37:26,922 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 283 transitions. [2018-12-08 17:37:26,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-08 17:37:26,923 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:37:26,923 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-12-08 17:37:26,923 INFO L423 AbstractCegarLoop]: === Iteration 13 === [merge_pairErr19REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION]=== [2018-12-08 17:37:26,923 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:37:26,923 INFO L82 PathProgramCache]: Analyzing trace with hash 1356967641, now seen corresponding path program 1 times [2018-12-08 17:37:26,923 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 17:37:26,923 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4740aade-a493-4198-b34c-4c4f6f881e09/bin-2019/utaipan/cvc4 Starting monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-08 17:37:26,937 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:37:26,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:37:26,995 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 17:37:27,019 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-08 17:37:27,021 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-08 17:37:27,022 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:37:27,024 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:37:27,033 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-08 17:37:27,035 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-08 17:37:27,035 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 17:37:27,037 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:37:27,042 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:37:27,042 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:30, output treesize:22 [2018-12-08 17:37:27,094 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 15 treesize of output 11 [2018-12-08 17:37:27,096 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-08 17:37:27,096 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:37:27,098 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:37:27,103 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 15 treesize of output 11 [2018-12-08 17:37:27,105 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-08 17:37:27,105 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 17:37:27,107 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:37:27,109 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:37:27,110 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:29, output treesize:7 [2018-12-08 17:37:27,128 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:37:27,129 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 17:37:27,241 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:37:27,243 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 17:37:27,243 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4740aade-a493-4198-b34c-4c4f6f881e09/bin-2019/utaipan/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 17:37:27,249 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:37:27,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:37:27,267 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 17:37:27,277 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-08 17:37:27,279 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-08 17:37:27,279 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:37:27,282 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:37:27,296 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-08 17:37:27,298 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-08 17:37:27,299 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 17:37:27,300 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:37:27,307 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:37:27,307 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:35, output treesize:22 [2018-12-08 17:37:27,311 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 19 treesize of output 15 [2018-12-08 17:37:27,314 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 15 treesize of output 3 [2018-12-08 17:37:27,314 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:37:27,319 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:37:27,327 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 19 treesize of output 15 [2018-12-08 17:37:27,329 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 15 treesize of output 3 [2018-12-08 17:37:27,329 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 17:37:27,330 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:37:27,334 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:37:27,334 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:45, output treesize:10 [2018-12-08 17:37:27,352 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:37:27,353 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 17:37:27,582 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:37:27,597 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-12-08 17:37:27,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9, 10] total 21 [2018-12-08 17:37:27,597 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-08 17:37:27,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-08 17:37:27,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2018-12-08 17:37:27,598 INFO L87 Difference]: Start difference. First operand 266 states and 283 transitions. Second operand 21 states. [2018-12-08 17:37:29,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:37:29,181 INFO L93 Difference]: Finished difference Result 319 states and 340 transitions. [2018-12-08 17:37:29,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-08 17:37:29,182 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 33 [2018-12-08 17:37:29,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:37:29,182 INFO L225 Difference]: With dead ends: 319 [2018-12-08 17:37:29,182 INFO L226 Difference]: Without dead ends: 319 [2018-12-08 17:37:29,183 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 110 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=92, Invalid=508, Unknown=0, NotChecked=0, Total=600 [2018-12-08 17:37:29,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2018-12-08 17:37:29,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 296. [2018-12-08 17:37:29,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2018-12-08 17:37:29,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 314 transitions. [2018-12-08 17:37:29,187 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 314 transitions. Word has length 33 [2018-12-08 17:37:29,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:37:29,187 INFO L480 AbstractCegarLoop]: Abstraction has 296 states and 314 transitions. [2018-12-08 17:37:29,187 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-08 17:37:29,187 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 314 transitions. [2018-12-08 17:37:29,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-08 17:37:29,188 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:37:29,188 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:37:29,188 INFO L423 AbstractCegarLoop]: === Iteration 14 === [merge_pairErr19REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION]=== [2018-12-08 17:37:29,188 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:37:29,188 INFO L82 PathProgramCache]: Analyzing trace with hash -1297908963, now seen corresponding path program 2 times [2018-12-08 17:37:29,189 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 17:37:29,189 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4740aade-a493-4198-b34c-4c4f6f881e09/bin-2019/utaipan/cvc4 Starting monitored process 16 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-08 17:37:29,202 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-12-08 17:37:29,304 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-08 17:37:29,304 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-08 17:37:29,308 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 17:37:29,311 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-12-08 17:37:29,312 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 17:37:29,313 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:37:29,313 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-08 17:37:29,321 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 14 treesize of output 11 [2018-12-08 17:37:29,321 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 17:37:29,326 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:37:29,327 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:14 [2018-12-08 17:37:29,338 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-08 17:37:29,340 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-12-08 17:37:29,340 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:37:29,342 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:37:29,349 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:37:29,349 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:22 [2018-12-08 17:37:29,369 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 25 treesize of output 20 [2018-12-08 17:37:29,373 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:37:29,374 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 27 [2018-12-08 17:37:29,375 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:37:29,382 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:37:29,393 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:37:29,394 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:22 [2018-12-08 17:37:29,444 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 19 treesize of output 15 [2018-12-08 17:37:29,446 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 15 treesize of output 7 [2018-12-08 17:37:29,446 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:37:29,448 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:37:29,451 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-12-08 17:37:29,451 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:13 [2018-12-08 17:37:29,468 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-08 17:37:29,468 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-08 17:37:29,470 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:37:29,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-08 17:37:29,470 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-08 17:37:29,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-08 17:37:29,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-12-08 17:37:29,471 INFO L87 Difference]: Start difference. First operand 296 states and 314 transitions. Second operand 9 states. [2018-12-08 17:37:30,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:37:30,691 INFO L93 Difference]: Finished difference Result 304 states and 321 transitions. [2018-12-08 17:37:30,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-08 17:37:30,691 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 42 [2018-12-08 17:37:30,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:37:30,692 INFO L225 Difference]: With dead ends: 304 [2018-12-08 17:37:30,692 INFO L226 Difference]: Without dead ends: 304 [2018-12-08 17:37:30,692 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2018-12-08 17:37:30,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2018-12-08 17:37:30,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 296. [2018-12-08 17:37:30,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2018-12-08 17:37:30,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 313 transitions. [2018-12-08 17:37:30,695 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 313 transitions. Word has length 42 [2018-12-08 17:37:30,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:37:30,695 INFO L480 AbstractCegarLoop]: Abstraction has 296 states and 313 transitions. [2018-12-08 17:37:30,695 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-08 17:37:30,695 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 313 transitions. [2018-12-08 17:37:30,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-08 17:37:30,696 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:37:30,696 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:37:30,696 INFO L423 AbstractCegarLoop]: === Iteration 15 === [merge_pairErr19REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION]=== [2018-12-08 17:37:30,696 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:37:30,696 INFO L82 PathProgramCache]: Analyzing trace with hash -1297908962, now seen corresponding path program 1 times [2018-12-08 17:37:30,696 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 17:37:30,696 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4740aade-a493-4198-b34c-4c4f6f881e09/bin-2019/utaipan/cvc4 Starting monitored process 17 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-08 17:37:30,709 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 17:37:30,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:37:30,850 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 17:37:30,853 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-12-08 17:37:30,854 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 17:37:30,861 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-12-08 17:37:30,861 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:37:30,865 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:37:30,866 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-08 17:37:30,878 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:37:30,878 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-12-08 17:37:30,879 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 17:37:30,890 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:37:30,893 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:37:30,893 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-12-08 17:37:30,893 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:37:30,901 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:37:30,902 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:23 [2018-12-08 17:37:30,921 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-08 17:37:30,923 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 8 treesize of output 7 [2018-12-08 17:37:30,923 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:37:30,926 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:37:30,944 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-08 17:37:30,946 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-12-08 17:37:30,946 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 17:37:30,948 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:37:30,960 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:37:30,961 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:44, output treesize:37 [2018-12-08 17:37:30,985 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 26 [2018-12-08 17:37:30,990 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:37:30,993 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 26 treesize of output 35 [2018-12-08 17:37:30,993 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:37:31,006 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:37:31,053 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-12-08 17:37:31,059 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:37:31,063 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-12-08 17:37:31,063 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 17:37:31,074 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:37:31,093 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:37:31,093 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:63, output treesize:37 [2018-12-08 17:37:31,160 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 15 treesize of output 11 [2018-12-08 17:37:31,162 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-08 17:37:31,162 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:37:31,164 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:37:31,173 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 27 treesize of output 21 [2018-12-08 17:37:31,175 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 21 treesize of output 12 [2018-12-08 17:37:31,176 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 17:37:31,179 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:37:31,186 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 17:37:31,186 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:46, output treesize:20 [2018-12-08 17:37:31,212 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-08 17:37:31,212 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-08 17:37:31,214 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:37:31,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-08 17:37:31,215 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-08 17:37:31,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-08 17:37:31,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-12-08 17:37:31,215 INFO L87 Difference]: Start difference. First operand 296 states and 313 transitions. Second operand 9 states. [2018-12-08 17:37:33,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:37:33,104 INFO L93 Difference]: Finished difference Result 315 states and 332 transitions. [2018-12-08 17:37:33,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-08 17:37:33,105 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 42 [2018-12-08 17:37:33,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:37:33,106 INFO L225 Difference]: With dead ends: 315 [2018-12-08 17:37:33,106 INFO L226 Difference]: Without dead ends: 315 [2018-12-08 17:37:33,106 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2018-12-08 17:37:33,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2018-12-08 17:37:33,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 296. [2018-12-08 17:37:33,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2018-12-08 17:37:33,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 312 transitions. [2018-12-08 17:37:33,109 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 312 transitions. Word has length 42 [2018-12-08 17:37:33,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:37:33,109 INFO L480 AbstractCegarLoop]: Abstraction has 296 states and 312 transitions. [2018-12-08 17:37:33,109 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-08 17:37:33,109 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 312 transitions. [2018-12-08 17:37:33,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-12-08 17:37:33,110 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:37:33,110 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:37:33,110 INFO L423 AbstractCegarLoop]: === Iteration 16 === [merge_pairErr19REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION]=== [2018-12-08 17:37:33,110 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:37:33,110 INFO L82 PathProgramCache]: Analyzing trace with hash 1468312342, now seen corresponding path program 1 times [2018-12-08 17:37:33,110 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 17:37:33,111 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4740aade-a493-4198-b34c-4c4f6f881e09/bin-2019/utaipan/cvc4 Starting monitored process 18 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-08 17:37:33,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:37:33,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:37:33,195 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 17:37:33,205 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 14 treesize of output 11 [2018-12-08 17:37:33,205 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 17:37:33,210 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-12-08 17:37:33,210 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:11 [2018-12-08 17:37:33,247 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:37:33,247 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-08 17:37:33,249 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:37:33,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 17:37:33,250 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-08 17:37:33,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 17:37:33,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-08 17:37:33,250 INFO L87 Difference]: Start difference. First operand 296 states and 312 transitions. Second operand 7 states. [2018-12-08 17:37:34,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:37:34,076 INFO L93 Difference]: Finished difference Result 321 states and 343 transitions. [2018-12-08 17:37:34,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-08 17:37:34,076 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 43 [2018-12-08 17:37:34,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:37:34,077 INFO L225 Difference]: With dead ends: 321 [2018-12-08 17:37:34,077 INFO L226 Difference]: Without dead ends: 321 [2018-12-08 17:37:34,078 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-12-08 17:37:34,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2018-12-08 17:37:34,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 296. [2018-12-08 17:37:34,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2018-12-08 17:37:34,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 314 transitions. [2018-12-08 17:37:34,081 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 314 transitions. Word has length 43 [2018-12-08 17:37:34,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:37:34,081 INFO L480 AbstractCegarLoop]: Abstraction has 296 states and 314 transitions. [2018-12-08 17:37:34,081 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-08 17:37:34,082 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 314 transitions. [2018-12-08 17:37:34,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-12-08 17:37:34,082 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:37:34,082 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:37:34,082 INFO L423 AbstractCegarLoop]: === Iteration 17 === [merge_pairErr19REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION]=== [2018-12-08 17:37:34,082 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:37:34,082 INFO L82 PathProgramCache]: Analyzing trace with hash 1468312343, now seen corresponding path program 1 times [2018-12-08 17:37:34,082 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 17:37:34,083 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4740aade-a493-4198-b34c-4c4f6f881e09/bin-2019/utaipan/cvc4 Starting monitored process 19 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-08 17:37:34,101 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:37:34,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:37:34,176 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 17:37:34,194 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-08 17:37:34,196 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-08 17:37:34,196 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:37:34,198 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:37:34,207 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-08 17:37:34,209 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-08 17:37:34,209 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 17:37:34,210 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:37:34,216 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:37:34,216 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:30, output treesize:22 [2018-12-08 17:37:34,258 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 15 treesize of output 11 [2018-12-08 17:37:34,260 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-08 17:37:34,260 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:37:34,262 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:37:34,267 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 15 treesize of output 11 [2018-12-08 17:37:34,268 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-08 17:37:34,268 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 17:37:34,269 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:37:34,272 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:37:34,272 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:29, output treesize:7 [2018-12-08 17:37:34,283 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:37:34,283 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 17:37:34,330 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:37:34,332 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 17:37:34,332 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4740aade-a493-4198-b34c-4c4f6f881e09/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-12-08 17:37:34,338 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:37:34,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:37:34,358 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 17:37:34,360 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-12-08 17:37:34,361 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 17:37:34,363 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:37:34,364 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-08 17:37:34,469 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:37:34,469 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-08 17:37:34,484 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-08 17:37:34,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [8, 6] total 15 [2018-12-08 17:37:34,485 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-08 17:37:34,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-08 17:37:34,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=173, Unknown=1, NotChecked=0, Total=210 [2018-12-08 17:37:34,485 INFO L87 Difference]: Start difference. First operand 296 states and 314 transitions. Second operand 15 states. [2018-12-08 17:37:36,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:37:36,618 INFO L93 Difference]: Finished difference Result 458 states and 487 transitions. [2018-12-08 17:37:36,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-08 17:37:36,619 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 43 [2018-12-08 17:37:36,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:37:36,620 INFO L225 Difference]: With dead ends: 458 [2018-12-08 17:37:36,620 INFO L226 Difference]: Without dead ends: 458 [2018-12-08 17:37:36,620 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 114 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=406, Unknown=1, NotChecked=0, Total=506 [2018-12-08 17:37:36,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2018-12-08 17:37:36,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 368. [2018-12-08 17:37:36,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 368 states. [2018-12-08 17:37:36,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 423 transitions. [2018-12-08 17:37:36,625 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 423 transitions. Word has length 43 [2018-12-08 17:37:36,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:37:36,625 INFO L480 AbstractCegarLoop]: Abstraction has 368 states and 423 transitions. [2018-12-08 17:37:36,625 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-08 17:37:36,625 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 423 transitions. [2018-12-08 17:37:36,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-08 17:37:36,626 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:37:36,626 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:37:36,626 INFO L423 AbstractCegarLoop]: === Iteration 18 === [merge_pairErr19REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION]=== [2018-12-08 17:37:36,626 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:37:36,626 INFO L82 PathProgramCache]: Analyzing trace with hash -1772210085, now seen corresponding path program 1 times [2018-12-08 17:37:36,626 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 17:37:36,626 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4740aade-a493-4198-b34c-4c4f6f881e09/bin-2019/utaipan/cvc4 Starting monitored process 21 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-08 17:37:36,646 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:37:36,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:37:36,716 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 17:37:36,721 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 14 treesize of output 11 [2018-12-08 17:37:36,721 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 17:37:36,725 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-12-08 17:37:36,725 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:11 [2018-12-08 17:37:36,755 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:37:36,756 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-08 17:37:36,757 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:37:36,757 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 17:37:36,757 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-08 17:37:36,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 17:37:36,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-08 17:37:36,758 INFO L87 Difference]: Start difference. First operand 368 states and 423 transitions. Second operand 7 states. [2018-12-08 17:37:37,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:37:37,555 INFO L93 Difference]: Finished difference Result 374 states and 424 transitions. [2018-12-08 17:37:37,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-08 17:37:37,556 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 44 [2018-12-08 17:37:37,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:37:37,557 INFO L225 Difference]: With dead ends: 374 [2018-12-08 17:37:37,557 INFO L226 Difference]: Without dead ends: 374 [2018-12-08 17:37:37,557 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-12-08 17:37:37,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2018-12-08 17:37:37,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 365. [2018-12-08 17:37:37,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 365 states. [2018-12-08 17:37:37,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 414 transitions. [2018-12-08 17:37:37,562 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 414 transitions. Word has length 44 [2018-12-08 17:37:37,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:37:37,562 INFO L480 AbstractCegarLoop]: Abstraction has 365 states and 414 transitions. [2018-12-08 17:37:37,562 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-08 17:37:37,562 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 414 transitions. [2018-12-08 17:37:37,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-08 17:37:37,563 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:37:37,563 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:37:37,563 INFO L423 AbstractCegarLoop]: === Iteration 19 === [merge_pairErr19REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION]=== [2018-12-08 17:37:37,563 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:37:37,564 INFO L82 PathProgramCache]: Analyzing trace with hash -1772210084, now seen corresponding path program 1 times [2018-12-08 17:37:37,564 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 17:37:37,564 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4740aade-a493-4198-b34c-4c4f6f881e09/bin-2019/utaipan/cvc4 Starting monitored process 22 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-08 17:37:37,578 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:37:37,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:37:37,654 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 17:37:37,656 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-12-08 17:37:37,656 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 17:37:37,662 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:37:37,662 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-08 17:37:37,700 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:37:37,700 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-08 17:37:37,702 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:37:37,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 17:37:37,703 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-08 17:37:37,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 17:37:37,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-08 17:37:37,703 INFO L87 Difference]: Start difference. First operand 365 states and 414 transitions. Second operand 7 states. [2018-12-08 17:37:38,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:37:38,588 INFO L93 Difference]: Finished difference Result 443 states and 477 transitions. [2018-12-08 17:37:38,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-08 17:37:38,588 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 44 [2018-12-08 17:37:38,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:37:38,589 INFO L225 Difference]: With dead ends: 443 [2018-12-08 17:37:38,589 INFO L226 Difference]: Without dead ends: 443 [2018-12-08 17:37:38,590 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-12-08 17:37:38,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2018-12-08 17:37:38,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 342. [2018-12-08 17:37:38,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 342 states. [2018-12-08 17:37:38,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 377 transitions. [2018-12-08 17:37:38,593 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 377 transitions. Word has length 44 [2018-12-08 17:37:38,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:37:38,594 INFO L480 AbstractCegarLoop]: Abstraction has 342 states and 377 transitions. [2018-12-08 17:37:38,594 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-08 17:37:38,594 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 377 transitions. [2018-12-08 17:37:38,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-08 17:37:38,594 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:37:38,594 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:37:38,594 INFO L423 AbstractCegarLoop]: === Iteration 20 === [merge_pairErr19REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION]=== [2018-12-08 17:37:38,594 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:37:38,594 INFO L82 PathProgramCache]: Analyzing trace with hash -1731821315, now seen corresponding path program 1 times [2018-12-08 17:37:38,594 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 17:37:38,595 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4740aade-a493-4198-b34c-4c4f6f881e09/bin-2019/utaipan/cvc4 Starting monitored process 23 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-08 17:37:38,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:37:38,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:37:38,767 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 17:37:38,770 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-12-08 17:37:38,770 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 17:37:38,776 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-12-08 17:37:38,776 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:37:38,780 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:37:38,780 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-08 17:37:38,796 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:37:38,797 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:37:38,797 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-12-08 17:37:38,798 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 17:37:38,807 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-12-08 17:37:38,807 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:37:38,816 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-12-08 17:37:38,816 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:18 [2018-12-08 17:37:38,834 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 17 treesize of output 20 [2018-12-08 17:37:38,835 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 17:37:38,844 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-12-08 17:37:38,844 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:26 [2018-12-08 17:37:38,870 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-08 17:37:38,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 10 treesize of output 9 [2018-12-08 17:37:38,873 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:37:38,876 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:37:38,897 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-08 17:37:38,899 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 10 treesize of output 9 [2018-12-08 17:37:38,899 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 17:37:38,901 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:37:38,915 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 17:37:38,915 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:51, output treesize:46 [2018-12-08 17:37:39,072 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 15 treesize of output 11 [2018-12-08 17:37:39,075 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-08 17:37:39,075 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:37:39,078 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:37:39,092 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 27 treesize of output 21 [2018-12-08 17:37:39,094 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 21 treesize of output 12 [2018-12-08 17:37:39,094 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 17:37:39,098 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:37:39,107 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-08 17:37:39,107 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:51, output treesize:25 [2018-12-08 17:37:39,186 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:37:39,186 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 17:37:40,269 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:37:40,271 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 17:37:40,271 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4740aade-a493-4198-b34c-4c4f6f881e09/bin-2019/utaipan/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 17:37:40,277 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:37:40,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:37:40,316 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 17:37:40,319 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-12-08 17:37:40,319 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 17:37:40,323 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:37:40,323 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-08 17:37:40,378 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-12-08 17:37:40,378 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 17:37:40,393 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-12-08 17:37:40,393 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:37:40,400 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:37:40,400 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:24 [2018-12-08 17:37:40,463 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:37:40,464 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:37:40,467 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:37:40,468 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 18 treesize of output 9 [2018-12-08 17:37:40,468 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 17:37:40,488 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 19 treesize of output 26 [2018-12-08 17:37:40,489 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:37:40,501 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-12-08 17:37:40,501 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2018-12-08 17:37:40,574 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-12-08 17:37:40,576 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 8 treesize of output 7 [2018-12-08 17:37:40,576 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:37:40,579 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:37:40,596 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-12-08 17:37:40,597 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:46, output treesize:40 [2018-12-08 17:37:40,676 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-08 17:37:40,679 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-08 17:37:40,679 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:37:40,683 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:37:40,713 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 26 [2018-12-08 17:37:40,716 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:37:40,718 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 35 [2018-12-08 17:37:40,718 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 17:37:40,726 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:37:40,752 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 17:37:40,752 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:68, output treesize:58 [2018-12-08 17:37:41,285 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 15 treesize of output 11 [2018-12-08 17:37:41,287 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-08 17:37:41,287 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:37:41,290 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:37:41,311 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 44 treesize of output 34 [2018-12-08 17:37:41,315 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2018-12-08 17:37:41,316 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 17:37:41,325 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 17:37:41,335 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-08 17:37:41,335 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:63, output treesize:29 [2018-12-08 17:37:41,369 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:37:41,369 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 17:37:43,011 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:37:43,012 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:37:43,012 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 24 treesize of output 15 [2018-12-08 17:37:43,012 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 17:37:43,060 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:37:43,060 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:37:43,061 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 30 treesize of output 21 [2018-12-08 17:37:43,061 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:37:43,101 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:37:43,102 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:37:43,102 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 13 [2018-12-08 17:37:43,102 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-08 17:37:43,141 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-12-08 17:37:43,141 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 7 variables, input treesize:77, output treesize:39 [2018-12-08 17:37:43,405 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:37:43,420 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-12-08 17:37:43,420 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 13, 15] total 38 [2018-12-08 17:37:43,420 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-12-08 17:37:43,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-12-08 17:37:43,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=1312, Unknown=0, NotChecked=0, Total=1482 [2018-12-08 17:37:43,421 INFO L87 Difference]: Start difference. First operand 342 states and 377 transitions. Second operand 39 states. [2018-12-08 17:37:45,357 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 63 [2018-12-08 17:37:45,620 WARN L180 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 73 [2018-12-08 17:37:46,527 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 58 [2018-12-08 17:37:47,801 WARN L180 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 63 [2018-12-08 17:37:51,010 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 44 [2018-12-08 17:37:52,471 WARN L180 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 58 [2018-12-08 17:37:54,794 WARN L180 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 32 [2018-12-08 17:37:56,000 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 58 [2018-12-08 17:37:56,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:37:56,111 INFO L93 Difference]: Finished difference Result 411 states and 448 transitions. [2018-12-08 17:37:56,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-08 17:37:56,111 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 47 [2018-12-08 17:37:56,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:37:56,112 INFO L225 Difference]: With dead ends: 411 [2018-12-08 17:37:56,112 INFO L226 Difference]: Without dead ends: 411 [2018-12-08 17:37:56,113 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 145 SyntacticMatches, 5 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 794 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=440, Invalid=2530, Unknown=0, NotChecked=0, Total=2970 [2018-12-08 17:37:56,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2018-12-08 17:37:56,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 360. [2018-12-08 17:37:56,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 360 states. [2018-12-08 17:37:56,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 397 transitions. [2018-12-08 17:37:56,119 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 397 transitions. Word has length 47 [2018-12-08 17:37:56,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:37:56,119 INFO L480 AbstractCegarLoop]: Abstraction has 360 states and 397 transitions. [2018-12-08 17:37:56,119 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-12-08 17:37:56,119 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 397 transitions. [2018-12-08 17:37:56,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-08 17:37:56,120 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:37:56,120 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:37:56,120 INFO L423 AbstractCegarLoop]: === Iteration 21 === [merge_pairErr19REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION]=== [2018-12-08 17:37:56,120 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:37:56,120 INFO L82 PathProgramCache]: Analyzing trace with hash -1731821316, now seen corresponding path program 1 times [2018-12-08 17:37:56,121 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 17:37:56,121 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4740aade-a493-4198-b34c-4c4f6f881e09/bin-2019/utaipan/cvc4 Starting monitored process 25 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-08 17:37:56,135 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:37:56,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:37:56,246 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 17:37:56,253 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 14 treesize of output 11 [2018-12-08 17:37:56,253 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 17:37:56,258 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-12-08 17:37:56,258 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:11 [2018-12-08 17:37:56,268 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:37:56,269 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:37:56,269 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-12-08 17:37:56,270 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 17:37:56,274 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-12-08 17:37:56,275 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:16 [2018-12-08 17:37:56,292 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:37:56,292 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-12-08 17:37:56,292 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 17:37:56,300 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-12-08 17:37:56,300 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:23 [2018-12-08 17:37:56,319 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-08 17:37:56,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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-08 17:37:56,321 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:37:56,323 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:37:56,333 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-12-08 17:37:56,333 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:40, output treesize:39 [2018-12-08 17:37:56,432 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 27 treesize of output 21 [2018-12-08 17:37:56,434 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 21 treesize of output 12 [2018-12-08 17:37:56,434 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:37:56,439 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:37:56,445 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-08 17:37:56,445 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:39, output treesize:24 [2018-12-08 17:37:56,500 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:37:56,500 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 17:37:56,742 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:37:56,744 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 17:37:56,745 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4740aade-a493-4198-b34c-4c4f6f881e09/bin-2019/utaipan/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 17:37:56,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:37:56,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:37:56,788 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 17:37:56,793 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-12-08 17:37:56,793 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 17:37:56,803 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:37:56,803 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-08 17:37:56,838 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-12-08 17:37:56,838 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 17:37:56,843 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:37:56,843 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-12-08 17:37:56,898 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-08 17:37:56,899 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-08 17:37:56,899 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:37:56,902 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:37:56,910 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:37:56,910 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:22 [2018-12-08 17:37:57,115 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 19 treesize of output 15 [2018-12-08 17:37:57,116 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 15 treesize of output 7 [2018-12-08 17:37:57,117 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:37:57,118 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:37:57,122 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-12-08 17:37:57,123 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:13 [2018-12-08 17:37:57,148 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:37:57,149 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 17:37:57,395 WARN L288 Elim1Store]: Array PQE input equivalent to true [2018-12-08 17:37:57,395 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 17:37:57,396 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:37:57,396 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:1 [2018-12-08 17:37:57,400 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:37:57,416 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-12-08 17:37:57,416 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 11, 14] total 34 [2018-12-08 17:37:57,416 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-12-08 17:37:57,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-12-08 17:37:57,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=1019, Unknown=0, NotChecked=0, Total=1190 [2018-12-08 17:37:57,416 INFO L87 Difference]: Start difference. First operand 360 states and 397 transitions. Second operand 35 states. [2018-12-08 17:38:02,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:38:02,416 INFO L93 Difference]: Finished difference Result 389 states and 427 transitions. [2018-12-08 17:38:02,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-08 17:38:02,417 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 47 [2018-12-08 17:38:02,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:38:02,417 INFO L225 Difference]: With dead ends: 389 [2018-12-08 17:38:02,417 INFO L226 Difference]: Without dead ends: 389 [2018-12-08 17:38:02,418 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 146 SyntacticMatches, 9 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 692 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=301, Invalid=1505, Unknown=0, NotChecked=0, Total=1806 [2018-12-08 17:38:02,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2018-12-08 17:38:02,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 360. [2018-12-08 17:38:02,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 360 states. [2018-12-08 17:38:02,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 396 transitions. [2018-12-08 17:38:02,423 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 396 transitions. Word has length 47 [2018-12-08 17:38:02,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:38:02,423 INFO L480 AbstractCegarLoop]: Abstraction has 360 states and 396 transitions. [2018-12-08 17:38:02,423 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-12-08 17:38:02,423 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 396 transitions. [2018-12-08 17:38:02,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-08 17:38:02,424 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:38:02,424 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:38:02,424 INFO L423 AbstractCegarLoop]: === Iteration 22 === [merge_pairErr19REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION]=== [2018-12-08 17:38:02,424 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:38:02,425 INFO L82 PathProgramCache]: Analyzing trace with hash -470259369, now seen corresponding path program 1 times [2018-12-08 17:38:02,425 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 17:38:02,425 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4740aade-a493-4198-b34c-4c4f6f881e09/bin-2019/utaipan/cvc4 Starting monitored process 27 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-08 17:38:02,445 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:38:02,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:38:02,537 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 17:38:02,549 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-08 17:38:02,551 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-08 17:38:02,551 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:38:02,553 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:38:02,560 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:38:02,560 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:3 [2018-12-08 17:38:02,627 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 17 treesize of output 13 [2018-12-08 17:38:02,628 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 13 treesize of output 5 [2018-12-08 17:38:02,628 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:38:02,629 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:38:02,630 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:38:02,631 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-12-08 17:38:02,656 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:38:02,656 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-08 17:38:02,658 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:38:02,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-08 17:38:02,658 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-08 17:38:02,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-08 17:38:02,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2018-12-08 17:38:02,658 INFO L87 Difference]: Start difference. First operand 360 states and 396 transitions. Second operand 12 states. [2018-12-08 17:38:04,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:38:04,078 INFO L93 Difference]: Finished difference Result 399 states and 437 transitions. [2018-12-08 17:38:04,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-08 17:38:04,079 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 53 [2018-12-08 17:38:04,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:38:04,079 INFO L225 Difference]: With dead ends: 399 [2018-12-08 17:38:04,079 INFO L226 Difference]: Without dead ends: 399 [2018-12-08 17:38:04,080 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=317, Unknown=0, NotChecked=0, Total=380 [2018-12-08 17:38:04,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2018-12-08 17:38:04,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 387. [2018-12-08 17:38:04,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2018-12-08 17:38:04,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 428 transitions. [2018-12-08 17:38:04,084 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 428 transitions. Word has length 53 [2018-12-08 17:38:04,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:38:04,084 INFO L480 AbstractCegarLoop]: Abstraction has 387 states and 428 transitions. [2018-12-08 17:38:04,084 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-08 17:38:04,084 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 428 transitions. [2018-12-08 17:38:04,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-08 17:38:04,084 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:38:04,084 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:38:04,085 INFO L423 AbstractCegarLoop]: === Iteration 23 === [merge_pairErr19REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION]=== [2018-12-08 17:38:04,085 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:38:04,085 INFO L82 PathProgramCache]: Analyzing trace with hash -470259368, now seen corresponding path program 1 times [2018-12-08 17:38:04,085 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 17:38:04,085 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4740aade-a493-4198-b34c-4c4f6f881e09/bin-2019/utaipan/cvc4 Starting monitored process 28 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-08 17:38:04,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:38:04,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:38:04,238 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 17:38:04,247 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-08 17:38:04,249 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-08 17:38:04,249 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:38:04,252 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:38:04,267 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-08 17:38:04,269 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-08 17:38:04,269 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 17:38:04,271 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:38:04,278 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:38:04,278 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:30, output treesize:3 [2018-12-08 17:38:04,492 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 43 treesize of output 33 [2018-12-08 17:38:04,494 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 33 treesize of output 20 [2018-12-08 17:38:04,494 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:38:04,504 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:38:04,515 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 19 treesize of output 15 [2018-12-08 17:38:04,517 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 15 treesize of output 7 [2018-12-08 17:38:04,517 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 17:38:04,520 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:38:04,527 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:38:04,527 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:16 [2018-12-08 17:38:04,620 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:38:04,620 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-08 17:38:04,622 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:38:04,622 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-08 17:38:04,622 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-08 17:38:04,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-08 17:38:04,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2018-12-08 17:38:04,623 INFO L87 Difference]: Start difference. First operand 387 states and 428 transitions. Second operand 12 states. [2018-12-08 17:38:07,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:38:07,793 INFO L93 Difference]: Finished difference Result 406 states and 442 transitions. [2018-12-08 17:38:07,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-08 17:38:07,793 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 53 [2018-12-08 17:38:07,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:38:07,794 INFO L225 Difference]: With dead ends: 406 [2018-12-08 17:38:07,794 INFO L226 Difference]: Without dead ends: 406 [2018-12-08 17:38:07,795 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=63, Invalid=317, Unknown=0, NotChecked=0, Total=380 [2018-12-08 17:38:07,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2018-12-08 17:38:07,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 385. [2018-12-08 17:38:07,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2018-12-08 17:38:07,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 421 transitions. [2018-12-08 17:38:07,799 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 421 transitions. Word has length 53 [2018-12-08 17:38:07,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:38:07,799 INFO L480 AbstractCegarLoop]: Abstraction has 385 states and 421 transitions. [2018-12-08 17:38:07,799 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-08 17:38:07,799 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 421 transitions. [2018-12-08 17:38:07,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-08 17:38:07,800 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:38:07,800 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:38:07,800 INFO L423 AbstractCegarLoop]: === Iteration 24 === [merge_pairErr19REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION]=== [2018-12-08 17:38:07,800 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:38:07,800 INFO L82 PathProgramCache]: Analyzing trace with hash -770742778, now seen corresponding path program 1 times [2018-12-08 17:38:07,801 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 17:38:07,801 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4740aade-a493-4198-b34c-4c4f6f881e09/bin-2019/utaipan/cvc4 Starting monitored process 29 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-08 17:38:07,814 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:38:07,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:38:07,853 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 17:38:07,892 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-08 17:38:07,892 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-08 17:38:07,894 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:38:07,894 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 17:38:07,894 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 17:38:07,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 17:38:07,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-08 17:38:07,894 INFO L87 Difference]: Start difference. First operand 385 states and 421 transitions. Second operand 6 states. [2018-12-08 17:38:08,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:38:08,168 INFO L93 Difference]: Finished difference Result 433 states and 469 transitions. [2018-12-08 17:38:08,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 17:38:08,168 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2018-12-08 17:38:08,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:38:08,169 INFO L225 Difference]: With dead ends: 433 [2018-12-08 17:38:08,169 INFO L226 Difference]: Without dead ends: 430 [2018-12-08 17:38:08,169 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-08 17:38:08,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2018-12-08 17:38:08,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 378. [2018-12-08 17:38:08,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2018-12-08 17:38:08,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 407 transitions. [2018-12-08 17:38:08,173 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 407 transitions. Word has length 56 [2018-12-08 17:38:08,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:38:08,173 INFO L480 AbstractCegarLoop]: Abstraction has 378 states and 407 transitions. [2018-12-08 17:38:08,173 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 17:38:08,174 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 407 transitions. [2018-12-08 17:38:08,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-08 17:38:08,174 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:38:08,174 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:38:08,175 INFO L423 AbstractCegarLoop]: === Iteration 25 === [merge_pairErr19REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION]=== [2018-12-08 17:38:08,175 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:38:08,175 INFO L82 PathProgramCache]: Analyzing trace with hash -748252506, now seen corresponding path program 1 times [2018-12-08 17:38:08,175 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 17:38:08,175 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4740aade-a493-4198-b34c-4c4f6f881e09/bin-2019/utaipan/cvc4 Starting monitored process 30 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-08 17:38:08,188 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:38:08,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:38:08,302 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 17:38:08,317 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-08 17:38:08,319 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 10 treesize of output 9 [2018-12-08 17:38:08,319 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:38:08,321 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:38:08,332 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:38:08,332 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:14 [2018-12-08 17:38:08,448 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:38:08,448 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 17:38:08,630 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:38:08,632 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 17:38:08,632 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4740aade-a493-4198-b34c-4c4f6f881e09/bin-2019/utaipan/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 17:38:08,639 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:38:08,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:38:08,670 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 17:38:08,678 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-08 17:38:08,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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-08 17:38:08,681 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:38:08,683 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:38:08,692 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:38:08,693 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:14 [2018-12-08 17:38:08,830 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:38:08,831 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 17:38:09,223 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:38:09,238 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-12-08 17:38:09,238 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 12, 11] total 26 [2018-12-08 17:38:09,238 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-12-08 17:38:09,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-12-08 17:38:09,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=550, Unknown=0, NotChecked=0, Total=650 [2018-12-08 17:38:09,239 INFO L87 Difference]: Start difference. First operand 378 states and 407 transitions. Second operand 26 states. [2018-12-08 17:38:39,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:38:39,370 INFO L93 Difference]: Finished difference Result 420 states and 446 transitions. [2018-12-08 17:38:39,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-08 17:38:39,371 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 56 [2018-12-08 17:38:39,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:38:39,371 INFO L225 Difference]: With dead ends: 420 [2018-12-08 17:38:39,371 INFO L226 Difference]: Without dead ends: 406 [2018-12-08 17:38:39,372 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 198 SyntacticMatches, 3 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 269 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=216, Invalid=1044, Unknown=0, NotChecked=0, Total=1260 [2018-12-08 17:38:39,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2018-12-08 17:38:39,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 362. [2018-12-08 17:38:39,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 362 states. [2018-12-08 17:38:39,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 389 transitions. [2018-12-08 17:38:39,375 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 389 transitions. Word has length 56 [2018-12-08 17:38:39,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:38:39,375 INFO L480 AbstractCegarLoop]: Abstraction has 362 states and 389 transitions. [2018-12-08 17:38:39,375 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-12-08 17:38:39,375 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 389 transitions. [2018-12-08 17:38:39,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-12-08 17:38:39,375 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:38:39,375 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:38:39,376 INFO L423 AbstractCegarLoop]: === Iteration 26 === [merge_pairErr19REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION]=== [2018-12-08 17:38:39,376 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:38:39,376 INFO L82 PathProgramCache]: Analyzing trace with hash -182425299, now seen corresponding path program 1 times [2018-12-08 17:38:39,376 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 17:38:39,376 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4740aade-a493-4198-b34c-4c4f6f881e09/bin-2019/utaipan/cvc4 Starting monitored process 32 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-08 17:38:39,391 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:38:39,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:38:39,491 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 17:38:39,500 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-08 17:38:39,502 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-08 17:38:39,502 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:38:39,504 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:38:39,517 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-08 17:38:39,519 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-08 17:38:39,519 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 17:38:39,521 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:38:39,528 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:38:39,528 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:30, output treesize:3 [2018-12-08 17:38:39,751 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 53 [2018-12-08 17:38:39,753 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 41 [2018-12-08 17:38:39,753 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 17:38:39,780 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 34 [2018-12-08 17:38:39,780 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-08 17:38:39,807 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 41 treesize of output 29 [2018-12-08 17:38:39,807 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 17:38:39,825 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-12-08 17:38:39,852 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2018-12-08 17:38:39,855 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 20 treesize of output 13 [2018-12-08 17:38:39,855 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-08 17:38:39,868 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 13 treesize of output 11 [2018-12-08 17:38:39,869 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-08 17:38:39,878 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:38:39,881 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2018-12-08 17:38:39,883 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-08 17:38:39,883 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-08 17:38:39,890 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 6 treesize of output 4 [2018-12-08 17:38:39,890 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-08 17:38:39,892 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:38:39,895 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:38:39,895 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 3 variables, input treesize:61, output treesize:7 [2018-12-08 17:38:39,919 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:38:39,920 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-08 17:38:39,922 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:38:39,922 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-12-08 17:38:39,922 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-08 17:38:39,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-08 17:38:39,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=151, Unknown=5, NotChecked=0, Total=182 [2018-12-08 17:38:39,922 INFO L87 Difference]: Start difference. First operand 362 states and 389 transitions. Second operand 14 states. [2018-12-08 17:38:42,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:38:42,111 INFO L93 Difference]: Finished difference Result 376 states and 400 transitions. [2018-12-08 17:38:42,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-08 17:38:42,111 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 57 [2018-12-08 17:38:42,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:38:42,112 INFO L225 Difference]: With dead ends: 376 [2018-12-08 17:38:42,112 INFO L226 Difference]: Without dead ends: 376 [2018-12-08 17:38:42,113 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=74, Invalid=423, Unknown=9, NotChecked=0, Total=506 [2018-12-08 17:38:42,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2018-12-08 17:38:42,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 359. [2018-12-08 17:38:42,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 359 states. [2018-12-08 17:38:42,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 383 transitions. [2018-12-08 17:38:42,117 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 383 transitions. Word has length 57 [2018-12-08 17:38:42,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:38:42,118 INFO L480 AbstractCegarLoop]: Abstraction has 359 states and 383 transitions. [2018-12-08 17:38:42,118 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-08 17:38:42,118 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 383 transitions. [2018-12-08 17:38:42,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-08 17:38:42,118 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:38:42,118 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:38:42,119 INFO L423 AbstractCegarLoop]: === Iteration 27 === [merge_pairErr19REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION]=== [2018-12-08 17:38:42,119 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:38:42,119 INFO L82 PathProgramCache]: Analyzing trace with hash -1724768733, now seen corresponding path program 1 times [2018-12-08 17:38:42,119 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 17:38:42,119 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4740aade-a493-4198-b34c-4c4f6f881e09/bin-2019/utaipan/cvc4 Starting monitored process 33 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-08 17:38:42,133 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:38:42,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:38:42,344 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 17:38:42,346 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-12-08 17:38:42,346 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 17:38:42,347 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:38:42,347 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-08 17:38:42,352 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:38:42,353 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:38:42,354 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 19 treesize of output 23 [2018-12-08 17:38:42,354 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 17:38:42,361 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:38:42,361 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:19 [2018-12-08 17:38:42,373 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-08 17:38:42,375 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 8 treesize of output 7 [2018-12-08 17:38:42,375 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:38:42,377 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:38:42,386 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:38:42,386 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:29 [2018-12-08 17:38:42,400 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 32 treesize of output 25 [2018-12-08 17:38:42,403 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:38:42,405 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 25 treesize of output 34 [2018-12-08 17:38:42,405 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:38:42,413 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:38:42,423 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:38:42,423 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:42, output treesize:29 [2018-12-08 17:38:42,439 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:38:42,441 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:38:42,441 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:38:42,442 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 58 [2018-12-08 17:38:42,442 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 17:38:42,454 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:38:42,455 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:46 [2018-12-08 17:38:42,484 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 40 [2018-12-08 17:38:42,488 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-12-08 17:38:42,488 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:38:42,498 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:38:42,512 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:38:42,513 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:59, output treesize:55 [2018-12-08 17:38:42,551 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 53 [2018-12-08 17:38:42,556 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:38:42,559 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 22 treesize of output 14 [2018-12-08 17:38:42,559 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:38:42,569 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:38:42,584 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-12-08 17:38:42,584 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:74, output treesize:55 [2018-12-08 17:38:42,625 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:38:42,626 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2018-12-08 17:38:42,626 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 17:38:42,650 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-12-08 17:38:42,651 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:68, output treesize:62 [2018-12-08 17:38:42,714 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:38:42,757 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 46 treesize of output 80 [2018-12-08 17:38:42,763 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 62 [2018-12-08 17:38:42,763 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:38:42,935 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 36 [2018-12-08 17:38:42,935 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 17:38:43,178 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:38:43,187 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 56 [2018-12-08 17:38:43,188 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-12-08 17:38:43,285 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: 1 dim-0 vars, and 4 xjuncts. [2018-12-08 17:38:43,383 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 4 xjuncts. [2018-12-08 17:38:43,383 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:79, output treesize:302 [2018-12-08 17:38:43,646 WARN L180 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 61 [2018-12-08 17:38:43,664 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 82 [2018-12-08 17:38:43,668 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:38:43,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, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 54 [2018-12-08 17:38:43,669 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:38:43,701 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:38:44,041 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 104 [2018-12-08 17:38:44,044 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-08 17:38:44,044 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 17:38:44,091 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:38:44,096 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 83 [2018-12-08 17:38:44,099 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-08 17:38:44,099 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-08 17:38:44,122 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:38:44,131 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 75 [2018-12-08 17:38:44,135 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-08 17:38:44,135 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-08 17:38:44,170 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:38:44,448 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:38:44,456 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:38:44,467 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:38:44,490 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 103 treesize of output 131 [2018-12-08 17:38:44,508 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:38:44,531 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 119 treesize of output 146 [2018-12-08 17:38:44,532 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-08 17:38:44,762 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:38:44,763 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:38:44,765 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:38:44,767 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:38:44,777 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 80 treesize of output 119 [2018-12-08 17:38:44,778 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 2 xjuncts. [2018-12-08 17:38:44,919 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-08 17:38:45,171 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:38:45,174 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:38:45,184 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:38:45,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, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 90 [2018-12-08 17:38:45,198 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:38:45,288 INFO L478 Elim1Store]: Elim1 applied some 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 52 [2018-12-08 17:38:45,288 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-08 17:38:45,326 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:38:45,444 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-2 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2018-12-08 17:38:45,445 INFO L202 ElimStorePlain]: Needed 14 recursive calls to eliminate 8 variables, input treesize:276, output treesize:302 [2018-12-08 17:38:45,638 WARN L180 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2018-12-08 17:38:45,826 WARN L180 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2018-12-08 17:38:46,017 WARN L180 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2018-12-08 17:38:46,218 WARN L180 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2018-12-08 17:38:46,245 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 92 treesize of output 88 [2018-12-08 17:38:46,251 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-08 17:38:46,251 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:38:46,269 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:38:46,395 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 123 treesize of output 119 [2018-12-08 17:38:46,398 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-08 17:38:46,398 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 17:38:46,427 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:38:46,564 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 83 [2018-12-08 17:38:46,567 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-08 17:38:46,567 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-08 17:38:46,599 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:38:46,716 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 3 dim-2 vars, End of recursive call: 6 dim-0 vars, and 3 xjuncts. [2018-12-08 17:38:46,717 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 9 variables, input treesize:303, output treesize:270 [2018-12-08 17:38:47,325 WARN L180 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 72 [2018-12-08 17:38:47,341 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:38:47,347 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:38:47,356 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 124 treesize of output 104 [2018-12-08 17:38:47,386 INFO L478 Elim1Store]: Elim1 applied some 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 92 treesize of output 94 [2018-12-08 17:38:47,387 INFO L267 ElimStorePlain]: Start of recursive call 3: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 4 xjuncts. [2018-12-08 17:38:47,485 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 56 [2018-12-08 17:38:47,486 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-08 17:38:47,564 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 56 treesize of output 51 [2018-12-08 17:38:47,564 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 17:38:47,624 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 80 treesize of output 64 [2018-12-08 17:38:47,624 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-08 17:38:47,682 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 64 treesize of output 61 [2018-12-08 17:38:47,684 INFO L267 ElimStorePlain]: Start of recursive call 7: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-12-08 17:38:47,773 INFO L267 ElimStorePlain]: Start of recursive call 2: 5 dim-1 vars, End of recursive call: 6 dim-0 vars, and 4 xjuncts. [2018-12-08 17:38:47,948 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:38:47,949 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:38:47,950 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 72 [2018-12-08 17:38:47,971 INFO L478 Elim1Store]: Elim1 applied some 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 40 [2018-12-08 17:38:47,972 INFO L267 ElimStorePlain]: Start of recursive call 9: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 4 xjuncts. [2018-12-08 17:38:48,003 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 27 [2018-12-08 17:38:48,004 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 17:38:48,014 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 17:38:48,127 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 12 dim-0 vars, and 5 xjuncts. [2018-12-08 17:38:48,127 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:218, output treesize:219 [2018-12-08 17:38:48,276 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:38:48,276 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 17:38:49,603 WARN L180 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 46 [2018-12-08 17:38:49,605 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 17:38:49,625 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 17:38:49,626 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 17:38:49,646 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 17:38:49,647 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 17:38:49,674 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 17:38:49,788 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 3 xjuncts. [2018-12-08 17:38:49,788 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 2 variables, input treesize:70, output treesize:189 [2018-12-08 17:38:55,890 WARN L180 SmtUtils]: Spent 3.40 s on a formula simplification that was a NOOP. DAG size: 71 [2018-12-08 17:39:02,807 WARN L180 SmtUtils]: Spent 4.23 s on a formula simplification that was a NOOP. DAG size: 78 [2018-12-08 17:39:15,927 WARN L180 SmtUtils]: Spent 6.36 s on a formula simplification that was a NOOP. DAG size: 93 [2018-12-08 17:39:23,678 WARN L180 SmtUtils]: Spent 7.23 s on a formula simplification that was a NOOP. DAG size: 94 [2018-12-08 17:39:53,573 WARN L180 SmtUtils]: Spent 13.83 s on a formula simplification that was a NOOP. DAG size: 105 [2018-12-08 17:39:55,161 WARN L180 SmtUtils]: Spent 1.59 s on a formula simplification. DAG size of input: 167 DAG size of output: 108 [2018-12-08 17:39:55,171 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 115 treesize of output 99 [2018-12-08 17:39:55,271 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 86 treesize of output 83 [2018-12-08 17:39:55,277 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:39:55,280 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 79 treesize of output 79 [2018-12-08 17:39:55,280 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-08 17:39:55,308 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:39:55,312 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 71 treesize of output 71 [2018-12-08 17:39:55,317 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:39:55,320 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 55 [2018-12-08 17:39:55,320 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-08 17:39:55,347 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:39:55,350 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 34 treesize of output 37 [2018-12-08 17:39:55,354 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:39:55,357 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 24 [2018-12-08 17:39:55,357 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-08 17:39:55,375 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:39:55,459 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 53 [2018-12-08 17:39:55,462 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:39:55,463 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:39:55,466 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:39:55,479 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 70 [2018-12-08 17:39:55,580 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 47 [2018-12-08 17:39:55,584 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:39:55,585 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:39:55,587 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:39:55,595 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 1 case distinctions, treesize of input 45 treesize of output 40 [2018-12-08 17:39:55,595 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 2 xjuncts. [2018-12-08 17:39:55,651 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:39:55,651 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:39:55,652 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:39:55,652 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:39:55,653 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 39 [2018-12-08 17:39:55,653 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-12-08 17:39:55,682 INFO L267 ElimStorePlain]: Start of recursive call 10: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-08 17:39:55,705 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-08 17:39:55,708 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 78 treesize of output 70 [2018-12-08 17:39:55,712 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:39:55,763 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 4 case distinctions, treesize of input 66 treesize of output 83 [2018-12-08 17:39:55,766 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-12-08 17:39:55,766 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-08 17:39:55,917 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:39:55,920 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 58 treesize of output 63 [2018-12-08 17:39:55,926 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:39:55,927 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:39:55,933 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:39:55,955 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 52 treesize of output 78 [2018-12-08 17:39:56,124 WARN L180 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 55 [2018-12-08 17:39:56,128 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:39:56,129 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:39:56,132 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:39:56,133 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 50 [2018-12-08 17:39:56,133 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-12-08 17:39:56,191 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:39:56,192 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:39:56,195 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:39:56,196 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:39:56,200 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:39:56,216 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:39:56,227 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 68 [2018-12-08 17:39:56,228 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 2 xjuncts. [2018-12-08 17:39:56,329 INFO L267 ElimStorePlain]: Start of recursive call 17: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-08 17:39:56,347 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:39:56,425 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:39:56,426 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:39:56,608 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 6 case distinctions, treesize of input 66 treesize of output 90 [2018-12-08 17:39:56,621 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:39:56,622 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:39:56,622 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:39:56,623 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:39:56,623 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:39:56,623 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:39:56,627 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:39:56,627 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:39:56,651 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:39:56,652 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 127 [2018-12-08 17:39:56,953 WARN L180 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 40 [2018-12-08 17:39:56,956 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:39:56,957 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:39:56,958 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:39:56,958 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:39:56,983 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:39:56,988 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 66 [2018-12-08 17:39:56,989 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-12-08 17:39:57,018 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:39:57,122 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:39:57,123 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:39:57,123 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:39:57,124 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:39:57,125 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:39:57,126 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 96 [2018-12-08 17:39:57,186 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:39:57,186 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:39:57,187 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:39:57,187 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:39:57,188 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 40 [2018-12-08 17:39:57,188 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-12-08 17:39:57,210 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:39:57,378 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:39:57,392 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:39:57,392 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:39:57,392 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:39:57,397 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:39:57,397 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:39:57,404 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:39:57,571 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 7 case distinctions, treesize of input 64 treesize of output 106 [2018-12-08 17:39:57,856 WARN L180 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 79 [2018-12-08 17:39:57,860 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:39:57,863 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:39:57,863 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:39:57,865 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:39:57,867 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 58 [2018-12-08 17:39:57,867 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-12-08 17:39:57,987 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:39:57,987 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:39:57,988 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:39:57,988 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:39:57,988 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:39:57,989 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:39:57,994 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:39:57,996 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:39:57,997 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 59 [2018-12-08 17:39:57,997 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-12-08 17:39:58,088 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:39:58,091 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:39:58,102 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:39:58,102 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:39:58,103 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:39:58,107 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:39:58,112 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:39:58,141 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 55 treesize of output 86 [2018-12-08 17:39:58,142 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 16 xjuncts. [2018-12-08 17:39:58,307 INFO L267 ElimStorePlain]: Start of recursive call 25: 3 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-12-08 17:39:58,385 INFO L267 ElimStorePlain]: Start of recursive call 20: 4 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-08 17:39:58,531 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:39:58,532 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:39:58,533 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:39:58,536 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:39:58,538 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 0 case distinctions, treesize of input 64 treesize of output 78 [2018-12-08 17:39:58,541 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:39:58,542 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:39:58,542 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:39:58,542 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:39:58,543 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 74 [2018-12-08 17:39:58,622 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:39:58,624 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:39:58,624 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 44 [2018-12-08 17:39:58,624 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-12-08 17:39:58,639 INFO L267 ElimStorePlain]: Start of recursive call 30: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:39:58,654 INFO L267 ElimStorePlain]: Start of recursive call 29: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:39:58,773 INFO L267 ElimStorePlain]: Start of recursive call 14: 4 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-12-08 17:39:58,876 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-12-08 17:39:58,880 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 101 treesize of output 91 [2018-12-08 17:39:58,884 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:39:58,884 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:39:58,887 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:39:58,897 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:39:58,904 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:39:58,944 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 87 treesize of output 143 [2018-12-08 17:39:59,350 WARN L180 SmtUtils]: Spent 404.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 108 [2018-12-08 17:39:59,359 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:39:59,363 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 81 treesize of output 86 [2018-12-08 17:39:59,368 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:39:59,369 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:39:59,375 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:39:59,398 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 52 treesize of output 78 [2018-12-08 17:39:59,576 WARN L180 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 56 [2018-12-08 17:39:59,581 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:39:59,582 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:39:59,586 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:39:59,602 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:39:59,610 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 74 [2018-12-08 17:39:59,611 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 2 xjuncts. [2018-12-08 17:39:59,739 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:39:59,739 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:39:59,740 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:39:59,742 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:39:59,744 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:39:59,744 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 49 [2018-12-08 17:39:59,745 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2018-12-08 17:39:59,782 INFO L267 ElimStorePlain]: Start of recursive call 35: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-08 17:39:59,822 INFO L267 ElimStorePlain]: Start of recursive call 34: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:39:59,979 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:39:59,980 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:39:59,980 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:39:59,981 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:39:59,986 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 39 [2018-12-08 17:39:59,986 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2018-12-08 17:40:00,098 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:40:00,098 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:40:00,100 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:40:00,103 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:40:00,106 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 0 case distinctions, treesize of input 101 treesize of output 111 [2018-12-08 17:40:00,110 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:40:00,110 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:40:00,110 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:40:00,111 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:40:00,111 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 72 [2018-12-08 17:40:00,188 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:40:00,189 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:40:00,190 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 44 [2018-12-08 17:40:00,190 INFO L267 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 1 xjuncts. [2018-12-08 17:40:00,208 INFO L267 ElimStorePlain]: Start of recursive call 40: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:40:00,237 INFO L267 ElimStorePlain]: Start of recursive call 39: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:40:00,348 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:40:00,349 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:40:00,349 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:40:00,349 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:40:00,354 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 61 [2018-12-08 17:40:00,354 INFO L267 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 1 xjuncts. [2018-12-08 17:40:00,471 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:40:00,472 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:40:00,765 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 6 case distinctions, treesize of input 103 treesize of output 127 [2018-12-08 17:40:00,770 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:40:00,786 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:40:00,786 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:40:00,786 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:40:00,792 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:40:00,793 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:40:00,800 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:40:00,954 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 7 case distinctions, treesize of input 111 treesize of output 167 [2018-12-08 17:40:01,384 WARN L180 SmtUtils]: Spent 427.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 91 [2018-12-08 17:40:01,388 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:40:01,388 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:40:01,389 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:40:01,389 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:40:01,390 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:40:01,392 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:40:01,400 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 109 [2018-12-08 17:40:01,400 INFO L267 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 1 xjuncts. [2018-12-08 17:40:01,551 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:40:01,552 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:40:01,555 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:40:01,555 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:40:01,555 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:40:01,556 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:40:01,558 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:40:01,560 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 98 [2018-12-08 17:40:01,560 INFO L267 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 1 xjuncts. [2018-12-08 17:40:01,682 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:40:01,682 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:40:01,692 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:40:01,692 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:40:01,699 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:40:01,699 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:40:01,705 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:40:01,746 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 93 treesize of output 146 [2018-12-08 17:40:01,748 INFO L267 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 16 xjuncts. [2018-12-08 17:40:01,996 INFO L267 ElimStorePlain]: Start of recursive call 44: 3 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-12-08 17:40:02,424 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:40:02,425 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:40:02,425 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:40:02,427 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:40:02,427 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:40:02,428 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 118 [2018-12-08 17:40:02,522 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:40:02,522 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:40:02,522 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:40:02,523 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:40:02,523 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:40:02,524 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:40:02,525 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:40:02,525 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 74 [2018-12-08 17:40:02,526 INFO L267 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 1 xjuncts. [2018-12-08 17:40:02,564 INFO L267 ElimStorePlain]: Start of recursive call 48: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:40:02,709 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:40:02,710 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:40:02,710 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:40:02,710 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:40:02,711 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:40:02,711 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:40:02,730 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:40:02,731 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:40:02,762 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:40:02,763 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 161 [2018-12-08 17:40:02,930 WARN L180 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 51 [2018-12-08 17:40:02,935 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:40:02,935 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:40:02,936 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:40:02,936 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:40:03,136 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:40:03,142 INFO L303 Elim1Store]: Index analysis took 211 ms [2018-12-08 17:40:03,143 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 84 [2018-12-08 17:40:03,144 INFO L267 ElimStorePlain]: Start of recursive call 51: End of recursive call: and 1 xjuncts. [2018-12-08 17:40:03,191 INFO L267 ElimStorePlain]: Start of recursive call 50: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:40:03,295 INFO L267 ElimStorePlain]: Start of recursive call 43: 4 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-08 17:40:03,443 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:40:03,443 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:40:03,444 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:40:03,446 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:40:03,447 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:40:03,447 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 46 [2018-12-08 17:40:03,447 INFO L267 ElimStorePlain]: Start of recursive call 52: End of recursive call: and 1 xjuncts. [2018-12-08 17:40:03,451 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:40:03,452 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:40:03,452 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:40:03,455 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:40:03,455 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:40:03,456 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 57 [2018-12-08 17:40:03,456 INFO L267 ElimStorePlain]: Start of recursive call 53: End of recursive call: and 1 xjuncts. [2018-12-08 17:40:03,564 INFO L267 ElimStorePlain]: Start of recursive call 33: 6 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-12-08 17:40:03,673 INFO L267 ElimStorePlain]: Start of recursive call 32: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-12-08 17:40:03,878 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 6 xjuncts. [2018-12-08 17:40:05,157 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 153 treesize of output 141 [2018-12-08 17:40:05,748 WARN L180 SmtUtils]: Spent 587.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 126 [2018-12-08 17:40:05,753 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 88 treesize of output 91 [2018-12-08 17:40:05,757 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:40:05,760 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 24 [2018-12-08 17:40:05,761 INFO L267 ElimStorePlain]: Start of recursive call 56: End of recursive call: and 1 xjuncts. [2018-12-08 17:40:05,796 INFO L267 ElimStorePlain]: Start of recursive call 55: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:40:05,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 110 [2018-12-08 17:40:05,804 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:40:05,808 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 24 [2018-12-08 17:40:05,808 INFO L267 ElimStorePlain]: Start of recursive call 58: End of recursive call: and 1 xjuncts. [2018-12-08 17:40:05,850 INFO L267 ElimStorePlain]: Start of recursive call 57: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:40:05,854 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 81 treesize of output 84 [2018-12-08 17:40:05,858 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:40:05,861 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 24 [2018-12-08 17:40:05,861 INFO L267 ElimStorePlain]: Start of recursive call 60: End of recursive call: and 1 xjuncts. [2018-12-08 17:40:05,893 INFO L267 ElimStorePlain]: Start of recursive call 59: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:40:06,347 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 107 treesize of output 104 [2018-12-08 17:40:06,357 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:40:06,363 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 65 treesize of output 65 [2018-12-08 17:40:06,363 INFO L267 ElimStorePlain]: Start of recursive call 62: End of recursive call: and 1 xjuncts. [2018-12-08 17:40:06,408 INFO L267 ElimStorePlain]: Start of recursive call 61: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:40:06,785 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 89 [2018-12-08 17:40:06,795 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:40:06,868 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 4 case distinctions, treesize of input 52 treesize of output 69 [2018-12-08 17:40:07,327 WARN L180 SmtUtils]: Spent 456.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 69 [2018-12-08 17:40:07,331 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:40:07,335 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 36 treesize of output 29 [2018-12-08 17:40:07,335 INFO L267 ElimStorePlain]: Start of recursive call 65: End of recursive call: and 1 xjuncts. [2018-12-08 17:40:07,463 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:40:07,464 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:40:07,465 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:40:07,469 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 46 treesize of output 35 [2018-12-08 17:40:07,469 INFO L267 ElimStorePlain]: Start of recursive call 66: End of recursive call: and 1 xjuncts. [2018-12-08 17:40:07,475 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:40:07,483 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 50 treesize of output 32 [2018-12-08 17:40:07,483 INFO L267 ElimStorePlain]: Start of recursive call 67: End of recursive call: and 1 xjuncts. [2018-12-08 17:40:07,563 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:40:07,566 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 34 treesize of output 23 [2018-12-08 17:40:07,566 INFO L267 ElimStorePlain]: Start of recursive call 68: End of recursive call: and 1 xjuncts. [2018-12-08 17:40:07,619 INFO L267 ElimStorePlain]: Start of recursive call 64: 3 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-12-08 17:40:07,719 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 21 treesize of output 25 [2018-12-08 17:40:07,741 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-12-08 17:40:07,741 INFO L267 ElimStorePlain]: Start of recursive call 70: End of recursive call: and 1 xjuncts. [2018-12-08 17:40:07,747 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:40:07,747 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:40:07,748 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2018-12-08 17:40:07,748 INFO L267 ElimStorePlain]: Start of recursive call 71: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 17:40:07,769 INFO L267 ElimStorePlain]: Start of recursive call 69: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 17:40:07,860 INFO L267 ElimStorePlain]: Start of recursive call 63: 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2018-12-08 17:40:08,463 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 115 treesize of output 105 [2018-12-08 17:40:08,468 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:40:08,472 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:40:08,476 INFO L478 Elim1Store]: Elim1 applied some 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 0 case distinctions, treesize of input 68 treesize of output 69 [2018-12-08 17:40:08,483 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:40:08,488 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 0 case distinctions, treesize of input 64 treesize of output 59 [2018-12-08 17:40:08,496 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:40:08,544 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 4 case distinctions, treesize of input 54 treesize of output 71 [2018-12-08 17:40:08,950 WARN L180 SmtUtils]: Spent 404.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 69 [2018-12-08 17:40:08,956 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:40:08,958 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 34 treesize of output 23 [2018-12-08 17:40:08,959 INFO L267 ElimStorePlain]: Start of recursive call 76: End of recursive call: and 1 xjuncts. [2018-12-08 17:40:09,110 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:40:09,113 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 38 treesize of output 31 [2018-12-08 17:40:09,114 INFO L267 ElimStorePlain]: Start of recursive call 77: End of recursive call: and 1 xjuncts. [2018-12-08 17:40:09,240 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:40:09,249 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 50 treesize of output 32 [2018-12-08 17:40:09,249 INFO L267 ElimStorePlain]: Start of recursive call 78: End of recursive call: and 1 xjuncts. [2018-12-08 17:40:09,256 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:40:09,257 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:40:09,258 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:40:09,262 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 46 treesize of output 35 [2018-12-08 17:40:09,262 INFO L267 ElimStorePlain]: Start of recursive call 79: End of recursive call: and 1 xjuncts. [2018-12-08 17:40:09,326 INFO L267 ElimStorePlain]: Start of recursive call 75: 3 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-12-08 17:40:09,395 INFO L267 ElimStorePlain]: Start of recursive call 74: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-12-08 17:40:09,465 INFO L267 ElimStorePlain]: Start of recursive call 73: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-12-08 17:40:09,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2018-12-08 17:40:09,597 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:40:09,597 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:40:09,598 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2018-12-08 17:40:09,598 INFO L267 ElimStorePlain]: Start of recursive call 81: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 17:40:09,600 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-12-08 17:40:09,600 INFO L267 ElimStorePlain]: Start of recursive call 82: End of recursive call: and 1 xjuncts. [2018-12-08 17:40:09,616 INFO L267 ElimStorePlain]: Start of recursive call 80: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 17:40:09,711 INFO L267 ElimStorePlain]: Start of recursive call 72: 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2018-12-08 17:40:09,725 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 75 [2018-12-08 17:40:09,729 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2018-12-08 17:40:09,751 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:40:09,751 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:40:09,752 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2018-12-08 17:40:09,752 INFO L267 ElimStorePlain]: Start of recursive call 85: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 17:40:09,756 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-08 17:40:09,756 INFO L267 ElimStorePlain]: Start of recursive call 86: End of recursive call: and 1 xjuncts. [2018-12-08 17:40:09,779 INFO L267 ElimStorePlain]: Start of recursive call 84: 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-12-08 17:40:09,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 27 [2018-12-08 17:40:09,843 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 20 treesize of output 11 [2018-12-08 17:40:09,843 INFO L267 ElimStorePlain]: Start of recursive call 88: End of recursive call: and 1 xjuncts. [2018-12-08 17:40:09,849 INFO L267 ElimStorePlain]: Start of recursive call 87: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:40:09,900 INFO L267 ElimStorePlain]: Start of recursive call 83: 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-12-08 17:40:09,907 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 84 [2018-12-08 17:40:09,915 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 51 treesize of output 57 [2018-12-08 17:40:09,935 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:40:09,937 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-12-08 17:40:09,941 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:40:09,949 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:40:09,977 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 1 new quantified variables, introduced 4 case distinctions, treesize of input 34 treesize of output 57 [2018-12-08 17:40:10,194 WARN L180 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 68 [2018-12-08 17:40:10,201 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:40:10,202 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:40:10,204 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:40:10,205 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:40:10,212 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 48 treesize of output 51 [2018-12-08 17:40:10,212 INFO L267 ElimStorePlain]: Start of recursive call 93: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-08 17:40:10,215 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:40:10,215 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:40:10,216 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 37 treesize of output 28 [2018-12-08 17:40:10,216 INFO L267 ElimStorePlain]: Start of recursive call 94: End of recursive call: and 1 xjuncts. [2018-12-08 17:40:10,221 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:40:10,221 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:40:10,224 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:40:10,224 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:40:10,229 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 41 [2018-12-08 17:40:10,229 INFO L267 ElimStorePlain]: Start of recursive call 95: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-08 17:40:10,445 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:40:10,446 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:40:10,446 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:40:10,450 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:40:10,453 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 35 [2018-12-08 17:40:10,453 INFO L267 ElimStorePlain]: Start of recursive call 96: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 17:40:10,457 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:40:10,459 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 36 treesize of output 27 [2018-12-08 17:40:10,459 INFO L267 ElimStorePlain]: Start of recursive call 97: End of recursive call: and 1 xjuncts. [2018-12-08 17:40:10,638 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:40:10,640 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:40:10,644 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:40:10,650 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 1 case distinctions, treesize of input 38 treesize of output 39 [2018-12-08 17:40:10,650 INFO L267 ElimStorePlain]: Start of recursive call 98: End of recursive call: and 2 xjuncts. [2018-12-08 17:40:10,661 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:40:10,661 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:40:10,664 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:40:10,669 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:40:10,674 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:40:10,697 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 62 [2018-12-08 17:40:10,698 INFO L267 ElimStorePlain]: Start of recursive call 99: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 7 xjuncts. [2018-12-08 17:40:10,895 INFO L267 ElimStorePlain]: Start of recursive call 92: 3 dim-1 vars, End of recursive call: 5 dim-0 vars, and 9 xjuncts. [2018-12-08 17:40:11,052 INFO L267 ElimStorePlain]: Start of recursive call 91: 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 8 xjuncts. [2018-12-08 17:40:11,219 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 20 treesize of output 11 [2018-12-08 17:40:11,219 INFO L267 ElimStorePlain]: Start of recursive call 100: End of recursive call: and 1 xjuncts. [2018-12-08 17:40:11,370 INFO L267 ElimStorePlain]: Start of recursive call 90: 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 8 xjuncts. [2018-12-08 17:40:11,581 INFO L267 ElimStorePlain]: Start of recursive call 89: 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 8 xjuncts. [2018-12-08 17:40:12,759 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 82 [2018-12-08 17:40:12,763 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:40:12,765 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 36 treesize of output 21 [2018-12-08 17:40:12,765 INFO L267 ElimStorePlain]: Start of recursive call 102: End of recursive call: and 1 xjuncts. [2018-12-08 17:40:12,790 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 27 treesize of output 31 [2018-12-08 17:40:12,792 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:40:12,795 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-12-08 17:40:12,798 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:40:12,806 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:40:12,832 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 1 new quantified variables, introduced 4 case distinctions, treesize of input 34 treesize of output 57 [2018-12-08 17:40:13,033 WARN L180 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 66 [2018-12-08 17:40:13,036 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:40:13,037 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:40:13,037 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:40:13,040 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:40:13,042 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 38 [2018-12-08 17:40:13,042 INFO L267 ElimStorePlain]: Start of recursive call 106: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 17:40:13,045 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:40:13,047 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 39 treesize of output 30 [2018-12-08 17:40:13,048 INFO L267 ElimStorePlain]: Start of recursive call 107: End of recursive call: and 1 xjuncts. [2018-12-08 17:40:13,052 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:40:13,053 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:40:13,055 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:40:13,064 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 1 case distinctions, treesize of input 48 treesize of output 53 [2018-12-08 17:40:13,064 INFO L267 ElimStorePlain]: Start of recursive call 108: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-08 17:40:13,252 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:40:13,253 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:40:13,254 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:40:13,262 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:40:13,264 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:40:13,291 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 60 [2018-12-08 17:40:13,292 INFO L267 ElimStorePlain]: Start of recursive call 109: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 6 xjuncts. [2018-12-08 17:40:13,297 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:40:13,297 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:40:13,302 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:40:13,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, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 39 [2018-12-08 17:40:13,312 INFO L267 ElimStorePlain]: Start of recursive call 110: End of recursive call: and 2 xjuncts. [2018-12-08 17:40:13,558 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:40:13,559 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:40:13,559 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 30 treesize of output 24 [2018-12-08 17:40:13,559 INFO L267 ElimStorePlain]: Start of recursive call 111: End of recursive call: and 1 xjuncts. [2018-12-08 17:40:13,564 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:40:13,564 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:40:13,566 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:40:13,567 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:40:13,572 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 39 [2018-12-08 17:40:13,573 INFO L267 ElimStorePlain]: Start of recursive call 112: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-08 17:40:13,731 INFO L267 ElimStorePlain]: Start of recursive call 105: 3 dim-1 vars, End of recursive call: 5 dim-0 vars, and 9 xjuncts. [2018-12-08 17:40:13,893 INFO L267 ElimStorePlain]: Start of recursive call 104: 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 9 xjuncts. [2018-12-08 17:40:14,046 INFO L267 ElimStorePlain]: Start of recursive call 103: 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 9 xjuncts. [2018-12-08 17:40:14,221 INFO L267 ElimStorePlain]: Start of recursive call 101: 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 9 xjuncts. [2018-12-08 17:40:14,230 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 75 [2018-12-08 17:40:14,236 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:40:14,239 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 36 treesize of output 21 [2018-12-08 17:40:14,240 INFO L267 ElimStorePlain]: Start of recursive call 114: End of recursive call: and 1 xjuncts. [2018-12-08 17:40:14,267 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2018-12-08 17:40:14,292 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:40:14,292 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:40:14,293 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2018-12-08 17:40:14,293 INFO L267 ElimStorePlain]: Start of recursive call 116: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 17:40:14,297 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-08 17:40:14,297 INFO L267 ElimStorePlain]: Start of recursive call 117: End of recursive call: and 1 xjuncts. [2018-12-08 17:40:14,319 INFO L267 ElimStorePlain]: Start of recursive call 115: 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-12-08 17:40:14,399 INFO L267 ElimStorePlain]: Start of recursive call 113: 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-12-08 17:40:15,821 INFO L267 ElimStorePlain]: Start of recursive call 54: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: 22 dim-0 vars, and 26 xjuncts. [2018-12-08 17:40:18,752 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 108 treesize of output 92 [2018-12-08 17:40:18,841 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 28 treesize of output 31 [2018-12-08 17:40:18,846 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:40:18,849 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 24 [2018-12-08 17:40:18,849 INFO L267 ElimStorePlain]: Start of recursive call 120: End of recursive call: and 1 xjuncts. [2018-12-08 17:40:18,863 INFO L267 ElimStorePlain]: Start of recursive call 119: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:40:18,867 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 72 treesize of output 69 [2018-12-08 17:40:18,871 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:40:18,874 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 65 treesize of output 65 [2018-12-08 17:40:18,874 INFO L267 ElimStorePlain]: Start of recursive call 122: End of recursive call: and 1 xjuncts. [2018-12-08 17:40:18,900 INFO L267 ElimStorePlain]: Start of recursive call 121: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:40:18,904 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 57 treesize of output 57 [2018-12-08 17:40:18,908 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:40:18,912 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 44 treesize of output 47 [2018-12-08 17:40:18,912 INFO L267 ElimStorePlain]: Start of recursive call 124: End of recursive call: and 1 xjuncts. [2018-12-08 17:40:18,937 INFO L267 ElimStorePlain]: Start of recursive call 123: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:40:19,036 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 64 treesize of output 56 [2018-12-08 17:40:19,040 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:40:19,090 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 4 case distinctions, treesize of input 52 treesize of output 69 [2018-12-08 17:40:19,408 WARN L180 SmtUtils]: Spent 316.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 70 [2018-12-08 17:40:19,413 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:40:19,417 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 38 treesize of output 31 [2018-12-08 17:40:19,417 INFO L267 ElimStorePlain]: Start of recursive call 127: End of recursive call: and 1 xjuncts. [2018-12-08 17:40:19,526 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:40:19,528 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 32 treesize of output 21 [2018-12-08 17:40:19,528 INFO L267 ElimStorePlain]: Start of recursive call 128: End of recursive call: and 1 xjuncts. [2018-12-08 17:40:19,620 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:40:19,620 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:40:19,621 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:40:19,625 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 46 treesize of output 35 [2018-12-08 17:40:19,625 INFO L267 ElimStorePlain]: Start of recursive call 129: End of recursive call: and 1 xjuncts. [2018-12-08 17:40:19,631 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:40:19,639 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 52 treesize of output 34 [2018-12-08 17:40:19,639 INFO L267 ElimStorePlain]: Start of recursive call 130: End of recursive call: and 1 xjuncts. [2018-12-08 17:40:19,704 INFO L267 ElimStorePlain]: Start of recursive call 126: 3 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-12-08 17:40:19,766 INFO L267 ElimStorePlain]: Start of recursive call 125: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-12-08 17:40:19,770 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 41 [2018-12-08 17:40:19,774 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:40:19,777 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 38 treesize of output 23 [2018-12-08 17:40:19,777 INFO L267 ElimStorePlain]: Start of recursive call 132: End of recursive call: and 1 xjuncts. [2018-12-08 17:40:19,788 INFO L267 ElimStorePlain]: Start of recursive call 131: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:40:19,794 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 81 treesize of output 71 [2018-12-08 17:40:19,798 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:40:19,849 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 4 case distinctions, treesize of input 67 treesize of output 82 [2018-12-08 17:40:20,145 WARN L180 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 65 [2018-12-08 17:40:20,148 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:40:20,150 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 32 treesize of output 23 [2018-12-08 17:40:20,151 INFO L267 ElimStorePlain]: Start of recursive call 135: End of recursive call: and 1 xjuncts. [2018-12-08 17:40:20,294 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:40:20,300 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 50 treesize of output 34 [2018-12-08 17:40:20,301 INFO L267 ElimStorePlain]: Start of recursive call 136: End of recursive call: and 1 xjuncts. [2018-12-08 17:40:20,305 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:40:20,311 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 40 [2018-12-08 17:40:20,312 INFO L267 ElimStorePlain]: Start of recursive call 137: End of recursive call: and 1 xjuncts. [2018-12-08 17:40:20,315 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:40:20,319 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 42 treesize of output 35 [2018-12-08 17:40:20,319 INFO L267 ElimStorePlain]: Start of recursive call 138: End of recursive call: and 1 xjuncts. [2018-12-08 17:40:20,432 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:40:20,437 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 49 treesize of output 42 [2018-12-08 17:40:20,437 INFO L267 ElimStorePlain]: Start of recursive call 139: End of recursive call: and 1 xjuncts. [2018-12-08 17:40:20,510 INFO L267 ElimStorePlain]: Start of recursive call 134: 3 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-12-08 17:40:20,587 INFO L267 ElimStorePlain]: Start of recursive call 133: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-12-08 17:40:20,695 INFO L267 ElimStorePlain]: Start of recursive call 118: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 5 xjuncts. [2018-12-08 17:40:23,177 INFO L267 ElimStorePlain]: Start of recursive call 1: 14 dim-0 vars, 3 dim-2 vars, End of recursive call: 68 dim-0 vars, and 37 xjuncts. [2018-12-08 17:40:23,177 INFO L202 ElimStorePlain]: Needed 139 recursive calls to eliminate 17 variables, input treesize:424, output treesize:1390 [2018-12-08 17:40:26,450 WARN L180 SmtUtils]: Spent 375.00 ms on a formula simplification. DAG size of input: 548 DAG size of output: 36 [2018-12-08 17:40:28,026 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:40:28,028 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 17:40:28,028 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4740aade-a493-4198-b34c-4c4f6f881e09/bin-2019/utaipan/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 17:40:28,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:40:28,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:40:28,083 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 17:40:28,268 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:40:28,269 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:40:28,270 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 19 treesize of output 23 [2018-12-08 17:40:28,270 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 17:40:28,277 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:40:28,277 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:19 [2018-12-08 17:40:28,282 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 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-12-08 17:40:28,284 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 8 treesize of output 7 [2018-12-08 17:40:28,284 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:40:28,286 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:40:28,296 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:40:28,296 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:40, output treesize:29 [2018-12-08 17:40:28,301 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 32 treesize of output 25 [2018-12-08 17:40:28,304 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:40:28,305 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 25 treesize of output 34 [2018-12-08 17:40:28,306 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:40:28,314 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:40:28,325 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:40:28,325 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:47, output treesize:29 [2018-12-08 17:40:28,329 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:40:28,330 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:40:28,331 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:40:28,331 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 58 [2018-12-08 17:40:28,331 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 17:40:28,345 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:40:28,345 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:46 [2018-12-08 17:40:28,356 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 40 [2018-12-08 17:40:28,359 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-12-08 17:40:28,359 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:40:28,369 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:40:28,386 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:40:28,387 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:64, output treesize:55 [2018-12-08 17:40:28,402 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 53 [2018-12-08 17:40:28,407 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:40:28,410 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 22 treesize of output 14 [2018-12-08 17:40:28,410 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:40:28,421 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:40:28,439 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-12-08 17:40:28,439 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:74, output treesize:55 [2018-12-08 17:40:28,446 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:40:28,448 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:40:28,449 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:40:28,449 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 83 [2018-12-08 17:40:28,449 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 17:40:28,484 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-12-08 17:40:28,484 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:69, output treesize:78 [2018-12-08 17:40:28,657 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:40:28,658 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 72 [2018-12-08 17:40:28,661 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2018-12-08 17:40:28,662 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:40:28,686 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:40:28,727 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-12-08 17:40:28,728 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:94, output treesize:100 [2018-12-08 17:40:28,892 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:40:28,901 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:40:28,919 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:40:28,920 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 103 [2018-12-08 17:40:28,928 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:40:29,033 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 80 treesize of output 109 [2018-12-08 17:40:29,034 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-08 17:40:29,093 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:40:29,143 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-08 17:40:29,147 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-08 17:40:29,147 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 17:40:29,152 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:40:29,191 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 17:40:29,191 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:128, output treesize:148 [2018-12-08 17:40:30,363 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 15 treesize of output 11 [2018-12-08 17:40:30,366 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-08 17:40:30,367 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:40:30,370 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:40:30,402 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-08 17:40:30,402 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:141, output treesize:130 [2018-12-08 17:40:30,783 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:40:30,787 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:40:30,787 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 126 treesize of output 94 [2018-12-08 17:40:30,791 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 5 treesize of output 1 [2018-12-08 17:40:30,791 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:40:30,818 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 26 [2018-12-08 17:40:30,819 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-08 17:40:30,837 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 40 [2018-12-08 17:40:30,837 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-08 17:40:30,853 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-08 17:40:30,876 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-08 17:40:30,876 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:131, output treesize:49 [2018-12-08 17:40:31,088 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:40:31,088 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 17:40:44,869 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 24 [2018-12-08 17:40:44,909 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 17:40:44,921 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 17:40:44,921 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 17:40:44,934 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 17:40:44,935 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 17:40:44,947 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 17:40:45,014 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 3 xjuncts. [2018-12-08 17:40:45,014 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 2 variables, input treesize:50, output treesize:131 [2018-12-08 17:40:57,235 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 44 [2018-12-08 17:41:07,662 WARN L180 SmtUtils]: Spent 10.04 s on a formula simplification that was a NOOP. DAG size: 53 [2018-12-08 17:41:42,809 WARN L180 SmtUtils]: Spent 2.55 s on a formula simplification that was a NOOP. DAG size: 58 [2018-12-08 17:42:14,057 WARN L180 SmtUtils]: Spent 2.88 s on a formula simplification that was a NOOP. DAG size: 57 [2018-12-08 17:42:30,015 WARN L180 SmtUtils]: Spent 6.28 s on a formula simplification that was a NOOP. DAG size: 70 [2018-12-08 17:42:30,118 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 46 [2018-12-08 17:42:30,125 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:42:30,140 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 48 [2018-12-08 17:42:30,195 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 14 treesize of output 18 [2018-12-08 17:42:30,204 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:42:30,208 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 24 [2018-12-08 17:42:30,208 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-08 17:42:30,222 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:42:30,242 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 34 treesize of output 28 [2018-12-08 17:42:30,248 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:42:30,250 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 28 treesize of output 17 [2018-12-08 17:42:30,251 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-08 17:42:30,258 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:42:30,262 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:42:30,281 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-08 17:42:30,281 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 11 variables, input treesize:184, output treesize:45 [2018-12-08 17:42:38,725 INFO L267 ElimStorePlain]: Start of recursive call 1: End of recursive call: and 1 xjuncts. [2018-12-08 17:42:38,725 INFO L202 ElimStorePlain]: Needed 1 recursive calls to eliminate 4 variables, input treesize:58, output treesize:1 [2018-12-08 17:42:38,739 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:42:38,754 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-12-08 17:42:38,754 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20, 19, 21] total 67 [2018-12-08 17:42:38,755 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-12-08 17:42:38,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-12-08 17:42:38,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=373, Invalid=4140, Unknown=43, NotChecked=0, Total=4556 [2018-12-08 17:42:38,755 INFO L87 Difference]: Start difference. First operand 359 states and 383 transitions. Second operand 68 states. [2018-12-08 17:43:03,740 WARN L180 SmtUtils]: Spent 20.74 s on a formula simplification. DAG size of input: 223 DAG size of output: 85 [2018-12-08 17:43:05,838 WARN L180 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 61 [2018-12-08 17:43:06,589 WARN L180 SmtUtils]: Spent 341.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 83 [2018-12-08 17:43:13,945 WARN L180 SmtUtils]: Spent 5.07 s on a formula simplification. DAG size of input: 326 DAG size of output: 140 [2018-12-08 17:43:14,904 WARN L180 SmtUtils]: Spent 631.00 ms on a formula simplification. DAG size of input: 159 DAG size of output: 105 [2018-12-08 17:43:17,835 WARN L180 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 65 [2018-12-08 17:43:18,388 WARN L180 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 53 [2018-12-08 17:43:19,486 WARN L180 SmtUtils]: Spent 442.00 ms on a formula simplification. DAG size of input: 173 DAG size of output: 96 [2018-12-08 17:43:26,369 WARN L180 SmtUtils]: Spent 1.19 s on a formula simplification. DAG size of input: 245 DAG size of output: 182 [2018-12-08 17:43:27,503 WARN L180 SmtUtils]: Spent 494.00 ms on a formula simplification. DAG size of input: 213 DAG size of output: 173 [2018-12-08 17:43:28,725 WARN L180 SmtUtils]: Spent 610.00 ms on a formula simplification. DAG size of input: 218 DAG size of output: 181 [2018-12-08 17:43:29,868 WARN L180 SmtUtils]: Spent 481.00 ms on a formula simplification. DAG size of input: 192 DAG size of output: 151 [2018-12-08 17:43:32,764 WARN L180 SmtUtils]: Spent 566.00 ms on a formula simplification. DAG size of input: 217 DAG size of output: 176 [2018-12-08 17:43:42,073 WARN L180 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 81 [2018-12-08 17:45:40,114 WARN L180 SmtUtils]: Spent 1.42 m on a formula simplification. DAG size of input: 195 DAG size of output: 144 [2018-12-08 17:46:12,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:46:12,635 INFO L93 Difference]: Finished difference Result 405 states and 429 transitions. [2018-12-08 17:46:12,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-12-08 17:46:12,636 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 58 [2018-12-08 17:46:12,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:46:12,638 INFO L225 Difference]: With dead ends: 405 [2018-12-08 17:46:12,638 INFO L226 Difference]: Without dead ends: 405 [2018-12-08 17:46:12,639 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 163 SyntacticMatches, 3 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2200 ImplicationChecksByTransitivity, 343.6s TimeCoverageRelationStatistics Valid=873, Invalid=6737, Unknown=46, NotChecked=0, Total=7656 [2018-12-08 17:46:12,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2018-12-08 17:46:12,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 360. [2018-12-08 17:46:12,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 360 states. [2018-12-08 17:46:12,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 385 transitions. [2018-12-08 17:46:12,641 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 385 transitions. Word has length 58 [2018-12-08 17:46:12,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:46:12,642 INFO L480 AbstractCegarLoop]: Abstraction has 360 states and 385 transitions. [2018-12-08 17:46:12,642 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-12-08 17:46:12,642 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 385 transitions. [2018-12-08 17:46:12,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-08 17:46:12,642 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:46:12,642 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:46:12,642 INFO L423 AbstractCegarLoop]: === Iteration 28 === [merge_pairErr19REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION]=== [2018-12-08 17:46:12,642 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:46:12,642 INFO L82 PathProgramCache]: Analyzing trace with hash -1724768732, now seen corresponding path program 1 times [2018-12-08 17:46:12,643 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 17:46:12,643 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4740aade-a493-4198-b34c-4c4f6f881e09/bin-2019/utaipan/cvc4 Starting monitored process 35 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-08 17:46:12,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:46:12,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:46:12,864 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 17:46:12,866 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-12-08 17:46:12,866 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 17:46:12,874 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-12-08 17:46:12,874 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:46:12,879 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:46:12,879 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-08 17:46:12,890 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:46:12,891 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:46:12,892 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 19 treesize of output 23 [2018-12-08 17:46:12,892 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 17:46:12,913 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-12-08 17:46:12,913 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:46:12,925 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:46:12,925 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:34 [2018-12-08 17:46:12,947 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-08 17:46:12,950 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-12-08 17:46:12,950 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:46:12,953 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:46:12,977 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-08 17:46:12,980 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 8 treesize of output 7 [2018-12-08 17:46:12,980 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 17:46:12,982 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:46:12,999 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:46:12,999 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:57, output treesize:54 [2018-12-08 17:46:13,029 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 34 [2018-12-08 17:46:13,034 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:46:13,038 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 34 treesize of output 45 [2018-12-08 17:46:13,038 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:46:13,056 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:46:13,096 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-12-08 17:46:13,101 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:46:13,104 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-12-08 17:46:13,104 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 17:46:13,114 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:46:13,138 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:46:13,138 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:80, output treesize:54 [2018-12-08 17:46:13,171 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:46:13,172 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:46:13,172 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:46:13,173 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 58 [2018-12-08 17:46:13,173 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 17:46:13,208 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 21 treesize of output 40 [2018-12-08 17:46:13,208 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:46:13,231 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:46:13,232 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:65, output treesize:72 [2018-12-08 17:46:13,291 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 49 [2018-12-08 17:46:13,295 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-12-08 17:46:13,295 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:46:13,310 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:46:13,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, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-12-08 17:46:13,363 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-12-08 17:46:13,363 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 17:46:13,371 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:46:13,401 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:46:13,401 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:98, output treesize:90 [2018-12-08 17:46:13,475 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 62 [2018-12-08 17:46:13,484 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:46:13,487 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 22 treesize of output 14 [2018-12-08 17:46:13,487 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:46:13,509 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:46:13,584 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 33 [2018-12-08 17:46:13,590 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:46:13,592 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 22 treesize of output 14 [2018-12-08 17:46:13,593 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 17:46:13,602 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:46:13,637 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:46:13,637 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:128, output treesize:90 [2018-12-08 17:46:13,645 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:46:13,647 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:46:13,648 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 17:46:13,649 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 37 [2018-12-08 17:46:13,649 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 17:46:13,712 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 63 [2018-12-08 17:46:13,712 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:46:13,755 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:46:13,756 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:108, output treesize:94 [2018-12-08 17:46:13,845 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:46:13,846 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 70 [2018-12-08 17:46:13,850 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2018-12-08 17:46:13,850 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:46:13,882 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:46:13,948 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:46:13,966 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 39 [2018-12-08 17:46:13,972 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-12-08 17:46:13,972 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 17:46:13,986 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:46:14,039 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:46:14,039 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:118, output treesize:124 [2018-12-08 17:46:14,124 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:46:14,151 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 64 [2018-12-08 17:46:14,158 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:46:14,162 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 37 treesize of output 46 [2018-12-08 17:46:14,162 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 17:46:14,189 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:46:14,266 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:46:14,278 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:46:14,284 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:46:14,285 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 117 [2018-12-08 17:46:14,294 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:46:14,353 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 85 treesize of output 114 [2018-12-08 17:46:14,354 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-08 17:46:14,418 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:46:14,468 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 17:46:14,469 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:147, output treesize:178 [2018-12-08 17:46:15,346 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:46:15,352 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 94 [2018-12-08 17:46:15,357 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 61 treesize of output 44 [2018-12-08 17:46:15,358 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 17:46:15,381 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 5 treesize of output 1 [2018-12-08 17:46:15,381 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-08 17:46:15,398 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-08 17:46:15,398 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 17:46:15,410 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 17:46:15,450 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:46:15,453 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 17:46:15,455 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 135 treesize of output 99 [2018-12-08 17:46:15,485 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 46 [2018-12-08 17:46:15,486 INFO L267 ElimStorePlain]: Start of recursive call 7: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 4 xjuncts. [2018-12-08 17:46:15,535 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 46 [2018-12-08 17:46:15,536 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-08 17:46:15,566 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 5 treesize of output 1 [2018-12-08 17:46:15,567 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-08 17:46:15,584 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-08 17:46:15,613 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-08 17:46:15,614 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:206, output treesize:58 [2018-12-08 17:46:15,740 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:46:15,740 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 17:46:22,776 WARN L180 SmtUtils]: Spent 1.80 s on a formula simplification. DAG size of input: 166 DAG size of output: 155 [2018-12-08 17:46:22,777 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 17:46:22,825 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 17:46:22,826 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 17:46:22,882 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 17:46:22,882 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 17:46:22,934 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 17:46:24,252 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 17:46:24,296 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 17:46:24,297 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 17:46:24,331 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 17:46:24,331 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 17:46:24,365 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 17:46:26,143 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 17:46:26,200 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 17:46:26,201 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 17:46:26,246 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 17:46:27,613 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 17:46:27,652 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 17:46:27,653 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 17:46:27,706 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 17:46:29,302 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 17:46:29,354 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 17:46:29,354 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 17:46:29,397 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 17:46:30,308 INFO L267 ElimStorePlain]: Start of recursive call 27: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 17:46:30,344 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 17:46:30,344 INFO L267 ElimStorePlain]: Start of recursive call 29: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 17:46:30,386 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 17:46:31,326 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 6 dim-2 vars, End of recursive call: 18 dim-0 vars, and 7 xjuncts. [2018-12-08 17:46:31,327 INFO L202 ElimStorePlain]: Needed 29 recursive calls to eliminate 9 variables, input treesize:307, output treesize:487 [2018-12-08 17:46:52,775 WARN L180 SmtUtils]: Spent 17.33 s on a formula simplification. DAG size of input: 188 DAG size of output: 160 [2018-12-08 17:47:13,532 WARN L180 SmtUtils]: Spent 13.00 s on a formula simplification that was a NOOP. DAG size: 182 [2018-12-08 17:47:18,874 WARN L194 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) stderr output: (error "out of memory") [2018-12-08 17:47:19,075 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-08 17:47:19,076 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:225) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.WrapperScript.checkSat(WrapperScript.java:116) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.checkSat(ManagedScript.java:141) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:84) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:893) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:767) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:339) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:299) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:575) 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) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1427) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:630) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:419) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:205) ... 40 more [2018-12-08 17:47:19,081 INFO L168 Benchmark]: Toolchain (without parser) took 601736.52 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 221.8 MB). Free memory was 938.0 MB in the beginning and 920.7 MB in the end (delta: 17.3 MB). Peak memory consumption was 239.0 MB. Max. memory is 11.5 GB. [2018-12-08 17:47:19,082 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 972.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 17:47:19,082 INFO L168 Benchmark]: CACSL2BoogieTranslator took 326.39 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.4 MB). Free memory was 938.0 MB in the beginning and 1.1 GB in the end (delta: -190.3 MB). Peak memory consumption was 25.7 MB. Max. memory is 11.5 GB. [2018-12-08 17:47:19,082 INFO L168 Benchmark]: Boogie Procedure Inliner took 19.73 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2018-12-08 17:47:19,083 INFO L168 Benchmark]: Boogie Preprocessor took 28.69 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-12-08 17:47:19,083 INFO L168 Benchmark]: RCFGBuilder took 679.42 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 83.5 MB). Peak memory consumption was 83.5 MB. Max. memory is 11.5 GB. [2018-12-08 17:47:19,083 INFO L168 Benchmark]: TraceAbstraction took 600679.64 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 73.4 MB). Free memory was 1.0 GB in the beginning and 920.7 MB in the end (delta: 117.5 MB). Peak memory consumption was 190.9 MB. Max. memory is 11.5 GB. [2018-12-08 17:47:19,084 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 972.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 326.39 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.4 MB). Free memory was 938.0 MB in the beginning and 1.1 GB in the end (delta: -190.3 MB). Peak memory consumption was 25.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 19.73 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 28.69 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 679.42 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 83.5 MB). Peak memory consumption was 83.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 600679.64 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 73.4 MB). Free memory was 1.0 GB in the beginning and 920.7 MB in the end (delta: 117.5 MB). Peak memory consumption was 190.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...