./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/forester-heap/sll-buckets_true-unreach-call_true-valid-memsafety.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_ee5af346-bf1c-44ad-a793-d5cc5b2233d9/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_ee5af346-bf1c-44ad-a793-d5cc5b2233d9/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_ee5af346-bf1c-44ad-a793-d5cc5b2233d9/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_ee5af346-bf1c-44ad-a793-d5cc5b2233d9/bin-2019/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/sll-buckets_true-unreach-call_true-valid-memsafety.i -s /tmp/vcloud-vcloud-master/worker/working_dir_ee5af346-bf1c-44ad-a793-d5cc5b2233d9/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_ee5af346-bf1c-44ad-a793-d5cc5b2233d9/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 109d156101f4cfba3ce2d0d8043b4202b4256b37 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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_ee5af346-bf1c-44ad-a793-d5cc5b2233d9/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_ee5af346-bf1c-44ad-a793-d5cc5b2233d9/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_ee5af346-bf1c-44ad-a793-d5cc5b2233d9/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_ee5af346-bf1c-44ad-a793-d5cc5b2233d9/bin-2019/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/sll-buckets_true-unreach-call_true-valid-memsafety.i -s /tmp/vcloud-vcloud-master/worker/working_dir_ee5af346-bf1c-44ad-a793-d5cc5b2233d9/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_ee5af346-bf1c-44ad-a793-d5cc5b2233d9/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 109d156101f4cfba3ce2d0d8043b4202b4256b37 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: var is still there: v_arrayElimArr_8 input size 44 context size 44 output size 44 --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 15:18:52,368 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 15:18:52,369 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 15:18:52,376 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 15:18:52,376 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 15:18:52,377 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 15:18:52,378 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 15:18:52,379 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 15:18:52,380 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 15:18:52,381 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 15:18:52,381 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 15:18:52,382 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 15:18:52,382 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 15:18:52,383 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 15:18:52,384 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 15:18:52,384 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 15:18:52,385 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 15:18:52,386 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 15:18:52,388 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 15:18:52,389 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 15:18:52,390 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 15:18:52,390 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 15:18:52,392 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 15:18:52,393 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 15:18:52,393 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 15:18:52,393 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 15:18:52,394 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 15:18:52,395 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 15:18:52,396 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 15:18:52,396 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 15:18:52,397 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 15:18:52,397 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 15:18:52,397 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 15:18:52,397 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 15:18:52,398 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 15:18:52,399 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 15:18:52,399 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_ee5af346-bf1c-44ad-a793-d5cc5b2233d9/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2018-11-23 15:18:52,409 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 15:18:52,409 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 15:18:52,410 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 15:18:52,410 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 15:18:52,410 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-23 15:18:52,410 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-23 15:18:52,410 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-23 15:18:52,411 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-23 15:18:52,411 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-23 15:18:52,411 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-23 15:18:52,411 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-23 15:18:52,411 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-23 15:18:52,411 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-23 15:18:52,412 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 15:18:52,412 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 15:18:52,412 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 15:18:52,412 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 15:18:52,412 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 15:18:52,412 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 15:18:52,413 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 15:18:52,413 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 15:18:52,413 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-11-23 15:18:52,413 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-11-23 15:18:52,413 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-11-23 15:18:52,413 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 15:18:52,413 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 15:18:52,414 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 15:18:52,414 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 15:18:52,414 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 15:18:52,414 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 15:18:52,414 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 15:18:52,414 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 15:18:52,414 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 15:18:52,414 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 15:18:52,414 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-23 15:18:52,414 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 15:18:52,416 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 15:18:52,416 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_ee5af346-bf1c-44ad-a793-d5cc5b2233d9/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 -> 109d156101f4cfba3ce2d0d8043b4202b4256b37 [2018-11-23 15:18:52,438 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 15:18:52,447 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 15:18:52,448 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 15:18:52,449 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 15:18:52,450 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 15:18:52,450 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_ee5af346-bf1c-44ad-a793-d5cc5b2233d9/bin-2019/utaipan/../../sv-benchmarks/c/forester-heap/sll-buckets_true-unreach-call_true-valid-memsafety.i [2018-11-23 15:18:52,484 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ee5af346-bf1c-44ad-a793-d5cc5b2233d9/bin-2019/utaipan/data/84ebf90c2/56bd3a45ca344c119aac69fe43752c49/FLAG9bb68d632 [2018-11-23 15:18:52,915 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 15:18:52,916 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_ee5af346-bf1c-44ad-a793-d5cc5b2233d9/sv-benchmarks/c/forester-heap/sll-buckets_true-unreach-call_true-valid-memsafety.i [2018-11-23 15:18:52,922 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ee5af346-bf1c-44ad-a793-d5cc5b2233d9/bin-2019/utaipan/data/84ebf90c2/56bd3a45ca344c119aac69fe43752c49/FLAG9bb68d632 [2018-11-23 15:18:52,930 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_ee5af346-bf1c-44ad-a793-d5cc5b2233d9/bin-2019/utaipan/data/84ebf90c2/56bd3a45ca344c119aac69fe43752c49 [2018-11-23 15:18:52,932 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 15:18:52,933 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 15:18:52,933 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 15:18:52,933 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 15:18:52,936 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 15:18:52,937 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:18:52" (1/1) ... [2018-11-23 15:18:52,939 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15c458f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:18:52, skipping insertion in model container [2018-11-23 15:18:52,939 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:18:52" (1/1) ... [2018-11-23 15:18:52,946 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 15:18:52,975 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 15:18:53,166 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 15:18:53,172 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 15:18:53,243 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 15:18:53,274 INFO L195 MainTranslator]: Completed translation [2018-11-23 15:18:53,274 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:18:53 WrapperNode [2018-11-23 15:18:53,274 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 15:18:53,275 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 15:18:53,275 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 15:18:53,275 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 15:18:53,282 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:18:53" (1/1) ... [2018-11-23 15:18:53,291 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:18:53" (1/1) ... [2018-11-23 15:18:53,296 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 15:18:53,296 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 15:18:53,296 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 15:18:53,296 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 15:18:53,302 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:18:53" (1/1) ... [2018-11-23 15:18:53,302 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:18:53" (1/1) ... [2018-11-23 15:18:53,305 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:18:53" (1/1) ... [2018-11-23 15:18:53,305 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:18:53" (1/1) ... [2018-11-23 15:18:53,316 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:18:53" (1/1) ... [2018-11-23 15:18:53,322 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:18:53" (1/1) ... [2018-11-23 15:18:53,323 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:18:53" (1/1) ... [2018-11-23 15:18:53,325 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 15:18:53,326 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 15:18:53,326 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 15:18:53,326 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 15:18:53,326 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:18:53" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ee5af346-bf1c-44ad-a793-d5cc5b2233d9/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 15:18:53,369 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 15:18:53,369 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 15:18:53,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 15:18:53,369 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 15:18:53,369 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 15:18:53,369 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 15:18:53,369 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 15:18:53,370 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-23 15:18:53,370 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-23 15:18:53,370 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 15:18:53,370 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 15:18:53,370 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 15:18:53,794 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 15:18:53,794 INFO L280 CfgBuilder]: Removed 15 assue(true) statements. [2018-11-23 15:18:53,794 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:18:53 BoogieIcfgContainer [2018-11-23 15:18:53,794 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 15:18:53,795 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 15:18:53,795 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 15:18:53,797 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 15:18:53,797 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 03:18:52" (1/3) ... [2018-11-23 15:18:53,798 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50c6bcc1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:18:53, skipping insertion in model container [2018-11-23 15:18:53,798 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:18:53" (2/3) ... [2018-11-23 15:18:53,798 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50c6bcc1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:18:53, skipping insertion in model container [2018-11-23 15:18:53,798 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:18:53" (3/3) ... [2018-11-23 15:18:53,800 INFO L112 eAbstractionObserver]: Analyzing ICFG sll-buckets_true-unreach-call_true-valid-memsafety.i [2018-11-23 15:18:53,806 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 15:18:53,811 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 65 error locations. [2018-11-23 15:18:53,821 INFO L257 AbstractCegarLoop]: Starting to check reachability of 65 error locations. [2018-11-23 15:18:53,840 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 15:18:53,840 INFO L383 AbstractCegarLoop]: Hoare is false [2018-11-23 15:18:53,840 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 15:18:53,840 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 15:18:53,840 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 15:18:53,840 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 15:18:53,840 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 15:18:53,840 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 15:18:53,853 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states. [2018-11-23 15:18:53,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-11-23 15:18:53,860 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:18:53,860 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:18:53,862 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr43REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr47REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION]=== [2018-11-23 15:18:53,866 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:18:53,867 INFO L82 PathProgramCache]: Analyzing trace with hash 1890133367, now seen corresponding path program 1 times [2018-11-23 15:18:53,868 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 15:18:53,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:18:53,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:18:53,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:18:53,902 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 15:18:53,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:18:53,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 15:18:53,964 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 15:18:53,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 15:18:53,964 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 15:18:53,967 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 15:18:53,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 15:18:53,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 15:18:53,977 INFO L87 Difference]: Start difference. First operand 144 states. Second operand 3 states. [2018-11-23 15:18:54,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:18:54,142 INFO L93 Difference]: Finished difference Result 172 states and 181 transitions. [2018-11-23 15:18:54,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 15:18:54,143 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-11-23 15:18:54,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:18:54,150 INFO L225 Difference]: With dead ends: 172 [2018-11-23 15:18:54,150 INFO L226 Difference]: Without dead ends: 168 [2018-11-23 15:18:54,152 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 15:18:54,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2018-11-23 15:18:54,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 137. [2018-11-23 15:18:54,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-11-23 15:18:54,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 144 transitions. [2018-11-23 15:18:54,184 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 144 transitions. Word has length 7 [2018-11-23 15:18:54,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:18:54,184 INFO L480 AbstractCegarLoop]: Abstraction has 137 states and 144 transitions. [2018-11-23 15:18:54,185 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 15:18:54,185 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 144 transitions. [2018-11-23 15:18:54,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-11-23 15:18:54,185 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:18:54,185 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:18:54,186 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr43REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr47REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION]=== [2018-11-23 15:18:54,186 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:18:54,186 INFO L82 PathProgramCache]: Analyzing trace with hash 1890133368, now seen corresponding path program 1 times [2018-11-23 15:18:54,186 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 15:18:54,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:18:54,188 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:18:54,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:18:54,188 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 15:18:54,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:18:54,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 15:18:54,217 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 15:18:54,217 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 15:18:54,217 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 15:18:54,218 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 15:18:54,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 15:18:54,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 15:18:54,218 INFO L87 Difference]: Start difference. First operand 137 states and 144 transitions. Second operand 3 states. [2018-11-23 15:18:54,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:18:54,329 INFO L93 Difference]: Finished difference Result 167 states and 176 transitions. [2018-11-23 15:18:54,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 15:18:54,330 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-11-23 15:18:54,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:18:54,331 INFO L225 Difference]: With dead ends: 167 [2018-11-23 15:18:54,331 INFO L226 Difference]: Without dead ends: 167 [2018-11-23 15:18:54,332 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 15:18:54,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-11-23 15:18:54,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 133. [2018-11-23 15:18:54,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-11-23 15:18:54,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 140 transitions. [2018-11-23 15:18:54,339 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 140 transitions. Word has length 7 [2018-11-23 15:18:54,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:18:54,339 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 140 transitions. [2018-11-23 15:18:54,339 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 15:18:54,340 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 140 transitions. [2018-11-23 15:18:54,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 15:18:54,340 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:18:54,340 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:18:54,340 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr43REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr47REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION]=== [2018-11-23 15:18:54,341 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:18:54,341 INFO L82 PathProgramCache]: Analyzing trace with hash 1185125342, now seen corresponding path program 1 times [2018-11-23 15:18:54,341 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 15:18:54,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:18:54,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:18:54,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:18:54,342 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 15:18:54,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:18:54,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 15:18:54,409 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 15:18:54,409 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 15:18:54,410 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 15:18:54,410 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 15:18:54,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 15:18:54,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-23 15:18:54,411 INFO L87 Difference]: Start difference. First operand 133 states and 140 transitions. Second operand 6 states. [2018-11-23 15:18:54,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:18:54,643 INFO L93 Difference]: Finished difference Result 173 states and 182 transitions. [2018-11-23 15:18:54,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 15:18:54,644 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-11-23 15:18:54,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:18:54,645 INFO L225 Difference]: With dead ends: 173 [2018-11-23 15:18:54,645 INFO L226 Difference]: Without dead ends: 173 [2018-11-23 15:18:54,645 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-11-23 15:18:54,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-11-23 15:18:54,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 131. [2018-11-23 15:18:54,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-11-23 15:18:54,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 145 transitions. [2018-11-23 15:18:54,651 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 145 transitions. Word has length 13 [2018-11-23 15:18:54,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:18:54,652 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 145 transitions. [2018-11-23 15:18:54,652 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 15:18:54,652 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 145 transitions. [2018-11-23 15:18:54,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 15:18:54,652 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:18:54,652 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:18:54,653 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr43REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr47REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION]=== [2018-11-23 15:18:54,653 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:18:54,653 INFO L82 PathProgramCache]: Analyzing trace with hash 1185125343, now seen corresponding path program 1 times [2018-11-23 15:18:54,653 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 15:18:54,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:18:54,655 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:18:54,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:18:54,655 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 15:18:54,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:18:54,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 15:18:54,719 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 15:18:54,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 15:18:54,720 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 15:18:54,720 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 15:18:54,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 15:18:54,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-23 15:18:54,720 INFO L87 Difference]: Start difference. First operand 131 states and 145 transitions. Second operand 6 states. [2018-11-23 15:18:54,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:18:54,907 INFO L93 Difference]: Finished difference Result 177 states and 200 transitions. [2018-11-23 15:18:54,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 15:18:54,908 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-11-23 15:18:54,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:18:54,909 INFO L225 Difference]: With dead ends: 177 [2018-11-23 15:18:54,909 INFO L226 Difference]: Without dead ends: 177 [2018-11-23 15:18:54,909 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-11-23 15:18:54,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-11-23 15:18:54,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 127. [2018-11-23 15:18:54,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-11-23 15:18:54,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 141 transitions. [2018-11-23 15:18:54,916 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 141 transitions. Word has length 13 [2018-11-23 15:18:54,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:18:54,917 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 141 transitions. [2018-11-23 15:18:54,917 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 15:18:54,917 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 141 transitions. [2018-11-23 15:18:54,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 15:18:54,917 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:18:54,917 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:18:54,919 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr43REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr47REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION]=== [2018-11-23 15:18:54,919 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:18:54,919 INFO L82 PathProgramCache]: Analyzing trace with hash -2015031739, now seen corresponding path program 1 times [2018-11-23 15:18:54,919 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 15:18:54,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:18:54,921 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:18:54,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:18:54,921 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 15:18:54,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:18:54,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 15:18:54,987 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 15:18:54,987 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 15:18:54,987 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 15:18:54,987 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 15:18:54,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 15:18:54,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-23 15:18:54,988 INFO L87 Difference]: Start difference. First operand 127 states and 141 transitions. Second operand 6 states. [2018-11-23 15:18:55,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:18:55,138 INFO L93 Difference]: Finished difference Result 168 states and 177 transitions. [2018-11-23 15:18:55,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 15:18:55,138 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-11-23 15:18:55,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:18:55,139 INFO L225 Difference]: With dead ends: 168 [2018-11-23 15:18:55,139 INFO L226 Difference]: Without dead ends: 168 [2018-11-23 15:18:55,140 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-23 15:18:55,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2018-11-23 15:18:55,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 126. [2018-11-23 15:18:55,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-11-23 15:18:55,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 140 transitions. [2018-11-23 15:18:55,146 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 140 transitions. Word has length 19 [2018-11-23 15:18:55,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:18:55,146 INFO L480 AbstractCegarLoop]: Abstraction has 126 states and 140 transitions. [2018-11-23 15:18:55,146 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 15:18:55,146 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 140 transitions. [2018-11-23 15:18:55,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 15:18:55,146 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:18:55,146 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:18:55,147 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr43REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr47REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION]=== [2018-11-23 15:18:55,147 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:18:55,147 INFO L82 PathProgramCache]: Analyzing trace with hash -2015031738, now seen corresponding path program 1 times [2018-11-23 15:18:55,147 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 15:18:55,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:18:55,148 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:18:55,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:18:55,148 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 15:18:55,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:18:55,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 15:18:55,239 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 15:18:55,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 15:18:55,240 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 15:18:55,240 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 15:18:55,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 15:18:55,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-23 15:18:55,240 INFO L87 Difference]: Start difference. First operand 126 states and 140 transitions. Second operand 6 states. [2018-11-23 15:18:55,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:18:55,447 INFO L93 Difference]: Finished difference Result 173 states and 196 transitions. [2018-11-23 15:18:55,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 15:18:55,447 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-11-23 15:18:55,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:18:55,448 INFO L225 Difference]: With dead ends: 173 [2018-11-23 15:18:55,448 INFO L226 Difference]: Without dead ends: 173 [2018-11-23 15:18:55,448 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-11-23 15:18:55,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-11-23 15:18:55,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 123. [2018-11-23 15:18:55,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-11-23 15:18:55,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 137 transitions. [2018-11-23 15:18:55,453 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 137 transitions. Word has length 19 [2018-11-23 15:18:55,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:18:55,453 INFO L480 AbstractCegarLoop]: Abstraction has 123 states and 137 transitions. [2018-11-23 15:18:55,453 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 15:18:55,453 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 137 transitions. [2018-11-23 15:18:55,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 15:18:55,455 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:18:55,455 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] [2018-11-23 15:18:55,455 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr43REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr47REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION]=== [2018-11-23 15:18:55,455 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:18:55,456 INFO L82 PathProgramCache]: Analyzing trace with hash 771067182, now seen corresponding path program 1 times [2018-11-23 15:18:55,456 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 15:18:55,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:18:55,457 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:18:55,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:18:55,457 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 15:18:55,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:18:55,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 15:18:55,489 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 15:18:55,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 15:18:55,489 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 15:18:55,490 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 15:18:55,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 15:18:55,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 15:18:55,490 INFO L87 Difference]: Start difference. First operand 123 states and 137 transitions. Second operand 3 states. [2018-11-23 15:18:55,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:18:55,586 INFO L93 Difference]: Finished difference Result 129 states and 144 transitions. [2018-11-23 15:18:55,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 15:18:55,586 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-23 15:18:55,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:18:55,587 INFO L225 Difference]: With dead ends: 129 [2018-11-23 15:18:55,587 INFO L226 Difference]: Without dead ends: 129 [2018-11-23 15:18:55,587 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 15:18:55,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-11-23 15:18:55,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 118. [2018-11-23 15:18:55,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-11-23 15:18:55,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 132 transitions. [2018-11-23 15:18:55,589 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 132 transitions. Word has length 25 [2018-11-23 15:18:55,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:18:55,590 INFO L480 AbstractCegarLoop]: Abstraction has 118 states and 132 transitions. [2018-11-23 15:18:55,590 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 15:18:55,590 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 132 transitions. [2018-11-23 15:18:55,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 15:18:55,590 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:18:55,590 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] [2018-11-23 15:18:55,591 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr43REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr47REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION]=== [2018-11-23 15:18:55,591 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:18:55,591 INFO L82 PathProgramCache]: Analyzing trace with hash 771067183, now seen corresponding path program 1 times [2018-11-23 15:18:55,591 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 15:18:55,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:18:55,592 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:18:55,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:18:55,592 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 15:18:55,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:18:55,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 15:18:55,643 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 15:18:55,644 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 15:18:55,644 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 15:18:55,644 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 15:18:55,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 15:18:55,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 15:18:55,644 INFO L87 Difference]: Start difference. First operand 118 states and 132 transitions. Second operand 3 states. [2018-11-23 15:18:55,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:18:55,694 INFO L93 Difference]: Finished difference Result 124 states and 139 transitions. [2018-11-23 15:18:55,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 15:18:55,695 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-23 15:18:55,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:18:55,695 INFO L225 Difference]: With dead ends: 124 [2018-11-23 15:18:55,695 INFO L226 Difference]: Without dead ends: 124 [2018-11-23 15:18:55,696 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 15:18:55,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-11-23 15:18:55,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 113. [2018-11-23 15:18:55,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-11-23 15:18:55,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 127 transitions. [2018-11-23 15:18:55,699 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 127 transitions. Word has length 25 [2018-11-23 15:18:55,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:18:55,699 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 127 transitions. [2018-11-23 15:18:55,699 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 15:18:55,699 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 127 transitions. [2018-11-23 15:18:55,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 15:18:55,700 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:18:55,700 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] [2018-11-23 15:18:55,700 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr43REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr47REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION]=== [2018-11-23 15:18:55,700 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:18:55,700 INFO L82 PathProgramCache]: Analyzing trace with hash -2033706762, now seen corresponding path program 1 times [2018-11-23 15:18:55,701 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 15:18:55,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:18:55,701 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:18:55,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:18:55,702 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 15:18:55,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:18:55,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 15:18:55,789 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 15:18:55,789 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-23 15:18:55,789 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 15:18:55,789 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 15:18:55,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 15:18:55,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-11-23 15:18:55,790 INFO L87 Difference]: Start difference. First operand 113 states and 127 transitions. Second operand 8 states. [2018-11-23 15:18:55,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:18:55,926 INFO L93 Difference]: Finished difference Result 148 states and 157 transitions. [2018-11-23 15:18:55,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 15:18:55,927 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2018-11-23 15:18:55,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:18:55,927 INFO L225 Difference]: With dead ends: 148 [2018-11-23 15:18:55,928 INFO L226 Difference]: Without dead ends: 148 [2018-11-23 15:18:55,928 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-11-23 15:18:55,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-11-23 15:18:55,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 115. [2018-11-23 15:18:55,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-11-23 15:18:55,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 132 transitions. [2018-11-23 15:18:55,930 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 132 transitions. Word has length 27 [2018-11-23 15:18:55,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:18:55,931 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 132 transitions. [2018-11-23 15:18:55,931 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 15:18:55,931 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 132 transitions. [2018-11-23 15:18:55,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 15:18:55,931 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:18:55,931 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] [2018-11-23 15:18:55,932 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr43REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr47REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION]=== [2018-11-23 15:18:55,932 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:18:55,932 INFO L82 PathProgramCache]: Analyzing trace with hash -2033706761, now seen corresponding path program 1 times [2018-11-23 15:18:55,932 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 15:18:55,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:18:55,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:18:55,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:18:55,933 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 15:18:55,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:18:56,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 15:18:56,091 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 15:18:56,091 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 15:18:56,091 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 15:18:56,091 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 15:18:56,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 15:18:56,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-23 15:18:56,092 INFO L87 Difference]: Start difference. First operand 115 states and 132 transitions. Second operand 7 states. [2018-11-23 15:18:56,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:18:56,350 INFO L93 Difference]: Finished difference Result 188 states and 208 transitions. [2018-11-23 15:18:56,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 15:18:56,351 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2018-11-23 15:18:56,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:18:56,352 INFO L225 Difference]: With dead ends: 188 [2018-11-23 15:18:56,352 INFO L226 Difference]: Without dead ends: 188 [2018-11-23 15:18:56,353 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 4 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2018-11-23 15:18:56,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2018-11-23 15:18:56,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 150. [2018-11-23 15:18:56,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-11-23 15:18:56,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 181 transitions. [2018-11-23 15:18:56,356 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 181 transitions. Word has length 27 [2018-11-23 15:18:56,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:18:56,357 INFO L480 AbstractCegarLoop]: Abstraction has 150 states and 181 transitions. [2018-11-23 15:18:56,357 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 15:18:56,357 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 181 transitions. [2018-11-23 15:18:56,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-23 15:18:56,357 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:18:56,357 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:18:56,358 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr43REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr47REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION]=== [2018-11-23 15:18:56,358 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:18:56,358 INFO L82 PathProgramCache]: Analyzing trace with hash 1379600496, now seen corresponding path program 1 times [2018-11-23 15:18:56,358 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 15:18:56,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:18:56,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:18:56,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:18:56,361 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 15:18:56,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:18:56,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 15:18:56,406 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 15:18:56,406 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 15:18:56,406 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 15:18:56,406 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 15:18:56,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 15:18:56,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 15:18:56,406 INFO L87 Difference]: Start difference. First operand 150 states and 181 transitions. Second operand 4 states. [2018-11-23 15:18:56,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:18:56,502 INFO L93 Difference]: Finished difference Result 183 states and 209 transitions. [2018-11-23 15:18:56,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 15:18:56,502 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2018-11-23 15:18:56,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:18:56,503 INFO L225 Difference]: With dead ends: 183 [2018-11-23 15:18:56,503 INFO L226 Difference]: Without dead ends: 183 [2018-11-23 15:18:56,503 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-23 15:18:56,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-11-23 15:18:56,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 150. [2018-11-23 15:18:56,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-11-23 15:18:56,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 180 transitions. [2018-11-23 15:18:56,506 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 180 transitions. Word has length 28 [2018-11-23 15:18:56,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:18:56,506 INFO L480 AbstractCegarLoop]: Abstraction has 150 states and 180 transitions. [2018-11-23 15:18:56,506 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 15:18:56,506 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 180 transitions. [2018-11-23 15:18:56,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-23 15:18:56,506 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:18:56,506 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] [2018-11-23 15:18:56,507 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr43REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr47REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION]=== [2018-11-23 15:18:56,507 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:18:56,507 INFO L82 PathProgramCache]: Analyzing trace with hash 1121357240, now seen corresponding path program 1 times [2018-11-23 15:18:56,507 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 15:18:56,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:18:56,508 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:18:56,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:18:56,508 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 15:18:56,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:18:56,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 15:18:56,885 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 15:18:56,885 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-11-23 15:18:56,885 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 15:18:56,886 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-23 15:18:56,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-23 15:18:56,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2018-11-23 15:18:56,886 INFO L87 Difference]: Start difference. First operand 150 states and 180 transitions. Second operand 16 states. [2018-11-23 15:18:57,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:18:57,735 INFO L93 Difference]: Finished difference Result 178 states and 207 transitions. [2018-11-23 15:18:57,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-23 15:18:57,735 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 31 [2018-11-23 15:18:57,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:18:57,737 INFO L225 Difference]: With dead ends: 178 [2018-11-23 15:18:57,737 INFO L226 Difference]: Without dead ends: 178 [2018-11-23 15:18:57,737 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=267, Invalid=855, Unknown=0, NotChecked=0, Total=1122 [2018-11-23 15:18:57,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-11-23 15:18:57,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 158. [2018-11-23 15:18:57,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-11-23 15:18:57,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 189 transitions. [2018-11-23 15:18:57,742 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 189 transitions. Word has length 31 [2018-11-23 15:18:57,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:18:57,742 INFO L480 AbstractCegarLoop]: Abstraction has 158 states and 189 transitions. [2018-11-23 15:18:57,742 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-23 15:18:57,742 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 189 transitions. [2018-11-23 15:18:57,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-23 15:18:57,743 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:18:57,743 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] [2018-11-23 15:18:57,744 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr43REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr47REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION]=== [2018-11-23 15:18:57,744 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:18:57,744 INFO L82 PathProgramCache]: Analyzing trace with hash 114271884, now seen corresponding path program 1 times [2018-11-23 15:18:57,744 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 15:18:57,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:18:57,745 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:18:57,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:18:57,745 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 15:18:57,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:18:58,017 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 15:18:58,018 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 15:18:58,018 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 15:18:58,019 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 40 with the following transitions: [2018-11-23 15:18:58,020 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [6], [9], [12], [13], [16], [19], [20], [23], [26], [27], [30], [33], [34], [37], [40], [43], [48], [51], [187], [196], [197], [198], [200], [201], [210], [252], [256], [261], [262], [265], [267], [269], [276], [277], [278] [2018-11-23 15:18:58,047 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 15:18:58,048 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 15:18:58,190 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-23 15:18:58,191 INFO L272 AbstractInterpreter]: Visited 38 different actions 38 times. Never merged. Never widened. Performed 346 root evaluator evaluations with a maximum evaluation depth of 3. Performed 346 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 37 variables. [2018-11-23 15:18:58,199 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:18:58,199 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-23 15:18:58,200 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 15:18:58,200 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ee5af346-bf1c-44ad-a793-d5cc5b2233d9/bin-2019/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 15:18:58,207 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:18:58,207 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-23 15:18:58,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:18:58,239 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:18:58,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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-23 15:18:58,270 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 15:18:58,275 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:18:58,275 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-23 15:18:58,312 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:18:58,313 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:18:58,313 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-23 15:18:58,314 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 15:18:58,316 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:18:58,316 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2018-11-23 15:18:58,333 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-11-23 15:18:58,335 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-11-23 15:18:58,335 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 15:18:58,339 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:18:58,344 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:18:58,344 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:14 [2018-11-23 15:18:58,388 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:18:58,391 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 35 treesize of output 36 [2018-11-23 15:18:58,393 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2018-11-23 15:18:58,393 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 15:18:58,397 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:18:58,401 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:18:58,401 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:40, output treesize:21 [2018-11-23 15:18:58,404 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:18:58,407 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 29 treesize of output 30 [2018-11-23 15:18:58,409 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-23 15:18:58,409 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 15:18:58,414 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:18:58,419 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:18:58,419 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:34, output treesize:30 [2018-11-23 15:18:58,438 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:18:58,439 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:18:58,440 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-23 15:18:58,440 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 15:18:58,445 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:18:58,446 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:29 [2018-11-23 15:18:58,468 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:18:58,472 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 36 treesize of output 35 [2018-11-23 15:18:58,475 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:18:58,476 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 16 treesize of output 23 [2018-11-23 15:18:58,477 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 15:18:58,483 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:18:58,490 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:18:58,490 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:45, output treesize:38 [2018-11-23 15:18:58,562 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:18:58,577 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 73 treesize of output 80 [2018-11-23 15:18:58,581 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 82 treesize of output 66 [2018-11-23 15:18:58,581 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 15:18:58,609 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:18:58,623 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 57 [2018-11-23 15:18:58,623 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 4 xjuncts. [2018-11-23 15:18:58,648 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-23 15:18:58,669 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 3 xjuncts. [2018-11-23 15:18:58,669 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:73, output treesize:107 [2018-11-23 15:18:58,728 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 59 treesize of output 68 [2018-11-23 15:18:58,732 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 64 treesize of output 63 [2018-11-23 15:18:58,733 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 15:18:58,758 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:18:58,767 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 2 case distinctions, treesize of input 47 treesize of output 62 [2018-11-23 15:18:58,768 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-23 15:18:58,798 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 15:18:58,853 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 43 treesize of output 38 [2018-11-23 15:18:58,855 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:18:58,856 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-23 15:18:58,857 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 15:18:58,863 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:18:58,915 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 43 treesize of output 38 [2018-11-23 15:18:58,918 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 18 treesize of output 9 [2018-11-23 15:18:58,918 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-23 15:18:58,923 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:18:58,942 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-23 15:18:58,942 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:146, output treesize:86 [2018-11-23 15:18:58,988 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 50 treesize of output 40 [2018-11-23 15:18:58,992 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:18:58,992 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 31 [2018-11-23 15:18:58,993 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 15:18:58,999 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:18:59,032 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 87 treesize of output 75 [2018-11-23 15:18:59,039 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:18:59,040 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:18:59,053 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 1 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 71 [2018-11-23 15:18:59,054 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-11-23 15:18:59,089 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:18:59,089 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 66 treesize of output 81 [2018-11-23 15:18:59,089 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 15:18:59,106 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 15:18:59,125 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-11-23 15:18:59,125 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:138, output treesize:160 [2018-11-23 15:18:59,781 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 88 treesize of output 69 [2018-11-23 15:18:59,784 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:18:59,786 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 73 treesize of output 90 [2018-11-23 15:18:59,787 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 15:18:59,799 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:18:59,826 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 55 treesize of output 45 [2018-11-23 15:18:59,830 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:18:59,832 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 44 treesize of output 57 [2018-11-23 15:18:59,833 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 15:18:59,843 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:18:59,862 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-11-23 15:18:59,862 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:144, output treesize:136 [2018-11-23 15:19:00,056 WARN L180 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2018-11-23 15:19:00,134 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 4 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 64 [2018-11-23 15:19:00,151 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:19:00,159 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 51 treesize of output 41 [2018-11-23 15:19:00,160 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 15:19:00,184 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:19:00,200 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 57 treesize of output 52 [2018-11-23 15:19:00,201 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 15:19:00,247 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:19:00,247 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 32 [2018-11-23 15:19:00,248 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 15:19:00,264 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:19:00,268 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:19:00,277 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 44 [2018-11-23 15:19:00,278 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-11-23 15:19:00,301 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:19:00,303 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 26 treesize of output 16 [2018-11-23 15:19:00,304 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 15:19:00,324 INFO L267 ElimStorePlain]: Start of recursive call 2: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:19:00,331 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:19:00,332 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 7 variables, input treesize:150, output treesize:10 [2018-11-23 15:19:00,346 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:19:00,347 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-11-23 15:19:00,347 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 15:19:00,354 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 15:19:00,354 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:11 [2018-11-23 15:19:00,391 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 15:19:00,391 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 15:19:00,521 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 15:19:00,526 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 15:19:00,528 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 15:19:00,531 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 15:19:00,532 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 15:19:00,536 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 15:19:00,557 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 3 xjuncts. [2018-11-23 15:19:00,558 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 2 variables, input treesize:46, output treesize:105 [2018-11-23 15:19:08,502 WARN L180 SmtUtils]: Spent 7.85 s on a formula simplification. DAG size of input: 54 DAG size of output: 36 [2018-11-23 15:19:12,142 WARN L180 SmtUtils]: Spent 3.60 s on a formula simplification. DAG size of input: 36 DAG size of output: 23 [2018-11-23 15:19:14,187 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 26 [2018-11-23 15:19:14,201 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 42 treesize of output 37 [2018-11-23 15:19:14,201 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 15:19:14,202 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-11-23 15:19:14,203 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 15:19:14,209 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-11-23 15:19:14,209 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 15:19:14,214 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-11-23 15:19:14,214 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:57, output treesize:72 [2018-11-23 15:19:16,275 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 33 [2018-11-23 15:19:18,334 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 48 [2018-11-23 15:19:18,395 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 15:19:18,400 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 15:19:18,437 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 15:19:18,439 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:19:18,462 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 15:19:18,466 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 15:19:18,479 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 3 dim-2 vars, End of recursive call: 10 dim-0 vars, and 3 xjuncts. [2018-11-23 15:19:18,479 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 12 variables, input treesize:149, output treesize:108 [2018-11-23 15:19:22,613 WARN L180 SmtUtils]: Spent 4.02 s on a formula simplification. DAG size of input: 49 DAG size of output: 30 [2018-11-23 15:19:24,660 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 31 [2018-11-23 15:19:24,662 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-23 15:19:24,662 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 15:19:24,669 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 15:19:24,670 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 15:19:24,670 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 3 [2018-11-23 15:19:24,671 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 15:19:24,695 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 65 treesize of output 43 [2018-11-23 15:19:24,698 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-11-23 15:19:24,698 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 15:19:24,705 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:19:24,705 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 15:19:24,706 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 42 [2018-11-23 15:19:24,734 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:19:24,734 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 16 [2018-11-23 15:19:24,734 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 15:19:24,741 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 8 treesize of output 6 [2018-11-23 15:19:24,742 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 6 treesize of output 1 [2018-11-23 15:19:24,742 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-23 15:19:24,743 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:19:24,745 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:19:24,747 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:19:24,752 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:19:24,752 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 8 variables, input treesize:92, output treesize:4 [2018-11-23 15:19:24,777 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 15:19:24,792 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 15:19:24,792 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 20, 18] total 47 [2018-11-23 15:19:24,792 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 15:19:24,792 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-11-23 15:19:24,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-11-23 15:19:24,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=216, Invalid=2035, Unknown=5, NotChecked=0, Total=2256 [2018-11-23 15:19:24,794 INFO L87 Difference]: Start difference. First operand 158 states and 189 transitions. Second operand 35 states. [2018-11-23 15:19:25,990 WARN L180 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 86 [2018-11-23 15:19:26,408 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 78 [2018-11-23 15:19:26,631 WARN L180 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 82 [2018-11-23 15:19:27,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:19:27,447 INFO L93 Difference]: Finished difference Result 233 states and 250 transitions. [2018-11-23 15:19:27,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-11-23 15:19:27,447 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 39 [2018-11-23 15:19:27,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:19:27,448 INFO L225 Difference]: With dead ends: 233 [2018-11-23 15:19:27,448 INFO L226 Difference]: Without dead ends: 233 [2018-11-23 15:19:27,448 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 45 SyntacticMatches, 8 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1682 ImplicationChecksByTransitivity, 26.9s TimeCoverageRelationStatistics Valid=739, Invalid=4654, Unknown=9, NotChecked=0, Total=5402 [2018-11-23 15:19:27,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2018-11-23 15:19:27,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 167. [2018-11-23 15:19:27,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-11-23 15:19:27,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 200 transitions. [2018-11-23 15:19:27,451 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 200 transitions. Word has length 39 [2018-11-23 15:19:27,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:19:27,451 INFO L480 AbstractCegarLoop]: Abstraction has 167 states and 200 transitions. [2018-11-23 15:19:27,451 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-11-23 15:19:27,451 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 200 transitions. [2018-11-23 15:19:27,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-23 15:19:27,452 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:19:27,452 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] [2018-11-23 15:19:27,452 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr43REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr47REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION]=== [2018-11-23 15:19:27,452 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:19:27,452 INFO L82 PathProgramCache]: Analyzing trace with hash 114271885, now seen corresponding path program 1 times [2018-11-23 15:19:27,452 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 15:19:27,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:19:27,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:19:27,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:19:27,453 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 15:19:27,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:19:27,708 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 15:19:27,708 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 15:19:27,708 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 15:19:27,709 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 40 with the following transitions: [2018-11-23 15:19:27,709 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [6], [9], [12], [13], [16], [19], [20], [23], [26], [27], [30], [33], [34], [37], [40], [43], [48], [51], [187], [196], [197], [199], [200], [201], [210], [252], [256], [261], [262], [265], [267], [269], [276], [277], [278] [2018-11-23 15:19:27,710 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 15:19:27,711 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 15:19:27,768 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-23 15:19:27,768 INFO L272 AbstractInterpreter]: Visited 38 different actions 38 times. Never merged. Never widened. Performed 350 root evaluator evaluations with a maximum evaluation depth of 3. Performed 350 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 37 variables. [2018-11-23 15:19:27,779 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:19:27,779 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-23 15:19:27,779 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 15:19:27,779 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ee5af346-bf1c-44ad-a793-d5cc5b2233d9/bin-2019/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 15:19:27,788 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:19:27,788 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-23 15:19:27,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:19:27,820 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:19:27,822 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-23 15:19:27,822 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 15:19:27,825 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:19:27,825 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-23 15:19:27,837 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:19:27,838 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:19:27,839 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-11-23 15:19:27,839 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 15:19:27,860 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:19:27,860 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:18 [2018-11-23 15:19:27,876 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-11-23 15:19:27,878 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 15:19:27,878 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 15:19:27,884 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:19:27,924 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-11-23 15:19:27,927 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-11-23 15:19:27,927 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 15:19:27,930 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:19:27,949 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:19:27,950 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:37, output treesize:30 [2018-11-23 15:19:28,009 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:19:28,012 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 32 [2018-11-23 15:19:28,015 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 20 treesize of output 19 [2018-11-23 15:19:28,015 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 15:19:28,019 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:19:28,031 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:19:28,035 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 45 [2018-11-23 15:19:28,037 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2018-11-23 15:19:28,038 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 15:19:28,043 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:19:28,050 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:19:28,050 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:82, output treesize:44 [2018-11-23 15:19:28,076 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:19:28,080 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 26 [2018-11-23 15:19:28,082 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 14 treesize of output 13 [2018-11-23 15:19:28,082 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 15:19:28,086 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:19:28,101 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:19:28,104 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 51 treesize of output 52 [2018-11-23 15:19:28,106 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-23 15:19:28,106 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 15:19:28,113 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:19:28,125 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:19:28,125 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:75, output treesize:71 [2018-11-23 15:19:28,158 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:19:28,159 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 21 [2018-11-23 15:19:28,159 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 15:19:28,178 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:19:28,178 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:19:28,179 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:19:28,180 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 20 treesize of output 21 [2018-11-23 15:19:28,180 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 15:19:28,193 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:19:28,193 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:82, output treesize:78 [2018-11-23 15:19:28,234 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 32 treesize of output 38 [2018-11-23 15:19:28,238 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:19:28,239 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 31 [2018-11-23 15:19:28,239 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 15:19:28,247 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:19:28,268 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:19:28,271 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 79 treesize of output 78 [2018-11-23 15:19:28,274 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:19:28,275 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 16 treesize of output 23 [2018-11-23 15:19:28,276 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 15:19:28,287 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:19:28,301 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:19:28,301 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:100, output treesize:90 [2018-11-23 15:19:28,383 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:19:28,384 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:19:28,391 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 117 treesize of output 113 [2018-11-23 15:19:28,395 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2018-11-23 15:19:28,395 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 15:19:28,410 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:19:28,430 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 40 treesize of output 65 [2018-11-23 15:19:28,432 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2018-11-23 15:19:28,432 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 15:19:28,437 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:19:28,448 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 15:19:28,448 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:148, output treesize:94 [2018-11-23 15:19:28,479 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:19:28,480 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:19:28,486 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 111 treesize of output 107 [2018-11-23 15:19:28,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 10 treesize of output 9 [2018-11-23 15:19:28,488 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 15:19:28,503 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:19:28,523 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:19:28,530 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 34 treesize of output 59 [2018-11-23 15:19:28,532 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 18 treesize of output 17 [2018-11-23 15:19:28,533 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 15:19:28,540 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:19:28,556 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 15:19:28,556 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:136, output treesize:128 [2018-11-23 15:19:28,604 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 175 treesize of output 132 [2018-11-23 15:19:28,607 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:19:28,607 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 39 [2018-11-23 15:19:28,608 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 15:19:28,626 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:19:28,660 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 65 treesize of output 80 [2018-11-23 15:19:28,662 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:19:28,663 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 39 [2018-11-23 15:19:28,663 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 15:19:28,671 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:19:28,687 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 15:19:28,687 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:187, output treesize:163 [2018-11-23 15:19:28,790 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 164 treesize of output 125 [2018-11-23 15:19:28,794 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:19:28,796 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 137 treesize of output 166 [2018-11-23 15:19:28,796 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 15:19:28,818 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:19:28,852 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 66 treesize of output 97 [2018-11-23 15:19:28,855 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:19:28,856 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-11-23 15:19:28,856 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 15:19:28,867 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:19:28,890 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 15:19:28,890 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:189, output treesize:181 [2018-11-23 15:19:28,972 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 167 treesize of output 104 [2018-11-23 15:19:28,974 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:19:28,976 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 33 [2018-11-23 15:19:28,976 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 15:19:28,994 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:19:28,995 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 47 treesize of output 36 [2018-11-23 15:19:28,996 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 15:19:29,009 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:19:29,009 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 13 treesize of output 6 [2018-11-23 15:19:29,010 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 15:19:29,019 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 15:19:29,035 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 49 treesize of output 49 [2018-11-23 15:19:29,037 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:19:29,037 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-11-23 15:19:29,037 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 15:19:29,045 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-11-23 15:19:29,046 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-23 15:19:29,050 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:19:29,051 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 13 treesize of output 6 [2018-11-23 15:19:29,051 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-23 15:19:29,056 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:19:29,064 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 15:19:29,064 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 6 variables, input treesize:195, output treesize:18 [2018-11-23 15:19:29,125 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 15:19:29,125 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 15:19:29,432 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 15:19:29,438 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 15:19:29,439 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 15:19:29,445 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 15:19:29,446 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 15:19:29,452 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 15:19:29,512 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 15:19:29,516 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 15:19:29,517 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 15:19:29,523 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 15:19:29,571 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 15:19:29,576 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 15:19:29,577 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 15:19:29,580 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 15:19:29,581 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 15:19:29,585 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 15:19:29,624 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-11-23 15:19:29,627 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:19:29,628 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-11-23 15:19:29,630 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:19:29,658 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-2 vars, End of recursive call: 13 dim-0 vars, and 5 xjuncts. [2018-11-23 15:19:29,658 INFO L202 ElimStorePlain]: Needed 21 recursive calls to eliminate 6 variables, input treesize:146, output treesize:228 [2018-11-23 15:19:37,722 WARN L180 SmtUtils]: Spent 7.94 s on a formula simplification. DAG size of input: 104 DAG size of output: 45 [2018-11-23 15:19:39,358 WARN L180 SmtUtils]: Spent 416.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2018-11-23 15:19:43,677 WARN L180 SmtUtils]: Spent 558.00 ms on a formula simplification that was a NOOP. DAG size: 75 [2018-11-23 15:19:43,905 WARN L180 SmtUtils]: Spent 223.00 ms on a formula simplification that was a NOOP. DAG size: 148 [2018-11-23 15:19:43,926 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 257 treesize of output 219 [2018-11-23 15:19:43,928 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-11-23 15:19:43,932 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 136 treesize of output 134 [2018-11-23 15:19:43,932 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 15:19:43,935 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 145 treesize of output 143 [2018-11-23 15:19:43,936 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 15:19:43,953 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 204 treesize of output 208 [2018-11-23 15:19:43,954 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-11-23 15:19:43,959 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 171 treesize of output 169 [2018-11-23 15:19:43,959 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 15:19:43,975 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 166 treesize of output 170 [2018-11-23 15:19:43,976 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-11-23 15:19:44,000 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 183 treesize of output 187 [2018-11-23 15:19:44,001 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-11-23 15:19:44,015 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 213 treesize of output 217 [2018-11-23 15:19:44,016 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-11-23 15:19:44,033 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 248 treesize of output 210 [2018-11-23 15:19:44,034 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-11-23 15:19:44,053 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 283 treesize of output 245 [2018-11-23 15:19:44,054 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 2 xjuncts. [2018-11-23 15:19:44,087 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 179 treesize of output 183 [2018-11-23 15:19:44,088 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 2 xjuncts. [2018-11-23 15:19:44,118 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 258 treesize of output 220 [2018-11-23 15:19:44,119 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 2 xjuncts. [2018-11-23 15:19:44,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 2 new quantified variables, introduced 0 case distinctions, treesize of input 188 treesize of output 187 [2018-11-23 15:19:44,129 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-23 15:19:44,587 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 133 treesize of output 131 [2018-11-23 15:19:44,588 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-11-23 15:19:44,591 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 116 treesize of output 114 [2018-11-23 15:19:44,591 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-11-23 15:19:44,861 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 15:19:44,884 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 15:19:44,885 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 15:19:44,899 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 15:19:45,590 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 15:19:45,606 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 15:19:45,608 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 15:19:45,629 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 15:19:45,630 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 15:19:45,643 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 15:19:45,643 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-11-23 15:19:45,658 INFO L267 ElimStorePlain]: Start of recursive call 27: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:19:45,864 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-11-23 15:19:45,873 INFO L267 ElimStorePlain]: Start of recursive call 29: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:19:45,874 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2018-11-23 15:19:45,884 INFO L267 ElimStorePlain]: Start of recursive call 31: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:19:46,010 INFO L267 ElimStorePlain]: Start of recursive call 34: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 15:19:46,021 INFO L267 ElimStorePlain]: Start of recursive call 33: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 15:19:46,022 INFO L267 ElimStorePlain]: Start of recursive call 36: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 15:19:46,030 INFO L267 ElimStorePlain]: Start of recursive call 35: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 15:19:46,031 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2018-11-23 15:19:46,037 INFO L267 ElimStorePlain]: Start of recursive call 37: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:19:46,038 INFO L267 ElimStorePlain]: Start of recursive call 40: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 15:19:46,052 INFO L267 ElimStorePlain]: Start of recursive call 39: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 15:19:46,275 INFO L267 ElimStorePlain]: Start of recursive call 1: 11 dim-0 vars, 2 dim-1 vars, 4 dim-2 vars, End of recursive call: 37 dim-0 vars, and 6 xjuncts. [2018-11-23 15:19:46,275 INFO L202 ElimStorePlain]: Needed 40 recursive calls to eliminate 17 variables, input treesize:291, output treesize:560 [2018-11-23 15:19:49,661 WARN L180 SmtUtils]: Spent 191.00 ms on a formula simplification that was a NOOP. DAG size: 201 [2018-11-23 15:19:51,826 WARN L180 SmtUtils]: Spent 1.42 s on a formula simplification that was a NOOP. DAG size: 201 [2018-11-23 15:20:03,347 WARN L180 SmtUtils]: Spent 4.20 s on a formula simplification that was a NOOP. DAG size: 202 [2018-11-23 15:20:03,361 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 184 treesize of output 161 [2018-11-23 15:20:03,405 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 9 treesize of output 8 [2018-11-23 15:20:03,405 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 15:20:03,424 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 15:20:03,425 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:20:03,427 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 15:20:03,431 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 45 treesize of output 67 [2018-11-23 15:20:03,467 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 36 [2018-11-23 15:20:03,469 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 15:20:03,471 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 29 treesize of output 39 [2018-11-23 15:20:03,473 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 15:20:03,474 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 15:20:03,474 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 15:20:03,476 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:20:03,477 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 0 case distinctions, treesize of input 26 treesize of output 56 [2018-11-23 15:20:03,477 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 15:20:03,488 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:20:03,502 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 15:20:03,502 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 15:20:03,503 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 15:20:03,506 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 0 case distinctions, treesize of input 29 treesize of output 49 [2018-11-23 15:20:03,508 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 15:20:03,509 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 15:20:03,509 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:20:03,516 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 50 [2018-11-23 15:20:03,516 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-23 15:20:03,528 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:20:03,548 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 15:20:03,571 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 33 treesize of output 27 [2018-11-23 15:20:03,573 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 15:20:03,573 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 15:20:03,573 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 15:20:03,576 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 23 treesize of output 18 [2018-11-23 15:20:03,576 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-23 15:20:03,581 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:20:03,583 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 35 [2018-11-23 15:20:03,585 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 15:20:03,585 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 15:20:03,586 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 15:20:03,588 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2018-11-23 15:20:03,588 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-23 15:20:03,595 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:20:03,605 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 15:20:03,626 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 15:20:04,045 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 188 treesize of output 133 [2018-11-23 15:20:04,072 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-11-23 15:20:04,072 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-11-23 15:20:04,082 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 15:20:04,083 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:20:04,085 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 15:20:04,088 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 83 [2018-11-23 15:20:04,129 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 36 [2018-11-23 15:20:04,130 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 15:20:04,131 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 29 treesize of output 39 [2018-11-23 15:20:04,134 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 15:20:04,135 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 15:20:04,135 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 15:20:04,136 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 15:20:04,137 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 55 [2018-11-23 15:20:04,137 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-11-23 15:20:04,145 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:20:04,156 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 15:20:04,157 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 15:20:04,157 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:20:04,159 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 15:20:04,159 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 29 treesize of output 47 [2018-11-23 15:20:04,161 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 15:20:04,162 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 15:20:04,162 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 15:20:04,164 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 15:20:04,164 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 57 [2018-11-23 15:20:04,165 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-11-23 15:20:04,174 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:20:04,184 INFO L267 ElimStorePlain]: Start of recursive call 17: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 15:20:04,200 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 51 treesize of output 41 [2018-11-23 15:20:04,202 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 15:20:04,202 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 15:20:04,205 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 35 treesize of output 34 [2018-11-23 15:20:04,205 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-11-23 15:20:04,210 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:20:04,212 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 39 [2018-11-23 15:20:04,213 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 15:20:04,214 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 15:20:04,225 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 33 treesize of output 30 [2018-11-23 15:20:04,225 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-11-23 15:20:04,231 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:20:04,242 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 15:20:04,257 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 15:20:04,709 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 148 treesize of output 109 [2018-11-23 15:20:04,712 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-11-23 15:20:04,712 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-11-23 15:20:04,752 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 88 treesize of output 108 [2018-11-23 15:20:04,861 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 111 [2018-11-23 15:20:04,871 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 72 treesize of output 77 [2018-11-23 15:20:04,871 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 2 xjuncts. [2018-11-23 15:20:04,873 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-23 15:20:04,873 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-11-23 15:20:04,948 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 77 [2018-11-23 15:20:04,948 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-11-23 15:20:05,004 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 15:20:05,011 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 82 treesize of output 76 [2018-11-23 15:20:05,013 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 24 [2018-11-23 15:20:05,015 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 15:20:05,017 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 34 [2018-11-23 15:20:05,028 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 15:20:05,030 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 15:20:05,032 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 15:20:05,035 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 24 treesize of output 31 [2018-11-23 15:20:05,036 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 2 xjuncts. [2018-11-23 15:20:05,057 INFO L267 ElimStorePlain]: Start of recursive call 34: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 15:20:05,071 INFO L267 ElimStorePlain]: Start of recursive call 33: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 15:20:05,091 INFO L267 ElimStorePlain]: Start of recursive call 32: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 15:20:05,180 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 52 treesize of output 52 [2018-11-23 15:20:05,183 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 30 treesize of output 22 [2018-11-23 15:20:05,183 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2018-11-23 15:20:05,401 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 15:20:05,401 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.UnsupportedOperationException: nested self-update not yet implemented: (store (store v_arrayElimCell_89 (+ main_~bcki~0.offset 8) v_DerPreprocessor_36) (+ main_~bcki~0.offset 4) 0) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.DerPreprocessor.constructReplacementForStoreCase(DerPreprocessor.java:248) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.DerPreprocessor.constructReplacement(DerPreprocessor.java:219) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.DerPreprocessor.constructReplacement(DerPreprocessor.java:208) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.DerPreprocessor.convert(DerPreprocessor.java:191) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.cacheConvert(TermTransformer.java:131) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.access$0(TermTransformer.java:127) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$Convert.walk(TermTransformer.java:79) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:122) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:113) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.transform(TermTransformer.java:253) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.Elim1Store.elim1(Elim1Store.java:211) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:221) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.elimAllRec(ElimStorePlain.java:199) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:293) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:245) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java: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-11-23 15:20:05,403 INFO L168 Benchmark]: Toolchain (without parser) took 72471.35 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 402.7 MB). Free memory was 952.8 MB in the beginning and 1.0 GB in the end (delta: -83.8 MB). Peak memory consumption was 318.8 MB. Max. memory is 11.5 GB. [2018-11-23 15:20:05,404 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 15:20:05,404 INFO L168 Benchmark]: CACSL2BoogieTranslator took 341.32 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 163.6 MB). Free memory was 952.8 MB in the beginning and 1.1 GB in the end (delta: -195.0 MB). Peak memory consumption was 29.1 MB. Max. memory is 11.5 GB. [2018-11-23 15:20:05,404 INFO L168 Benchmark]: Boogie Procedure Inliner took 21.19 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 15:20:05,404 INFO L168 Benchmark]: Boogie Preprocessor took 29.26 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.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. [2018-11-23 15:20:05,405 INFO L168 Benchmark]: RCFGBuilder took 468.83 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: 48.5 MB). Peak memory consumption was 48.5 MB. Max. memory is 11.5 GB. [2018-11-23 15:20:05,405 INFO L168 Benchmark]: TraceAbstraction took 71607.97 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 239.1 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 59.3 MB). Peak memory consumption was 298.4 MB. Max. memory is 11.5 GB. [2018-11-23 15:20:05,406 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.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 341.32 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 163.6 MB). Free memory was 952.8 MB in the beginning and 1.1 GB in the end (delta: -195.0 MB). Peak memory consumption was 29.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 21.19 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 29.26 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.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 468.83 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: 48.5 MB). Peak memory consumption was 48.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 71607.97 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 239.1 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 59.3 MB). Peak memory consumption was 298.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: UnsupportedOperationException: nested self-update not yet implemented: (store (store v_arrayElimCell_89 (+ main_~bcki~0.offset 8) v_DerPreprocessor_36) (+ main_~bcki~0.offset 4) 0) de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: UnsupportedOperationException: nested self-update not yet implemented: (store (store v_arrayElimCell_89 (+ main_~bcki~0.offset 8) v_DerPreprocessor_36) (+ main_~bcki~0.offset 4) 0): de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.DerPreprocessor.constructReplacementForStoreCase(DerPreprocessor.java:248) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.23-aa41828 [2018-11-23 15:20:06,776 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 15:20:06,777 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 15:20:06,785 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 15:20:06,785 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 15:20:06,786 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 15:20:06,787 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 15:20:06,788 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 15:20:06,789 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 15:20:06,790 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 15:20:06,790 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 15:20:06,790 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 15:20:06,791 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 15:20:06,792 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 15:20:06,793 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 15:20:06,793 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 15:20:06,794 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 15:20:06,795 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 15:20:06,796 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 15:20:06,797 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 15:20:06,798 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 15:20:06,799 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 15:20:06,801 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 15:20:06,801 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 15:20:06,801 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 15:20:06,802 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 15:20:06,802 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 15:20:06,803 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 15:20:06,804 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 15:20:06,805 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 15:20:06,805 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 15:20:06,805 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 15:20:06,805 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 15:20:06,806 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 15:20:06,806 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 15:20:06,807 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 15:20:06,808 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_ee5af346-bf1c-44ad-a793-d5cc5b2233d9/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2018-11-23 15:20:06,818 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 15:20:06,818 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 15:20:06,819 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 15:20:06,819 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 15:20:06,819 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-23 15:20:06,819 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-23 15:20:06,819 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-23 15:20:06,819 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-23 15:20:06,819 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-23 15:20:06,820 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-23 15:20:06,820 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 15:20:06,820 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 15:20:06,820 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 15:20:06,821 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 15:20:06,821 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 15:20:06,821 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 15:20:06,821 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 15:20:06,821 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 15:20:06,821 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-11-23 15:20:06,821 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-11-23 15:20:06,821 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-11-23 15:20:06,822 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 15:20:06,822 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 15:20:06,822 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 15:20:06,822 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 15:20:06,822 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 15:20:06,822 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 15:20:06,822 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 15:20:06,824 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 15:20:06,824 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 15:20:06,824 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 15:20:06,825 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 15:20:06,825 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 15:20:06,825 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-11-23 15:20:06,825 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 15:20:06,825 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 15:20:06,825 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_ee5af346-bf1c-44ad-a793-d5cc5b2233d9/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 -> 109d156101f4cfba3ce2d0d8043b4202b4256b37 [2018-11-23 15:20:06,855 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 15:20:06,864 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 15:20:06,867 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 15:20:06,868 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 15:20:06,868 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 15:20:06,869 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_ee5af346-bf1c-44ad-a793-d5cc5b2233d9/bin-2019/utaipan/../../sv-benchmarks/c/forester-heap/sll-buckets_true-unreach-call_true-valid-memsafety.i [2018-11-23 15:20:06,910 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ee5af346-bf1c-44ad-a793-d5cc5b2233d9/bin-2019/utaipan/data/57149a5a4/6866908c84714ee4bb08e4f9bed549fa/FLAG1ba6dc9d9 [2018-11-23 15:20:07,253 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 15:20:07,253 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_ee5af346-bf1c-44ad-a793-d5cc5b2233d9/sv-benchmarks/c/forester-heap/sll-buckets_true-unreach-call_true-valid-memsafety.i [2018-11-23 15:20:07,263 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ee5af346-bf1c-44ad-a793-d5cc5b2233d9/bin-2019/utaipan/data/57149a5a4/6866908c84714ee4bb08e4f9bed549fa/FLAG1ba6dc9d9 [2018-11-23 15:20:07,272 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_ee5af346-bf1c-44ad-a793-d5cc5b2233d9/bin-2019/utaipan/data/57149a5a4/6866908c84714ee4bb08e4f9bed549fa [2018-11-23 15:20:07,275 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 15:20:07,276 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 15:20:07,277 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 15:20:07,277 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 15:20:07,280 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 15:20:07,281 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:20:07" (1/1) ... [2018-11-23 15:20:07,283 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35f9999 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:20:07, skipping insertion in model container [2018-11-23 15:20:07,283 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:20:07" (1/1) ... [2018-11-23 15:20:07,291 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 15:20:07,323 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 15:20:07,557 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 15:20:07,567 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 15:20:07,605 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 15:20:07,683 INFO L195 MainTranslator]: Completed translation [2018-11-23 15:20:07,683 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:20:07 WrapperNode [2018-11-23 15:20:07,683 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 15:20:07,684 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 15:20:07,684 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 15:20:07,684 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 15:20:07,689 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:20:07" (1/1) ... [2018-11-23 15:20:07,698 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:20:07" (1/1) ... [2018-11-23 15:20:07,702 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 15:20:07,703 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 15:20:07,703 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 15:20:07,703 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 15:20:07,708 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:20:07" (1/1) ... [2018-11-23 15:20:07,709 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:20:07" (1/1) ... [2018-11-23 15:20:07,711 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:20:07" (1/1) ... [2018-11-23 15:20:07,711 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:20:07" (1/1) ... [2018-11-23 15:20:07,719 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:20:07" (1/1) ... [2018-11-23 15:20:07,724 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:20:07" (1/1) ... [2018-11-23 15:20:07,725 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:20:07" (1/1) ... [2018-11-23 15:20:07,727 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 15:20:07,727 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 15:20:07,727 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 15:20:07,727 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 15:20:07,728 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:20:07" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ee5af346-bf1c-44ad-a793-d5cc5b2233d9/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 15:20:07,761 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 15:20:07,761 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-23 15:20:07,761 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 15:20:07,761 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 15:20:07,761 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 15:20:07,761 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 15:20:07,762 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-23 15:20:07,762 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-23 15:20:07,762 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 15:20:07,762 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-23 15:20:07,762 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 15:20:07,762 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 15:20:08,320 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 15:20:08,320 INFO L280 CfgBuilder]: Removed 15 assue(true) statements. [2018-11-23 15:20:08,320 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:20:08 BoogieIcfgContainer [2018-11-23 15:20:08,321 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 15:20:08,321 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 15:20:08,321 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 15:20:08,323 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 15:20:08,323 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 03:20:07" (1/3) ... [2018-11-23 15:20:08,323 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2efc5e21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:20:08, skipping insertion in model container [2018-11-23 15:20:08,324 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:20:07" (2/3) ... [2018-11-23 15:20:08,324 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2efc5e21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:20:08, skipping insertion in model container [2018-11-23 15:20:08,324 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:20:08" (3/3) ... [2018-11-23 15:20:08,325 INFO L112 eAbstractionObserver]: Analyzing ICFG sll-buckets_true-unreach-call_true-valid-memsafety.i [2018-11-23 15:20:08,330 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 15:20:08,335 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 65 error locations. [2018-11-23 15:20:08,345 INFO L257 AbstractCegarLoop]: Starting to check reachability of 65 error locations. [2018-11-23 15:20:08,359 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 15:20:08,360 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 15:20:08,360 INFO L383 AbstractCegarLoop]: Hoare is false [2018-11-23 15:20:08,360 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 15:20:08,360 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 15:20:08,360 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 15:20:08,360 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 15:20:08,360 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 15:20:08,360 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 15:20:08,370 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states. [2018-11-23 15:20:08,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-11-23 15:20:08,375 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:20:08,376 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:20:08,377 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr45REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr55REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr37REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2018-11-23 15:20:08,381 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:20:08,381 INFO L82 PathProgramCache]: Analyzing trace with hash 115064501, now seen corresponding path program 1 times [2018-11-23 15:20:08,383 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 15:20:08,384 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ee5af346-bf1c-44ad-a793-d5cc5b2233d9/bin-2019/utaipan/cvc4nyu Starting monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 15:20:08,397 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:20:08,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:20:08,430 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:20:08,459 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-23 15:20:08,460 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 15:20:08,465 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:20:08,465 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-23 15:20:08,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 15:20:08,480 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 15:20:08,482 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 15:20:08,483 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 15:20:08,485 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 15:20:08,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 15:20:08,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 15:20:08,494 INFO L87 Difference]: Start difference. First operand 142 states. Second operand 3 states. [2018-11-23 15:20:08,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:20:08,824 INFO L93 Difference]: Finished difference Result 170 states and 179 transitions. [2018-11-23 15:20:08,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 15:20:08,826 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-11-23 15:20:08,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:20:08,833 INFO L225 Difference]: With dead ends: 170 [2018-11-23 15:20:08,833 INFO L226 Difference]: Without dead ends: 166 [2018-11-23 15:20:08,834 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 15:20:08,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-11-23 15:20:08,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 135. [2018-11-23 15:20:08,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-11-23 15:20:08,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 142 transitions. [2018-11-23 15:20:08,865 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 142 transitions. Word has length 7 [2018-11-23 15:20:08,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:20:08,865 INFO L480 AbstractCegarLoop]: Abstraction has 135 states and 142 transitions. [2018-11-23 15:20:08,865 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 15:20:08,865 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 142 transitions. [2018-11-23 15:20:08,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-11-23 15:20:08,866 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:20:08,866 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:20:08,866 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr45REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr55REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr37REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2018-11-23 15:20:08,866 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:20:08,866 INFO L82 PathProgramCache]: Analyzing trace with hash 115064502, now seen corresponding path program 1 times [2018-11-23 15:20:08,866 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 15:20:08,867 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ee5af346-bf1c-44ad-a793-d5cc5b2233d9/bin-2019/utaipan/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 15:20:08,878 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:20:08,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:20:08,895 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:20:08,903 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-23 15:20:08,903 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 15:20:08,908 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:20:08,908 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-23 15:20:08,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 15:20:08,915 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 15:20:08,919 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 15:20:08,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 15:20:08,921 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 15:20:08,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 15:20:08,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 15:20:08,922 INFO L87 Difference]: Start difference. First operand 135 states and 142 transitions. Second operand 3 states. [2018-11-23 15:20:09,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:20:09,203 INFO L93 Difference]: Finished difference Result 164 states and 173 transitions. [2018-11-23 15:20:09,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 15:20:09,204 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-11-23 15:20:09,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:20:09,205 INFO L225 Difference]: With dead ends: 164 [2018-11-23 15:20:09,205 INFO L226 Difference]: Without dead ends: 164 [2018-11-23 15:20:09,206 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 15:20:09,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2018-11-23 15:20:09,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 131. [2018-11-23 15:20:09,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-11-23 15:20:09,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 138 transitions. [2018-11-23 15:20:09,213 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 138 transitions. Word has length 7 [2018-11-23 15:20:09,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:20:09,214 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 138 transitions. [2018-11-23 15:20:09,214 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 15:20:09,214 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 138 transitions. [2018-11-23 15:20:09,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 15:20:09,214 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:20:09,215 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:20:09,215 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr45REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr55REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr37REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2018-11-23 15:20:09,215 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:20:09,215 INFO L82 PathProgramCache]: Analyzing trace with hash 1484899996, now seen corresponding path program 1 times [2018-11-23 15:20:09,216 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 15:20:09,216 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ee5af346-bf1c-44ad-a793-d5cc5b2233d9/bin-2019/utaipan/cvc4nyu Starting monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 15:20:09,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:20:09,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:20:09,265 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:20:09,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, 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-11-23 15:20:09,281 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 15:20:09,290 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:20:09,290 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:11 [2018-11-23 15:20:09,309 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-23 15:20:09,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 8 treesize of output 7 [2018-11-23 15:20:09,311 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 15:20:09,314 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:20:09,320 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:20:09,320 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:17 [2018-11-23 15:20:09,334 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-11-23 15:20:09,350 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-11-23 15:20:09,351 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 15:20:09,353 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:20:09,358 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 15:20:09,358 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:13 [2018-11-23 15:20:09,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 15:20:09,377 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 15:20:09,378 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 15:20:09,378 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 15:20:09,378 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 15:20:09,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 15:20:09,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-23 15:20:09,379 INFO L87 Difference]: Start difference. First operand 131 states and 138 transitions. Second operand 7 states. [2018-11-23 15:20:10,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:20:10,092 INFO L93 Difference]: Finished difference Result 175 states and 184 transitions. [2018-11-23 15:20:10,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 15:20:10,092 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2018-11-23 15:20:10,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:20:10,093 INFO L225 Difference]: With dead ends: 175 [2018-11-23 15:20:10,094 INFO L226 Difference]: Without dead ends: 175 [2018-11-23 15:20:10,094 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2018-11-23 15:20:10,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-11-23 15:20:10,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 135. [2018-11-23 15:20:10,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-11-23 15:20:10,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 153 transitions. [2018-11-23 15:20:10,102 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 153 transitions. Word has length 13 [2018-11-23 15:20:10,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:20:10,102 INFO L480 AbstractCegarLoop]: Abstraction has 135 states and 153 transitions. [2018-11-23 15:20:10,102 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 15:20:10,103 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 153 transitions. [2018-11-23 15:20:10,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 15:20:10,104 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:20:10,104 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:20:10,105 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr45REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr55REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr37REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2018-11-23 15:20:10,105 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:20:10,105 INFO L82 PathProgramCache]: Analyzing trace with hash 1484899997, now seen corresponding path program 1 times [2018-11-23 15:20:10,105 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 15:20:10,106 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ee5af346-bf1c-44ad-a793-d5cc5b2233d9/bin-2019/utaipan/cvc4nyu Starting monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 15:20:10,126 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:20:10,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:20:10,159 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:20:10,162 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-23 15:20:10,162 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 15:20:10,167 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:20:10,167 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-23 15:20:10,187 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-23 15:20:10,191 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 15:20:10,192 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 15:20:10,196 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:20:10,210 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-23 15:20:10,212 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 15:20:10,212 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 15:20:10,214 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:20:10,221 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:20:10,222 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2018-11-23 15:20:10,234 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-11-23 15:20:10,237 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-11-23 15:20:10,237 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 15:20:10,239 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:20:10,247 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-11-23 15:20:10,249 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-11-23 15:20:10,249 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 15:20:10,251 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:20:10,254 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:20:10,254 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:31, output treesize:9 [2018-11-23 15:20:10,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 15:20:10,271 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 15:20:10,272 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 15:20:10,273 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 15:20:10,273 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 15:20:10,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 15:20:10,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-23 15:20:10,273 INFO L87 Difference]: Start difference. First operand 135 states and 153 transitions. Second operand 6 states. [2018-11-23 15:20:10,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:20:10,885 INFO L93 Difference]: Finished difference Result 185 states and 215 transitions. [2018-11-23 15:20:10,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 15:20:10,886 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-11-23 15:20:10,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:20:10,887 INFO L225 Difference]: With dead ends: 185 [2018-11-23 15:20:10,887 INFO L226 Difference]: Without dead ends: 185 [2018-11-23 15:20:10,887 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-11-23 15:20:10,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-11-23 15:20:10,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 131. [2018-11-23 15:20:10,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-11-23 15:20:10,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 149 transitions. [2018-11-23 15:20:10,893 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 149 transitions. Word has length 13 [2018-11-23 15:20:10,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:20:10,893 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 149 transitions. [2018-11-23 15:20:10,894 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 15:20:10,894 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 149 transitions. [2018-11-23 15:20:10,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 15:20:10,894 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:20:10,894 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:20:10,895 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr45REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr55REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr37REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2018-11-23 15:20:10,895 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:20:10,895 INFO L82 PathProgramCache]: Analyzing trace with hash 1974844035, now seen corresponding path program 1 times [2018-11-23 15:20:10,895 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 15:20:10,896 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ee5af346-bf1c-44ad-a793-d5cc5b2233d9/bin-2019/utaipan/cvc4nyu Starting monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 15:20:10,908 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:20:10,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:20:10,950 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:20:10,954 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-23 15:20:10,954 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 15:20:10,956 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:20:10,956 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-23 15:20:10,966 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-23 15:20:10,968 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 15:20:10,968 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 15:20:10,970 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:20:10,975 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:20:10,975 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:11 [2018-11-23 15:20:10,985 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-11-23 15:20:10,988 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-11-23 15:20:10,988 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 15:20:10,990 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:20:10,991 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:20:10,991 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:7 [2018-11-23 15:20:11,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 15:20:11,003 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 15:20:11,005 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 15:20:11,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 15:20:11,005 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 15:20:11,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 15:20:11,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-23 15:20:11,006 INFO L87 Difference]: Start difference. First operand 131 states and 149 transitions. Second operand 6 states. [2018-11-23 15:20:11,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:20:11,518 INFO L93 Difference]: Finished difference Result 168 states and 179 transitions. [2018-11-23 15:20:11,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 15:20:11,518 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-11-23 15:20:11,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:20:11,519 INFO L225 Difference]: With dead ends: 168 [2018-11-23 15:20:11,519 INFO L226 Difference]: Without dead ends: 168 [2018-11-23 15:20:11,519 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-23 15:20:11,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2018-11-23 15:20:11,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 130. [2018-11-23 15:20:11,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-11-23 15:20:11,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 148 transitions. [2018-11-23 15:20:11,524 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 148 transitions. Word has length 19 [2018-11-23 15:20:11,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:20:11,524 INFO L480 AbstractCegarLoop]: Abstraction has 130 states and 148 transitions. [2018-11-23 15:20:11,524 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 15:20:11,524 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 148 transitions. [2018-11-23 15:20:11,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 15:20:11,524 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:20:11,525 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:20:11,525 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr45REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr55REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr37REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2018-11-23 15:20:11,525 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:20:11,525 INFO L82 PathProgramCache]: Analyzing trace with hash 1974844036, now seen corresponding path program 1 times [2018-11-23 15:20:11,525 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 15:20:11,525 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ee5af346-bf1c-44ad-a793-d5cc5b2233d9/bin-2019/utaipan/cvc4nyu Starting monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 15:20:11,544 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:20:11,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:20:11,593 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:20:11,597 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-23 15:20:11,597 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 15:20:11,601 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:20:11,601 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-23 15:20:11,617 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-23 15:20:11,619 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 15:20:11,620 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 15:20:11,622 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:20:11,633 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-23 15:20:11,636 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 15:20:11,637 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 15:20:11,639 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:20:11,646 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:20:11,646 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:28, output treesize:19 [2018-11-23 15:20:11,660 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-11-23 15:20:11,663 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-11-23 15:20:11,663 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 15:20:11,666 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:20:11,677 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-11-23 15:20:11,679 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-11-23 15:20:11,679 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 15:20:11,681 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:20:11,684 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:20:11,685 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:33, output treesize:11 [2018-11-23 15:20:11,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 15:20:11,704 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 15:20:11,705 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 15:20:11,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 15:20:11,706 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 15:20:11,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 15:20:11,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-23 15:20:11,706 INFO L87 Difference]: Start difference. First operand 130 states and 148 transitions. Second operand 6 states. [2018-11-23 15:20:12,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:20:12,252 INFO L93 Difference]: Finished difference Result 181 states and 211 transitions. [2018-11-23 15:20:12,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 15:20:12,253 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-11-23 15:20:12,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:20:12,254 INFO L225 Difference]: With dead ends: 181 [2018-11-23 15:20:12,254 INFO L226 Difference]: Without dead ends: 181 [2018-11-23 15:20:12,254 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-11-23 15:20:12,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2018-11-23 15:20:12,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 127. [2018-11-23 15:20:12,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-11-23 15:20:12,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 145 transitions. [2018-11-23 15:20:12,259 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 145 transitions. Word has length 19 [2018-11-23 15:20:12,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:20:12,259 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 145 transitions. [2018-11-23 15:20:12,259 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 15:20:12,259 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 145 transitions. [2018-11-23 15:20:12,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 15:20:12,260 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:20:12,260 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] [2018-11-23 15:20:12,261 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr45REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr55REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr37REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2018-11-23 15:20:12,261 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:20:12,261 INFO L82 PathProgramCache]: Analyzing trace with hash 415286056, now seen corresponding path program 1 times [2018-11-23 15:20:12,262 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 15:20:12,262 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ee5af346-bf1c-44ad-a793-d5cc5b2233d9/bin-2019/utaipan/cvc4nyu Starting monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 15:20:12,273 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:20:12,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:20:12,355 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:20:12,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 6 treesize of output 5 [2018-11-23 15:20:12,360 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 15:20:12,361 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:20:12,361 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-23 15:20:12,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 15:20:12,367 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 15:20:12,369 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 15:20:12,369 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 15:20:12,369 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 15:20:12,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 15:20:12,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 15:20:12,370 INFO L87 Difference]: Start difference. First operand 127 states and 145 transitions. Second operand 3 states. [2018-11-23 15:20:12,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:20:12,526 INFO L93 Difference]: Finished difference Result 131 states and 150 transitions. [2018-11-23 15:20:12,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 15:20:12,526 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-23 15:20:12,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:20:12,527 INFO L225 Difference]: With dead ends: 131 [2018-11-23 15:20:12,527 INFO L226 Difference]: Without dead ends: 131 [2018-11-23 15:20:12,527 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 15:20:12,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-11-23 15:20:12,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 122. [2018-11-23 15:20:12,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-11-23 15:20:12,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 140 transitions. [2018-11-23 15:20:12,530 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 140 transitions. Word has length 24 [2018-11-23 15:20:12,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:20:12,530 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 140 transitions. [2018-11-23 15:20:12,530 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 15:20:12,531 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 140 transitions. [2018-11-23 15:20:12,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 15:20:12,531 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:20:12,531 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] [2018-11-23 15:20:12,531 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr45REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr55REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr37REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2018-11-23 15:20:12,531 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:20:12,531 INFO L82 PathProgramCache]: Analyzing trace with hash 415286057, now seen corresponding path program 1 times [2018-11-23 15:20:12,532 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 15:20:12,532 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ee5af346-bf1c-44ad-a793-d5cc5b2233d9/bin-2019/utaipan/cvc4nyu Starting monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 15:20:12,544 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:20:12,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:20:12,611 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:20:12,614 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-23 15:20:12,615 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 15:20:12,618 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:20:12,618 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-23 15:20:12,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 15:20:12,623 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 15:20:12,625 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 15:20:12,625 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 15:20:12,625 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 15:20:12,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 15:20:12,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 15:20:12,625 INFO L87 Difference]: Start difference. First operand 122 states and 140 transitions. Second operand 3 states. [2018-11-23 15:20:12,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:20:12,799 INFO L93 Difference]: Finished difference Result 126 states and 145 transitions. [2018-11-23 15:20:12,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 15:20:12,800 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-23 15:20:12,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:20:12,800 INFO L225 Difference]: With dead ends: 126 [2018-11-23 15:20:12,800 INFO L226 Difference]: Without dead ends: 126 [2018-11-23 15:20:12,801 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 15:20:12,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-11-23 15:20:12,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 117. [2018-11-23 15:20:12,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-11-23 15:20:12,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 135 transitions. [2018-11-23 15:20:12,802 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 135 transitions. Word has length 24 [2018-11-23 15:20:12,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:20:12,803 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 135 transitions. [2018-11-23 15:20:12,803 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 15:20:12,803 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 135 transitions. [2018-11-23 15:20:12,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 15:20:12,803 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:20:12,803 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:20:12,803 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr45REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr55REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr37REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2018-11-23 15:20:12,803 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:20:12,803 INFO L82 PathProgramCache]: Analyzing trace with hash -341986192, now seen corresponding path program 1 times [2018-11-23 15:20:12,804 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 15:20:12,804 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ee5af346-bf1c-44ad-a793-d5cc5b2233d9/bin-2019/utaipan/cvc4nyu Starting monitored process 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 15:20:12,815 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:20:12,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:20:12,926 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:20:12,930 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-23 15:20:12,930 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 15:20:12,937 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-23 15:20:12,937 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 15:20:12,942 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:20:12,942 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-11-23 15:20:12,952 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:20:12,953 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:20:12,954 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-11-23 15:20:12,954 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 15:20:12,964 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-11-23 15:20:12,964 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 15:20:12,971 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:20:12,971 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:18 [2018-11-23 15:20:13,013 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:20:13,014 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:20:13,015 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 13 treesize of output 4 [2018-11-23 15:20:13,015 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 15:20:13,032 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 24 [2018-11-23 15:20:13,033 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 15:20:13,048 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 15:20:13,048 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:27 [2018-11-23 15:20:13,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 15:20:13,117 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 15:20:13,119 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 15:20:13,119 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-23 15:20:13,119 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 15:20:13,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 15:20:13,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-11-23 15:20:13,119 INFO L87 Difference]: Start difference. First operand 117 states and 135 transitions. Second operand 8 states. [2018-11-23 15:20:14,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:20:14,297 INFO L93 Difference]: Finished difference Result 199 states and 219 transitions. [2018-11-23 15:20:14,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 15:20:14,298 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 26 [2018-11-23 15:20:14,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:20:14,300 INFO L225 Difference]: With dead ends: 199 [2018-11-23 15:20:14,300 INFO L226 Difference]: Without dead ends: 199 [2018-11-23 15:20:14,300 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2018-11-23 15:20:14,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2018-11-23 15:20:14,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 149. [2018-11-23 15:20:14,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-11-23 15:20:14,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 183 transitions. [2018-11-23 15:20:14,304 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 183 transitions. Word has length 26 [2018-11-23 15:20:14,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:20:14,304 INFO L480 AbstractCegarLoop]: Abstraction has 149 states and 183 transitions. [2018-11-23 15:20:14,304 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 15:20:14,304 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 183 transitions. [2018-11-23 15:20:14,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 15:20:14,305 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:20:14,305 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] [2018-11-23 15:20:14,305 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr45REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr55REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr37REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2018-11-23 15:20:14,305 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:20:14,305 INFO L82 PathProgramCache]: Analyzing trace with hash -2011636715, now seen corresponding path program 1 times [2018-11-23 15:20:14,305 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 15:20:14,305 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ee5af346-bf1c-44ad-a793-d5cc5b2233d9/bin-2019/utaipan/cvc4nyu Starting monitored process 11 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 15:20:14,322 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:20:14,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:20:14,361 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:20:14,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 15:20:14,372 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 15:20:14,374 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 15:20:14,374 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 15:20:14,374 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 15:20:14,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 15:20:14,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 15:20:14,374 INFO L87 Difference]: Start difference. First operand 149 states and 183 transitions. Second operand 4 states. [2018-11-23 15:20:14,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:20:14,624 INFO L93 Difference]: Finished difference Result 228 states and 274 transitions. [2018-11-23 15:20:14,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 15:20:14,624 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2018-11-23 15:20:14,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:20:14,625 INFO L225 Difference]: With dead ends: 228 [2018-11-23 15:20:14,625 INFO L226 Difference]: Without dead ends: 228 [2018-11-23 15:20:14,625 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-23 15:20:14,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2018-11-23 15:20:14,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 149. [2018-11-23 15:20:14,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-11-23 15:20:14,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 181 transitions. [2018-11-23 15:20:14,630 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 181 transitions. Word has length 27 [2018-11-23 15:20:14,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:20:14,630 INFO L480 AbstractCegarLoop]: Abstraction has 149 states and 181 transitions. [2018-11-23 15:20:14,630 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 15:20:14,630 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 181 transitions. [2018-11-23 15:20:14,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-23 15:20:14,631 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:20:14,631 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] [2018-11-23 15:20:14,631 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr45REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr55REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr37REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2018-11-23 15:20:14,632 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:20:14,632 INFO L82 PathProgramCache]: Analyzing trace with hash -1005661135, now seen corresponding path program 1 times [2018-11-23 15:20:14,632 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 15:20:14,632 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ee5af346-bf1c-44ad-a793-d5cc5b2233d9/bin-2019/utaipan/cvc4nyu Starting monitored process 12 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 15:20:14,645 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:20:14,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:20:14,747 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:20:14,750 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-23 15:20:14,750 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 15:20:14,756 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:20:14,757 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-23 15:20:14,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 13 treesize of output 10 [2018-11-23 15:20:14,768 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-23 15:20:14,768 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 15:20:14,771 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:20:14,782 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-23 15:20:14,787 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-23 15:20:14,787 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 15:20:14,791 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:20:14,798 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:20:14,798 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:37, output treesize:29 [2018-11-23 15:20:14,814 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:20:14,815 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:20:14,816 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-11-23 15:20:14,816 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 15:20:14,824 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:20:14,824 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:26 [2018-11-23 15:20:14,846 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 21 treesize of output 16 [2018-11-23 15:20:14,850 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:20:14,853 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 16 treesize of output 23 [2018-11-23 15:20:14,853 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 15:20:14,867 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:20:14,893 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 21 treesize of output 16 [2018-11-23 15:20:14,898 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:20:14,901 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-11-23 15:20:14,901 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 15:20:14,908 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:20:14,922 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:20:14,923 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:53, output treesize:35 [2018-11-23 15:20:14,986 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:20:15,011 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 45 [2018-11-23 15:20:15,016 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2018-11-23 15:20:15,017 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 15:20:15,030 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:20:15,078 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 29 treesize of output 34 [2018-11-23 15:20:15,082 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 20 treesize of output 19 [2018-11-23 15:20:15,083 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 15:20:15,089 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:20:15,104 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:20:15,104 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:82, output treesize:40 [2018-11-23 15:20:15,125 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:20:15,138 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 38 treesize of output 39 [2018-11-23 15:20:15,142 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-23 15:20:15,142 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 15:20:15,159 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:20:15,189 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 28 [2018-11-23 15:20:15,192 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 14 treesize of output 13 [2018-11-23 15:20:15,193 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 15:20:15,200 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:20:15,220 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:20:15,221 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:70, output treesize:62 [2018-11-23 15:20:15,262 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:20:15,268 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:20:15,269 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 13 treesize of output 4 [2018-11-23 15:20:15,269 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 15:20:15,299 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:20:15,299 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:67, output treesize:59 [2018-11-23 15:20:15,357 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 50 treesize of output 49 [2018-11-23 15:20:15,362 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:20:15,365 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 16 treesize of output 23 [2018-11-23 15:20:15,365 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 15:20:15,386 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:20:15,439 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 44 [2018-11-23 15:20:15,444 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:20:15,446 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 31 [2018-11-23 15:20:15,446 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 15:20:15,460 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:20:15,489 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:20:15,490 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:81, output treesize:63 [2018-11-23 15:20:15,671 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:20:15,737 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 98 [2018-11-23 15:20:15,748 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 75 treesize of output 74 [2018-11-23 15:20:15,749 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 15:20:15,950 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 56 treesize of output 73 [2018-11-23 15:20:15,951 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-23 15:20:15,990 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 15:20:16,068 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:20:16,109 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 95 treesize of output 102 [2018-11-23 15:20:16,127 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 104 treesize of output 88 [2018-11-23 15:20:16,128 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 15:20:16,218 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:20:16,415 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 4 case distinctions, treesize of input 71 treesize of output 79 [2018-11-23 15:20:16,415 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 4 xjuncts. [2018-11-23 15:20:16,498 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-23 15:20:16,502 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 15:20:16,519 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 84 [2018-11-23 15:20:16,525 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:20:16,525 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 15:20:16,532 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 44 treesize of output 52 [2018-11-23 15:20:16,533 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-23 15:20:16,554 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:20:16,640 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-11-23 15:20:16,641 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:117, output treesize:175 [2018-11-23 15:20:16,882 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 97 treesize of output 141 [2018-11-23 15:20:16,888 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 118 treesize of output 117 [2018-11-23 15:20:16,888 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 15:20:17,112 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:20:18,618 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 76 [2018-11-23 15:20:18,625 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:20:18,626 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 35 [2018-11-23 15:20:18,626 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 15:20:18,667 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:20:19,515 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:20:19,526 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 74 treesize of output 71 [2018-11-23 15:20:19,532 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 26 treesize of output 14 [2018-11-23 15:20:19,533 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 15:20:19,564 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:20:20,063 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 101 treesize of output 104 [2018-11-23 15:20:20,068 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 106 treesize of output 105 [2018-11-23 15:20:20,069 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-23 15:20:20,234 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:20:20,283 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 2 case distinctions, treesize of input 79 treesize of output 92 [2018-11-23 15:20:20,283 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-11-23 15:20:20,400 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 15:20:20,755 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 55 treesize of output 56 [2018-11-23 15:20:20,758 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 14 treesize of output 13 [2018-11-23 15:20:20,758 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-23 15:20:20,775 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:20:20,927 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 6 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-23 15:20:20,927 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 7 variables, input treesize:253, output treesize:153 [2018-11-23 15:20:21,117 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 156 treesize of output 126 [2018-11-23 15:20:21,131 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:20:21,132 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:20:21,298 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 1 new quantified variables, introduced 3 case distinctions, treesize of input 108 treesize of output 128 [2018-11-23 15:20:21,299 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-23 15:20:21,773 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:20:21,774 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 135 treesize of output 150 [2018-11-23 15:20:21,774 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 15:20:21,978 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 15:20:22,876 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 94 treesize of output 81 [2018-11-23 15:20:22,881 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:20:22,881 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 31 [2018-11-23 15:20:22,882 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 15:20:22,908 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:20:23,353 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 86 treesize of output 76 [2018-11-23 15:20:23,357 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:20:23,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 20 treesize of output 31 [2018-11-23 15:20:23,358 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-23 15:20:23,376 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:20:23,704 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 144 treesize of output 162 [2018-11-23 15:20:23,709 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:20:23,710 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 139 treesize of output 154 [2018-11-23 15:20:23,710 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-23 15:20:23,928 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:20:23,937 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 89 treesize of output 76 [2018-11-23 15:20:23,941 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:20:23,941 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 31 [2018-11-23 15:20:23,942 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-23 15:20:23,970 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:20:24,140 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 4 dim-2 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-11-23 15:20:24,140 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 7 variables, input treesize:251, output treesize:289 [2018-11-23 15:20:24,469 WARN L180 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 57 [2018-11-23 15:20:24,633 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 85 treesize of output 68 [2018-11-23 15:20:24,637 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:20:24,637 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 13 treesize of output 6 [2018-11-23 15:20:24,637 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 15:20:24,657 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 37 treesize of output 24 [2018-11-23 15:20:24,658 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 15:20:24,672 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 15:20:24,747 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 38 treesize of output 30 [2018-11-23 15:20:24,750 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-11-23 15:20:24,750 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 15:20:24,763 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:20:24,764 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 13 treesize of output 6 [2018-11-23 15:20:24,764 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 15:20:24,770 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:20:24,848 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 139 treesize of output 129 [2018-11-23 15:20:24,856 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 125 treesize of output 118 [2018-11-23 15:20:24,857 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-23 15:20:24,965 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 109 treesize of output 102 [2018-11-23 15:20:24,966 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-23 15:20:25,052 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:20:25,057 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 102 treesize of output 89 [2018-11-23 15:20:25,057 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-23 15:20:25,150 INFO L267 ElimStorePlain]: Start of recursive call 8: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:20:25,208 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 5 new quantified variables, introduced 1 case distinctions, treesize of input 83 treesize of output 63 [2018-11-23 15:20:25,213 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:20:25,227 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:20:25,245 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 54 [2018-11-23 15:20:25,245 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 2 xjuncts. [2018-11-23 15:20:25,318 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 30 treesize of output 21 [2018-11-23 15:20:25,318 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-23 15:20:25,320 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 24 treesize of output 15 [2018-11-23 15:20:25,320 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-11-23 15:20:25,374 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:20:25,376 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 53 treesize of output 48 [2018-11-23 15:20:25,377 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-11-23 15:20:25,415 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 32 treesize of output 23 [2018-11-23 15:20:25,415 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-11-23 15:20:25,443 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:20:25,444 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 13 [2018-11-23 15:20:25,444 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-11-23 15:20:25,452 INFO L267 ElimStorePlain]: Start of recursive call 12: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:20:25,458 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:20:25,458 INFO L202 ElimStorePlain]: Needed 18 recursive calls to eliminate 9 variables, input treesize:225, output treesize:7 [2018-11-23 15:20:25,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 15:20:25,538 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 15:20:25,540 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 15:20:25,540 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2018-11-23 15:20:25,540 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-23 15:20:25,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-23 15:20:25,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=284, Unknown=6, NotChecked=0, Total=342 [2018-11-23 15:20:25,540 INFO L87 Difference]: Start difference. First operand 149 states and 181 transitions. Second operand 19 states. [2018-11-23 15:20:41,137 WARN L180 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 60 [2018-11-23 15:20:43,532 WARN L180 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 56 [2018-11-23 15:20:44,276 WARN L180 SmtUtils]: Spent 555.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 80 [2018-11-23 15:20:45,114 WARN L180 SmtUtils]: Spent 746.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 84 [2018-11-23 15:20:45,869 WARN L180 SmtUtils]: Spent 572.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 118 [2018-11-23 15:20:47,172 WARN L180 SmtUtils]: Spent 729.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 122 [2018-11-23 15:20:48,593 WARN L180 SmtUtils]: Spent 360.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2018-11-23 15:20:48,942 WARN L180 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2018-11-23 15:20:50,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:20:50,046 INFO L93 Difference]: Finished difference Result 160 states and 180 transitions. [2018-11-23 15:20:50,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-23 15:20:50,046 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 30 [2018-11-23 15:20:50,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:20:50,047 INFO L225 Difference]: With dead ends: 160 [2018-11-23 15:20:50,047 INFO L226 Difference]: Without dead ends: 160 [2018-11-23 15:20:50,047 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=245, Invalid=1079, Unknown=8, NotChecked=0, Total=1332 [2018-11-23 15:20:50,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-11-23 15:20:50,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 130. [2018-11-23 15:20:50,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-11-23 15:20:50,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 148 transitions. [2018-11-23 15:20:50,050 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 148 transitions. Word has length 30 [2018-11-23 15:20:50,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:20:50,051 INFO L480 AbstractCegarLoop]: Abstraction has 130 states and 148 transitions. [2018-11-23 15:20:50,051 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-23 15:20:50,051 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 148 transitions. [2018-11-23 15:20:50,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-23 15:20:50,051 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:20:50,051 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:20:50,052 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr45REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr55REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr37REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2018-11-23 15:20:50,052 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:20:50,052 INFO L82 PathProgramCache]: Analyzing trace with hash 1346897253, now seen corresponding path program 1 times [2018-11-23 15:20:50,052 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 15:20:50,052 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ee5af346-bf1c-44ad-a793-d5cc5b2233d9/bin-2019/utaipan/cvc4nyu Starting monitored process 13 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 15:20:50,071 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:20:50,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:20:50,188 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:20:50,191 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-23 15:20:50,192 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 15:20:50,201 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-23 15:20:50,201 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 15:20:50,208 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:20:50,208 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-11-23 15:20:50,216 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:20:50,217 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-11-23 15:20:50,217 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 15:20:50,227 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:20:50,228 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:20:50,228 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-11-23 15:20:50,228 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 15:20:50,235 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:20:50,235 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:18 [2018-11-23 15:20:50,272 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:20:50,273 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 24 [2018-11-23 15:20:50,273 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 15:20:50,294 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:20:50,295 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:20:50,295 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2018-11-23 15:20:50,296 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 15:20:50,310 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 15:20:50,310 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:44, output treesize:38 [2018-11-23 15:20:50,365 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:20:50,367 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 15:20:50,367 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 19 treesize of output 13 [2018-11-23 15:20:50,368 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 15:20:50,390 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:20:50,391 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 34 [2018-11-23 15:20:50,391 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 15:20:50,403 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 15:20:50,403 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:42, output treesize:23 [2018-11-23 15:20:50,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 15:20:50,451 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 15:20:50,452 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 15:20:50,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-23 15:20:50,453 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 15:20:50,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 15:20:50,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-11-23 15:20:50,453 INFO L87 Difference]: Start difference. First operand 130 states and 148 transitions. Second operand 9 states. [2018-11-23 15:20:51,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:20:51,543 INFO L93 Difference]: Finished difference Result 203 states and 225 transitions. [2018-11-23 15:20:51,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 15:20:51,544 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 32 [2018-11-23 15:20:51,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:20:51,545 INFO L225 Difference]: With dead ends: 203 [2018-11-23 15:20:51,545 INFO L226 Difference]: Without dead ends: 203 [2018-11-23 15:20:51,545 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2018-11-23 15:20:51,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2018-11-23 15:20:51,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 161. [2018-11-23 15:20:51,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-11-23 15:20:51,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 193 transitions. [2018-11-23 15:20:51,548 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 193 transitions. Word has length 32 [2018-11-23 15:20:51,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:20:51,549 INFO L480 AbstractCegarLoop]: Abstraction has 161 states and 193 transitions. [2018-11-23 15:20:51,549 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 15:20:51,549 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 193 transitions. [2018-11-23 15:20:51,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-23 15:20:51,549 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:20:51,549 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] [2018-11-23 15:20:51,550 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr45REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr55REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr37REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2018-11-23 15:20:51,550 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:20:51,550 INFO L82 PathProgramCache]: Analyzing trace with hash -731762077, now seen corresponding path program 1 times [2018-11-23 15:20:51,550 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 15:20:51,550 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ee5af346-bf1c-44ad-a793-d5cc5b2233d9/bin-2019/utaipan/cvc4nyu Starting monitored process 14 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 15:20:51,564 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:20:51,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:20:51,677 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:20:51,683 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-23 15:20:51,683 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 15:20:51,688 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:20:51,688 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-23 15:20:51,695 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:20:51,696 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:20:51,696 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-11-23 15:20:51,696 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 15:20:51,701 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:20:51,701 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:8 [2018-11-23 15:20:51,710 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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-11-23 15:20:51,712 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-11-23 15:20:51,712 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 15:20:51,714 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:20:51,721 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:20:51,721 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:17 [2018-11-23 15:20:51,758 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:20:51,767 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 35 treesize of output 36 [2018-11-23 15:20:51,769 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2018-11-23 15:20:51,770 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 15:20:51,774 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:20:51,781 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:20:51,781 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:45, output treesize:22 [2018-11-23 15:20:51,794 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:20:51,801 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 29 treesize of output 30 [2018-11-23 15:20:51,804 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-23 15:20:51,804 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 15:20:51,814 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:20:51,825 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:20:51,825 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:39, output treesize:31 [2018-11-23 15:20:51,854 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:20:51,855 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:20:51,856 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 13 treesize of output 4 [2018-11-23 15:20:51,856 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 15:20:51,869 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:20:51,869 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:28 [2018-11-23 15:20:51,908 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 28 treesize of output 27 [2018-11-23 15:20:51,913 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:20:51,915 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 16 treesize of output 23 [2018-11-23 15:20:51,915 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 15:20:51,928 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:20:51,945 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:20:51,946 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:37 [2018-11-23 15:20:52,058 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:20:52,116 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 75 treesize of output 82 [2018-11-23 15:20:52,121 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 84 treesize of output 68 [2018-11-23 15:20:52,121 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 15:20:52,208 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:20:52,296 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 53 treesize of output 59 [2018-11-23 15:20:52,297 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 4 xjuncts. [2018-11-23 15:20:52,363 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-23 15:20:52,427 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 3 xjuncts. [2018-11-23 15:20:52,427 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:78, output treesize:122 [2018-11-23 15:20:52,568 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 46 treesize of output 41 [2018-11-23 15:20:52,572 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 18 treesize of output 9 [2018-11-23 15:20:52,572 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 15:20:52,584 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:20:52,776 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 62 treesize of output 71 [2018-11-23 15:20:52,781 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:20:52,835 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 2 case distinctions, treesize of input 54 treesize of output 69 [2018-11-23 15:20:52,836 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-11-23 15:20:52,999 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 59 treesize of output 58 [2018-11-23 15:20:53,000 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 15:20:53,078 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 15:20:53,129 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-23 15:20:53,129 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:155, output treesize:92 [2018-11-23 15:20:53,237 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 55 treesize of output 45 [2018-11-23 15:20:53,242 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:20:53,243 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 31 [2018-11-23 15:20:53,243 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 15:20:53,267 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:20:53,390 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 92 treesize of output 80 [2018-11-23 15:20:53,398 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:20:53,399 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 87 treesize of output 102 [2018-11-23 15:20:53,399 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 15:20:53,526 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:20:53,534 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:20:53,582 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 1 new quantified variables, introduced 3 case distinctions, treesize of input 54 treesize of output 76 [2018-11-23 15:20:53,583 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-11-23 15:20:53,727 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 15:20:53,798 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-11-23 15:20:53,799 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:148, output treesize:175 [2018-11-23 15:20:53,961 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:20:53,962 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:20:53,963 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 62 treesize of output 74 [2018-11-23 15:20:53,963 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 15:20:54,053 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 64 treesize of output 63 [2018-11-23 15:20:54,053 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 15:20:54,057 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 95 treesize of output 94 [2018-11-23 15:20:54,057 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 15:20:54,141 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:20:54,143 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:20:54,144 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 94 treesize of output 106 [2018-11-23 15:20:54,144 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 15:20:54,224 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 3 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-11-23 15:20:54,224 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:158, output treesize:160 [2018-11-23 15:20:54,470 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 113 treesize of output 122 [2018-11-23 15:20:54,476 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-11-23 15:20:54,476 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 15:20:54,950 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 15:20:56,100 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 93 treesize of output 91 [2018-11-23 15:20:56,101 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-23 15:20:56,584 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 107 [2018-11-23 15:20:56,584 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 15:20:56,803 INFO L267 ElimStorePlain]: Start of recursive call 2: 5 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-23 15:20:57,252 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 80 treesize of output 85 [2018-11-23 15:20:57,274 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 2 case distinctions, treesize of input 68 treesize of output 68 [2018-11-23 15:20:57,276 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-23 15:20:57,454 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 75 treesize of output 74 [2018-11-23 15:20:57,454 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-23 15:20:57,516 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-23 15:20:57,790 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 11 dim-0 vars, and 5 xjuncts. [2018-11-23 15:20:57,790 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:194, output treesize:439 [2018-11-23 15:20:58,339 WARN L180 SmtUtils]: Spent 433.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 98 [2018-11-23 15:20:58,357 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 69 treesize of output 64 [2018-11-23 15:20:58,361 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:20:58,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-11-23 15:20:58,363 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 15:20:58,382 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:20:59,454 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 126 treesize of output 133 [2018-11-23 15:20:59,472 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:20:59,503 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 3 case distinctions, treesize of input 120 treesize of output 109 [2018-11-23 15:20:59,503 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-23 15:21:00,540 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:21:00,546 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:21:00,840 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 0 new quantified variables, introduced 4 case distinctions, treesize of input 114 treesize of output 130 [2018-11-23 15:21:00,840 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 4 xjuncts. [2018-11-23 15:21:02,421 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 15:21:03,271 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:21:03,274 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 123 treesize of output 115 [2018-11-23 15:21:03,274 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-23 15:21:03,779 INFO L267 ElimStorePlain]: Start of recursive call 4: 5 dim-1 vars, End of recursive call: 2 dim-0 vars, and 5 xjuncts. [2018-11-23 15:21:05,647 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 93 treesize of output 96 [2018-11-23 15:21:05,653 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:21:05,656 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 94 treesize of output 86 [2018-11-23 15:21:05,656 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-23 15:21:05,785 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:21:05,805 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 3 case distinctions, treesize of input 75 treesize of output 72 [2018-11-23 15:21:05,806 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-23 15:21:05,870 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-23 15:21:07,001 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 94 treesize of output 88 [2018-11-23 15:21:07,005 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:21:07,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, 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-11-23 15:21:07,008 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-23 15:21:07,040 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:21:07,833 INFO L267 ElimStorePlain]: Start of recursive call 1: 12 dim-0 vars, 4 dim-2 vars, End of recursive call: 25 dim-0 vars, and 9 xjuncts. [2018-11-23 15:21:07,833 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 16 variables, input treesize:383, output treesize:787 [2018-11-23 15:21:08,662 WARN L180 SmtUtils]: Spent 611.00 ms on a formula simplification. DAG size of input: 244 DAG size of output: 186 [2018-11-23 15:21:09,162 WARN L180 SmtUtils]: Spent 323.00 ms on a formula simplification that was a NOOP. DAG size: 185 [2018-11-23 15:21:09,197 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-11-23 15:21:09,197 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 15:21:09,484 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:21:09,485 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:21:09,486 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 83 treesize of output 82 [2018-11-23 15:21:09,486 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 15:21:10,038 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:21:10,039 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:21:10,040 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 116 treesize of output 115 [2018-11-23 15:21:10,041 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 15:21:10,212 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:21:10,213 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:21:10,214 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 104 treesize of output 103 [2018-11-23 15:21:10,214 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 15:21:10,575 INFO L267 ElimStorePlain]: Start of recursive call 1: 19 dim-0 vars, 7 dim-1 vars, End of recursive call: 12 dim-0 vars, and 3 xjuncts. [2018-11-23 15:21:10,575 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 26 variables, input treesize:584, output treesize:289 [2018-11-23 15:21:13,455 WARN L180 SmtUtils]: Spent 2.75 s on a formula simplification. DAG size of input: 102 DAG size of output: 91 [2018-11-23 15:21:13,474 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 75 treesize of output 57 [2018-11-23 15:21:13,479 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-11-23 15:21:13,479 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 15:21:13,512 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:21:13,513 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 13 treesize of output 6 [2018-11-23 15:21:13,513 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 15:21:13,527 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 25 treesize of output 14 [2018-11-23 15:21:13,527 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 15:21:13,536 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:21:13,689 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 108 treesize of output 87 [2018-11-23 15:21:13,699 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:21:13,701 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 72 treesize of output 67 [2018-11-23 15:21:13,702 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 15:21:13,911 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 53 treesize of output 42 [2018-11-23 15:21:13,911 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-23 15:21:14,109 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:21:14,109 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 31 [2018-11-23 15:21:14,110 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-23 15:21:14,218 INFO L267 ElimStorePlain]: Start of recursive call 6: 12 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:21:14,290 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 59 [2018-11-23 15:21:14,294 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 27 treesize of output 16 [2018-11-23 15:21:14,295 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-23 15:21:14,320 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:21:14,322 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 29 treesize of output 22 [2018-11-23 15:21:14,322 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 15:21:14,340 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-11-23 15:21:14,340 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-23 15:21:14,350 INFO L267 ElimStorePlain]: Start of recursive call 10: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 15:21:14,380 INFO L267 ElimStorePlain]: Start of recursive call 1: 12 dim-0 vars, 3 dim-2 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2018-11-23 15:21:14,380 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 15 variables, input treesize:280, output treesize:52 [2018-11-23 15:21:14,559 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 15:21:14,559 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 15:21:14,925 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 15:21:14,930 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 15:21:14,943 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 15:21:14,944 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:40, output treesize:28 [2018-11-23 15:21:19,414 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 12 treesize of output 10 [2018-11-23 15:21:19,414 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 15:21:19,458 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2018-11-23 15:21:19,458 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:77 [2018-11-23 15:21:41,370 WARN L180 SmtUtils]: Spent 6.74 s on a formula simplification. DAG size of input: 54 DAG size of output: 49 [2018-11-23 15:21:43,379 WARN L832 $PredicateComparison]: unable to prove that (and (forall ((v_prenex_76 (_ BitVec 32)) (v_main_~item~0.base_31 (_ BitVec 32)) (v_prenex_77 (_ BitVec 32))) (or (= (_ bv1 1) (select (store |c_#valid| v_main_~item~0.base_31 (_ bv1 1)) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| c_main_~bcki~0.base (store (select |c_#memory_$Pointer$.base| c_main_~bcki~0.base) c_main_~bcki~0.offset (_ bv0 32))))) (store .cse0 v_main_~item~0.base_31 (store (store (select .cse0 v_main_~item~0.base_31) v_prenex_77 (_ bv0 32)) (bvadd v_prenex_77 (_ bv4 32)) v_prenex_76))) c_main_~bucket~0.base) c_main_~bucket~0.offset))) (not (= (select |c_#valid| v_main_~item~0.base_31) (_ bv0 1))) (= v_main_~item~0.base_31 c_main_~bucket~0.base))) (or (not (= (select |c_#valid| c_main_~bucket~0.base) (_ bv0 1))) (forall ((v_DerPreprocessor_4 (_ BitVec 32)) (main_~item~0.offset (_ BitVec 32))) (= (_ bv1 1) (select (store |c_#valid| c_main_~bucket~0.base (_ bv1 1)) (select (store (store (select (store |c_#memory_$Pointer$.base| c_main_~bcki~0.base (store (select |c_#memory_$Pointer$.base| c_main_~bcki~0.base) c_main_~bcki~0.offset (_ bv0 32))) c_main_~bucket~0.base) main_~item~0.offset (_ bv0 32)) (bvadd main_~item~0.offset (_ bv4 32)) v_DerPreprocessor_4) c_main_~bucket~0.offset)))) (not (bvsle (bvadd c_main_~bucket~0.offset (_ bv12 32)) (_ bv8 32))))) is different from false [2018-11-23 15:22:00,338 WARN L180 SmtUtils]: Spent 5.22 s on a formula simplification that was a NOOP. DAG size: 57 [2018-11-23 15:22:00,766 WARN L180 SmtUtils]: Spent 425.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 82 [2018-11-23 15:22:00,767 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 15:22:00,788 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 15:22:00,789 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 15:22:00,808 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 15:22:00,809 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 15:22:00,844 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 15:22:01,312 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 15:22:01,345 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 15:22:01,620 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-2 vars, End of recursive call: 17 dim-0 vars, and 4 xjuncts. [2018-11-23 15:22:01,620 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 9 variables, input treesize:152, output treesize:249 [2018-11-23 15:23:18,281 WARN L180 SmtUtils]: Spent 1.02 m on a formula simplification. DAG size of input: 111 DAG size of output: 94 [2018-11-23 15:23:55,913 WARN L180 SmtUtils]: Spent 20.03 s on a formula simplification. DAG size of input: 93 DAG size of output: 74 [2018-11-23 15:24:20,786 WARN L180 SmtUtils]: Spent 3.41 s on a formula simplification that was a NOOP. DAG size: 76 [2018-11-23 15:24:21,237 WARN L180 SmtUtils]: Spent 448.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 81 [2018-11-23 15:24:21,242 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 15:24:21,249 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 15:24:21,252 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:24:21,254 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:24:21,255 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 177 treesize of output 164 [2018-11-23 15:24:21,256 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 15:24:21,448 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 15:24:21,448 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 15:24:21,451 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:24:21,451 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 168 treesize of output 157 [2018-11-23 15:24:21,452 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 15:24:21,610 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 2 dim-1 vars, End of recursive call: 9 dim-0 vars, and 2 xjuncts. [2018-11-23 15:24:21,610 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 11 variables, input treesize:207, output treesize:322 [2018-11-23 15:24:22,779 WARN L180 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 43 [2018-11-23 15:24:50,792 WARN L180 SmtUtils]: Spent 2.86 s on a formula simplification that was a NOOP. DAG size: 53 [2018-11-23 15:25:22,128 WARN L180 SmtUtils]: Spent 4.31 s on a formula simplification that was a NOOP. DAG size: 55 [2018-11-23 15:25:22,677 WARN L180 SmtUtils]: Spent 547.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2018-11-23 15:25:22,678 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 15:25:22,748 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 15:25:22,749 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 15:25:22,802 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 15:25:22,803 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 15:25:23,041 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 15:25:25,826 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-23 15:25:25,835 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:25:29,644 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 2 dim-2 vars, End of recursive call: 24 dim-0 vars, and 4 xjuncts. [2018-11-23 15:25:29,644 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 11 variables, input treesize:250, output treesize:759 [2018-11-23 15:26:28,424 WARN L180 SmtUtils]: Spent 17.50 s on a formula simplification that was a NOOP. DAG size: 142 [2018-11-23 15:27:24,955 WARN L180 SmtUtils]: Spent 20.73 s on a formula simplification that was a NOOP. DAG size: 142 [2018-11-23 15:28:07,454 WARN L180 SmtUtils]: Spent 16.54 s on a formula simplification that was a NOOP. DAG size: 143 [2018-11-23 15:28:07,470 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 15:28:07,471 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 15:28:07,472 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 547 treesize of output 538 [2018-11-23 15:28:07,472 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 15:28:09,251 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 15:28:09,252 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 15:28:09,253 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 290 treesize of output 281 [2018-11-23 15:28:09,253 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 15:28:10,368 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 15:28:10,368 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 15:28:10,369 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 22 treesize of output 13 [2018-11-23 15:28:10,369 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 15:28:12,172 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 281 treesize of output 194 [2018-11-23 15:28:12,180 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-11-23 15:28:12,181 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 15:28:12,252 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:28:12,253 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 15:28:12,272 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 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 187 treesize of output 159 [2018-11-23 15:28:12,652 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 2 new quantified variables, introduced 5 case distinctions, treesize of input 53 treesize of output 80 [2018-11-23 15:28:12,653 INFO L267 ElimStorePlain]: Start of recursive call 8: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 7 xjuncts. [2018-11-23 15:28:13,165 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 137 treesize of output 126 [2018-11-23 15:28:13,176 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 95 treesize of output 83 [2018-11-23 15:28:13,186 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 15:28:13,198 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 83 treesize of output 78 [2018-11-23 15:28:13,206 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 15:28:13,207 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 15:28:13,215 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 15:28:13,235 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 0 case distinctions, treesize of input 71 treesize of output 82 [2018-11-23 15:28:13,245 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 15:28:13,245 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 15:28:13,253 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 15:28:13,514 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 15:28:13,514 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: var is still there: v_arrayElimArr_8 input size 44 context size 44 output size 44 at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.Elim1Store.elim1(Elim1Store.java:452) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:221) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.elimAllRec(ElimStorePlain.java:199) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:293) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:245) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:418) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:290) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:188) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:232) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:456) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-11-23 15:28:13,517 INFO L168 Benchmark]: Toolchain (without parser) took 486241.76 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 296.2 MB). Free memory was 944.4 MB in the beginning and 1.0 GB in the end (delta: -69.8 MB). Peak memory consumption was 226.4 MB. Max. memory is 11.5 GB. [2018-11-23 15:28:13,517 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 15:28:13,517 INFO L168 Benchmark]: CACSL2BoogieTranslator took 406.82 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 123.7 MB). Free memory was 944.4 MB in the beginning and 1.1 GB in the end (delta: -172.1 MB). Peak memory consumption was 39.5 MB. Max. memory is 11.5 GB. [2018-11-23 15:28:13,518 INFO L168 Benchmark]: Boogie Procedure Inliner took 18.87 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.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2018-11-23 15:28:13,518 INFO L168 Benchmark]: Boogie Preprocessor took 23.88 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 15:28:13,518 INFO L168 Benchmark]: RCFGBuilder took 593.64 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: 52.9 MB). Peak memory consumption was 52.9 MB. Max. memory is 11.5 GB. [2018-11-23 15:28:13,518 INFO L168 Benchmark]: TraceAbstraction took 485195.41 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 172.5 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 42.4 MB). Peak memory consumption was 214.9 MB. Max. memory is 11.5 GB. [2018-11-23 15:28:13,519 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 406.82 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 123.7 MB). Free memory was 944.4 MB in the beginning and 1.1 GB in the end (delta: -172.1 MB). Peak memory consumption was 39.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 18.87 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.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 23.88 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 593.64 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: 52.9 MB). Peak memory consumption was 52.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 485195.41 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 172.5 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 42.4 MB). Peak memory consumption was 214.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: var is still there: v_arrayElimArr_8 input size 44 context size 44 output size 44 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: var is still there: v_arrayElimArr_8 input size 44 context size 44 output size 44: de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.Elim1Store.elim1(Elim1Store.java:452) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...