./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/array-memsafety-realloc/array-realloc-2.i --full-output --cacsl2boogietranslator.adapt.memory.model.on.pointer.casts.if.necessary true --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 264dba86 Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/array-memsafety-realloc/array-realloc-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 5ce6ab98ff3a344cbd8c93195b0f965c65d244bc --cacsl2boogietranslator.adapt.memory.model.on.pointer.casts.if.necessary true ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: Alternating quantifiers not yet supported --- Real Ultimate output --- Skipped default analysis because property is memsafety ### Bit-precise run ### This is Ultimate 0.1.24-264dba8 [2019-11-21 11:40:54,269 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-21 11:40:54,271 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-21 11:40:54,289 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-21 11:40:54,290 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-21 11:40:54,291 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-21 11:40:54,293 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-21 11:40:54,303 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-21 11:40:54,309 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-21 11:40:54,312 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-21 11:40:54,314 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-21 11:40:54,316 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-21 11:40:54,316 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-21 11:40:54,320 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-21 11:40:54,321 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-21 11:40:54,323 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-21 11:40:54,325 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-21 11:40:54,326 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-21 11:40:54,329 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-21 11:40:54,333 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-21 11:40:54,338 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-21 11:40:54,343 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-21 11:40:54,345 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-21 11:40:54,347 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-21 11:40:54,352 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-21 11:40:54,352 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-21 11:40:54,352 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-21 11:40:54,354 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-21 11:40:54,355 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-21 11:40:54,356 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-21 11:40:54,356 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-21 11:40:54,357 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-21 11:40:54,358 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-21 11:40:54,359 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-21 11:40:54,360 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-21 11:40:54,361 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-21 11:40:54,362 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-21 11:40:54,362 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-21 11:40:54,362 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-21 11:40:54,363 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-21 11:40:54,365 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-21 11:40:54,366 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Bitvector.epf [2019-11-21 11:40:54,383 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-21 11:40:54,384 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-21 11:40:54,385 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-21 11:40:54,385 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-21 11:40:54,386 INFO L138 SettingsManager]: * Use SBE=true [2019-11-21 11:40:54,386 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-21 11:40:54,386 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-21 11:40:54,387 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-21 11:40:54,387 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-21 11:40:54,387 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-21 11:40:54,387 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-21 11:40:54,388 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-21 11:40:54,388 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-21 11:40:54,388 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-21 11:40:54,389 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-21 11:40:54,389 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-21 11:40:54,389 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-21 11:40:54,389 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-21 11:40:54,390 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-21 11:40:54,390 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-21 11:40:54,390 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-21 11:40:54,391 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-21 11:40:54,391 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-21 11:40:54,391 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-21 11:40:54,391 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-21 11:40:54,392 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-21 11:40:54,392 INFO L138 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5ce6ab98ff3a344cbd8c93195b0f965c65d244bc Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Adapt memory model on pointer casts if necessary -> true [2019-11-21 11:40:54,707 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-21 11:40:54,723 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-21 11:40:54,727 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-21 11:40:54,728 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-21 11:40:54,729 INFO L275 PluginConnector]: CDTParser initialized [2019-11-21 11:40:54,730 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety-realloc/array-realloc-2.i [2019-11-21 11:40:54,805 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e26677810/5aede2612ffb4422ab601e890c25e125/FLAGc0e3b0732 [2019-11-21 11:40:55,345 INFO L306 CDTParser]: Found 1 translation units. [2019-11-21 11:40:55,346 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety-realloc/array-realloc-2.i [2019-11-21 11:40:55,360 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e26677810/5aede2612ffb4422ab601e890c25e125/FLAGc0e3b0732 [2019-11-21 11:40:55,666 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e26677810/5aede2612ffb4422ab601e890c25e125 [2019-11-21 11:40:55,670 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-21 11:40:55,671 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-21 11:40:55,673 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-21 11:40:55,673 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-21 11:40:55,676 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-21 11:40:55,677 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 11:40:55" (1/1) ... [2019-11-21 11:40:55,680 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a3459d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:40:55, skipping insertion in model container [2019-11-21 11:40:55,680 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 11:40:55" (1/1) ... [2019-11-21 11:40:55,688 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-21 11:40:55,744 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-21 11:40:56,119 INFO L966 CHandler]: Found a cast between two array/pointer types where the value type is smaller than the cast-to type, and where that value type is smaller than our current memory model resolution [2019-11-21 11:40:56,120 INFO L969 CHandler]: at location: C: (int *)malloc(sizeof(int)) [575] [2019-11-21 11:40:56,120 INFO L970 CHandler]: current memory model: HoenickeLindenmann_4ByteResolution [2019-11-21 11:40:56,126 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-21 11:40:56,145 INFO L198 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2019-11-21 11:40:56,163 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-21 11:40:56,195 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-21 11:40:56,203 INFO L201 MainTranslator]: Completed pre-run [2019-11-21 11:40:56,245 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-21 11:40:56,311 INFO L205 MainTranslator]: Completed translation [2019-11-21 11:40:56,311 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:40:56 WrapperNode [2019-11-21 11:40:56,311 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-21 11:40:56,312 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-21 11:40:56,312 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-21 11:40:56,313 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-21 11:40:56,326 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:40:56" (1/1) ... [2019-11-21 11:40:56,327 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:40:56" (1/1) ... [2019-11-21 11:40:56,348 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:40:56" (1/1) ... [2019-11-21 11:40:56,348 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:40:56" (1/1) ... [2019-11-21 11:40:56,370 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:40:56" (1/1) ... [2019-11-21 11:40:56,375 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:40:56" (1/1) ... [2019-11-21 11:40:56,383 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:40:56" (1/1) ... [2019-11-21 11:40:56,395 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-21 11:40:56,396 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-21 11:40:56,400 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-21 11:40:56,400 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-21 11:40:56,401 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:40:56" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-11-21 11:40:56,456 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-21 11:40:56,457 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-21 11:40:56,457 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-21 11:40:56,457 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-21 11:40:56,457 INFO L138 BoogieDeclarations]: Found implementation of procedure expandArray [2019-11-21 11:40:56,457 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-21 11:40:56,458 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc [2019-11-21 11:40:56,458 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-21 11:40:56,458 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-21 11:40:56,458 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-21 11:40:56,458 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-21 11:40:56,458 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-21 11:40:56,459 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-21 11:40:56,459 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-21 11:40:56,459 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-21 11:40:56,459 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-21 11:40:56,459 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-21 11:40:56,459 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-21 11:40:56,460 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-21 11:40:56,460 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-21 11:40:56,460 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-21 11:40:56,460 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-21 11:40:56,460 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-21 11:40:56,460 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-21 11:40:56,460 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-21 11:40:56,461 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-21 11:40:56,461 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-21 11:40:56,463 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-21 11:40:56,463 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-21 11:40:56,463 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-21 11:40:56,463 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-21 11:40:56,463 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-21 11:40:56,464 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-21 11:40:56,464 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-21 11:40:56,464 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-21 11:40:56,464 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-21 11:40:56,464 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-21 11:40:56,464 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-21 11:40:56,465 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-21 11:40:56,465 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-21 11:40:56,465 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-21 11:40:56,465 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-21 11:40:56,465 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-21 11:40:56,466 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-21 11:40:56,466 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-21 11:40:56,466 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-21 11:40:56,466 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-21 11:40:56,466 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-21 11:40:56,466 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-21 11:40:56,467 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-21 11:40:56,467 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-21 11:40:56,467 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-21 11:40:56,467 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-21 11:40:56,467 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-21 11:40:56,468 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-21 11:40:56,468 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-21 11:40:56,468 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-21 11:40:56,468 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-21 11:40:56,468 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-21 11:40:56,468 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-21 11:40:56,469 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-21 11:40:56,469 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-21 11:40:56,469 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-21 11:40:56,469 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-11-21 11:40:56,469 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-21 11:40:56,469 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-21 11:40:56,469 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-21 11:40:56,470 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-21 11:40:56,470 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-21 11:40:56,470 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-21 11:40:56,470 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-21 11:40:56,470 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-21 11:40:56,470 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-21 11:40:56,471 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-21 11:40:56,471 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-21 11:40:56,471 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-21 11:40:56,471 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-21 11:40:56,471 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-21 11:40:56,471 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-21 11:40:56,471 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-21 11:40:56,472 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-21 11:40:56,472 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-21 11:40:56,472 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-21 11:40:56,472 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-21 11:40:56,472 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-21 11:40:56,472 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-21 11:40:56,472 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-21 11:40:56,473 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-21 11:40:56,473 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-21 11:40:56,473 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-21 11:40:56,473 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-21 11:40:56,473 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-21 11:40:56,473 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-21 11:40:56,473 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-21 11:40:56,474 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-21 11:40:56,474 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-21 11:40:56,474 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-21 11:40:56,474 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-21 11:40:56,474 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-21 11:40:56,474 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-21 11:40:56,474 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-21 11:40:56,474 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-21 11:40:56,475 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-21 11:40:56,475 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-21 11:40:56,475 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-21 11:40:56,475 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-21 11:40:56,475 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-21 11:40:56,475 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-21 11:40:56,475 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-21 11:40:56,476 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-21 11:40:56,476 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-21 11:40:56,476 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-21 11:40:56,476 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-21 11:40:56,476 INFO L130 BoogieDeclarations]: Found specification of procedure expandArray [2019-11-21 11:40:56,476 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc [2019-11-21 11:40:56,476 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-21 11:40:56,477 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-21 11:40:56,477 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-21 11:40:56,477 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-21 11:40:56,477 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-21 11:40:56,477 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-21 11:40:56,477 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-21 11:40:56,477 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-21 11:40:56,478 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-21 11:40:56,478 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-21 11:40:56,478 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-21 11:40:57,147 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-21 11:40:57,148 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-11-21 11:40:57,150 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 11:40:57 BoogieIcfgContainer [2019-11-21 11:40:57,150 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-21 11:40:57,151 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-21 11:40:57,151 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-21 11:40:57,154 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-21 11:40:57,154 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 11:40:55" (1/3) ... [2019-11-21 11:40:57,155 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cf660a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 11:40:57, skipping insertion in model container [2019-11-21 11:40:57,155 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:40:56" (2/3) ... [2019-11-21 11:40:57,156 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cf660a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 11:40:57, skipping insertion in model container [2019-11-21 11:40:57,156 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 11:40:57" (3/3) ... [2019-11-21 11:40:57,158 INFO L109 eAbstractionObserver]: Analyzing ICFG array-realloc-2.i [2019-11-21 11:40:57,167 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-21 11:40:57,173 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 14 error locations. [2019-11-21 11:40:57,185 INFO L249 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2019-11-21 11:40:57,203 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-21 11:40:57,203 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-21 11:40:57,203 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-21 11:40:57,203 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-21 11:40:57,204 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-21 11:40:57,204 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-21 11:40:57,204 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-21 11:40:57,204 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-21 11:40:57,220 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states. [2019-11-21 11:40:57,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-11-21 11:40:57,230 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 11:40:57,231 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 11:40:57,231 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, expandArrayErr4REQUIRES_VIOLATION, expandArrayErr3REQUIRES_VIOLATION, expandArrayErr2REQUIRES_VIOLATION, expandArrayErr1REQUIRES_VIOLATION, expandArrayErr0REQUIRES_VIOLATION, expandArrayErr5REQUIRES_VIOLATION]=== [2019-11-21 11:40:57,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 11:40:57,237 INFO L82 PathProgramCache]: Analyzing trace with hash 529620371, now seen corresponding path program 1 times [2019-11-21 11:40:57,247 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 11:40:57,247 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1692725298] [2019-11-21 11:40:57,247 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 11:40:57,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 11:40:57,495 INFO L255 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-21 11:40:57,502 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 11:40:57,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 11:40:57,543 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 11:40:57,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 11:40:57,558 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1692725298] [2019-11-21 11:40:57,558 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 11:40:57,558 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-21 11:40:57,559 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396299372] [2019-11-21 11:40:57,563 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-21 11:40:57,564 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 11:40:57,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-21 11:40:57,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-21 11:40:57,577 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 3 states. [2019-11-21 11:40:57,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 11:40:57,774 INFO L93 Difference]: Finished difference Result 56 states and 62 transitions. [2019-11-21 11:40:57,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-21 11:40:57,777 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2019-11-21 11:40:57,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 11:40:57,793 INFO L225 Difference]: With dead ends: 56 [2019-11-21 11:40:57,794 INFO L226 Difference]: Without dead ends: 52 [2019-11-21 11:40:57,797 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-21 11:40:57,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-11-21 11:40:57,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 44. [2019-11-21 11:40:57,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-11-21 11:40:57,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 47 transitions. [2019-11-21 11:40:57,874 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 47 transitions. Word has length 8 [2019-11-21 11:40:57,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 11:40:57,875 INFO L462 AbstractCegarLoop]: Abstraction has 44 states and 47 transitions. [2019-11-21 11:40:57,875 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-21 11:40:57,875 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 47 transitions. [2019-11-21 11:40:57,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-11-21 11:40:57,876 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 11:40:57,877 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 11:40:58,081 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 11:40:58,081 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, expandArrayErr4REQUIRES_VIOLATION, expandArrayErr3REQUIRES_VIOLATION, expandArrayErr2REQUIRES_VIOLATION, expandArrayErr1REQUIRES_VIOLATION, expandArrayErr0REQUIRES_VIOLATION, expandArrayErr5REQUIRES_VIOLATION]=== [2019-11-21 11:40:58,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 11:40:58,082 INFO L82 PathProgramCache]: Analyzing trace with hash 529620385, now seen corresponding path program 1 times [2019-11-21 11:40:58,082 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 11:40:58,082 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [191183474] [2019-11-21 11:40:58,083 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 11:40:58,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 11:40:58,320 INFO L255 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-21 11:40:58,322 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 11:40:58,365 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_24|], 1=[|v_#valid_40|]} [2019-11-21 11:40:58,380 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 11:40:58,392 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2019-11-21 11:40:58,393 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 11:40:58,412 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:40:58,419 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 11:40:58,425 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2019-11-21 11:40:58,426 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 11:40:58,438 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:40:58,446 INFO L377 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 9 treesize of output 5 [2019-11-21 11:40:58,448 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-21 11:40:58,459 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:40:58,460 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-21 11:40:58,461 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:29, output treesize:14 [2019-11-21 11:40:58,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 11:40:58,479 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 11:40:58,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 11:40:58,529 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [191183474] [2019-11-21 11:40:58,530 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 11:40:58,530 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2019-11-21 11:40:58,530 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453213269] [2019-11-21 11:40:58,532 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-21 11:40:58,532 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 11:40:58,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-21 11:40:58,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-21 11:40:58,533 INFO L87 Difference]: Start difference. First operand 44 states and 47 transitions. Second operand 4 states. [2019-11-21 11:40:58,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 11:40:58,688 INFO L93 Difference]: Finished difference Result 43 states and 46 transitions. [2019-11-21 11:40:58,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-21 11:40:58,689 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2019-11-21 11:40:58,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 11:40:58,690 INFO L225 Difference]: With dead ends: 43 [2019-11-21 11:40:58,691 INFO L226 Difference]: Without dead ends: 43 [2019-11-21 11:40:58,692 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-21 11:40:58,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-11-21 11:40:58,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-11-21 11:40:58,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-11-21 11:40:58,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 46 transitions. [2019-11-21 11:40:58,698 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 46 transitions. Word has length 8 [2019-11-21 11:40:58,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 11:40:58,699 INFO L462 AbstractCegarLoop]: Abstraction has 43 states and 46 transitions. [2019-11-21 11:40:58,699 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-21 11:40:58,699 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 46 transitions. [2019-11-21 11:40:58,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-11-21 11:40:58,699 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 11:40:58,700 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 11:40:58,903 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 11:40:58,904 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, expandArrayErr4REQUIRES_VIOLATION, expandArrayErr3REQUIRES_VIOLATION, expandArrayErr2REQUIRES_VIOLATION, expandArrayErr1REQUIRES_VIOLATION, expandArrayErr0REQUIRES_VIOLATION, expandArrayErr5REQUIRES_VIOLATION]=== [2019-11-21 11:40:58,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 11:40:58,905 INFO L82 PathProgramCache]: Analyzing trace with hash 529620384, now seen corresponding path program 1 times [2019-11-21 11:40:58,906 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 11:40:58,906 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [233775409] [2019-11-21 11:40:58,907 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 11:40:59,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 11:40:59,107 INFO L255 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-21 11:40:59,108 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 11:40:59,144 INFO L343 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2019-11-21 11:40:59,145 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 1 case distinctions, treesize of input 13 treesize of output 15 [2019-11-21 11:40:59,145 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 11:40:59,156 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:40:59,161 INFO L377 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 9 treesize of output 5 [2019-11-21 11:40:59,162 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-21 11:40:59,171 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:40:59,172 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-21 11:40:59,172 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:13, output treesize:11 [2019-11-21 11:40:59,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 11:40:59,189 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 11:40:59,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 11:40:59,205 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [233775409] [2019-11-21 11:40:59,206 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 11:40:59,206 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-21 11:40:59,206 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055473116] [2019-11-21 11:40:59,206 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-21 11:40:59,207 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 11:40:59,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-21 11:40:59,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-21 11:40:59,208 INFO L87 Difference]: Start difference. First operand 43 states and 46 transitions. Second operand 3 states. [2019-11-21 11:40:59,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 11:40:59,295 INFO L93 Difference]: Finished difference Result 42 states and 45 transitions. [2019-11-21 11:40:59,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-21 11:40:59,296 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2019-11-21 11:40:59,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 11:40:59,297 INFO L225 Difference]: With dead ends: 42 [2019-11-21 11:40:59,297 INFO L226 Difference]: Without dead ends: 42 [2019-11-21 11:40:59,298 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-21 11:40:59,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-11-21 11:40:59,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-11-21 11:40:59,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-11-21 11:40:59,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 45 transitions. [2019-11-21 11:40:59,305 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 45 transitions. Word has length 8 [2019-11-21 11:40:59,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 11:40:59,306 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 45 transitions. [2019-11-21 11:40:59,306 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-21 11:40:59,306 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2019-11-21 11:40:59,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-21 11:40:59,307 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 11:40:59,307 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 11:40:59,507 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 11:40:59,508 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, expandArrayErr4REQUIRES_VIOLATION, expandArrayErr3REQUIRES_VIOLATION, expandArrayErr2REQUIRES_VIOLATION, expandArrayErr1REQUIRES_VIOLATION, expandArrayErr0REQUIRES_VIOLATION, expandArrayErr5REQUIRES_VIOLATION]=== [2019-11-21 11:40:59,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 11:40:59,508 INFO L82 PathProgramCache]: Analyzing trace with hash -2135919539, now seen corresponding path program 1 times [2019-11-21 11:40:59,509 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 11:40:59,509 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1543915463] [2019-11-21 11:40:59,509 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 11:40:59,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 11:40:59,683 INFO L255 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-21 11:40:59,684 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 11:40:59,698 INFO L377 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 16 treesize of output 8 [2019-11-21 11:40:59,699 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 11:40:59,701 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:40:59,702 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-21 11:40:59,702 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:16, output treesize:4 [2019-11-21 11:40:59,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 11:40:59,711 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 11:40:59,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 11:40:59,724 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1543915463] [2019-11-21 11:40:59,724 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 11:40:59,724 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-11-21 11:40:59,724 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233917167] [2019-11-21 11:40:59,725 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-21 11:40:59,725 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 11:40:59,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-21 11:40:59,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-21 11:40:59,727 INFO L87 Difference]: Start difference. First operand 42 states and 45 transitions. Second operand 4 states. [2019-11-21 11:40:59,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 11:40:59,826 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2019-11-21 11:40:59,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-21 11:40:59,828 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-11-21 11:40:59,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 11:40:59,829 INFO L225 Difference]: With dead ends: 42 [2019-11-21 11:40:59,829 INFO L226 Difference]: Without dead ends: 42 [2019-11-21 11:40:59,830 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-21 11:40:59,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-11-21 11:40:59,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-11-21 11:40:59,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-11-21 11:40:59,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 44 transitions. [2019-11-21 11:40:59,836 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 44 transitions. Word has length 10 [2019-11-21 11:40:59,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 11:40:59,837 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 44 transitions. [2019-11-21 11:40:59,837 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-21 11:40:59,837 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 44 transitions. [2019-11-21 11:40:59,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-21 11:40:59,838 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 11:40:59,838 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 11:41:00,039 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 11:41:00,040 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, expandArrayErr4REQUIRES_VIOLATION, expandArrayErr3REQUIRES_VIOLATION, expandArrayErr2REQUIRES_VIOLATION, expandArrayErr1REQUIRES_VIOLATION, expandArrayErr0REQUIRES_VIOLATION, expandArrayErr5REQUIRES_VIOLATION]=== [2019-11-21 11:41:00,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 11:41:00,041 INFO L82 PathProgramCache]: Analyzing trace with hash -1236436269, now seen corresponding path program 1 times [2019-11-21 11:41:00,041 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 11:41:00,042 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1831054069] [2019-11-21 11:41:00,043 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 11:41:00,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 11:41:00,274 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-21 11:41:00,276 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 11:41:00,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 11:41:00,307 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 11:41:00,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 11:41:00,323 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1831054069] [2019-11-21 11:41:00,324 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 11:41:00,324 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-11-21 11:41:00,324 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341054256] [2019-11-21 11:41:00,325 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-21 11:41:00,325 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 11:41:00,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-21 11:41:00,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-21 11:41:00,326 INFO L87 Difference]: Start difference. First operand 42 states and 44 transitions. Second operand 5 states. [2019-11-21 11:41:00,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 11:41:00,551 INFO L93 Difference]: Finished difference Result 53 states and 57 transitions. [2019-11-21 11:41:00,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-21 11:41:00,552 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-11-21 11:41:00,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 11:41:00,553 INFO L225 Difference]: With dead ends: 53 [2019-11-21 11:41:00,553 INFO L226 Difference]: Without dead ends: 53 [2019-11-21 11:41:00,554 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-21 11:41:00,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-11-21 11:41:00,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 47. [2019-11-21 11:41:00,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-11-21 11:41:00,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2019-11-21 11:41:00,582 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 13 [2019-11-21 11:41:00,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 11:41:00,586 INFO L462 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2019-11-21 11:41:00,586 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-21 11:41:00,586 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2019-11-21 11:41:00,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-21 11:41:00,587 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 11:41:00,587 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 11:41:00,791 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 11:41:00,792 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, expandArrayErr4REQUIRES_VIOLATION, expandArrayErr3REQUIRES_VIOLATION, expandArrayErr2REQUIRES_VIOLATION, expandArrayErr1REQUIRES_VIOLATION, expandArrayErr0REQUIRES_VIOLATION, expandArrayErr5REQUIRES_VIOLATION]=== [2019-11-21 11:41:00,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 11:41:00,793 INFO L82 PathProgramCache]: Analyzing trace with hash -1236436268, now seen corresponding path program 1 times [2019-11-21 11:41:00,794 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 11:41:00,794 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1314572730] [2019-11-21 11:41:00,795 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 11:41:00,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 11:41:00,998 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-21 11:41:00,999 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 11:41:01,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 11:41:01,058 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 11:41:01,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 11:41:01,231 INFO L377 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 12 treesize of output 10 [2019-11-21 11:41:01,232 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-21 11:41:01,247 INFO L377 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 14 treesize of output 12 [2019-11-21 11:41:01,248 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-21 11:41:01,277 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:41:01,279 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-11-21 11:41:01,279 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:23 [2019-11-21 11:41:01,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 11:41:01,361 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1314572730] [2019-11-21 11:41:01,361 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 11:41:01,361 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2019-11-21 11:41:01,361 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372445933] [2019-11-21 11:41:01,361 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-21 11:41:01,362 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 11:41:01,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-21 11:41:01,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-11-21 11:41:01,362 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand 10 states. [2019-11-21 11:41:01,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 11:41:01,789 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2019-11-21 11:41:01,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-21 11:41:01,791 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 13 [2019-11-21 11:41:01,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 11:41:01,792 INFO L225 Difference]: With dead ends: 50 [2019-11-21 11:41:01,792 INFO L226 Difference]: Without dead ends: 50 [2019-11-21 11:41:01,792 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-11-21 11:41:01,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-11-21 11:41:01,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 46. [2019-11-21 11:41:01,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-11-21 11:41:01,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 49 transitions. [2019-11-21 11:41:01,798 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 49 transitions. Word has length 13 [2019-11-21 11:41:01,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 11:41:01,798 INFO L462 AbstractCegarLoop]: Abstraction has 46 states and 49 transitions. [2019-11-21 11:41:01,798 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-21 11:41:01,798 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2019-11-21 11:41:01,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-21 11:41:01,799 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 11:41:01,799 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 11:41:01,999 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 11:41:02,000 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, expandArrayErr4REQUIRES_VIOLATION, expandArrayErr3REQUIRES_VIOLATION, expandArrayErr2REQUIRES_VIOLATION, expandArrayErr1REQUIRES_VIOLATION, expandArrayErr0REQUIRES_VIOLATION, expandArrayErr5REQUIRES_VIOLATION]=== [2019-11-21 11:41:02,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 11:41:02,000 INFO L82 PathProgramCache]: Analyzing trace with hash -2119265845, now seen corresponding path program 1 times [2019-11-21 11:41:02,000 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 11:41:02,001 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1676190916] [2019-11-21 11:41:02,001 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 11:41:02,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 11:41:02,220 INFO L255 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-21 11:41:02,222 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 11:41:02,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 11:41:02,309 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 11:41:02,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 11:41:02,404 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1676190916] [2019-11-21 11:41:02,404 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 11:41:02,405 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 10 [2019-11-21 11:41:02,405 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107310218] [2019-11-21 11:41:02,405 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-21 11:41:02,405 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 11:41:02,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-21 11:41:02,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-11-21 11:41:02,406 INFO L87 Difference]: Start difference. First operand 46 states and 49 transitions. Second operand 10 states. [2019-11-21 11:41:02,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 11:41:02,548 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2019-11-21 11:41:02,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-21 11:41:02,549 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2019-11-21 11:41:02,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 11:41:02,550 INFO L225 Difference]: With dead ends: 41 [2019-11-21 11:41:02,550 INFO L226 Difference]: Without dead ends: 41 [2019-11-21 11:41:02,551 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-11-21 11:41:02,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-11-21 11:41:02,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-11-21 11:41:02,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-11-21 11:41:02,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 43 transitions. [2019-11-21 11:41:02,555 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 43 transitions. Word has length 18 [2019-11-21 11:41:02,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 11:41:02,555 INFO L462 AbstractCegarLoop]: Abstraction has 41 states and 43 transitions. [2019-11-21 11:41:02,556 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-21 11:41:02,556 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 43 transitions. [2019-11-21 11:41:02,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-21 11:41:02,556 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 11:41:02,557 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 11:41:02,757 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 11:41:02,758 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, expandArrayErr4REQUIRES_VIOLATION, expandArrayErr3REQUIRES_VIOLATION, expandArrayErr2REQUIRES_VIOLATION, expandArrayErr1REQUIRES_VIOLATION, expandArrayErr0REQUIRES_VIOLATION, expandArrayErr5REQUIRES_VIOLATION]=== [2019-11-21 11:41:02,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 11:41:02,759 INFO L82 PathProgramCache]: Analyzing trace with hash 2000066657, now seen corresponding path program 1 times [2019-11-21 11:41:02,759 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 11:41:02,760 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [939536781] [2019-11-21 11:41:02,760 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 11:41:02,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 11:41:02,972 INFO L255 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-21 11:41:02,974 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 11:41:03,019 INFO L377 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 16 treesize of output 8 [2019-11-21 11:41:03,020 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 11:41:03,021 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:41:03,022 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-21 11:41:03,022 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:4 [2019-11-21 11:41:03,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 11:41:03,040 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 11:41:03,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 11:41:03,117 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [939536781] [2019-11-21 11:41:03,117 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 11:41:03,117 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 10 [2019-11-21 11:41:03,117 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023265230] [2019-11-21 11:41:03,118 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-21 11:41:03,118 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 11:41:03,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-21 11:41:03,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-11-21 11:41:03,119 INFO L87 Difference]: Start difference. First operand 41 states and 43 transitions. Second operand 10 states. [2019-11-21 11:41:03,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 11:41:03,338 INFO L93 Difference]: Finished difference Result 46 states and 49 transitions. [2019-11-21 11:41:03,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-21 11:41:03,339 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2019-11-21 11:41:03,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 11:41:03,340 INFO L225 Difference]: With dead ends: 46 [2019-11-21 11:41:03,340 INFO L226 Difference]: Without dead ends: 46 [2019-11-21 11:41:03,340 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-11-21 11:41:03,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-11-21 11:41:03,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2019-11-21 11:41:03,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-11-21 11:41:03,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 48 transitions. [2019-11-21 11:41:03,346 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 48 transitions. Word has length 20 [2019-11-21 11:41:03,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 11:41:03,347 INFO L462 AbstractCegarLoop]: Abstraction has 45 states and 48 transitions. [2019-11-21 11:41:03,347 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-21 11:41:03,347 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2019-11-21 11:41:03,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-21 11:41:03,349 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 11:41:03,349 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 11:41:03,554 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 11:41:03,554 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, expandArrayErr4REQUIRES_VIOLATION, expandArrayErr3REQUIRES_VIOLATION, expandArrayErr2REQUIRES_VIOLATION, expandArrayErr1REQUIRES_VIOLATION, expandArrayErr0REQUIRES_VIOLATION, expandArrayErr5REQUIRES_VIOLATION]=== [2019-11-21 11:41:03,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 11:41:03,555 INFO L82 PathProgramCache]: Analyzing trace with hash 2028695808, now seen corresponding path program 1 times [2019-11-21 11:41:03,555 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 11:41:03,555 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [702731112] [2019-11-21 11:41:03,555 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 11:41:03,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 11:41:03,778 INFO L255 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-21 11:41:03,780 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 11:41:03,810 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:41:03,810 INFO L377 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 1 case distinctions, treesize of input 9 treesize of output 25 [2019-11-21 11:41:03,811 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 11:41:03,827 INFO L567 ElimStorePlain]: treesize reduction 10, result has 60.0 percent of original size [2019-11-21 11:41:03,828 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 11:41:03,828 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:9, output treesize:5 [2019-11-21 11:41:03,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 11:41:03,855 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 11:41:03,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 11:41:03,882 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [702731112] [2019-11-21 11:41:03,882 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 11:41:03,882 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-11-21 11:41:03,883 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636712183] [2019-11-21 11:41:03,883 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-21 11:41:03,883 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 11:41:03,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-21 11:41:03,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-21 11:41:03,883 INFO L87 Difference]: Start difference. First operand 45 states and 48 transitions. Second operand 5 states. [2019-11-21 11:41:04,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 11:41:04,043 INFO L93 Difference]: Finished difference Result 44 states and 47 transitions. [2019-11-21 11:41:04,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-21 11:41:04,044 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2019-11-21 11:41:04,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 11:41:04,045 INFO L225 Difference]: With dead ends: 44 [2019-11-21 11:41:04,045 INFO L226 Difference]: Without dead ends: 44 [2019-11-21 11:41:04,045 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-21 11:41:04,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-11-21 11:41:04,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-11-21 11:41:04,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-11-21 11:41:04,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 47 transitions. [2019-11-21 11:41:04,051 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 47 transitions. Word has length 20 [2019-11-21 11:41:04,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 11:41:04,051 INFO L462 AbstractCegarLoop]: Abstraction has 44 states and 47 transitions. [2019-11-21 11:41:04,051 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-21 11:41:04,051 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 47 transitions. [2019-11-21 11:41:04,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-21 11:41:04,052 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 11:41:04,052 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 11:41:04,255 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 11:41:04,256 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, expandArrayErr4REQUIRES_VIOLATION, expandArrayErr3REQUIRES_VIOLATION, expandArrayErr2REQUIRES_VIOLATION, expandArrayErr1REQUIRES_VIOLATION, expandArrayErr0REQUIRES_VIOLATION, expandArrayErr5REQUIRES_VIOLATION]=== [2019-11-21 11:41:04,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 11:41:04,257 INFO L82 PathProgramCache]: Analyzing trace with hash 2028695809, now seen corresponding path program 1 times [2019-11-21 11:41:04,257 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 11:41:04,258 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1539557750] [2019-11-21 11:41:04,258 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 11:41:04,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 11:41:04,496 INFO L255 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-21 11:41:04,498 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 11:41:04,519 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 [2019-11-21 11:41:04,520 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 11:41:04,529 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:41:04,529 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 11:41:04,529 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-11-21 11:41:04,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 11:41:04,580 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 11:41:05,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 11:41:05,075 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1539557750] [2019-11-21 11:41:05,075 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 11:41:05,075 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 11 [2019-11-21 11:41:05,076 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484050595] [2019-11-21 11:41:05,076 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-21 11:41:05,076 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 11:41:05,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-21 11:41:05,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-11-21 11:41:05,078 INFO L87 Difference]: Start difference. First operand 44 states and 47 transitions. Second operand 12 states. [2019-11-21 11:41:05,857 WARN L192 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 26 [2019-11-21 11:41:06,512 WARN L192 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 24 [2019-11-21 11:41:06,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 11:41:06,974 INFO L93 Difference]: Finished difference Result 131 states and 138 transitions. [2019-11-21 11:41:06,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-21 11:41:06,975 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 20 [2019-11-21 11:41:06,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 11:41:06,976 INFO L225 Difference]: With dead ends: 131 [2019-11-21 11:41:06,977 INFO L226 Difference]: Without dead ends: 129 [2019-11-21 11:41:06,977 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-11-21 11:41:06,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-11-21 11:41:06,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 68. [2019-11-21 11:41:06,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-11-21 11:41:06,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 81 transitions. [2019-11-21 11:41:06,986 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 81 transitions. Word has length 20 [2019-11-21 11:41:06,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 11:41:06,986 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 81 transitions. [2019-11-21 11:41:06,986 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-21 11:41:06,987 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 81 transitions. [2019-11-21 11:41:06,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-21 11:41:06,987 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 11:41:06,988 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 11:41:07,191 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 11:41:07,192 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, expandArrayErr4REQUIRES_VIOLATION, expandArrayErr3REQUIRES_VIOLATION, expandArrayErr2REQUIRES_VIOLATION, expandArrayErr1REQUIRES_VIOLATION, expandArrayErr0REQUIRES_VIOLATION, expandArrayErr5REQUIRES_VIOLATION]=== [2019-11-21 11:41:07,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 11:41:07,193 INFO L82 PathProgramCache]: Analyzing trace with hash -1534939367, now seen corresponding path program 1 times [2019-11-21 11:41:07,194 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 11:41:07,194 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [2079783075] [2019-11-21 11:41:07,195 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 11:41:07,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 11:41:07,503 INFO L255 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 20 conjunts are in the unsatisfiable core [2019-11-21 11:41:07,505 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 11:41:07,518 INFO L377 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 18 treesize of output 12 [2019-11-21 11:41:07,518 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 11:41:07,523 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:41:07,523 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 11:41:07,523 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:12 [2019-11-21 11:41:07,593 INFO L377 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 16 treesize of output 8 [2019-11-21 11:41:07,593 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 11:41:07,604 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:41:07,604 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-21 11:41:07,605 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:10 [2019-11-21 11:41:07,683 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:41:07,683 INFO L377 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 15 treesize of output 47 [2019-11-21 11:41:07,684 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 11:41:07,722 INFO L567 ElimStorePlain]: treesize reduction 24, result has 50.0 percent of original size [2019-11-21 11:41:07,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 11:41:07,725 INFO L496 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. [2019-11-21 11:41:07,725 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:24 [2019-11-21 11:41:07,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 11:41:07,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 11:41:07,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 11:41:07,812 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 11:41:08,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 11:41:08,008 INFO L377 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 14 treesize of output 10 [2019-11-21 11:41:08,009 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 11:41:08,014 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2019-11-21 11:41:08,014 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 11:41:08,016 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:41:08,016 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 11:41:08,017 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:30, output treesize:8 [2019-11-21 11:41:08,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 11:41:08,050 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2079783075] [2019-11-21 11:41:08,051 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 11:41:08,051 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10, 8] imperfect sequences [] total 15 [2019-11-21 11:41:08,051 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244500504] [2019-11-21 11:41:08,051 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-21 11:41:08,052 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 11:41:08,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-21 11:41:08,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2019-11-21 11:41:08,052 INFO L87 Difference]: Start difference. First operand 68 states and 81 transitions. Second operand 16 states. [2019-11-21 11:41:09,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 11:41:09,409 INFO L93 Difference]: Finished difference Result 77 states and 88 transitions. [2019-11-21 11:41:09,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-21 11:41:09,410 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 21 [2019-11-21 11:41:09,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 11:41:09,411 INFO L225 Difference]: With dead ends: 77 [2019-11-21 11:41:09,411 INFO L226 Difference]: Without dead ends: 77 [2019-11-21 11:41:09,412 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=82, Invalid=338, Unknown=0, NotChecked=0, Total=420 [2019-11-21 11:41:09,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-11-21 11:41:09,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 68. [2019-11-21 11:41:09,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-11-21 11:41:09,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 80 transitions. [2019-11-21 11:41:09,418 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 80 transitions. Word has length 21 [2019-11-21 11:41:09,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 11:41:09,419 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 80 transitions. [2019-11-21 11:41:09,419 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-21 11:41:09,419 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 80 transitions. [2019-11-21 11:41:09,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-21 11:41:09,420 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 11:41:09,420 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 11:41:09,622 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 11:41:09,623 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, expandArrayErr4REQUIRES_VIOLATION, expandArrayErr3REQUIRES_VIOLATION, expandArrayErr2REQUIRES_VIOLATION, expandArrayErr1REQUIRES_VIOLATION, expandArrayErr0REQUIRES_VIOLATION, expandArrayErr5REQUIRES_VIOLATION]=== [2019-11-21 11:41:09,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 11:41:09,624 INFO L82 PathProgramCache]: Analyzing trace with hash -1534939366, now seen corresponding path program 1 times [2019-11-21 11:41:09,624 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 11:41:09,625 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1356521237] [2019-11-21 11:41:09,625 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 11:41:10,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 11:41:10,020 INFO L255 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 26 conjunts are in the unsatisfiable core [2019-11-21 11:41:10,022 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 11:41:10,030 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_57|], 1=[|v_#valid_109|]} [2019-11-21 11:41:10,035 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 11:41:10,037 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2019-11-21 11:41:10,037 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 11:41:10,049 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:41:10,053 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 11:41:10,056 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2019-11-21 11:41:10,056 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 11:41:10,071 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:41:10,071 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 11:41:10,071 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:18 [2019-11-21 11:41:10,173 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2019-11-21 11:41:10,173 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 11:41:10,208 INFO L567 ElimStorePlain]: treesize reduction 8, result has 72.4 percent of original size [2019-11-21 11:41:10,208 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-21 11:41:10,208 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:40, output treesize:21 [2019-11-21 11:41:11,583 INFO L392 ElimStorePlain]: Different costs {2=[|v_#valid_BEFORE_CALL_8|], 3=[|v_old(#length)_AFTER_CALL_23|]} [2019-11-21 11:41:11,607 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:41:11,608 INFO L377 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 20 treesize of output 24 [2019-11-21 11:41:11,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 11:41:11,609 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-11-21 11:41:11,644 INFO L567 ElimStorePlain]: treesize reduction 4, result has 87.5 percent of original size [2019-11-21 11:41:11,692 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:41:11,692 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 48 [2019-11-21 11:41:11,693 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 11:41:11,731 INFO L567 ElimStorePlain]: treesize reduction 20, result has 57.4 percent of original size [2019-11-21 11:41:11,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 11:41:11,733 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 11:41:11,733 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:37, output treesize:9 [2019-11-21 11:41:11,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 11:41:11,758 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 11:41:11,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 11:41:12,157 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 23 [2019-11-21 11:41:12,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 11:41:13,857 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:41:13,857 INFO L377 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 30 treesize of output 34 [2019-11-21 11:41:13,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 11:41:13,859 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-11-21 11:41:13,918 INFO L567 ElimStorePlain]: treesize reduction 8, result has 80.5 percent of original size [2019-11-21 11:41:13,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 11:41:13,920 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-21 11:41:13,920 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:33 [2019-11-21 11:41:13,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 11:41:14,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 11:41:14,033 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1356521237] [2019-11-21 11:41:14,034 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 11:41:14,034 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [] total 17 [2019-11-21 11:41:14,034 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398434577] [2019-11-21 11:41:14,034 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-21 11:41:14,034 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 11:41:14,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-21 11:41:14,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=253, Unknown=1, NotChecked=0, Total=306 [2019-11-21 11:41:14,035 INFO L87 Difference]: Start difference. First operand 68 states and 80 transitions. Second operand 18 states. [2019-11-21 11:41:23,121 WARN L192 SmtUtils]: Spent 2.05 s on a formula simplification that was a NOOP. DAG size: 45 [2019-11-21 11:41:27,774 WARN L192 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 56 [2019-11-21 11:41:56,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 11:41:56,224 INFO L93 Difference]: Finished difference Result 73 states and 84 transitions. [2019-11-21 11:41:56,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-21 11:41:56,225 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 21 [2019-11-21 11:41:56,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 11:41:56,226 INFO L225 Difference]: With dead ends: 73 [2019-11-21 11:41:56,226 INFO L226 Difference]: Without dead ends: 73 [2019-11-21 11:41:56,227 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 18.7s TimeCoverageRelationStatistics Valid=123, Invalid=470, Unknown=7, NotChecked=0, Total=600 [2019-11-21 11:41:56,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-11-21 11:41:56,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 68. [2019-11-21 11:41:56,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-11-21 11:41:56,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 79 transitions. [2019-11-21 11:41:56,232 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 79 transitions. Word has length 21 [2019-11-21 11:41:56,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 11:41:56,232 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 79 transitions. [2019-11-21 11:41:56,232 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-21 11:41:56,233 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 79 transitions. [2019-11-21 11:41:56,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-21 11:41:56,234 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 11:41:56,234 INFO L410 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] [2019-11-21 11:41:56,437 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 11:41:56,437 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, expandArrayErr4REQUIRES_VIOLATION, expandArrayErr3REQUIRES_VIOLATION, expandArrayErr2REQUIRES_VIOLATION, expandArrayErr1REQUIRES_VIOLATION, expandArrayErr0REQUIRES_VIOLATION, expandArrayErr5REQUIRES_VIOLATION]=== [2019-11-21 11:41:56,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 11:41:56,438 INFO L82 PathProgramCache]: Analyzing trace with hash -1895188378, now seen corresponding path program 1 times [2019-11-21 11:41:56,438 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 11:41:56,439 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1189130319] [2019-11-21 11:41:56,439 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 11:41:56,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 11:41:56,622 INFO L255 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-21 11:41:56,624 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 11:41:56,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 11:41:56,642 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 11:41:56,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 11:41:56,709 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1189130319] [2019-11-21 11:41:56,710 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 11:41:56,710 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2019-11-21 11:41:56,710 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879932535] [2019-11-21 11:41:56,710 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-21 11:41:56,710 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 11:41:56,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-21 11:41:56,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-21 11:41:56,711 INFO L87 Difference]: Start difference. First operand 68 states and 79 transitions. Second operand 5 states. [2019-11-21 11:41:56,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 11:41:56,824 INFO L93 Difference]: Finished difference Result 68 states and 75 transitions. [2019-11-21 11:41:56,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-21 11:41:56,826 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2019-11-21 11:41:56,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 11:41:56,827 INFO L225 Difference]: With dead ends: 68 [2019-11-21 11:41:56,827 INFO L226 Difference]: Without dead ends: 68 [2019-11-21 11:41:56,827 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-21 11:41:56,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-11-21 11:41:56,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-11-21 11:41:56,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-11-21 11:41:56,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 75 transitions. [2019-11-21 11:41:56,832 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 75 transitions. Word has length 23 [2019-11-21 11:41:56,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 11:41:56,833 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 75 transitions. [2019-11-21 11:41:56,833 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-21 11:41:56,833 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 75 transitions. [2019-11-21 11:41:56,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-21 11:41:56,834 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 11:41:56,834 INFO L410 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] [2019-11-21 11:41:57,036 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 11:41:57,037 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, expandArrayErr4REQUIRES_VIOLATION, expandArrayErr3REQUIRES_VIOLATION, expandArrayErr2REQUIRES_VIOLATION, expandArrayErr1REQUIRES_VIOLATION, expandArrayErr0REQUIRES_VIOLATION, expandArrayErr5REQUIRES_VIOLATION]=== [2019-11-21 11:41:57,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 11:41:57,037 INFO L82 PathProgramCache]: Analyzing trace with hash 1554357335, now seen corresponding path program 1 times [2019-11-21 11:41:57,037 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 11:41:57,038 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1645105156] [2019-11-21 11:41:57,038 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 11:41:57,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 11:41:57,298 INFO L255 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-21 11:41:57,300 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 11:41:57,305 INFO L377 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 5 treesize of output 3 [2019-11-21 11:41:57,306 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 11:41:57,307 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:41:57,307 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 11:41:57,307 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:5, output treesize:1 [2019-11-21 11:41:57,330 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 11:41:57,330 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 11:41:57,372 INFO L377 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 14 treesize of output 10 [2019-11-21 11:41:57,372 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 11:41:57,376 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:41:57,377 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 11:41:57,377 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:1 [2019-11-21 11:41:57,396 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:41:57,397 INFO L377 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 14 treesize of output 18 [2019-11-21 11:41:57,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 11:41:57,398 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 11:41:57,401 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:41:57,401 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 11:41:57,401 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:3 [2019-11-21 11:41:57,418 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 11:41:57,419 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1645105156] [2019-11-21 11:41:57,419 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-21 11:41:57,419 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-21 11:41:57,419 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933532189] [2019-11-21 11:41:57,420 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-21 11:41:57,420 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 11:41:57,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-21 11:41:57,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-21 11:41:57,421 INFO L87 Difference]: Start difference. First operand 68 states and 75 transitions. Second operand 5 states. [2019-11-21 11:41:57,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 11:41:57,579 INFO L93 Difference]: Finished difference Result 67 states and 74 transitions. [2019-11-21 11:41:57,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-21 11:41:57,580 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-11-21 11:41:57,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 11:41:57,582 INFO L225 Difference]: With dead ends: 67 [2019-11-21 11:41:57,582 INFO L226 Difference]: Without dead ends: 67 [2019-11-21 11:41:57,583 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-21 11:41:57,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-11-21 11:41:57,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-11-21 11:41:57,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-11-21 11:41:57,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 74 transitions. [2019-11-21 11:41:57,587 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 74 transitions. Word has length 27 [2019-11-21 11:41:57,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 11:41:57,588 INFO L462 AbstractCegarLoop]: Abstraction has 67 states and 74 transitions. [2019-11-21 11:41:57,588 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-21 11:41:57,588 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 74 transitions. [2019-11-21 11:41:57,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-21 11:41:57,589 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 11:41:57,589 INFO L410 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] [2019-11-21 11:41:57,792 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 11:41:57,793 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, expandArrayErr4REQUIRES_VIOLATION, expandArrayErr3REQUIRES_VIOLATION, expandArrayErr2REQUIRES_VIOLATION, expandArrayErr1REQUIRES_VIOLATION, expandArrayErr0REQUIRES_VIOLATION, expandArrayErr5REQUIRES_VIOLATION]=== [2019-11-21 11:41:57,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 11:41:57,793 INFO L82 PathProgramCache]: Analyzing trace with hash 1554357336, now seen corresponding path program 1 times [2019-11-21 11:41:57,794 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 11:41:57,795 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [662552793] [2019-11-21 11:41:57,795 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 16 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 11:41:58,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 11:41:58,077 INFO L255 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-21 11:41:58,078 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 11:41:58,127 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 11:41:58,128 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 11:41:58,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 11:41:58,232 INFO L377 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 12 treesize of output 10 [2019-11-21 11:41:58,232 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-21 11:41:58,242 INFO L377 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 14 treesize of output 12 [2019-11-21 11:41:58,243 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-21 11:41:58,272 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:41:58,273 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-11-21 11:41:58,274 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:23 [2019-11-21 11:41:58,403 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:41:58,404 INFO L377 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 16 treesize of output 20 [2019-11-21 11:41:58,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 11:41:58,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 11:41:58,406 INFO L496 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-21 11:41:58,439 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:41:58,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 11:41:58,440 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-21 11:41:58,440 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:30 [2019-11-21 11:41:58,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 11:41:58,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 11:41:58,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 11:41:58,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 11:41:58,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 11:41:58,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 11:41:59,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 11:41:59,205 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 11:41:59,205 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [662552793] [2019-11-21 11:41:59,205 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-21 11:41:59,205 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2019-11-21 11:41:59,206 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012465102] [2019-11-21 11:41:59,206 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-21 11:41:59,206 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 11:41:59,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-21 11:41:59,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-11-21 11:41:59,207 INFO L87 Difference]: Start difference. First operand 67 states and 74 transitions. Second operand 10 states. [2019-11-21 11:41:59,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 11:41:59,459 INFO L93 Difference]: Finished difference Result 66 states and 73 transitions. [2019-11-21 11:41:59,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-21 11:41:59,460 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 27 [2019-11-21 11:41:59,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 11:41:59,461 INFO L225 Difference]: With dead ends: 66 [2019-11-21 11:41:59,461 INFO L226 Difference]: Without dead ends: 66 [2019-11-21 11:41:59,461 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 38 SyntacticMatches, 7 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-11-21 11:41:59,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-11-21 11:41:59,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2019-11-21 11:41:59,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-11-21 11:41:59,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 73 transitions. [2019-11-21 11:41:59,465 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 73 transitions. Word has length 27 [2019-11-21 11:41:59,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 11:41:59,466 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 73 transitions. [2019-11-21 11:41:59,466 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-21 11:41:59,466 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 73 transitions. [2019-11-21 11:41:59,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-21 11:41:59,467 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 11:41:59,467 INFO L410 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] [2019-11-21 11:41:59,669 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 11:41:59,670 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, expandArrayErr4REQUIRES_VIOLATION, expandArrayErr3REQUIRES_VIOLATION, expandArrayErr2REQUIRES_VIOLATION, expandArrayErr1REQUIRES_VIOLATION, expandArrayErr0REQUIRES_VIOLATION, expandArrayErr5REQUIRES_VIOLATION]=== [2019-11-21 11:41:59,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 11:41:59,670 INFO L82 PathProgramCache]: Analyzing trace with hash 940437124, now seen corresponding path program 1 times [2019-11-21 11:41:59,671 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 11:41:59,671 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [362644075] [2019-11-21 11:41:59,672 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 17 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 11:41:59,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 11:41:59,929 INFO L255 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-21 11:41:59,930 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 11:41:59,985 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-21 11:41:59,986 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 11:41:59,988 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:41:59,989 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-21 11:41:59,989 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2019-11-21 11:42:00,022 INFO L377 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 7 [2019-11-21 11:42:00,023 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 11:42:00,024 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:42:00,024 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-21 11:42:00,024 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-11-21 11:42:00,036 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 11:42:00,036 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 11:42:00,140 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2019-11-21 11:42:00,141 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2019-11-21 11:42:00,152 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:42:00,153 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-11-21 11:42:00,153 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:10 [2019-11-21 11:42:00,177 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 11:42:00,177 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [362644075] [2019-11-21 11:42:00,177 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-21 11:42:00,178 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 10 [2019-11-21 11:42:00,178 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279195104] [2019-11-21 11:42:00,178 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-21 11:42:00,178 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 11:42:00,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-21 11:42:00,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-11-21 11:42:00,179 INFO L87 Difference]: Start difference. First operand 66 states and 73 transitions. Second operand 11 states. [2019-11-21 11:42:00,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 11:42:00,504 INFO L93 Difference]: Finished difference Result 65 states and 72 transitions. [2019-11-21 11:42:00,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-21 11:42:00,505 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2019-11-21 11:42:00,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 11:42:00,506 INFO L225 Difference]: With dead ends: 65 [2019-11-21 11:42:00,506 INFO L226 Difference]: Without dead ends: 65 [2019-11-21 11:42:00,507 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2019-11-21 11:42:00,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-11-21 11:42:00,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-11-21 11:42:00,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-11-21 11:42:00,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 72 transitions. [2019-11-21 11:42:00,511 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 72 transitions. Word has length 28 [2019-11-21 11:42:00,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 11:42:00,511 INFO L462 AbstractCegarLoop]: Abstraction has 65 states and 72 transitions. [2019-11-21 11:42:00,511 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-21 11:42:00,511 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 72 transitions. [2019-11-21 11:42:00,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-21 11:42:00,513 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 11:42:00,513 INFO L410 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] [2019-11-21 11:42:00,713 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 11:42:00,714 INFO L410 AbstractCegarLoop]: === Iteration 17 === [mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, expandArrayErr4REQUIRES_VIOLATION, expandArrayErr3REQUIRES_VIOLATION, expandArrayErr2REQUIRES_VIOLATION, expandArrayErr1REQUIRES_VIOLATION, expandArrayErr0REQUIRES_VIOLATION, expandArrayErr5REQUIRES_VIOLATION]=== [2019-11-21 11:42:00,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 11:42:00,714 INFO L82 PathProgramCache]: Analyzing trace with hash -911220169, now seen corresponding path program 1 times [2019-11-21 11:42:00,715 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 11:42:00,715 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [917328136] [2019-11-21 11:42:00,716 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 18 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 11:42:01,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 11:42:01,048 INFO L255 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-21 11:42:01,049 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 11:42:01,153 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-21 11:42:01,153 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 11:42:01,164 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:42:01,165 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-21 11:42:01,165 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:11 [2019-11-21 11:42:01,222 INFO L377 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 7 [2019-11-21 11:42:01,223 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 11:42:01,228 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:42:01,229 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-21 11:42:01,229 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:7 [2019-11-21 11:42:01,254 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 11:42:01,254 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 11:42:01,418 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2019-11-21 11:42:01,419 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-21 11:42:01,450 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:42:01,451 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-21 11:42:01,451 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:24 [2019-11-21 11:42:01,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 11:42:01,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 11:42:01,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 11:42:01,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 11:42:01,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 11:42:01,817 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 11:42:01,818 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [917328136] [2019-11-21 11:42:01,818 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-21 11:42:01,818 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 17 [2019-11-21 11:42:01,818 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605455276] [2019-11-21 11:42:01,819 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-21 11:42:01,819 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 11:42:01,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-21 11:42:01,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2019-11-21 11:42:01,820 INFO L87 Difference]: Start difference. First operand 65 states and 72 transitions. Second operand 18 states. [2019-11-21 11:42:02,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 11:42:02,534 INFO L93 Difference]: Finished difference Result 64 states and 71 transitions. [2019-11-21 11:42:02,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-21 11:42:02,536 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 29 [2019-11-21 11:42:02,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 11:42:02,537 INFO L225 Difference]: With dead ends: 64 [2019-11-21 11:42:02,537 INFO L226 Difference]: Without dead ends: 64 [2019-11-21 11:42:02,538 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=89, Invalid=373, Unknown=0, NotChecked=0, Total=462 [2019-11-21 11:42:02,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-11-21 11:42:02,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-11-21 11:42:02,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-11-21 11:42:02,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 71 transitions. [2019-11-21 11:42:02,542 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 71 transitions. Word has length 29 [2019-11-21 11:42:02,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 11:42:02,542 INFO L462 AbstractCegarLoop]: Abstraction has 64 states and 71 transitions. [2019-11-21 11:42:02,543 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-21 11:42:02,543 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 71 transitions. [2019-11-21 11:42:02,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-21 11:42:02,544 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 11:42:02,544 INFO L410 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] [2019-11-21 11:42:02,747 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 11:42:02,748 INFO L410 AbstractCegarLoop]: === Iteration 18 === [mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, expandArrayErr4REQUIRES_VIOLATION, expandArrayErr3REQUIRES_VIOLATION, expandArrayErr2REQUIRES_VIOLATION, expandArrayErr1REQUIRES_VIOLATION, expandArrayErr0REQUIRES_VIOLATION, expandArrayErr5REQUIRES_VIOLATION]=== [2019-11-21 11:42:02,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 11:42:02,748 INFO L82 PathProgramCache]: Analyzing trace with hash 1816945894, now seen corresponding path program 1 times [2019-11-21 11:42:02,749 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 11:42:02,749 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1706212922] [2019-11-21 11:42:02,749 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 19 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 11:42:03,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 11:42:03,013 INFO L255 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-21 11:42:03,014 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 11:42:03,022 INFO L377 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 5 treesize of output 3 [2019-11-21 11:42:03,022 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 11:42:03,024 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:42:03,024 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 11:42:03,024 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:9, output treesize:3 [2019-11-21 11:42:03,056 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:42:03,056 INFO L377 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 1 case distinctions, treesize of input 9 treesize of output 25 [2019-11-21 11:42:03,057 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 11:42:03,082 INFO L567 ElimStorePlain]: treesize reduction 10, result has 60.0 percent of original size [2019-11-21 11:42:03,083 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 11:42:03,083 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:9, output treesize:5 [2019-11-21 11:42:03,129 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-21 11:42:03,129 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 11:42:03,137 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:42:03,138 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-21 11:42:03,138 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:11 [2019-11-21 11:42:03,169 INFO L377 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 9 [2019-11-21 11:42:03,169 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 11:42:03,171 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:42:03,171 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-21 11:42:03,171 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:7 [2019-11-21 11:42:03,193 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 11:42:03,194 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 11:42:03,345 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 32 [2019-11-21 11:42:03,346 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-21 11:42:03,402 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:42:03,403 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-21 11:42:03,403 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:32 [2019-11-21 11:42:03,627 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 11:42:03,627 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1706212922] [2019-11-21 11:42:03,627 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-21 11:42:03,627 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 12 [2019-11-21 11:42:03,627 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305858266] [2019-11-21 11:42:03,628 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-21 11:42:03,628 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 11:42:03,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-21 11:42:03,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2019-11-21 11:42:03,628 INFO L87 Difference]: Start difference. First operand 64 states and 71 transitions. Second operand 13 states. [2019-11-21 11:42:04,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 11:42:04,113 INFO L93 Difference]: Finished difference Result 63 states and 70 transitions. [2019-11-21 11:42:04,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-21 11:42:04,115 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 30 [2019-11-21 11:42:04,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 11:42:04,116 INFO L225 Difference]: With dead ends: 63 [2019-11-21 11:42:04,116 INFO L226 Difference]: Without dead ends: 63 [2019-11-21 11:42:04,117 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 45 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2019-11-21 11:42:04,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-11-21 11:42:04,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-11-21 11:42:04,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-11-21 11:42:04,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 70 transitions. [2019-11-21 11:42:04,120 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 70 transitions. Word has length 30 [2019-11-21 11:42:04,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 11:42:04,120 INFO L462 AbstractCegarLoop]: Abstraction has 63 states and 70 transitions. [2019-11-21 11:42:04,120 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-21 11:42:04,120 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 70 transitions. [2019-11-21 11:42:04,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-21 11:42:04,121 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 11:42:04,122 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 11:42:04,324 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 11:42:04,326 INFO L410 AbstractCegarLoop]: === Iteration 19 === [mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, expandArrayErr4REQUIRES_VIOLATION, expandArrayErr3REQUIRES_VIOLATION, expandArrayErr2REQUIRES_VIOLATION, expandArrayErr1REQUIRES_VIOLATION, expandArrayErr0REQUIRES_VIOLATION, expandArrayErr5REQUIRES_VIOLATION]=== [2019-11-21 11:42:04,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 11:42:04,327 INFO L82 PathProgramCache]: Analyzing trace with hash 1392750719, now seen corresponding path program 1 times [2019-11-21 11:42:04,327 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 11:42:04,328 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [502540383] [2019-11-21 11:42:04,328 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 20 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 11:42:04,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 11:42:04,630 INFO L255 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-21 11:42:04,631 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 11:42:04,655 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-21 11:42:04,656 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 11:42:04,660 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:42:04,661 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-21 11:42:04,661 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:8 [2019-11-21 11:42:04,685 INFO L377 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 16 treesize of output 8 [2019-11-21 11:42:04,685 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 11:42:04,687 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:42:04,687 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-21 11:42:04,688 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:16, output treesize:4 [2019-11-21 11:42:04,706 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-21 11:42:04,706 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 11:42:04,734 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-21 11:42:04,734 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [502540383] [2019-11-21 11:42:04,734 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-21 11:42:04,735 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2019-11-21 11:42:04,735 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923437625] [2019-11-21 11:42:04,735 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-21 11:42:04,735 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 11:42:04,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-21 11:42:04,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-21 11:42:04,736 INFO L87 Difference]: Start difference. First operand 63 states and 70 transitions. Second operand 8 states. [2019-11-21 11:42:04,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 11:42:04,975 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2019-11-21 11:42:04,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-21 11:42:04,977 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 31 [2019-11-21 11:42:04,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 11:42:04,977 INFO L225 Difference]: With dead ends: 69 [2019-11-21 11:42:04,978 INFO L226 Difference]: Without dead ends: 63 [2019-11-21 11:42:04,978 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2019-11-21 11:42:04,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-11-21 11:42:04,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-11-21 11:42:04,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-11-21 11:42:04,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2019-11-21 11:42:04,982 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 67 transitions. Word has length 31 [2019-11-21 11:42:04,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 11:42:04,983 INFO L462 AbstractCegarLoop]: Abstraction has 63 states and 67 transitions. [2019-11-21 11:42:04,983 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-21 11:42:04,984 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2019-11-21 11:42:04,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-21 11:42:04,985 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 11:42:04,985 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 11:42:05,185 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 11:42:05,186 INFO L410 AbstractCegarLoop]: === Iteration 20 === [mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, expandArrayErr4REQUIRES_VIOLATION, expandArrayErr3REQUIRES_VIOLATION, expandArrayErr2REQUIRES_VIOLATION, expandArrayErr1REQUIRES_VIOLATION, expandArrayErr0REQUIRES_VIOLATION, expandArrayErr5REQUIRES_VIOLATION]=== [2019-11-21 11:42:05,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 11:42:05,186 INFO L82 PathProgramCache]: Analyzing trace with hash -2014712896, now seen corresponding path program 1 times [2019-11-21 11:42:05,187 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 11:42:05,187 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [503197827] [2019-11-21 11:42:05,187 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 21 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 11:42:05,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 11:42:05,613 INFO L255 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 25 conjunts are in the unsatisfiable core [2019-11-21 11:42:05,615 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 11:42:05,625 INFO L377 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 5 treesize of output 3 [2019-11-21 11:42:05,625 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 11:42:05,627 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:42:05,628 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 11:42:05,628 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:9, output treesize:3 [2019-11-21 11:42:05,690 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 [2019-11-21 11:42:05,690 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 11:42:05,696 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:42:05,696 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 11:42:05,696 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-11-21 11:42:05,747 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-21 11:42:05,748 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 11:42:05,760 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:42:05,761 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-21 11:42:05,761 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:18 [2019-11-21 11:42:05,803 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:42:05,803 INFO L377 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 15 treesize of output 19 [2019-11-21 11:42:05,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 11:42:05,806 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 11:42:05,815 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:42:05,818 INFO L377 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 16 treesize of output 8 [2019-11-21 11:42:05,818 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 11:42:05,829 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:42:05,830 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-21 11:42:05,830 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:10 [2019-11-21 11:42:05,926 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:42:05,927 INFO L377 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 15 treesize of output 47 [2019-11-21 11:42:05,928 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 11:42:05,966 INFO L567 ElimStorePlain]: treesize reduction 24, result has 50.0 percent of original size [2019-11-21 11:42:05,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 11:42:05,967 INFO L496 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. [2019-11-21 11:42:05,968 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:24 [2019-11-21 11:42:05,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 11:42:06,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 11:42:06,068 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 11:42:06,068 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 11:42:06,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 11:42:06,305 INFO L377 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 6 treesize of output 4 [2019-11-21 11:42:06,306 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 11:42:06,316 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:42:06,316 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 11:42:06,316 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:13 [2019-11-21 11:42:06,854 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 11:42:06,854 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [503197827] [2019-11-21 11:42:06,854 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-21 11:42:06,854 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13] total 26 [2019-11-21 11:42:06,855 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204733880] [2019-11-21 11:42:06,855 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-11-21 11:42:06,855 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 11:42:06,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-11-21 11:42:06,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=632, Unknown=0, NotChecked=0, Total=702 [2019-11-21 11:42:06,856 INFO L87 Difference]: Start difference. First operand 63 states and 67 transitions. Second operand 27 states. [2019-11-21 11:42:08,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 11:42:08,728 INFO L93 Difference]: Finished difference Result 74 states and 75 transitions. [2019-11-21 11:42:08,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-11-21 11:42:08,729 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 31 [2019-11-21 11:42:08,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 11:42:08,730 INFO L225 Difference]: With dead ends: 74 [2019-11-21 11:42:08,730 INFO L226 Difference]: Without dead ends: 74 [2019-11-21 11:42:08,731 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 33 SyntacticMatches, 3 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 260 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=187, Invalid=1619, Unknown=0, NotChecked=0, Total=1806 [2019-11-21 11:42:08,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-11-21 11:42:08,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 63. [2019-11-21 11:42:08,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-11-21 11:42:08,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 66 transitions. [2019-11-21 11:42:08,734 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 66 transitions. Word has length 31 [2019-11-21 11:42:08,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 11:42:08,734 INFO L462 AbstractCegarLoop]: Abstraction has 63 states and 66 transitions. [2019-11-21 11:42:08,735 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-11-21 11:42:08,735 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 66 transitions. [2019-11-21 11:42:08,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-21 11:42:08,735 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 11:42:08,736 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 11:42:08,940 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 11:42:08,941 INFO L410 AbstractCegarLoop]: === Iteration 21 === [mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, expandArrayErr4REQUIRES_VIOLATION, expandArrayErr3REQUIRES_VIOLATION, expandArrayErr2REQUIRES_VIOLATION, expandArrayErr1REQUIRES_VIOLATION, expandArrayErr0REQUIRES_VIOLATION, expandArrayErr5REQUIRES_VIOLATION]=== [2019-11-21 11:42:08,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 11:42:08,941 INFO L82 PathProgramCache]: Analyzing trace with hash -2014712895, now seen corresponding path program 1 times [2019-11-21 11:42:08,942 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 11:42:08,942 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [971095851] [2019-11-21 11:42:08,942 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 22 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 11:42:09,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 11:42:09,507 INFO L255 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 31 conjunts are in the unsatisfiable core [2019-11-21 11:42:09,509 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 11:42:09,518 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_161|], 1=[|v_#valid_248|]} [2019-11-21 11:42:09,523 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 11:42:09,525 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2019-11-21 11:42:09,525 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 11:42:09,539 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:42:09,542 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 11:42:09,548 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2019-11-21 11:42:09,549 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 11:42:09,556 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:42:09,561 INFO L377 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 9 treesize of output 5 [2019-11-21 11:42:09,561 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-21 11:42:09,569 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:42:09,570 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-21 11:42:09,570 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:29, output treesize:14 [2019-11-21 11:42:09,749 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:42:09,749 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 19 treesize of output 64 [2019-11-21 11:42:09,750 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 11:42:09,805 INFO L567 ElimStorePlain]: treesize reduction 28, result has 54.8 percent of original size [2019-11-21 11:42:09,805 INFO L496 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. [2019-11-21 11:42:09,805 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:34 [2019-11-21 11:42:09,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 11:42:10,183 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:42:10,183 INFO L377 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 17 treesize of output 21 [2019-11-21 11:42:10,184 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-11-21 11:42:10,218 INFO L567 ElimStorePlain]: treesize reduction 8, result has 61.9 percent of original size [2019-11-21 11:42:10,219 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 11:42:10,219 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:9 [2019-11-21 11:42:10,326 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:42:10,326 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 62 [2019-11-21 11:42:10,327 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 11:42:10,375 INFO L567 ElimStorePlain]: treesize reduction 24, result has 52.9 percent of original size [2019-11-21 11:42:10,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 11:42:10,376 INFO L496 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. [2019-11-21 11:42:10,377 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:27 [2019-11-21 11:42:10,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 11:42:10,488 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 11:42:10,783 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 11:42:10,783 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 11:42:11,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 11:42:12,811 WARN L192 SmtUtils]: Spent 1.56 s on a formula simplification that was a NOOP. DAG size: 29 [2019-11-21 11:42:16,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 11:42:22,097 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 11:42:22,098 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [971095851] [2019-11-21 11:42:22,098 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-21 11:42:22,098 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13] total 28 [2019-11-21 11:42:22,099 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797467203] [2019-11-21 11:42:22,099 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-11-21 11:42:22,099 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 11:42:22,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-11-21 11:42:22,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=692, Unknown=1, NotChecked=0, Total=812 [2019-11-21 11:42:22,100 INFO L87 Difference]: Start difference. First operand 63 states and 66 transitions. Second operand 29 states. [2019-11-21 11:42:24,586 WARN L192 SmtUtils]: Spent 2.10 s on a formula simplification that was a NOOP. DAG size: 59 [2019-11-21 11:42:29,904 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2019-11-21 11:42:30,613 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 45 [2019-11-21 11:42:30,996 WARN L192 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 47 [2019-11-21 11:42:31,586 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 39 [2019-11-21 11:42:32,159 WARN L192 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2019-11-21 11:42:33,024 WARN L192 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 56 [2019-11-21 11:42:34,125 WARN L192 SmtUtils]: Spent 598.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 53 [2019-11-21 11:42:36,340 WARN L192 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 42 [2019-11-21 11:42:41,270 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 18 [2019-11-21 11:42:45,086 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2019-11-21 11:42:45,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 11:42:45,087 INFO L93 Difference]: Finished difference Result 95 states and 98 transitions. [2019-11-21 11:42:45,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-11-21 11:42:45,087 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 31 [2019-11-21 11:42:45,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 11:42:45,088 INFO L225 Difference]: With dead ends: 95 [2019-11-21 11:42:45,088 INFO L226 Difference]: Without dead ends: 95 [2019-11-21 11:42:45,089 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 32 SyntacticMatches, 5 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 322 ImplicationChecksByTransitivity, 19.5s TimeCoverageRelationStatistics Valid=264, Invalid=1541, Unknown=1, NotChecked=0, Total=1806 [2019-11-21 11:42:45,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-11-21 11:42:45,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 71. [2019-11-21 11:42:45,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-11-21 11:42:45,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 78 transitions. [2019-11-21 11:42:45,093 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 78 transitions. Word has length 31 [2019-11-21 11:42:45,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 11:42:45,093 INFO L462 AbstractCegarLoop]: Abstraction has 71 states and 78 transitions. [2019-11-21 11:42:45,093 INFO L463 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-11-21 11:42:45,094 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 78 transitions. [2019-11-21 11:42:45,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-21 11:42:45,094 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 11:42:45,095 INFO L410 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] [2019-11-21 11:42:45,295 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 11:42:45,295 INFO L410 AbstractCegarLoop]: === Iteration 22 === [mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, expandArrayErr4REQUIRES_VIOLATION, expandArrayErr3REQUIRES_VIOLATION, expandArrayErr2REQUIRES_VIOLATION, expandArrayErr1REQUIRES_VIOLATION, expandArrayErr0REQUIRES_VIOLATION, expandArrayErr5REQUIRES_VIOLATION]=== [2019-11-21 11:42:45,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 11:42:45,296 INFO L82 PathProgramCache]: Analyzing trace with hash 490747930, now seen corresponding path program 1 times [2019-11-21 11:42:45,297 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 11:42:45,297 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1915166180] [2019-11-21 11:42:45,297 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 23 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 11:42:45,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 11:42:45,644 INFO L255 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 31 conjunts are in the unsatisfiable core [2019-11-21 11:42:45,646 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 11:42:45,649 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 [2019-11-21 11:42:45,649 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 11:42:45,651 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:42:45,651 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 11:42:45,651 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-21 11:42:45,995 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-21 11:42:45,995 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 11:42:46,015 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:42:46,016 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-21 11:42:46,016 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:41, output treesize:42 [2019-11-21 11:42:46,110 INFO L377 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 60 treesize of output 44 [2019-11-21 11:42:46,111 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-21 11:42:46,152 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:42:46,152 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-21 11:42:46,153 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:85, output treesize:69 [2019-11-21 11:42:46,176 INFO L377 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 41 treesize of output 25 [2019-11-21 11:42:46,177 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 11:42:46,195 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:42:46,195 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-21 11:42:46,195 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:55, output treesize:36 [2019-11-21 11:42:48,372 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 11:42:48,372 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 11:42:54,483 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 11:42:54,484 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: Alternating quantifiers not yet supported at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:271) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:253) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:216) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:306) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:102) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:246) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:440) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:419) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:291) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:334) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:177) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:242) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:333) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:171) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) 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) [2019-11-21 11:42:54,491 INFO L168 Benchmark]: Toolchain (without parser) took 118820.53 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 348.7 MB). Free memory was 961.7 MB in the beginning and 958.7 MB in the end (delta: 3.0 MB). Peak memory consumption was 351.7 MB. Max. memory is 11.5 GB. [2019-11-21 11:42:54,492 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-21 11:42:54,492 INFO L168 Benchmark]: CACSL2BoogieTranslator took 639.33 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.9 MB). Free memory was 961.7 MB in the beginning and 1.1 GB in the end (delta: -164.9 MB). Peak memory consumption was 21.9 MB. Max. memory is 11.5 GB. [2019-11-21 11:42:54,492 INFO L168 Benchmark]: Boogie Preprocessor took 83.19 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: 8.2 MB). Peak memory consumption was 8.2 MB. Max. memory is 11.5 GB. [2019-11-21 11:42:54,493 INFO L168 Benchmark]: RCFGBuilder took 754.41 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: 50.6 MB). Peak memory consumption was 50.6 MB. Max. memory is 11.5 GB. [2019-11-21 11:42:54,493 INFO L168 Benchmark]: TraceAbstraction took 117339.01 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 198.7 MB). Free memory was 1.1 GB in the beginning and 958.7 MB in the end (delta: 109.1 MB). Peak memory consumption was 307.8 MB. Max. memory is 11.5 GB. [2019-11-21 11:42:54,495 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 639.33 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.9 MB). Free memory was 961.7 MB in the beginning and 1.1 GB in the end (delta: -164.9 MB). Peak memory consumption was 21.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 83.19 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: 8.2 MB). Peak memory consumption was 8.2 MB. Max. memory is 11.5 GB. * RCFGBuilder took 754.41 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: 50.6 MB). Peak memory consumption was 50.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 117339.01 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 198.7 MB). Free memory was 1.1 GB in the beginning and 958.7 MB in the end (delta: 109.1 MB). Peak memory consumption was 307.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: Alternating quantifiers not yet supported de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: Alternating quantifiers not yet supported: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:271) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...