./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/list-properties/alternating_list-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 678e0110 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/list-properties/alternating_list-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-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-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9c54128245d3ab9ad313da188c7be33f66027c6a ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- Skipped default analysis because property is memsafety ### Bit-precise run ### This is Ultimate 0.1.24-678e011 [2019-11-20 11:16:01,929 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 11:16:01,932 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 11:16:01,948 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 11:16:01,948 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 11:16:01,950 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 11:16:01,951 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 11:16:01,953 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 11:16:01,955 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 11:16:01,956 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 11:16:01,957 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 11:16:01,958 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 11:16:01,959 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 11:16:01,960 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 11:16:01,961 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 11:16:01,962 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 11:16:01,963 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 11:16:01,964 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 11:16:01,966 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 11:16:01,968 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 11:16:01,969 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 11:16:01,970 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 11:16:01,972 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 11:16:01,972 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 11:16:01,975 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 11:16:01,975 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 11:16:01,975 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 11:16:01,976 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 11:16:01,977 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 11:16:01,978 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 11:16:01,978 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 11:16:01,979 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 11:16:01,980 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 11:16:01,981 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 11:16:01,982 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 11:16:01,982 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 11:16:01,983 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 11:16:01,983 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 11:16:01,983 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 11:16:01,984 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 11:16:01,985 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 11:16:01,986 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf [2019-11-20 11:16:02,000 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 11:16:02,001 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 11:16:02,002 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 11:16:02,002 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 11:16:02,002 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 11:16:02,003 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 11:16:02,003 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 11:16:02,003 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-20 11:16:02,004 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 11:16:02,004 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 11:16:02,004 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 11:16:02,004 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-20 11:16:02,005 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-20 11:16:02,005 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 11:16:02,005 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-20 11:16:02,005 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-20 11:16:02,006 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 11:16:02,006 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 11:16:02,006 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 11:16:02,007 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 11:16:02,007 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 11:16:02,007 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 11:16:02,007 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 11:16:02,008 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 11:16:02,008 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 11:16:02,008 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-20 11:16:02,009 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-20 11:16:02,009 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-20 11:16:02,009 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-memcleanup) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9c54128245d3ab9ad313da188c7be33f66027c6a [2019-11-20 11:16:02,312 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 11:16:02,330 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 11:16:02,333 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 11:16:02,335 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 11:16:02,335 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 11:16:02,336 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-properties/alternating_list-2.i [2019-11-20 11:16:02,410 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d12a001ed/6fa9fe5a1d6d427680788171a3080271/FLAGd74c2e387 [2019-11-20 11:16:02,941 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 11:16:02,942 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-properties/alternating_list-2.i [2019-11-20 11:16:02,957 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d12a001ed/6fa9fe5a1d6d427680788171a3080271/FLAGd74c2e387 [2019-11-20 11:16:03,261 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d12a001ed/6fa9fe5a1d6d427680788171a3080271 [2019-11-20 11:16:03,265 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 11:16:03,266 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-20 11:16:03,267 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 11:16:03,268 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 11:16:03,272 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 11:16:03,272 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 11:16:03" (1/1) ... [2019-11-20 11:16:03,275 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d93eb8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:16:03, skipping insertion in model container [2019-11-20 11:16:03,276 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 11:16:03" (1/1) ... [2019-11-20 11:16:03,285 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 11:16:03,345 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 11:16:03,794 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 11:16:03,807 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 11:16:03,853 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 11:16:03,910 INFO L192 MainTranslator]: Completed translation [2019-11-20 11:16:03,911 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:16:03 WrapperNode [2019-11-20 11:16:03,911 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 11:16:03,912 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 11:16:03,912 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 11:16:03,913 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 11:16:03,926 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:16:03" (1/1) ... [2019-11-20 11:16:03,927 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:16:03" (1/1) ... [2019-11-20 11:16:03,946 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:16:03" (1/1) ... [2019-11-20 11:16:03,946 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:16:03" (1/1) ... [2019-11-20 11:16:03,967 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:16:03" (1/1) ... [2019-11-20 11:16:03,972 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:16:03" (1/1) ... [2019-11-20 11:16:03,976 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:16:03" (1/1) ... [2019-11-20 11:16:03,983 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 11:16:03,983 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 11:16:03,984 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 11:16:03,984 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 11:16:03,985 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:16:03" (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-20 11:16:04,055 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-20 11:16:04,055 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 11:16:04,055 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-20 11:16:04,056 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-20 11:16:04,056 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint16_identity [2019-11-20 11:16:04,056 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint32_identity [2019-11-20 11:16:04,056 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint64_identity [2019-11-20 11:16:04,056 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2019-11-20 11:16:04,057 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-20 11:16:04,057 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-20 11:16:04,057 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-20 11:16:04,057 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-20 11:16:04,057 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-20 11:16:04,057 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-20 11:16:04,057 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-20 11:16:04,058 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-20 11:16:04,058 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-20 11:16:04,058 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-20 11:16:04,058 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-20 11:16:04,058 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-20 11:16:04,058 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-20 11:16:04,059 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-20 11:16:04,060 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-20 11:16:04,060 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-20 11:16:04,060 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-20 11:16:04,061 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-20 11:16:04,062 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-20 11:16:04,062 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-20 11:16:04,062 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-20 11:16:04,062 INFO L130 BoogieDeclarations]: Found specification of procedure __uint16_identity [2019-11-20 11:16:04,062 INFO L130 BoogieDeclarations]: Found specification of procedure __uint32_identity [2019-11-20 11:16:04,062 INFO L130 BoogieDeclarations]: Found specification of procedure __uint64_identity [2019-11-20 11:16:04,062 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-20 11:16:04,063 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-20 11:16:04,063 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-20 11:16:04,063 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-20 11:16:04,063 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-20 11:16:04,063 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-20 11:16:04,063 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-20 11:16:04,063 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-20 11:16:04,064 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-20 11:16:04,064 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-20 11:16:04,064 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-20 11:16:04,064 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-20 11:16:04,064 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-20 11:16:04,064 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-20 11:16:04,064 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-20 11:16:04,064 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-20 11:16:04,065 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-20 11:16:04,065 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-20 11:16:04,065 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-20 11:16:04,065 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-20 11:16:04,065 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-20 11:16:04,066 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-20 11:16:04,066 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-20 11:16:04,066 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-20 11:16:04,066 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-20 11:16:04,066 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-20 11:16:04,066 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-20 11:16:04,067 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-20 11:16:04,067 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-20 11:16:04,067 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-20 11:16:04,067 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-20 11:16:04,067 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-20 11:16:04,067 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-20 11:16:04,068 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-20 11:16:04,068 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-20 11:16:04,068 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-20 11:16:04,068 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-20 11:16:04,068 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-20 11:16:04,068 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-20 11:16:04,069 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-20 11:16:04,069 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-20 11:16:04,069 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-20 11:16:04,069 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-20 11:16:04,070 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-20 11:16:04,070 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-20 11:16:04,070 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-20 11:16:04,070 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-20 11:16:04,071 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-20 11:16:04,071 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-20 11:16:04,071 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-20 11:16:04,071 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-20 11:16:04,071 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-20 11:16:04,072 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-20 11:16:04,072 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-20 11:16:04,072 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-20 11:16:04,072 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-20 11:16:04,072 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-20 11:16:04,072 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-20 11:16:04,073 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-20 11:16:04,073 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-20 11:16:04,073 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-20 11:16:04,073 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-20 11:16:04,073 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-20 11:16:04,073 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-20 11:16:04,073 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-20 11:16:04,073 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-20 11:16:04,074 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-20 11:16:04,074 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-20 11:16:04,074 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-20 11:16:04,074 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-20 11:16:04,074 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-20 11:16:04,074 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-20 11:16:04,074 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-20 11:16:04,074 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-20 11:16:04,074 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-20 11:16:04,075 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-20 11:16:04,075 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-20 11:16:04,075 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-20 11:16:04,075 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-20 11:16:04,075 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-20 11:16:04,075 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-20 11:16:04,075 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-20 11:16:04,076 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-20 11:16:04,076 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-20 11:16:04,076 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-20 11:16:04,076 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-20 11:16:04,076 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2019-11-20 11:16:04,077 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-20 11:16:04,077 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-20 11:16:04,077 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-20 11:16:04,077 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-20 11:16:04,078 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-20 11:16:04,078 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-20 11:16:04,078 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-20 11:16:04,078 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-20 11:16:04,079 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 11:16:04,402 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2019-11-20 11:16:04,883 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 11:16:04,883 INFO L285 CfgBuilder]: Removed 3 assume(true) statements. [2019-11-20 11:16:04,885 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 11:16:04 BoogieIcfgContainer [2019-11-20 11:16:04,887 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 11:16:04,888 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-20 11:16:04,889 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-20 11:16:04,893 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-20 11:16:04,893 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 11:16:03" (1/3) ... [2019-11-20 11:16:04,894 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1561917e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 11:16:04, skipping insertion in model container [2019-11-20 11:16:04,895 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:16:03" (2/3) ... [2019-11-20 11:16:04,895 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1561917e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 11:16:04, skipping insertion in model container [2019-11-20 11:16:04,896 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 11:16:04" (3/3) ... [2019-11-20 11:16:04,898 INFO L109 eAbstractionObserver]: Analyzing ICFG alternating_list-2.i [2019-11-20 11:16:04,909 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-20 11:16:04,920 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 29 error locations. [2019-11-20 11:16:04,940 INFO L249 AbstractCegarLoop]: Starting to check reachability of 29 error locations. [2019-11-20 11:16:04,957 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-20 11:16:04,958 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-20 11:16:04,958 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-20 11:16:04,958 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 11:16:04,959 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 11:16:04,959 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-20 11:16:04,959 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 11:16:04,959 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-20 11:16:04,979 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states. [2019-11-20 11:16:04,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-20 11:16:04,988 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:16:04,988 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 11:16:04,989 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-20 11:16:04,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:16:04,994 INFO L82 PathProgramCache]: Analyzing trace with hash -655644872, now seen corresponding path program 1 times [2019-11-20 11:16:05,004 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 11:16:05,004 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [116337414] [2019-11-20 11:16:05,005 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-20 11:16:05,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:16:05,226 INFO L255 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-20 11:16:05,232 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 11:16:05,297 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-20 11:16:05,297 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:16:05,305 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:16:05,305 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:16:05,306 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-20 11:16:05,329 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-20 11:16:05,329 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 11:16:05,345 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-20 11:16:05,346 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [116337414] [2019-11-20 11:16:05,347 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:16:05,348 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-11-20 11:16:05,349 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031596730] [2019-11-20 11:16:05,354 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 11:16:05,354 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 11:16:05,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 11:16:05,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 11:16:05,372 INFO L87 Difference]: Start difference. First operand 79 states. Second operand 4 states. [2019-11-20 11:16:05,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:16:05,763 INFO L93 Difference]: Finished difference Result 99 states and 109 transitions. [2019-11-20 11:16:05,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 11:16:05,765 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-11-20 11:16:05,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:16:05,776 INFO L225 Difference]: With dead ends: 99 [2019-11-20 11:16:05,776 INFO L226 Difference]: Without dead ends: 91 [2019-11-20 11:16:05,778 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-20 11:16:05,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-11-20 11:16:05,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 71. [2019-11-20 11:16:05,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-11-20 11:16:05,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 82 transitions. [2019-11-20 11:16:05,827 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 82 transitions. Word has length 10 [2019-11-20 11:16:05,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:16:05,828 INFO L462 AbstractCegarLoop]: Abstraction has 71 states and 82 transitions. [2019-11-20 11:16:05,829 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 11:16:05,829 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 82 transitions. [2019-11-20 11:16:05,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-20 11:16:05,830 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:16:05,830 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 11:16:06,033 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 11:16:06,033 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-20 11:16:06,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:16:06,034 INFO L82 PathProgramCache]: Analyzing trace with hash -655644871, now seen corresponding path program 1 times [2019-11-20 11:16:06,035 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 11:16:06,035 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1950981473] [2019-11-20 11:16:06,035 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-20 11:16:06,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:16:06,211 INFO L255 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-20 11:16:06,213 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 11:16:06,227 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-20 11:16:06,227 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:16:06,238 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:16:06,239 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:16:06,239 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-20 11:16:06,266 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-20 11:16:06,267 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 11:16:06,367 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-20 11:16:06,368 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1950981473] [2019-11-20 11:16:06,368 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:16:06,368 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2019-11-20 11:16:06,369 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347880251] [2019-11-20 11:16:06,371 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 11:16:06,371 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 11:16:06,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 11:16:06,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-20 11:16:06,372 INFO L87 Difference]: Start difference. First operand 71 states and 82 transitions. Second operand 6 states. [2019-11-20 11:16:06,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:16:06,855 INFO L93 Difference]: Finished difference Result 95 states and 103 transitions. [2019-11-20 11:16:06,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 11:16:06,860 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2019-11-20 11:16:06,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:16:06,862 INFO L225 Difference]: With dead ends: 95 [2019-11-20 11:16:06,862 INFO L226 Difference]: Without dead ends: 95 [2019-11-20 11:16:06,864 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-11-20 11:16:06,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-11-20 11:16:06,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 85. [2019-11-20 11:16:06,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-11-20 11:16:06,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 94 transitions. [2019-11-20 11:16:06,876 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 94 transitions. Word has length 10 [2019-11-20 11:16:06,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:16:06,876 INFO L462 AbstractCegarLoop]: Abstraction has 85 states and 94 transitions. [2019-11-20 11:16:06,877 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 11:16:06,877 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 94 transitions. [2019-11-20 11:16:06,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-20 11:16:06,877 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:16:06,878 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-20 11:16:07,084 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 11:16:07,084 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-20 11:16:07,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:16:07,085 INFO L82 PathProgramCache]: Analyzing trace with hash 952624162, now seen corresponding path program 1 times [2019-11-20 11:16:07,086 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 11:16:07,086 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [349612023] [2019-11-20 11:16:07,086 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-20 11:16:07,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:16:07,322 INFO L255 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-20 11:16:07,324 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 11:16:07,358 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-20 11:16:07,358 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 11:16:07,389 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-20 11:16:07,389 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [349612023] [2019-11-20 11:16:07,389 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:16:07,389 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 3] imperfect sequences [] total 6 [2019-11-20 11:16:07,390 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390001825] [2019-11-20 11:16:07,390 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-20 11:16:07,390 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 11:16:07,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-20 11:16:07,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-20 11:16:07,391 INFO L87 Difference]: Start difference. First operand 85 states and 94 transitions. Second operand 7 states. [2019-11-20 11:16:07,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:16:07,746 INFO L93 Difference]: Finished difference Result 91 states and 100 transitions. [2019-11-20 11:16:07,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 11:16:07,747 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2019-11-20 11:16:07,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:16:07,749 INFO L225 Difference]: With dead ends: 91 [2019-11-20 11:16:07,750 INFO L226 Difference]: Without dead ends: 91 [2019-11-20 11:16:07,750 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-20 11:16:07,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-11-20 11:16:07,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 86. [2019-11-20 11:16:07,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-11-20 11:16:07,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 95 transitions. [2019-11-20 11:16:07,759 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 95 transitions. Word has length 18 [2019-11-20 11:16:07,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:16:07,759 INFO L462 AbstractCegarLoop]: Abstraction has 86 states and 95 transitions. [2019-11-20 11:16:07,759 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-20 11:16:07,760 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 95 transitions. [2019-11-20 11:16:07,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-20 11:16:07,761 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:16:07,761 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 11:16:07,961 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 11:16:07,962 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-20 11:16:07,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:16:07,963 INFO L82 PathProgramCache]: Analyzing trace with hash -533376169, now seen corresponding path program 1 times [2019-11-20 11:16:07,964 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 11:16:07,964 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [106230854] [2019-11-20 11:16:07,965 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-20 11:16:08,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:16:08,118 INFO L255 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-20 11:16:08,120 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 11:16:08,144 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-20 11:16:08,144 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 11:16:08,155 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-20 11:16:08,155 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [106230854] [2019-11-20 11:16:08,156 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:16:08,156 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-11-20 11:16:08,156 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016861218] [2019-11-20 11:16:08,157 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 11:16:08,157 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 11:16:08,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 11:16:08,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-20 11:16:08,157 INFO L87 Difference]: Start difference. First operand 86 states and 95 transitions. Second operand 5 states. [2019-11-20 11:16:08,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:16:08,401 INFO L93 Difference]: Finished difference Result 95 states and 103 transitions. [2019-11-20 11:16:08,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 11:16:08,401 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-11-20 11:16:08,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:16:08,403 INFO L225 Difference]: With dead ends: 95 [2019-11-20 11:16:08,403 INFO L226 Difference]: Without dead ends: 95 [2019-11-20 11:16:08,403 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-20 11:16:08,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-11-20 11:16:08,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 88. [2019-11-20 11:16:08,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-11-20 11:16:08,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 97 transitions. [2019-11-20 11:16:08,432 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 97 transitions. Word has length 19 [2019-11-20 11:16:08,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:16:08,432 INFO L462 AbstractCegarLoop]: Abstraction has 88 states and 97 transitions. [2019-11-20 11:16:08,432 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 11:16:08,432 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 97 transitions. [2019-11-20 11:16:08,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-20 11:16:08,435 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:16:08,435 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 11:16:08,637 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 11:16:08,638 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-20 11:16:08,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:16:08,640 INFO L82 PathProgramCache]: Analyzing trace with hash 439071551, now seen corresponding path program 1 times [2019-11-20 11:16:08,641 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 11:16:08,641 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [851691236] [2019-11-20 11:16:08,641 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-20 11:16:08,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:16:08,823 INFO L255 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-20 11:16:08,825 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 11:16:08,858 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-20 11:16:08,858 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:16:08,865 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:16:08,865 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:16:08,866 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2019-11-20 11:16:08,912 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-20 11:16:08,915 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:16:08,918 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:16:08,918 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-20 11:16:08,918 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2019-11-20 11:16:08,931 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 11:16:08,931 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 11:16:08,989 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 12 [2019-11-20 11:16:08,990 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-11-20 11:16:08,996 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:16:08,997 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-11-20 11:16:08,997 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:7 [2019-11-20 11:16:09,020 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 11:16:09,021 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [851691236] [2019-11-20 11:16:09,021 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:16:09,021 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 6] imperfect sequences [] total 11 [2019-11-20 11:16:09,021 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131128594] [2019-11-20 11:16:09,022 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-20 11:16:09,022 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 11:16:09,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-20 11:16:09,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-11-20 11:16:09,023 INFO L87 Difference]: Start difference. First operand 88 states and 97 transitions. Second operand 11 states. [2019-11-20 11:16:09,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:16:09,863 INFO L93 Difference]: Finished difference Result 230 states and 246 transitions. [2019-11-20 11:16:09,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-20 11:16:09,864 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2019-11-20 11:16:09,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:16:09,866 INFO L225 Difference]: With dead ends: 230 [2019-11-20 11:16:09,866 INFO L226 Difference]: Without dead ends: 226 [2019-11-20 11:16:09,867 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=93, Invalid=213, Unknown=0, NotChecked=0, Total=306 [2019-11-20 11:16:09,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2019-11-20 11:16:09,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 99. [2019-11-20 11:16:09,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-11-20 11:16:09,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 112 transitions. [2019-11-20 11:16:09,880 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 112 transitions. Word has length 19 [2019-11-20 11:16:09,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:16:09,880 INFO L462 AbstractCegarLoop]: Abstraction has 99 states and 112 transitions. [2019-11-20 11:16:09,880 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-20 11:16:09,880 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 112 transitions. [2019-11-20 11:16:09,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-20 11:16:09,881 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:16:09,881 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 11:16:10,091 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 11:16:10,091 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-20 11:16:10,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:16:10,092 INFO L82 PathProgramCache]: Analyzing trace with hash 734896181, now seen corresponding path program 1 times [2019-11-20 11:16:10,092 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 11:16:10,092 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [896309389] [2019-11-20 11:16:10,092 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-20 11:16:10,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:16:10,248 INFO L255 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 11:16:10,249 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 11:16:10,278 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 11:16:10,278 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 11:16:10,290 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 11:16:10,290 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [896309389] [2019-11-20 11:16:10,291 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:16:10,291 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-20 11:16:10,291 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737858954] [2019-11-20 11:16:10,291 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 11:16:10,292 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 11:16:10,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 11:16:10,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 11:16:10,292 INFO L87 Difference]: Start difference. First operand 99 states and 112 transitions. Second operand 4 states. [2019-11-20 11:16:10,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:16:10,309 INFO L93 Difference]: Finished difference Result 145 states and 158 transitions. [2019-11-20 11:16:10,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 11:16:10,309 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-11-20 11:16:10,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:16:10,310 INFO L225 Difference]: With dead ends: 145 [2019-11-20 11:16:10,310 INFO L226 Difference]: Without dead ends: 144 [2019-11-20 11:16:10,311 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 35 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-20 11:16:10,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2019-11-20 11:16:10,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 102. [2019-11-20 11:16:10,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-11-20 11:16:10,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 119 transitions. [2019-11-20 11:16:10,318 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 119 transitions. Word has length 19 [2019-11-20 11:16:10,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:16:10,319 INFO L462 AbstractCegarLoop]: Abstraction has 102 states and 119 transitions. [2019-11-20 11:16:10,319 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 11:16:10,319 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 119 transitions. [2019-11-20 11:16:10,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-20 11:16:10,320 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:16:10,320 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 11:16:10,533 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 11:16:10,533 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-20 11:16:10,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:16:10,534 INFO L82 PathProgramCache]: Analyzing trace with hash 1214032540, now seen corresponding path program 1 times [2019-11-20 11:16:10,534 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 11:16:10,534 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1265608495] [2019-11-20 11:16:10,534 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-20 11:16:10,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:16:10,727 INFO L255 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-20 11:16:10,728 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 11:16:10,762 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:16:10,763 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 28 [2019-11-20 11:16:10,764 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:16:10,790 INFO L567 ElimStorePlain]: treesize reduction 14, result has 44.0 percent of original size [2019-11-20 11:16:10,790 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:16:10,791 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-11-20 11:16:10,817 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 13 treesize of output 9 [2019-11-20 11:16:10,817 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:16:10,831 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:16:10,832 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-20 11:16:10,832 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:17 [2019-11-20 11:16:10,858 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 21 treesize of output 9 [2019-11-20 11:16:10,858 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:16:10,865 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:16:10,866 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 11:16:10,866 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:26, output treesize:11 [2019-11-20 11:16:10,894 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 11:16:10,894 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 11:16:10,931 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 11:16:10,932 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1265608495] [2019-11-20 11:16:10,932 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:16:10,932 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 7 [2019-11-20 11:16:10,932 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416500488] [2019-11-20 11:16:10,933 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-20 11:16:10,933 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 11:16:10,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-20 11:16:10,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-11-20 11:16:10,934 INFO L87 Difference]: Start difference. First operand 102 states and 119 transitions. Second operand 8 states. [2019-11-20 11:16:11,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:16:11,448 INFO L93 Difference]: Finished difference Result 115 states and 132 transitions. [2019-11-20 11:16:11,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-20 11:16:11,449 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2019-11-20 11:16:11,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:16:11,452 INFO L225 Difference]: With dead ends: 115 [2019-11-20 11:16:11,452 INFO L226 Difference]: Without dead ends: 115 [2019-11-20 11:16:11,453 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-11-20 11:16:11,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-11-20 11:16:11,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 99. [2019-11-20 11:16:11,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-11-20 11:16:11,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 115 transitions. [2019-11-20 11:16:11,460 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 115 transitions. Word has length 19 [2019-11-20 11:16:11,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:16:11,460 INFO L462 AbstractCegarLoop]: Abstraction has 99 states and 115 transitions. [2019-11-20 11:16:11,460 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-20 11:16:11,460 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 115 transitions. [2019-11-20 11:16:11,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-20 11:16:11,461 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:16:11,461 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 11:16:11,663 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 11:16:11,664 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-20 11:16:11,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:16:11,664 INFO L82 PathProgramCache]: Analyzing trace with hash 1214032541, now seen corresponding path program 1 times [2019-11-20 11:16:11,665 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 11:16:11,665 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1013864554] [2019-11-20 11:16:11,665 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-20 11:16:11,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:16:11,845 INFO L255 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-20 11:16:11,847 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 11:16:11,855 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-20 11:16:11,856 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:16:11,860 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:16:11,861 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:16:11,861 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-20 11:16:11,884 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 13 treesize of output 9 [2019-11-20 11:16:11,884 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:16:11,897 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:16:11,903 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 13 treesize of output 9 [2019-11-20 11:16:11,903 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 11:16:11,920 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:16:11,921 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:16:11,922 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:23 [2019-11-20 11:16:11,956 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 23 treesize of output 11 [2019-11-20 11:16:11,957 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:16:11,973 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:16:11,981 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 19 treesize of output 7 [2019-11-20 11:16:11,982 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 11:16:11,990 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:16:11,990 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:16:11,990 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:41, output treesize:11 [2019-11-20 11:16:12,017 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 11:16:12,017 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 11:16:12,184 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 11:16:12,184 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1013864554] [2019-11-20 11:16:12,185 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:16:12,185 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2019-11-20 11:16:12,185 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409082773] [2019-11-20 11:16:12,185 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-20 11:16:12,186 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 11:16:12,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-20 11:16:12,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-20 11:16:12,186 INFO L87 Difference]: Start difference. First operand 99 states and 115 transitions. Second operand 10 states. [2019-11-20 11:16:13,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:16:13,251 INFO L93 Difference]: Finished difference Result 125 states and 139 transitions. [2019-11-20 11:16:13,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-20 11:16:13,253 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 19 [2019-11-20 11:16:13,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:16:13,254 INFO L225 Difference]: With dead ends: 125 [2019-11-20 11:16:13,254 INFO L226 Difference]: Without dead ends: 125 [2019-11-20 11:16:13,255 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2019-11-20 11:16:13,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-11-20 11:16:13,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 93. [2019-11-20 11:16:13,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-11-20 11:16:13,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 106 transitions. [2019-11-20 11:16:13,261 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 106 transitions. Word has length 19 [2019-11-20 11:16:13,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:16:13,262 INFO L462 AbstractCegarLoop]: Abstraction has 93 states and 106 transitions. [2019-11-20 11:16:13,262 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-20 11:16:13,262 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 106 transitions. [2019-11-20 11:16:13,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-20 11:16:13,263 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:16:13,264 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-20 11:16:13,466 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 11:16:13,467 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-20 11:16:13,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:16:13,467 INFO L82 PathProgramCache]: Analyzing trace with hash 643791046, now seen corresponding path program 1 times [2019-11-20 11:16:13,467 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 11:16:13,468 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1173002305] [2019-11-20 11:16:13,468 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-20 11:16:13,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:16:13,690 INFO L255 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-20 11:16:13,691 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 11:16:13,695 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-20 11:16:13,695 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:16:13,697 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:16:13,698 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:16:13,698 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-20 11:16:13,756 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-20 11:16:13,756 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 11:16:17,832 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-20 11:16:17,833 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1173002305] [2019-11-20 11:16:17,833 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:16:17,833 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2019-11-20 11:16:17,834 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664439162] [2019-11-20 11:16:17,834 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-20 11:16:17,834 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 11:16:17,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-20 11:16:17,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=65, Unknown=2, NotChecked=0, Total=90 [2019-11-20 11:16:17,835 INFO L87 Difference]: Start difference. First operand 93 states and 106 transitions. Second operand 10 states. [2019-11-20 11:16:18,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:16:18,312 INFO L93 Difference]: Finished difference Result 111 states and 124 transitions. [2019-11-20 11:16:18,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-20 11:16:18,313 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2019-11-20 11:16:18,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:16:18,315 INFO L225 Difference]: With dead ends: 111 [2019-11-20 11:16:18,315 INFO L226 Difference]: Without dead ends: 107 [2019-11-20 11:16:18,315 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=44, Invalid=110, Unknown=2, NotChecked=0, Total=156 [2019-11-20 11:16:18,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-11-20 11:16:18,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 100. [2019-11-20 11:16:18,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-11-20 11:16:18,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 113 transitions. [2019-11-20 11:16:18,320 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 113 transitions. Word has length 20 [2019-11-20 11:16:18,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:16:18,321 INFO L462 AbstractCegarLoop]: Abstraction has 100 states and 113 transitions. [2019-11-20 11:16:18,321 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-20 11:16:18,321 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 113 transitions. [2019-11-20 11:16:18,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-20 11:16:18,322 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:16:18,322 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-20 11:16:18,525 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 11:16:18,526 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-20 11:16:18,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:16:18,526 INFO L82 PathProgramCache]: Analyzing trace with hash 645208103, now seen corresponding path program 1 times [2019-11-20 11:16:18,527 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 11:16:18,527 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [296001145] [2019-11-20 11:16:18,528 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-20 11:16:18,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:16:18,707 INFO L255 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-20 11:16:18,708 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 11:16:18,734 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-20 11:16:18,734 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:16:18,739 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:16:18,739 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:16:18,739 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2019-11-20 11:16:18,810 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-20 11:16:18,811 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:16:18,814 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:16:18,815 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-20 11:16:18,815 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:3 [2019-11-20 11:16:18,841 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-20 11:16:18,842 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 11:16:18,944 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:16:18,945 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 56 [2019-11-20 11:16:18,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:16:18,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:16:18,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:16:18,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:16:18,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:16:18,952 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:16:19,029 INFO L567 ElimStorePlain]: treesize reduction 43, result has 25.9 percent of original size [2019-11-20 11:16:19,031 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-11-20 11:16:19,031 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:7 [2019-11-20 11:16:19,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-20 11:16:19,058 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [296001145] [2019-11-20 11:16:19,058 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:16:19,058 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 13 [2019-11-20 11:16:19,058 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078523451] [2019-11-20 11:16:19,059 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-20 11:16:19,059 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 11:16:19,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-20 11:16:19,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2019-11-20 11:16:19,060 INFO L87 Difference]: Start difference. First operand 100 states and 113 transitions. Second operand 13 states. [2019-11-20 11:16:21,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:16:21,612 INFO L93 Difference]: Finished difference Result 112 states and 122 transitions. [2019-11-20 11:16:21,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-20 11:16:21,612 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 20 [2019-11-20 11:16:21,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:16:21,613 INFO L225 Difference]: With dead ends: 112 [2019-11-20 11:16:21,613 INFO L226 Difference]: Without dead ends: 105 [2019-11-20 11:16:21,613 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2019-11-20 11:16:21,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-11-20 11:16:21,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 96. [2019-11-20 11:16:21,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-11-20 11:16:21,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 108 transitions. [2019-11-20 11:16:21,618 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 108 transitions. Word has length 20 [2019-11-20 11:16:21,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:16:21,618 INFO L462 AbstractCegarLoop]: Abstraction has 96 states and 108 transitions. [2019-11-20 11:16:21,618 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-20 11:16:21,618 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 108 transitions. [2019-11-20 11:16:21,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-20 11:16:21,619 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:16:21,619 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-20 11:16:21,828 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 11:16:21,829 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-20 11:16:21,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:16:21,830 INFO L82 PathProgramCache]: Analyzing trace with hash -1812033750, now seen corresponding path program 1 times [2019-11-20 11:16:21,830 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 11:16:21,832 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1777101920] [2019-11-20 11:16:21,832 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-20 11:16:22,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:16:22,054 INFO L255 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 20 conjunts are in the unsatisfiable core [2019-11-20 11:16:22,056 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 11:16:22,060 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-20 11:16:22,061 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:16:22,065 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:16:22,065 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:16:22,066 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-20 11:16:22,096 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-20 11:16:22,096 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:16:22,109 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:16:22,110 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:16:22,110 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2019-11-20 11:16:22,135 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:16:22,136 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 11 treesize of output 15 [2019-11-20 11:16:22,137 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:16:22,152 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:16:22,153 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:16:22,153 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:23 [2019-11-20 11:16:22,178 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_23|], 2=[|v_#memory_int_25|]} [2019-11-20 11:16:22,195 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 13 treesize of output 9 [2019-11-20 11:16:22,195 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:16:22,236 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:16:22,245 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 11:16:22,247 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2019-11-20 11:16:22,248 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 11:16:22,265 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:16:22,266 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:16:22,266 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:55, output treesize:29 [2019-11-20 11:16:22,312 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 20 treesize of output 8 [2019-11-20 11:16:22,313 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:16:22,322 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:16:22,322 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:16:22,322 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:17 [2019-11-20 11:16:22,384 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2019-11-20 11:16:22,384 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:16:22,398 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:16:22,399 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-20 11:16:22,399 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:24 [2019-11-20 11:16:22,479 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2019-11-20 11:16:22,480 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:16:22,488 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:16:22,489 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-20 11:16:22,489 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:33, output treesize:9 [2019-11-20 11:16:22,512 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-20 11:16:22,512 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 11:16:22,729 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-20 11:16:22,735 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:16:22,736 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-20 11:16:22,736 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:36 [2019-11-20 11:16:25,016 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 274 treesize of output 266 [2019-11-20 11:16:25,018 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-11-20 11:16:25,220 WARN L191 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 32 [2019-11-20 11:16:25,221 INFO L567 ElimStorePlain]: treesize reduction 217, result has 15.6 percent of original size [2019-11-20 11:16:25,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:16:25,223 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-11-20 11:16:25,223 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:51, output treesize:21 [2019-11-20 11:16:25,439 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-20 11:16:25,439 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1777101920] [2019-11-20 11:16:25,439 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 11:16:25,439 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2019-11-20 11:16:25,439 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926181352] [2019-11-20 11:16:25,440 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-11-20 11:16:25,440 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 11:16:25,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-20 11:16:25,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=388, Unknown=1, NotChecked=0, Total=462 [2019-11-20 11:16:25,441 INFO L87 Difference]: Start difference. First operand 96 states and 108 transitions. Second operand 22 states. [2019-11-20 11:16:26,913 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 56 [2019-11-20 11:16:27,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:16:27,944 INFO L93 Difference]: Finished difference Result 101 states and 110 transitions. [2019-11-20 11:16:27,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-11-20 11:16:27,945 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 29 [2019-11-20 11:16:27,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:16:27,946 INFO L225 Difference]: With dead ends: 101 [2019-11-20 11:16:27,947 INFO L226 Difference]: Without dead ends: 97 [2019-11-20 11:16:27,948 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=259, Invalid=1000, Unknown=1, NotChecked=0, Total=1260 [2019-11-20 11:16:27,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-11-20 11:16:27,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 89. [2019-11-20 11:16:27,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-11-20 11:16:27,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 99 transitions. [2019-11-20 11:16:27,952 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 99 transitions. Word has length 29 [2019-11-20 11:16:27,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:16:27,953 INFO L462 AbstractCegarLoop]: Abstraction has 89 states and 99 transitions. [2019-11-20 11:16:27,953 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-11-20 11:16:27,953 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 99 transitions. [2019-11-20 11:16:27,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-20 11:16:27,954 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:16:27,954 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, 1, 1, 1, 1, 1, 1] [2019-11-20 11:16:28,157 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 11:16:28,158 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-20 11:16:28,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:16:28,158 INFO L82 PathProgramCache]: Analyzing trace with hash -306007361, now seen corresponding path program 1 times [2019-11-20 11:16:28,159 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 11:16:28,160 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1956074681] [2019-11-20 11:16:28,160 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-20 11:16:28,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:16:28,360 INFO L255 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 11:16:28,361 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 11:16:28,373 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-20 11:16:28,373 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 11:16:28,393 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-20 11:16:28,393 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1956074681] [2019-11-20 11:16:28,393 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:16:28,393 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-11-20 11:16:28,393 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039032925] [2019-11-20 11:16:28,394 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 11:16:28,394 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 11:16:28,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 11:16:28,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 11:16:28,394 INFO L87 Difference]: Start difference. First operand 89 states and 99 transitions. Second operand 3 states. [2019-11-20 11:16:28,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:16:28,408 INFO L93 Difference]: Finished difference Result 122 states and 128 transitions. [2019-11-20 11:16:28,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 11:16:28,410 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2019-11-20 11:16:28,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:16:28,411 INFO L225 Difference]: With dead ends: 122 [2019-11-20 11:16:28,411 INFO L226 Difference]: Without dead ends: 122 [2019-11-20 11:16:28,411 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 72 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-20 11:16:28,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-11-20 11:16:28,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 89. [2019-11-20 11:16:28,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-11-20 11:16:28,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 97 transitions. [2019-11-20 11:16:28,415 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 97 transitions. Word has length 37 [2019-11-20 11:16:28,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:16:28,415 INFO L462 AbstractCegarLoop]: Abstraction has 89 states and 97 transitions. [2019-11-20 11:16:28,415 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 11:16:28,416 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 97 transitions. [2019-11-20 11:16:28,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-20 11:16:28,417 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:16:28,417 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 11:16:28,620 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 11:16:28,620 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-20 11:16:28,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:16:28,620 INFO L82 PathProgramCache]: Analyzing trace with hash 1059552773, now seen corresponding path program 1 times [2019-11-20 11:16:28,621 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 11:16:28,621 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1032939348] [2019-11-20 11:16:28,621 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-20 11:16:28,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:16:28,878 INFO L255 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 26 conjunts are in the unsatisfiable core [2019-11-20 11:16:28,885 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 11:16:28,892 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-20 11:16:28,892 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:16:28,898 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:16:28,898 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:16:28,898 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-20 11:16:28,947 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:16:28,948 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 11 treesize of output 15 [2019-11-20 11:16:28,948 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:16:28,961 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:16:28,961 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:16:28,961 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2019-11-20 11:16:28,986 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 13 treesize of output 9 [2019-11-20 11:16:28,987 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:16:29,008 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:16:29,008 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-20 11:16:29,011 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:20 [2019-11-20 11:16:37,238 WARN L191 SmtUtils]: Spent 8.14 s on a formula simplification that was a NOOP. DAG size: 22 [2019-11-20 11:16:37,238 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:16:37,239 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 51 [2019-11-20 11:16:37,239 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:16:37,272 INFO L567 ElimStorePlain]: treesize reduction 34, result has 39.3 percent of original size [2019-11-20 11:16:37,272 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:16:37,272 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:43, output treesize:22 [2019-11-20 11:16:37,297 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:16:37,297 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 11 treesize of output 15 [2019-11-20 11:16:37,298 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:16:37,313 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:16:37,314 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:16:37,314 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:27 [2019-11-20 11:16:37,376 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:16:37,376 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 60 [2019-11-20 11:16:37,377 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:16:37,427 INFO L567 ElimStorePlain]: treesize reduction 34, result has 46.9 percent of original size [2019-11-20 11:16:37,428 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-20 11:16:37,428 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:27 [2019-11-20 11:16:37,656 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:16:37,657 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 89 treesize of output 133 [2019-11-20 11:16:37,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:16:37,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:16:37,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:16:37,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:16:37,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:16:37,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:16:37,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:16:37,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:16:37,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:16:37,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:16:37,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:16:37,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:16:37,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:16:37,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:16:37,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:16:37,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:16:37,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:16:37,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:16:37,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:16:37,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:16:37,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:16:37,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:16:37,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:16:37,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:16:37,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:16:37,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:16:37,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:16:37,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:16:37,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:16:37,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:16:37,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:16:37,684 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 15 xjuncts. [2019-11-20 11:17:37,094 WARN L191 SmtUtils]: Spent 59.41 s on a formula simplification. DAG size of input: 74 DAG size of output: 33 [2019-11-20 11:17:37,095 INFO L567 ElimStorePlain]: treesize reduction 2178, result has 6.9 percent of original size [2019-11-20 11:17:37,096 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-20 11:17:37,096 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:92, output treesize:125 [2019-11-20 11:17:37,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 27 treesize of output 15 [2019-11-20 11:17:37,222 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:17:37,228 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:17:37,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-20 11:17:37,229 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:5 [2019-11-20 11:17:37,332 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-20 11:17:37,332 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 11:17:37,432 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-20 11:17:37,436 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:17:37,436 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-20 11:17:37,437 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:19 [2019-11-20 11:17:38,797 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:17:38,798 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 40 treesize of output 44 [2019-11-20 11:17:38,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:17:38,799 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:17:38,806 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:17:38,807 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-20 11:17:38,807 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:29 [2019-11-20 11:17:46,721 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-20 11:17:46,742 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:17:46,743 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-11-20 11:17:46,743 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:60, output treesize:50 [2019-11-20 11:18:11,835 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:18:11,835 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 13 treesize of output 17 [2019-11-20 11:18:11,835 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:18:11,859 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:18:11,859 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-11-20 11:18:11,860 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:86, output treesize:77 [2019-11-20 11:18:12,158 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 1694 treesize of output 1670 [2019-11-20 11:18:12,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:18:12,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:18:12,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:18:12,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:18:12,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:18:12,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,190 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:18:12,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:18:12,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:18:12,201 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,202 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,202 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:18:12,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:18:12,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:18:12,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,227 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,227 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,230 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:18:12,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,233 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:18:12,235 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,235 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:18:12,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,240 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:18:12,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:18:12,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:18:12,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:18:12,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,259 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:18:12,259 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,260 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:18:12,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,268 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:18:12,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:18:12,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:18:12,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:18:12,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:18:12,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:18:12,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:18:12,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:18:12,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:18:12,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,309 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,310 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:18:12,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,315 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:18:12,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,322 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,326 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:18:12,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:18:12,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:18:12,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:18:12,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:18:12,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:18:12,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:18:12,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:18:12,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:18:12,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:18:12,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:18:12,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:18:12,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:18:12,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,385 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,385 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:18:12,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:18:12,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:18:12,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:18:12,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,405 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:18:12,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:18:12,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:18:12,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,414 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:18:12,418 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:18:12,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:12,432 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2019-11-20 11:18:13,889 WARN L191 SmtUtils]: Spent 1.46 s on a formula simplification. DAG size of input: 120 DAG size of output: 47 [2019-11-20 11:18:13,890 INFO L567 ElimStorePlain]: treesize reduction 52155, result has 0.3 percent of original size [2019-11-20 11:18:13,891 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-11-20 11:18:13,891 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:87, output treesize:128 [2019-11-20 11:18:13,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:18:13,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:13,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:18:13,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:18:13,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:13,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:18:13,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:18:13,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:13,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:18:13,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:18:13,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:13,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:18:13,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:18:13,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:18:13,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:18:13,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:13,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:13,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:18:13,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:13,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:13,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:18:14,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:18:14,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:18:14,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:14,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:18:14,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:14,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:14,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:18:14,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:18:14,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:18:14,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:14,147 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:14,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:18:14,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:18:14,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:14,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:18:14,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:18:14,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:18:17,308 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-20 11:18:17,309 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1032939348] [2019-11-20 11:18:17,309 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 11:18:17,309 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17] total 29 [2019-11-20 11:18:17,309 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736311053] [2019-11-20 11:18:17,310 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-11-20 11:18:17,310 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 11:18:17,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-11-20 11:18:17,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=773, Unknown=8, NotChecked=0, Total=870 [2019-11-20 11:18:17,311 INFO L87 Difference]: Start difference. First operand 89 states and 97 transitions. Second operand 30 states. [2019-11-20 11:18:42,458 WARN L191 SmtUtils]: Spent 10.74 s on a formula simplification. DAG size of input: 47 DAG size of output: 37 [2019-11-20 11:18:43,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:18:43,087 INFO L93 Difference]: Finished difference Result 159 states and 174 transitions. [2019-11-20 11:18:43,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-11-20 11:18:43,088 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 37 [2019-11-20 11:18:43,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:18:43,089 INFO L225 Difference]: With dead ends: 159 [2019-11-20 11:18:43,090 INFO L226 Difference]: Without dead ends: 159 [2019-11-20 11:18:43,091 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 41 SyntacticMatches, 5 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 462 ImplicationChecksByTransitivity, 51.4s TimeCoverageRelationStatistics Valid=327, Invalid=2017, Unknown=8, NotChecked=0, Total=2352 [2019-11-20 11:18:43,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-11-20 11:18:43,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 108. [2019-11-20 11:18:43,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-11-20 11:18:43,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 118 transitions. [2019-11-20 11:18:43,095 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 118 transitions. Word has length 37 [2019-11-20 11:18:43,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:18:43,095 INFO L462 AbstractCegarLoop]: Abstraction has 108 states and 118 transitions. [2019-11-20 11:18:43,095 INFO L463 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-11-20 11:18:43,096 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 118 transitions. [2019-11-20 11:18:43,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-20 11:18:43,096 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:18:43,097 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 11:18:43,299 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 11:18:43,300 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-20 11:18:43,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:18:43,301 INFO L82 PathProgramCache]: Analyzing trace with hash 1059552774, now seen corresponding path program 1 times [2019-11-20 11:18:43,302 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 11:18:43,302 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [122138599] [2019-11-20 11:18:43,302 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-20 11:18:43,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:18:43,566 INFO L255 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 26 conjunts are in the unsatisfiable core [2019-11-20 11:18:43,568 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 11:18:43,573 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-20 11:18:43,573 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:18:43,577 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:18:43,578 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:18:43,578 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-20 11:18:43,608 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-20 11:18:43,608 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:18:43,630 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:18:43,630 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:18:43,631 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2019-11-20 11:18:43,658 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:18:43,659 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 11 treesize of output 15 [2019-11-20 11:18:43,659 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:18:43,673 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:18:43,674 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:18:43,674 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:23 [2019-11-20 11:18:43,695 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_40|], 2=[|v_#memory_int_40|]} [2019-11-20 11:18:43,702 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 13 treesize of output 9 [2019-11-20 11:18:43,702 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:18:43,727 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:18:43,734 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 11:18:43,735 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2019-11-20 11:18:43,736 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 11:18:43,753 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:18:43,754 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:18:43,754 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:55, output treesize:29 [2019-11-20 11:18:43,796 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 20 treesize of output 8 [2019-11-20 11:18:43,797 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:18:43,809 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:18:43,812 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:18:43,812 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:37, output treesize:22 [2019-11-20 11:18:43,858 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2019-11-20 11:18:43,859 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:18:43,874 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:18:43,874 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:18:43,875 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:29 [2019-11-20 11:18:43,920 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:18:43,920 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-20 11:18:43,921 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:18:43,936 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:18:43,936 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:18:43,937 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:30 [2019-11-20 11:18:43,970 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_41|], 6=[|v_#memory_int_42|]} [2019-11-20 11:18:43,976 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 9 [2019-11-20 11:18:43,977 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:18:44,010 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:18:44,017 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 11:18:44,018 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 25 [2019-11-20 11:18:44,019 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 11:18:44,039 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:18:44,040 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:18:44,040 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:62, output treesize:34 [2019-11-20 11:18:44,096 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 20 treesize of output 8 [2019-11-20 11:18:44,096 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:18:44,111 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:18:44,112 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-20 11:18:44,113 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:28 [2019-11-20 11:18:44,237 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:18:44,237 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 54 [2019-11-20 11:18:44,238 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:18:44,299 INFO L567 ElimStorePlain]: treesize reduction 16, result has 72.9 percent of original size [2019-11-20 11:18:44,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:44,301 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-20 11:18:44,301 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:39, output treesize:43 [2019-11-20 11:18:44,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:44,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:44,437 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2019-11-20 11:18:44,437 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:18:44,443 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:18:44,443 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:18:44,444 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:28, output treesize:3 [2019-11-20 11:18:44,477 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-20 11:18:44,477 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 11:18:44,625 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-20 11:18:44,630 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:18:44,630 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-20 11:18:44,631 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:20 [2019-11-20 11:18:46,738 WARN L191 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 27 [2019-11-20 11:18:53,523 WARN L191 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 26 [2019-11-20 11:18:59,729 WARN L191 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 26 [2019-11-20 11:18:59,742 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:18:59,742 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 13 treesize of output 17 [2019-11-20 11:18:59,743 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:18:59,756 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:18:59,757 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-20 11:18:59,757 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:46, output treesize:33 [2019-11-20 11:18:59,876 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-20 11:18:59,883 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:18:59,883 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-20 11:18:59,884 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:44, output treesize:43 [2019-11-20 11:19:08,303 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 3002 treesize of output 2970 [2019-11-20 11:19:08,307 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-11-20 11:19:09,266 WARN L191 SmtUtils]: Spent 958.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 44 [2019-11-20 11:19:09,266 INFO L567 ElimStorePlain]: treesize reduction 2844, result has 2.4 percent of original size [2019-11-20 11:19:09,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:19:09,268 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:19:09,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:19:09,270 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-11-20 11:19:09,270 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:32 [2019-11-20 11:19:10,070 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-20 11:19:10,071 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [122138599] [2019-11-20 11:19:10,071 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 11:19:10,071 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14] total 29 [2019-11-20 11:19:10,071 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116620728] [2019-11-20 11:19:10,072 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-11-20 11:19:10,072 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 11:19:10,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-11-20 11:19:10,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=677, Unknown=7, NotChecked=0, Total=812 [2019-11-20 11:19:10,073 INFO L87 Difference]: Start difference. First operand 108 states and 118 transitions. Second operand 29 states. [2019-11-20 11:19:12,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:19:12,611 INFO L93 Difference]: Finished difference Result 60 states and 61 transitions. [2019-11-20 11:19:12,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-20 11:19:12,612 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 37 [2019-11-20 11:19:12,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:19:12,612 INFO L225 Difference]: With dead ends: 60 [2019-11-20 11:19:12,613 INFO L226 Difference]: Without dead ends: 0 [2019-11-20 11:19:12,614 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 43 SyntacticMatches, 3 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 337 ImplicationChecksByTransitivity, 26.1s TimeCoverageRelationStatistics Valid=359, Invalid=1440, Unknown=7, NotChecked=0, Total=1806 [2019-11-20 11:19:12,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-20 11:19:12,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-20 11:19:12,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-20 11:19:12,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-20 11:19:12,615 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 37 [2019-11-20 11:19:12,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:19:12,615 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-20 11:19:12,615 INFO L463 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-11-20 11:19:12,616 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-20 11:19:12,616 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-20 11:19:12,816 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 11:19:12,823 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 11:19:12 BoogieIcfgContainer [2019-11-20 11:19:12,823 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-20 11:19:12,823 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-20 11:19:12,823 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-20 11:19:12,824 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-20 11:19:12,824 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 11:16:04" (3/4) ... [2019-11-20 11:19:12,827 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-20 11:19:12,832 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2019-11-20 11:19:12,832 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure myexit [2019-11-20 11:19:12,832 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_32 [2019-11-20 11:19:12,832 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_64 [2019-11-20 11:19:12,832 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __uint16_identity [2019-11-20 11:19:12,832 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __uint64_identity [2019-11-20 11:19:12,832 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2019-11-20 11:19:12,833 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __uint32_identity [2019-11-20 11:19:12,838 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2019-11-20 11:19:12,838 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-11-20 11:19:12,838 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-20 11:19:12,839 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-20 11:19:12,885 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-20 11:19:12,885 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-20 11:19:12,887 INFO L168 Benchmark]: Toolchain (without parser) took 189620.99 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 259.5 MB). Free memory was 955.0 MB in the beginning and 962.0 MB in the end (delta: -7.0 MB). Peak memory consumption was 252.6 MB. Max. memory is 11.5 GB. [2019-11-20 11:19:12,887 INFO L168 Benchmark]: CDTParser took 0.60 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 11:19:12,887 INFO L168 Benchmark]: CACSL2BoogieTranslator took 644.46 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 152.0 MB). Free memory was 949.6 MB in the beginning and 1.1 GB in the end (delta: -177.6 MB). Peak memory consumption was 15.2 MB. Max. memory is 11.5 GB. [2019-11-20 11:19:12,888 INFO L168 Benchmark]: Boogie Preprocessor took 70.94 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 11:19:12,888 INFO L168 Benchmark]: RCFGBuilder took 903.81 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: 57.0 MB). Peak memory consumption was 57.0 MB. Max. memory is 11.5 GB. [2019-11-20 11:19:12,888 INFO L168 Benchmark]: TraceAbstraction took 187934.68 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 107.5 MB). Free memory was 1.1 GB in the beginning and 962.0 MB in the end (delta: 108.2 MB). Peak memory consumption was 215.7 MB. Max. memory is 11.5 GB. [2019-11-20 11:19:12,889 INFO L168 Benchmark]: Witness Printer took 62.17 ms. Allocated memory is still 1.3 GB. Free memory is still 962.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 11:19:12,890 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.60 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 644.46 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 152.0 MB). Free memory was 949.6 MB in the beginning and 1.1 GB in the end (delta: -177.6 MB). Peak memory consumption was 15.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 70.94 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 903.81 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: 57.0 MB). Peak memory consumption was 57.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 187934.68 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 107.5 MB). Free memory was 1.1 GB in the beginning and 962.0 MB in the end (delta: 108.2 MB). Peak memory consumption was 215.7 MB. Max. memory is 11.5 GB. * Witness Printer took 62.17 ms. Allocated memory is still 1.3 GB. Free memory is still 962.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 539]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 539]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 536]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 537]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 537]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 531]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 560]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 531]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 536]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 558]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 560]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 528]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 557]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 528]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 555]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 555]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 557]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 558]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 552]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 552]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 520]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 545]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 549]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 549]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 542]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 542]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 545]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 558]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 560]: free always succeeds For all program executions holds that free always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 29 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 95 locations, 29 error locations. Result: SAFE, OverallTime: 187.8s, OverallIterations: 14, TraceHistogramMax: 2, AutomataDifference: 37.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 631 SDtfs, 2259 SDslu, 2352 SDs, 0 SdLazy, 3027 SolverSat, 426 SolverUnsat, 5 SolverUnknown, 0 SolverNotchecked, 20.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 691 GetRequests, 468 SyntacticMatches, 12 SemanticMatches, 211 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 1147 ImplicationChecksByTransitivity, 87.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=108occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 14 MinimizatonAttempts, 367 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 144.0s InterpolantComputationTime, 313 NumberOfCodeBlocks, 313 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 598 ConstructedInterpolants, 63 QuantifiedInterpolants, 157643 SizeOfPredicates, 122 NumberOfNonLiveVariables, 1178 ConjunctsInSsa, 146 ConjunctsInUnsatCore, 28 InterpolantComputations, 22 PerfectInterpolantSequences, 34/74 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request... No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...