./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-ext-properties/test-0232_1-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 20ed64ec Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.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-ext-properties/test-0232_1-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 86beb7e463e80bf4cd7303ba718fa4bc3c1db625 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally 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 -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.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-ext-properties/test-0232_1-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-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-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 86beb7e463e80bf4cd7303ba718fa4bc3c1db625 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample --- Real Ultimate output --- This is Ultimate 0.2.1-dev-20ed64e [2021-08-27 05:59:59,497 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-27 05:59:59,499 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-27 05:59:59,538 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-27 05:59:59,539 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-27 05:59:59,541 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-27 05:59:59,542 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-27 05:59:59,546 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-27 05:59:59,548 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-27 05:59:59,551 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-27 05:59:59,552 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-27 05:59:59,553 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-27 05:59:59,553 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-27 05:59:59,555 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-27 05:59:59,556 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-27 05:59:59,560 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-27 05:59:59,561 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-27 05:59:59,562 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-27 05:59:59,563 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-27 05:59:59,568 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-27 05:59:59,568 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-27 05:59:59,569 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-27 05:59:59,571 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-27 05:59:59,571 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-27 05:59:59,576 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-27 05:59:59,576 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-27 05:59:59,576 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-27 05:59:59,578 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-27 05:59:59,578 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-27 05:59:59,579 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-27 05:59:59,579 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-27 05:59:59,579 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-27 05:59:59,580 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-27 05:59:59,581 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-27 05:59:59,582 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-27 05:59:59,582 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-27 05:59:59,583 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-27 05:59:59,583 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-27 05:59:59,583 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-27 05:59:59,585 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-27 05:59:59,586 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-27 05:59:59,586 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2021-08-27 05:59:59,614 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-27 05:59:59,614 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-27 05:59:59,615 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-27 05:59:59,615 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-27 05:59:59,616 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-27 05:59:59,616 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-27 05:59:59,616 INFO L138 SettingsManager]: * Use SBE=true [2021-08-27 05:59:59,616 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-27 05:59:59,616 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-27 05:59:59,617 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-08-27 05:59:59,617 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-27 05:59:59,617 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-27 05:59:59,618 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-27 05:59:59,618 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-08-27 05:59:59,618 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-08-27 05:59:59,618 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-08-27 05:59:59,618 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-27 05:59:59,618 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-08-27 05:59:59,618 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-27 05:59:59,619 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-27 05:59:59,619 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-27 05:59:59,619 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-27 05:59:59,619 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-27 05:59:59,619 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-27 05:59:59,619 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-27 05:59:59,619 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-27 05:59:59,620 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-27 05:59:59,620 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-27 05:59:59,620 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-27 05:59:59,620 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 86beb7e463e80bf4cd7303ba718fa4bc3c1db625 [2021-08-27 05:59:59,884 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-27 05:59:59,900 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-27 05:59:59,902 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-27 05:59:59,903 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-27 05:59:59,903 INFO L275 PluginConnector]: CDTParser initialized [2021-08-27 05:59:59,904 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-ext-properties/test-0232_1-1.i [2021-08-27 05:59:59,950 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d359d8e6/9aa4d0b1bfb04e25b063025998185c6f/FLAG0534588da [2021-08-27 06:00:00,363 INFO L306 CDTParser]: Found 1 translation units. [2021-08-27 06:00:00,363 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext-properties/test-0232_1-1.i [2021-08-27 06:00:00,371 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d359d8e6/9aa4d0b1bfb04e25b063025998185c6f/FLAG0534588da [2021-08-27 06:00:00,744 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d359d8e6/9aa4d0b1bfb04e25b063025998185c6f [2021-08-27 06:00:00,745 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-27 06:00:00,747 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-08-27 06:00:00,748 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-27 06:00:00,748 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-27 06:00:00,751 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-27 06:00:00,751 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 06:00:00" (1/1) ... [2021-08-27 06:00:00,752 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ddefef4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:00:00, skipping insertion in model container [2021-08-27 06:00:00,752 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 06:00:00" (1/1) ... [2021-08-27 06:00:00,756 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-27 06:00:00,775 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-27 06:00:00,997 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 06:00:01,006 INFO L203 MainTranslator]: Completed pre-run [2021-08-27 06:00:01,046 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 06:00:01,071 INFO L208 MainTranslator]: Completed translation [2021-08-27 06:00:01,072 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:00:01 WrapperNode [2021-08-27 06:00:01,072 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-27 06:00:01,073 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-27 06:00:01,073 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-27 06:00:01,073 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-27 06:00:01,082 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:00:01" (1/1) ... [2021-08-27 06:00:01,084 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:00:01" (1/1) ... [2021-08-27 06:00:01,093 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:00:01" (1/1) ... [2021-08-27 06:00:01,094 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:00:01" (1/1) ... [2021-08-27 06:00:01,103 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:00:01" (1/1) ... [2021-08-27 06:00:01,107 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:00:01" (1/1) ... [2021-08-27 06:00:01,109 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:00:01" (1/1) ... [2021-08-27 06:00:01,112 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-27 06:00:01,113 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-27 06:00:01,113 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-27 06:00:01,113 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-27 06:00:01,114 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:00:01" (1/1) ... [2021-08-27 06:00:01,126 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-27 06:00:01,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 06:00:01,150 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-08-27 06:00:01,165 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-08-27 06:00:01,188 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2021-08-27 06:00:01,188 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-27 06:00:01,188 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2021-08-27 06:00:01,189 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2021-08-27 06:00:01,189 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2021-08-27 06:00:01,189 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint16_identity [2021-08-27 06:00:01,189 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint32_identity [2021-08-27 06:00:01,189 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint64_identity [2021-08-27 06:00:01,189 INFO L138 BoogieDeclarations]: Found implementation of procedure append [2021-08-27 06:00:01,189 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2021-08-27 06:00:01,190 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2021-08-27 06:00:01,190 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2021-08-27 06:00:01,190 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2021-08-27 06:00:01,190 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2021-08-27 06:00:01,190 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2021-08-27 06:00:01,190 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-27 06:00:01,190 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2021-08-27 06:00:01,191 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2021-08-27 06:00:01,191 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2021-08-27 06:00:01,191 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2021-08-27 06:00:01,191 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2021-08-27 06:00:01,191 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2021-08-27 06:00:01,191 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2021-08-27 06:00:01,191 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2021-08-27 06:00:01,191 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2021-08-27 06:00:01,191 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2021-08-27 06:00:01,192 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2021-08-27 06:00:01,192 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2021-08-27 06:00:01,192 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2021-08-27 06:00:01,192 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2021-08-27 06:00:01,192 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2021-08-27 06:00:01,192 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2021-08-27 06:00:01,192 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2021-08-27 06:00:01,192 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2021-08-27 06:00:01,192 INFO L130 BoogieDeclarations]: Found specification of procedure __uint16_identity [2021-08-27 06:00:01,193 INFO L130 BoogieDeclarations]: Found specification of procedure __uint32_identity [2021-08-27 06:00:01,193 INFO L130 BoogieDeclarations]: Found specification of procedure __uint64_identity [2021-08-27 06:00:01,193 INFO L130 BoogieDeclarations]: Found specification of procedure select [2021-08-27 06:00:01,193 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2021-08-27 06:00:01,193 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2021-08-27 06:00:01,193 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2021-08-27 06:00:01,193 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2021-08-27 06:00:01,193 INFO L130 BoogieDeclarations]: Found specification of procedure random [2021-08-27 06:00:01,194 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2021-08-27 06:00:01,194 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2021-08-27 06:00:01,194 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2021-08-27 06:00:01,194 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2021-08-27 06:00:01,194 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2021-08-27 06:00:01,194 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2021-08-27 06:00:01,194 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2021-08-27 06:00:01,194 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2021-08-27 06:00:01,194 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2021-08-27 06:00:01,195 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2021-08-27 06:00:01,195 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2021-08-27 06:00:01,195 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2021-08-27 06:00:01,195 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2021-08-27 06:00:01,195 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2021-08-27 06:00:01,195 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2021-08-27 06:00:01,195 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2021-08-27 06:00:01,195 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2021-08-27 06:00:01,195 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2021-08-27 06:00:01,196 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2021-08-27 06:00:01,196 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2021-08-27 06:00:01,196 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2021-08-27 06:00:01,196 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2021-08-27 06:00:01,196 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2021-08-27 06:00:01,196 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2021-08-27 06:00:01,196 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2021-08-27 06:00:01,196 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2021-08-27 06:00:01,196 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2021-08-27 06:00:01,197 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2021-08-27 06:00:01,197 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2021-08-27 06:00:01,197 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2021-08-27 06:00:01,197 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2021-08-27 06:00:01,197 INFO L130 BoogieDeclarations]: Found specification of procedure free [2021-08-27 06:00:01,197 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2021-08-27 06:00:01,197 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2021-08-27 06:00:01,197 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2021-08-27 06:00:01,198 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2021-08-27 06:00:01,198 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2021-08-27 06:00:01,198 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2021-08-27 06:00:01,198 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2021-08-27 06:00:01,198 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2021-08-27 06:00:01,198 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2021-08-27 06:00:01,198 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2021-08-27 06:00:01,198 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2021-08-27 06:00:01,198 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2021-08-27 06:00:01,199 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2021-08-27 06:00:01,199 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2021-08-27 06:00:01,199 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2021-08-27 06:00:01,199 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2021-08-27 06:00:01,199 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2021-08-27 06:00:01,199 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2021-08-27 06:00:01,199 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2021-08-27 06:00:01,199 INFO L130 BoogieDeclarations]: Found specification of procedure system [2021-08-27 06:00:01,199 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2021-08-27 06:00:01,200 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2021-08-27 06:00:01,200 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2021-08-27 06:00:01,200 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2021-08-27 06:00:01,200 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2021-08-27 06:00:01,200 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2021-08-27 06:00:01,200 INFO L130 BoogieDeclarations]: Found specification of procedure div [2021-08-27 06:00:01,200 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2021-08-27 06:00:01,200 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2021-08-27 06:00:01,200 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2021-08-27 06:00:01,200 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2021-08-27 06:00:01,201 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2021-08-27 06:00:01,201 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2021-08-27 06:00:01,201 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2021-08-27 06:00:01,201 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2021-08-27 06:00:01,201 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2021-08-27 06:00:01,201 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2021-08-27 06:00:01,201 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2021-08-27 06:00:01,201 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2021-08-27 06:00:01,202 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2021-08-27 06:00:01,202 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2021-08-27 06:00:01,202 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2021-08-27 06:00:01,202 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2021-08-27 06:00:01,202 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2021-08-27 06:00:01,202 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2021-08-27 06:00:01,202 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2021-08-27 06:00:01,202 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2021-08-27 06:00:01,202 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2021-08-27 06:00:01,202 INFO L130 BoogieDeclarations]: Found specification of procedure append [2021-08-27 06:00:01,203 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-08-27 06:00:01,203 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-08-27 06:00:01,203 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-08-27 06:00:01,203 INFO L130 BoogieDeclarations]: Found specification of procedure main [2021-08-27 06:00:01,203 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-08-27 06:00:01,203 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-08-27 06:00:01,203 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2021-08-27 06:00:01,203 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-27 06:00:01,204 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-27 06:00:01,204 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-08-27 06:00:01,204 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-08-27 06:00:01,684 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-27 06:00:01,684 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2021-08-27 06:00:01,685 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 06:00:01 BoogieIcfgContainer [2021-08-27 06:00:01,686 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-27 06:00:01,687 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-27 06:00:01,687 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-27 06:00:01,689 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-27 06:00:01,689 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.08 06:00:00" (1/3) ... [2021-08-27 06:00:01,690 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@227e61ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 06:00:01, skipping insertion in model container [2021-08-27 06:00:01,690 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:00:01" (2/3) ... [2021-08-27 06:00:01,690 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@227e61ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 06:00:01, skipping insertion in model container [2021-08-27 06:00:01,690 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 06:00:01" (3/3) ... [2021-08-27 06:00:01,691 INFO L111 eAbstractionObserver]: Analyzing ICFG test-0232_1-1.i [2021-08-27 06:00:01,695 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-27 06:00:01,695 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 44 error locations. [2021-08-27 06:00:01,732 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-27 06:00:01,738 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-08-27 06:00:01,738 INFO L340 AbstractCegarLoop]: Starting to check reachability of 44 error locations. [2021-08-27 06:00:01,755 INFO L276 IsEmpty]: Start isEmpty. Operand has 99 states, 49 states have (on average 2.020408163265306) internal successors, (99), 92 states have internal predecessors, (99), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-08-27 06:00:01,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-08-27 06:00:01,760 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:00:01,761 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:00:01,761 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting appendErr0REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE (and 39 more)] === [2021-08-27 06:00:01,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:00:01,765 INFO L82 PathProgramCache]: Analyzing trace with hash 159106718, now seen corresponding path program 1 times [2021-08-27 06:00:01,795 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:00:01,796 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159397535] [2021-08-27 06:00:01,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:00:01,797 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:00:01,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:00:02,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:00:02,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:00:02,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:00:02,126 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:00:02,126 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159397535] [2021-08-27 06:00:02,126 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159397535] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 06:00:02,127 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:00:02,127 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-27 06:00:02,128 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842558156] [2021-08-27 06:00:02,134 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-27 06:00:02,134 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:00:02,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-27 06:00:02,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-27 06:00:02,147 INFO L87 Difference]: Start difference. First operand has 99 states, 49 states have (on average 2.020408163265306) internal successors, (99), 92 states have internal predecessors, (99), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 6 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:00:02,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:00:02,467 INFO L93 Difference]: Finished difference Result 95 states and 99 transitions. [2021-08-27 06:00:02,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-27 06:00:02,469 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 9 [2021-08-27 06:00:02,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:00:02,475 INFO L225 Difference]: With dead ends: 95 [2021-08-27 06:00:02,475 INFO L226 Difference]: Without dead ends: 92 [2021-08-27 06:00:02,478 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 86.6ms TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-08-27 06:00:02,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2021-08-27 06:00:02,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 91. [2021-08-27 06:00:02,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 48 states have (on average 1.8958333333333333) internal successors, (91), 85 states have internal predecessors, (91), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-08-27 06:00:02,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 96 transitions. [2021-08-27 06:00:02,513 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 96 transitions. Word has length 9 [2021-08-27 06:00:02,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:00:02,513 INFO L470 AbstractCegarLoop]: Abstraction has 91 states and 96 transitions. [2021-08-27 06:00:02,513 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:00:02,513 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 96 transitions. [2021-08-27 06:00:02,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-08-27 06:00:02,514 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:00:02,514 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:00:02,514 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-27 06:00:02,514 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting appendErr1REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE (and 39 more)] === [2021-08-27 06:00:02,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:00:02,515 INFO L82 PathProgramCache]: Analyzing trace with hash 159106719, now seen corresponding path program 1 times [2021-08-27 06:00:02,515 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:00:02,516 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141084070] [2021-08-27 06:00:02,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:00:02,516 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:00:02,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:00:02,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:00:02,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:00:02,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:00:02,669 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:00:02,669 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141084070] [2021-08-27 06:00:02,669 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141084070] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 06:00:02,669 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:00:02,669 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-27 06:00:02,669 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458290382] [2021-08-27 06:00:02,670 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-27 06:00:02,670 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:00:02,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-27 06:00:02,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-27 06:00:02,671 INFO L87 Difference]: Start difference. First operand 91 states and 96 transitions. Second operand has 6 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:00:02,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:00:02,919 INFO L93 Difference]: Finished difference Result 121 states and 126 transitions. [2021-08-27 06:00:02,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-27 06:00:02,920 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 9 [2021-08-27 06:00:02,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:00:02,924 INFO L225 Difference]: With dead ends: 121 [2021-08-27 06:00:02,924 INFO L226 Difference]: Without dead ends: 121 [2021-08-27 06:00:02,924 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 62.4ms TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-08-27 06:00:02,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2021-08-27 06:00:02,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 100. [2021-08-27 06:00:02,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 59 states have (on average 1.7966101694915255) internal successors, (106), 94 states have internal predecessors, (106), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-08-27 06:00:02,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 111 transitions. [2021-08-27 06:00:02,935 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 111 transitions. Word has length 9 [2021-08-27 06:00:02,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:00:02,936 INFO L470 AbstractCegarLoop]: Abstraction has 100 states and 111 transitions. [2021-08-27 06:00:02,936 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:00:02,936 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 111 transitions. [2021-08-27 06:00:02,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-08-27 06:00:02,936 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:00:02,937 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:00:02,937 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-08-27 06:00:02,937 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting appendErr2REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE (and 39 more)] === [2021-08-27 06:00:02,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:00:02,937 INFO L82 PathProgramCache]: Analyzing trace with hash 637341052, now seen corresponding path program 1 times [2021-08-27 06:00:02,938 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:00:02,938 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907634550] [2021-08-27 06:00:02,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:00:02,938 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:00:02,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:00:02,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:00:02,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:00:03,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:00:03,005 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:00:03,005 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907634550] [2021-08-27 06:00:03,006 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907634550] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 06:00:03,007 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:00:03,009 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 06:00:03,009 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543772048] [2021-08-27 06:00:03,010 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 06:00:03,010 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:00:03,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 06:00:03,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 06:00:03,011 INFO L87 Difference]: Start difference. First operand 100 states and 111 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:00:03,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:00:03,132 INFO L93 Difference]: Finished difference Result 96 states and 106 transitions. [2021-08-27 06:00:03,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 06:00:03,136 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2021-08-27 06:00:03,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:00:03,139 INFO L225 Difference]: With dead ends: 96 [2021-08-27 06:00:03,139 INFO L226 Difference]: Without dead ends: 96 [2021-08-27 06:00:03,139 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 19.0ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 06:00:03,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2021-08-27 06:00:03,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2021-08-27 06:00:03,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 59 states have (on average 1.7118644067796611) internal successors, (101), 90 states have internal predecessors, (101), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-08-27 06:00:03,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 106 transitions. [2021-08-27 06:00:03,152 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 106 transitions. Word has length 10 [2021-08-27 06:00:03,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:00:03,152 INFO L470 AbstractCegarLoop]: Abstraction has 96 states and 106 transitions. [2021-08-27 06:00:03,152 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:00:03,152 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 106 transitions. [2021-08-27 06:00:03,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-08-27 06:00:03,153 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:00:03,153 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:00:03,153 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-08-27 06:00:03,153 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting appendErr3REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE (and 39 more)] === [2021-08-27 06:00:03,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:00:03,154 INFO L82 PathProgramCache]: Analyzing trace with hash 637341053, now seen corresponding path program 1 times [2021-08-27 06:00:03,155 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:00:03,155 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962679646] [2021-08-27 06:00:03,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:00:03,155 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:00:03,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:00:03,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:00:03,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:00:03,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:00:03,226 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:00:03,226 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962679646] [2021-08-27 06:00:03,226 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962679646] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 06:00:03,226 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:00:03,227 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 06:00:03,227 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796442322] [2021-08-27 06:00:03,227 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 06:00:03,227 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:00:03,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 06:00:03,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 06:00:03,228 INFO L87 Difference]: Start difference. First operand 96 states and 106 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:00:03,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:00:03,335 INFO L93 Difference]: Finished difference Result 92 states and 101 transitions. [2021-08-27 06:00:03,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 06:00:03,335 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2021-08-27 06:00:03,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:00:03,336 INFO L225 Difference]: With dead ends: 92 [2021-08-27 06:00:03,336 INFO L226 Difference]: Without dead ends: 92 [2021-08-27 06:00:03,337 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 30.2ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 06:00:03,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2021-08-27 06:00:03,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2021-08-27 06:00:03,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 59 states have (on average 1.6271186440677967) internal successors, (96), 86 states have internal predecessors, (96), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-08-27 06:00:03,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 101 transitions. [2021-08-27 06:00:03,340 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 101 transitions. Word has length 10 [2021-08-27 06:00:03,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:00:03,340 INFO L470 AbstractCegarLoop]: Abstraction has 92 states and 101 transitions. [2021-08-27 06:00:03,340 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:00:03,340 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 101 transitions. [2021-08-27 06:00:03,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-08-27 06:00:03,340 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:00:03,341 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:00:03,341 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-08-27 06:00:03,341 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting appendErr8REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE (and 39 more)] === [2021-08-27 06:00:03,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:00:03,341 INFO L82 PathProgramCache]: Analyzing trace with hash 403096809, now seen corresponding path program 1 times [2021-08-27 06:00:03,342 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:00:03,342 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206537304] [2021-08-27 06:00:03,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:00:03,342 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:00:03,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:00:03,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:00:03,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:00:03,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:00:03,438 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:00:03,438 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206537304] [2021-08-27 06:00:03,439 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206537304] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 06:00:03,439 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:00:03,439 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-08-27 06:00:03,439 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342016853] [2021-08-27 06:00:03,439 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-08-27 06:00:03,439 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:00:03,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-27 06:00:03,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-08-27 06:00:03,440 INFO L87 Difference]: Start difference. First operand 92 states and 101 transitions. Second operand has 9 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:00:03,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:00:03,710 INFO L93 Difference]: Finished difference Result 103 states and 113 transitions. [2021-08-27 06:00:03,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-08-27 06:00:03,710 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2021-08-27 06:00:03,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:00:03,711 INFO L225 Difference]: With dead ends: 103 [2021-08-27 06:00:03,711 INFO L226 Difference]: Without dead ends: 103 [2021-08-27 06:00:03,711 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 161.8ms TimeCoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2021-08-27 06:00:03,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2021-08-27 06:00:03,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 99. [2021-08-27 06:00:03,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 65 states have (on average 1.5692307692307692) internal successors, (102), 92 states have internal predecessors, (102), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2021-08-27 06:00:03,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 109 transitions. [2021-08-27 06:00:03,715 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 109 transitions. Word has length 15 [2021-08-27 06:00:03,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:00:03,716 INFO L470 AbstractCegarLoop]: Abstraction has 99 states and 109 transitions. [2021-08-27 06:00:03,716 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:00:03,716 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 109 transitions. [2021-08-27 06:00:03,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-08-27 06:00:03,716 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:00:03,717 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:00:03,717 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-08-27 06:00:03,717 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting appendErr13REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE (and 39 more)] === [2021-08-27 06:00:03,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:00:03,717 INFO L82 PathProgramCache]: Analyzing trace with hash -388622655, now seen corresponding path program 1 times [2021-08-27 06:00:03,717 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:00:03,718 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934536297] [2021-08-27 06:00:03,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:00:03,718 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:00:03,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:00:03,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:00:03,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:00:03,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:00:03,798 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:00:03,798 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934536297] [2021-08-27 06:00:03,798 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934536297] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 06:00:03,798 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:00:03,798 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-27 06:00:03,799 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499551337] [2021-08-27 06:00:03,799 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-08-27 06:00:03,799 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:00:03,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-27 06:00:03,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-08-27 06:00:03,800 INFO L87 Difference]: Start difference. First operand 99 states and 109 transitions. Second operand has 8 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:00:03,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:00:03,949 INFO L93 Difference]: Finished difference Result 98 states and 108 transitions. [2021-08-27 06:00:03,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-27 06:00:03,949 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2021-08-27 06:00:03,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:00:03,950 INFO L225 Difference]: With dead ends: 98 [2021-08-27 06:00:03,950 INFO L226 Difference]: Without dead ends: 98 [2021-08-27 06:00:03,950 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 72.1ms TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2021-08-27 06:00:03,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2021-08-27 06:00:03,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 95. [2021-08-27 06:00:03,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 62 states have (on average 1.5806451612903225) internal successors, (98), 88 states have internal predecessors, (98), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2021-08-27 06:00:03,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 105 transitions. [2021-08-27 06:00:03,953 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 105 transitions. Word has length 16 [2021-08-27 06:00:03,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:00:03,953 INFO L470 AbstractCegarLoop]: Abstraction has 95 states and 105 transitions. [2021-08-27 06:00:03,953 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:00:03,953 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 105 transitions. [2021-08-27 06:00:03,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-08-27 06:00:03,954 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:00:03,954 INFO L512 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] [2021-08-27 06:00:03,954 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-08-27 06:00:03,954 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr9REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE (and 39 more)] === [2021-08-27 06:00:03,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:00:03,955 INFO L82 PathProgramCache]: Analyzing trace with hash 482359371, now seen corresponding path program 1 times [2021-08-27 06:00:03,955 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:00:03,955 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964410129] [2021-08-27 06:00:03,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:00:03,955 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:00:03,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:00:04,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:00:04,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:00:04,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 06:00:04,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:00:04,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:00:04,073 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:00:04,073 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964410129] [2021-08-27 06:00:04,073 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964410129] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 06:00:04,073 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:00:04,073 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-08-27 06:00:04,074 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032267726] [2021-08-27 06:00:04,074 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-08-27 06:00:04,074 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:00:04,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-27 06:00:04,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-08-27 06:00:04,075 INFO L87 Difference]: Start difference. First operand 95 states and 105 transitions. Second operand has 9 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-08-27 06:00:04,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:00:04,356 INFO L93 Difference]: Finished difference Result 111 states and 117 transitions. [2021-08-27 06:00:04,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-27 06:00:04,357 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 25 [2021-08-27 06:00:04,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:00:04,357 INFO L225 Difference]: With dead ends: 111 [2021-08-27 06:00:04,358 INFO L226 Difference]: Without dead ends: 111 [2021-08-27 06:00:04,358 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 136.7ms TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2021-08-27 06:00:04,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2021-08-27 06:00:04,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 95. [2021-08-27 06:00:04,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 62 states have (on average 1.564516129032258) internal successors, (97), 88 states have internal predecessors, (97), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2021-08-27 06:00:04,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 104 transitions. [2021-08-27 06:00:04,361 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 104 transitions. Word has length 25 [2021-08-27 06:00:04,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:00:04,362 INFO L470 AbstractCegarLoop]: Abstraction has 95 states and 104 transitions. [2021-08-27 06:00:04,362 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-08-27 06:00:04,362 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 104 transitions. [2021-08-27 06:00:04,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-08-27 06:00:04,362 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:00:04,363 INFO L512 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] [2021-08-27 06:00:04,363 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-08-27 06:00:04,363 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr10REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE (and 39 more)] === [2021-08-27 06:00:04,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:00:04,363 INFO L82 PathProgramCache]: Analyzing trace with hash 482359372, now seen corresponding path program 1 times [2021-08-27 06:00:04,363 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:00:04,364 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097698477] [2021-08-27 06:00:04,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:00:04,364 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:00:04,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:00:04,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:00:04,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:00:04,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 06:00:04,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:00:04,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:00:04,522 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:00:04,522 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097698477] [2021-08-27 06:00:04,522 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097698477] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 06:00:04,522 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:00:04,522 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-08-27 06:00:04,522 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867648769] [2021-08-27 06:00:04,523 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-08-27 06:00:04,523 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:00:04,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-27 06:00:04,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-08-27 06:00:04,524 INFO L87 Difference]: Start difference. First operand 95 states and 104 transitions. Second operand has 9 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-08-27 06:00:04,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:00:04,811 INFO L93 Difference]: Finished difference Result 106 states and 112 transitions. [2021-08-27 06:00:04,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-27 06:00:04,812 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 25 [2021-08-27 06:00:04,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:00:04,812 INFO L225 Difference]: With dead ends: 106 [2021-08-27 06:00:04,812 INFO L226 Difference]: Without dead ends: 106 [2021-08-27 06:00:04,813 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 149.9ms TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2021-08-27 06:00:04,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2021-08-27 06:00:04,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 94. [2021-08-27 06:00:04,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 62 states have (on average 1.532258064516129) internal successors, (95), 87 states have internal predecessors, (95), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2021-08-27 06:00:04,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 102 transitions. [2021-08-27 06:00:04,816 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 102 transitions. Word has length 25 [2021-08-27 06:00:04,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:00:04,816 INFO L470 AbstractCegarLoop]: Abstraction has 94 states and 102 transitions. [2021-08-27 06:00:04,816 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-08-27 06:00:04,816 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 102 transitions. [2021-08-27 06:00:04,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-08-27 06:00:04,817 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:00:04,817 INFO L512 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] [2021-08-27 06:00:04,817 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-08-27 06:00:04,818 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr2REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE (and 39 more)] === [2021-08-27 06:00:04,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:00:04,818 INFO L82 PathProgramCache]: Analyzing trace with hash 482345437, now seen corresponding path program 1 times [2021-08-27 06:00:04,818 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:00:04,818 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134225121] [2021-08-27 06:00:04,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:00:04,819 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:00:04,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:00:04,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:00:04,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:00:04,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 06:00:04,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:00:04,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:00:04,895 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:00:04,895 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134225121] [2021-08-27 06:00:04,896 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134225121] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 06:00:04,896 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:00:04,896 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-27 06:00:04,896 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206563192] [2021-08-27 06:00:04,896 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-27 06:00:04,896 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:00:04,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-27 06:00:04,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-27 06:00:04,897 INFO L87 Difference]: Start difference. First operand 94 states and 102 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-08-27 06:00:04,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:00:04,996 INFO L93 Difference]: Finished difference Result 76 states and 83 transitions. [2021-08-27 06:00:04,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 06:00:04,997 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 25 [2021-08-27 06:00:04,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:00:04,997 INFO L225 Difference]: With dead ends: 76 [2021-08-27 06:00:04,997 INFO L226 Difference]: Without dead ends: 76 [2021-08-27 06:00:04,998 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 66.8ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-27 06:00:04,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2021-08-27 06:00:04,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2021-08-27 06:00:04,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 53 states have (on average 1.4339622641509433) internal successors, (76), 69 states have internal predecessors, (76), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2021-08-27 06:00:04,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 83 transitions. [2021-08-27 06:00:04,999 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 83 transitions. Word has length 25 [2021-08-27 06:00:05,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:00:05,000 INFO L470 AbstractCegarLoop]: Abstraction has 76 states and 83 transitions. [2021-08-27 06:00:05,000 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-08-27 06:00:05,000 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 83 transitions. [2021-08-27 06:00:05,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-08-27 06:00:05,000 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:00:05,000 INFO L512 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] [2021-08-27 06:00:05,000 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-08-27 06:00:05,001 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr29ENSURES_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE (and 39 more)] === [2021-08-27 06:00:05,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:00:05,004 INFO L82 PathProgramCache]: Analyzing trace with hash 483581567, now seen corresponding path program 1 times [2021-08-27 06:00:05,005 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:00:05,005 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716439860] [2021-08-27 06:00:05,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:00:05,005 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:00:05,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:00:05,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:00:05,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:00:05,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 06:00:05,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:00:05,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:00:05,073 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:00:05,073 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716439860] [2021-08-27 06:00:05,073 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716439860] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 06:00:05,073 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:00:05,074 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-27 06:00:05,074 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695171343] [2021-08-27 06:00:05,074 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-27 06:00:05,074 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:00:05,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-27 06:00:05,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-27 06:00:05,074 INFO L87 Difference]: Start difference. First operand 76 states and 83 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-08-27 06:00:05,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:00:05,195 INFO L93 Difference]: Finished difference Result 72 states and 75 transitions. [2021-08-27 06:00:05,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-27 06:00:05,195 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 25 [2021-08-27 06:00:05,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:00:05,196 INFO L225 Difference]: With dead ends: 72 [2021-08-27 06:00:05,196 INFO L226 Difference]: Without dead ends: 72 [2021-08-27 06:00:05,196 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 44.6ms TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-08-27 06:00:05,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2021-08-27 06:00:05,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 71. [2021-08-27 06:00:05,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 48 states have (on average 1.3958333333333333) internal successors, (67), 64 states have internal predecessors, (67), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2021-08-27 06:00:05,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 74 transitions. [2021-08-27 06:00:05,198 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 74 transitions. Word has length 25 [2021-08-27 06:00:05,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:00:05,198 INFO L470 AbstractCegarLoop]: Abstraction has 71 states and 74 transitions. [2021-08-27 06:00:05,199 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-08-27 06:00:05,199 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 74 transitions. [2021-08-27 06:00:05,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-08-27 06:00:05,199 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:00:05,199 INFO L512 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] [2021-08-27 06:00:05,199 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-08-27 06:00:05,199 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr13ASSERT_VIOLATIONMEMORY_FREE === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE (and 39 more)] === [2021-08-27 06:00:05,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:00:05,200 INFO L82 PathProgramCache]: Analyzing trace with hash -992523117, now seen corresponding path program 1 times [2021-08-27 06:00:05,200 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:00:05,200 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141160981] [2021-08-27 06:00:05,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:00:05,200 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:00:05,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:00:05,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:00:05,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:00:05,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 06:00:05,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:00:05,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:00:05,293 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:00:05,293 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141160981] [2021-08-27 06:00:05,293 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141160981] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 06:00:05,293 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:00:05,294 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-27 06:00:05,294 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717104572] [2021-08-27 06:00:05,294 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-08-27 06:00:05,294 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:00:05,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-27 06:00:05,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-08-27 06:00:05,294 INFO L87 Difference]: Start difference. First operand 71 states and 74 transitions. Second operand has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-08-27 06:00:05,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:00:05,494 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2021-08-27 06:00:05,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-27 06:00:05,495 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 28 [2021-08-27 06:00:05,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:00:05,495 INFO L225 Difference]: With dead ends: 70 [2021-08-27 06:00:05,496 INFO L226 Difference]: Without dead ends: 70 [2021-08-27 06:00:05,496 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 115.6ms TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2021-08-27 06:00:05,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2021-08-27 06:00:05,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2021-08-27 06:00:05,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 48 states have (on average 1.375) internal successors, (66), 63 states have internal predecessors, (66), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2021-08-27 06:00:05,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 73 transitions. [2021-08-27 06:00:05,497 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 73 transitions. Word has length 28 [2021-08-27 06:00:05,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:00:05,498 INFO L470 AbstractCegarLoop]: Abstraction has 70 states and 73 transitions. [2021-08-27 06:00:05,498 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-08-27 06:00:05,498 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 73 transitions. [2021-08-27 06:00:05,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-08-27 06:00:05,498 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:00:05,498 INFO L512 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] [2021-08-27 06:00:05,498 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-08-27 06:00:05,499 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr14ASSERT_VIOLATIONMEMORY_FREE === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE (and 39 more)] === [2021-08-27 06:00:05,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:00:05,499 INFO L82 PathProgramCache]: Analyzing trace with hash -703445460, now seen corresponding path program 1 times [2021-08-27 06:00:05,499 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:00:05,499 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980408670] [2021-08-27 06:00:05,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:00:05,499 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:00:05,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:00:05,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:00:05,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:00:05,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 06:00:05,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:00:05,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:00:05,599 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:00:05,600 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980408670] [2021-08-27 06:00:05,600 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980408670] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 06:00:05,600 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:00:05,600 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-27 06:00:05,601 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358140491] [2021-08-27 06:00:05,601 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-08-27 06:00:05,602 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:00:05,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-27 06:00:05,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-08-27 06:00:05,602 INFO L87 Difference]: Start difference. First operand 70 states and 73 transitions. Second operand has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-08-27 06:00:05,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:00:05,811 INFO L93 Difference]: Finished difference Result 69 states and 72 transitions. [2021-08-27 06:00:05,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-27 06:00:05,811 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 29 [2021-08-27 06:00:05,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:00:05,812 INFO L225 Difference]: With dead ends: 69 [2021-08-27 06:00:05,812 INFO L226 Difference]: Without dead ends: 69 [2021-08-27 06:00:05,812 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 117.8ms TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2021-08-27 06:00:05,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2021-08-27 06:00:05,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2021-08-27 06:00:05,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 48 states have (on average 1.3541666666666667) internal successors, (65), 62 states have internal predecessors, (65), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2021-08-27 06:00:05,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 72 transitions. [2021-08-27 06:00:05,814 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 72 transitions. Word has length 29 [2021-08-27 06:00:05,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:00:05,814 INFO L470 AbstractCegarLoop]: Abstraction has 69 states and 72 transitions. [2021-08-27 06:00:05,814 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-08-27 06:00:05,814 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 72 transitions. [2021-08-27 06:00:05,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-08-27 06:00:05,815 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:00:05,815 INFO L512 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] [2021-08-27 06:00:05,815 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-08-27 06:00:05,815 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting appendErr8REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE (and 39 more)] === [2021-08-27 06:00:05,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:00:05,815 INFO L82 PathProgramCache]: Analyzing trace with hash 413622409, now seen corresponding path program 1 times [2021-08-27 06:00:05,815 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:00:05,815 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693030413] [2021-08-27 06:00:05,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:00:05,816 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:00:05,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:00:05,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:00:05,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:00:05,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 06:00:05,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:00:05,970 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:00:05,970 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:00:05,970 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693030413] [2021-08-27 06:00:05,970 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693030413] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 06:00:05,971 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [116852652] [2021-08-27 06:00:05,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:00:05,971 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 06:00:05,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 06:00:05,972 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 06:00:06,008 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-08-27 06:00:06,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:00:06,121 INFO L263 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 34 conjunts are in the unsatisfiable core [2021-08-27 06:00:06,125 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:00:06,360 INFO L388 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 17 treesize of output 13 [2021-08-27 06:00:06,454 INFO L354 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2021-08-27 06:00:06,454 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 29 [2021-08-27 06:00:06,541 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-08-27 06:00:06,542 INFO L388 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 33 treesize of output 24 [2021-08-27 06:00:06,652 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-08-27 06:00:06,652 INFO L388 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 41 treesize of output 21 [2021-08-27 06:00:06,683 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:00:06,683 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [116852652] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 06:00:06,683 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 06:00:06,683 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2021-08-27 06:00:06,683 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110140876] [2021-08-27 06:00:06,684 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-08-27 06:00:06,684 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:00:06,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-08-27 06:00:06,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2021-08-27 06:00:06,685 INFO L87 Difference]: Start difference. First operand 69 states and 72 transitions. Second operand has 19 states, 17 states have (on average 2.235294117647059) internal successors, (38), 16 states have internal predecessors, (38), 4 states have call successors, (7), 5 states have call predecessors, (7), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2021-08-27 06:00:07,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:00:07,256 INFO L93 Difference]: Finished difference Result 75 states and 77 transitions. [2021-08-27 06:00:07,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-08-27 06:00:07,257 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 2.235294117647059) internal successors, (38), 16 states have internal predecessors, (38), 4 states have call successors, (7), 5 states have call predecessors, (7), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 30 [2021-08-27 06:00:07,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:00:07,257 INFO L225 Difference]: With dead ends: 75 [2021-08-27 06:00:07,257 INFO L226 Difference]: Without dead ends: 75 [2021-08-27 06:00:07,258 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 488.7ms TimeCoverageRelationStatistics Valid=153, Invalid=717, Unknown=0, NotChecked=0, Total=870 [2021-08-27 06:00:07,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2021-08-27 06:00:07,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 73. [2021-08-27 06:00:07,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 52 states have (on average 1.3076923076923077) internal successors, (68), 66 states have internal predecessors, (68), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2021-08-27 06:00:07,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 75 transitions. [2021-08-27 06:00:07,259 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 75 transitions. Word has length 30 [2021-08-27 06:00:07,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:00:07,260 INFO L470 AbstractCegarLoop]: Abstraction has 73 states and 75 transitions. [2021-08-27 06:00:07,260 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 2.235294117647059) internal successors, (38), 16 states have internal predecessors, (38), 4 states have call successors, (7), 5 states have call predecessors, (7), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2021-08-27 06:00:07,260 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 75 transitions. [2021-08-27 06:00:07,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-08-27 06:00:07,260 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:00:07,260 INFO L512 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] [2021-08-27 06:00:07,296 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-08-27 06:00:07,477 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2021-08-27 06:00:07,478 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting appendErr9REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE (and 39 more)] === [2021-08-27 06:00:07,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:00:07,478 INFO L82 PathProgramCache]: Analyzing trace with hash 413622410, now seen corresponding path program 1 times [2021-08-27 06:00:07,478 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:00:07,479 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370455389] [2021-08-27 06:00:07,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:00:07,479 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:00:07,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:00:07,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:00:07,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:00:07,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 06:00:07,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:00:07,681 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:00:07,681 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:00:07,681 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370455389] [2021-08-27 06:00:07,681 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370455389] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 06:00:07,681 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [792069167] [2021-08-27 06:00:07,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:00:07,682 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 06:00:07,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 06:00:07,683 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 06:00:07,684 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-08-27 06:00:07,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:00:07,833 INFO L263 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 49 conjunts are in the unsatisfiable core [2021-08-27 06:00:07,835 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:00:07,979 INFO L388 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 22 treesize of output 18 [2021-08-27 06:00:07,986 INFO L388 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 [2021-08-27 06:00:08,124 INFO L354 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2021-08-27 06:00:08,124 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2021-08-27 06:00:08,129 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-08-27 06:00:08,219 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-08-27 06:00:08,219 INFO L388 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 55 treesize of output 46 [2021-08-27 06:00:08,231 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-08-27 06:00:08,231 INFO L388 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 51 treesize of output 46 [2021-08-27 06:00:08,781 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-08-27 06:00:08,781 INFO L388 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 66 treesize of output 50 [2021-08-27 06:00:08,786 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-08-27 06:00:08,786 INFO L388 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 44 treesize of output 24 [2021-08-27 06:00:08,818 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:00:08,818 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [792069167] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 06:00:08,818 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 06:00:08,818 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2021-08-27 06:00:08,819 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566915685] [2021-08-27 06:00:08,819 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-08-27 06:00:08,819 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:00:08,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-08-27 06:00:08,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2021-08-27 06:00:08,820 INFO L87 Difference]: Start difference. First operand 73 states and 75 transitions. Second operand has 19 states, 17 states have (on average 2.235294117647059) internal successors, (38), 16 states have internal predecessors, (38), 4 states have call successors, (7), 5 states have call predecessors, (7), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2021-08-27 06:00:09,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:00:09,559 INFO L93 Difference]: Finished difference Result 74 states and 76 transitions. [2021-08-27 06:00:09,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-08-27 06:00:09,560 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 2.235294117647059) internal successors, (38), 16 states have internal predecessors, (38), 4 states have call successors, (7), 5 states have call predecessors, (7), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 30 [2021-08-27 06:00:09,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:00:09,561 INFO L225 Difference]: With dead ends: 74 [2021-08-27 06:00:09,561 INFO L226 Difference]: Without dead ends: 74 [2021-08-27 06:00:09,561 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 1035.3ms TimeCoverageRelationStatistics Valid=120, Invalid=636, Unknown=0, NotChecked=0, Total=756 [2021-08-27 06:00:09,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2021-08-27 06:00:09,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 72. [2021-08-27 06:00:09,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 52 states have (on average 1.2884615384615385) internal successors, (67), 65 states have internal predecessors, (67), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2021-08-27 06:00:09,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 74 transitions. [2021-08-27 06:00:09,563 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 74 transitions. Word has length 30 [2021-08-27 06:00:09,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:00:09,563 INFO L470 AbstractCegarLoop]: Abstraction has 72 states and 74 transitions. [2021-08-27 06:00:09,564 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 2.235294117647059) internal successors, (38), 16 states have internal predecessors, (38), 4 states have call successors, (7), 5 states have call predecessors, (7), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2021-08-27 06:00:09,564 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 74 transitions. [2021-08-27 06:00:09,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-08-27 06:00:09,564 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:00:09,565 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:00:09,585 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-08-27 06:00:09,782 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2021-08-27 06:00:09,783 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr15ASSERT_VIOLATIONMEMORY_FREE === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE (and 39 more)] === [2021-08-27 06:00:09,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:00:09,783 INFO L82 PathProgramCache]: Analyzing trace with hash -331972683, now seen corresponding path program 1 times [2021-08-27 06:00:09,783 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:00:09,783 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171684149] [2021-08-27 06:00:09,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:00:09,783 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:00:09,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:00:09,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:00:09,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:00:09,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 06:00:09,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:00:09,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:00:09,852 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:00:09,852 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171684149] [2021-08-27 06:00:09,852 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171684149] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 06:00:09,852 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:00:09,852 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-27 06:00:09,852 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479661971] [2021-08-27 06:00:09,853 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-27 06:00:09,853 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:00:09,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-27 06:00:09,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-08-27 06:00:09,853 INFO L87 Difference]: Start difference. First operand 72 states and 74 transitions. Second operand has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-08-27 06:00:09,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:00:09,990 INFO L93 Difference]: Finished difference Result 71 states and 73 transitions. [2021-08-27 06:00:09,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-27 06:00:09,990 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2021-08-27 06:00:09,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:00:09,991 INFO L225 Difference]: With dead ends: 71 [2021-08-27 06:00:09,991 INFO L226 Difference]: Without dead ends: 71 [2021-08-27 06:00:09,991 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 66.7ms TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-08-27 06:00:09,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2021-08-27 06:00:09,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2021-08-27 06:00:09,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 52 states have (on average 1.2692307692307692) internal successors, (66), 64 states have internal predecessors, (66), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2021-08-27 06:00:09,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 73 transitions. [2021-08-27 06:00:09,993 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 73 transitions. Word has length 30 [2021-08-27 06:00:09,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:00:09,994 INFO L470 AbstractCegarLoop]: Abstraction has 71 states and 73 transitions. [2021-08-27 06:00:09,994 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-08-27 06:00:09,994 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 73 transitions. [2021-08-27 06:00:09,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-08-27 06:00:09,994 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:00:09,995 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:00:09,995 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-08-27 06:00:09,995 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr16REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE (and 39 more)] === [2021-08-27 06:00:09,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:00:09,995 INFO L82 PathProgramCache]: Analyzing trace with hash -1701218481, now seen corresponding path program 1 times [2021-08-27 06:00:09,995 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:00:09,996 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217209482] [2021-08-27 06:00:09,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:00:09,996 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:00:10,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:00:10,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:00:10,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:00:10,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 06:00:10,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:00:10,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:00:10,104 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:00:10,104 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217209482] [2021-08-27 06:00:10,104 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217209482] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 06:00:10,104 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:00:10,104 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-08-27 06:00:10,104 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68155178] [2021-08-27 06:00:10,105 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-08-27 06:00:10,105 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:00:10,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-27 06:00:10,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-08-27 06:00:10,106 INFO L87 Difference]: Start difference. First operand 71 states and 73 transitions. Second operand has 9 states, 8 states have (on average 3.25) internal successors, (26), 7 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-08-27 06:00:10,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:00:10,278 INFO L93 Difference]: Finished difference Result 70 states and 72 transitions. [2021-08-27 06:00:10,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-27 06:00:10,278 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 7 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 31 [2021-08-27 06:00:10,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:00:10,288 INFO L225 Difference]: With dead ends: 70 [2021-08-27 06:00:10,288 INFO L226 Difference]: Without dead ends: 70 [2021-08-27 06:00:10,289 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 90.5ms TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2021-08-27 06:00:10,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2021-08-27 06:00:10,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2021-08-27 06:00:10,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 52 states have (on average 1.25) internal successors, (65), 63 states have internal predecessors, (65), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2021-08-27 06:00:10,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 72 transitions. [2021-08-27 06:00:10,291 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 72 transitions. Word has length 31 [2021-08-27 06:00:10,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:00:10,291 INFO L470 AbstractCegarLoop]: Abstraction has 70 states and 72 transitions. [2021-08-27 06:00:10,291 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 7 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-08-27 06:00:10,291 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 72 transitions. [2021-08-27 06:00:10,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-08-27 06:00:10,292 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:00:10,292 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:00:10,292 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-08-27 06:00:10,292 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting mainErr17REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE (and 39 more)] === [2021-08-27 06:00:10,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:00:10,293 INFO L82 PathProgramCache]: Analyzing trace with hash -1701218480, now seen corresponding path program 1 times [2021-08-27 06:00:10,293 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:00:10,293 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430850217] [2021-08-27 06:00:10,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:00:10,293 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:00:10,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:00:10,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:00:10,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:00:10,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 06:00:10,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:00:10,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:00:10,355 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:00:10,355 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430850217] [2021-08-27 06:00:10,355 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430850217] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 06:00:10,355 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:00:10,355 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-27 06:00:10,356 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517665866] [2021-08-27 06:00:10,356 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-27 06:00:10,356 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:00:10,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-27 06:00:10,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-08-27 06:00:10,357 INFO L87 Difference]: Start difference. First operand 70 states and 72 transitions. Second operand has 6 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-08-27 06:00:10,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:00:10,458 INFO L93 Difference]: Finished difference Result 66 states and 68 transitions. [2021-08-27 06:00:10,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-27 06:00:10,459 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 31 [2021-08-27 06:00:10,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:00:10,459 INFO L225 Difference]: With dead ends: 66 [2021-08-27 06:00:10,460 INFO L226 Difference]: Without dead ends: 66 [2021-08-27 06:00:10,460 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 45.9ms TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-08-27 06:00:10,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2021-08-27 06:00:10,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2021-08-27 06:00:10,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 52 states have (on average 1.1730769230769231) internal successors, (61), 59 states have internal predecessors, (61), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2021-08-27 06:00:10,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 68 transitions. [2021-08-27 06:00:10,462 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 68 transitions. Word has length 31 [2021-08-27 06:00:10,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:00:10,462 INFO L470 AbstractCegarLoop]: Abstraction has 66 states and 68 transitions. [2021-08-27 06:00:10,462 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-08-27 06:00:10,462 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 68 transitions. [2021-08-27 06:00:10,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-08-27 06:00:10,463 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:00:10,463 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:00:10,463 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-08-27 06:00:10,464 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting mainErr29ENSURES_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE (and 39 more)] === [2021-08-27 06:00:10,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:00:10,464 INFO L82 PathProgramCache]: Analyzing trace with hash 930259001, now seen corresponding path program 1 times [2021-08-27 06:00:10,464 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:00:10,464 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347084974] [2021-08-27 06:00:10,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:00:10,465 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:00:10,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 06:00:10,482 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 06:00:10,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 06:00:10,512 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 06:00:10,512 INFO L626 BasicCegarLoop]: Counterexample is feasible [2021-08-27 06:00:10,513 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location mainErr29ENSURES_VIOLATIONMEMORY_LEAK [2021-08-27 06:00:10,514 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr0REQUIRES_VIOLATION [2021-08-27 06:00:10,514 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr1REQUIRES_VIOLATION [2021-08-27 06:00:10,514 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr2REQUIRES_VIOLATION [2021-08-27 06:00:10,514 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr3REQUIRES_VIOLATION [2021-08-27 06:00:10,515 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr4ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 06:00:10,515 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr5ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 06:00:10,515 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr6ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 06:00:10,515 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr7REQUIRES_VIOLATION [2021-08-27 06:00:10,515 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr8REQUIRES_VIOLATION [2021-08-27 06:00:10,515 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr9REQUIRES_VIOLATION [2021-08-27 06:00:10,515 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr10REQUIRES_VIOLATION [2021-08-27 06:00:10,516 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr11REQUIRES_VIOLATION [2021-08-27 06:00:10,516 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr12REQUIRES_VIOLATION [2021-08-27 06:00:10,516 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr13ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 06:00:10,516 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr14ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 06:00:10,516 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr15ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 06:00:10,516 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr16REQUIRES_VIOLATION [2021-08-27 06:00:10,516 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr17REQUIRES_VIOLATION [2021-08-27 06:00:10,517 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr18REQUIRES_VIOLATION [2021-08-27 06:00:10,517 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr19REQUIRES_VIOLATION [2021-08-27 06:00:10,517 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr20REQUIRES_VIOLATION [2021-08-27 06:00:10,517 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr21REQUIRES_VIOLATION [2021-08-27 06:00:10,517 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr22REQUIRES_VIOLATION [2021-08-27 06:00:10,517 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr23REQUIRES_VIOLATION [2021-08-27 06:00:10,517 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr24ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 06:00:10,517 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr25ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 06:00:10,518 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr26ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 06:00:10,518 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr27REQUIRES_VIOLATION [2021-08-27 06:00:10,518 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr28REQUIRES_VIOLATION [2021-08-27 06:00:10,518 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location appendErr0REQUIRES_VIOLATION [2021-08-27 06:00:10,518 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location appendErr1REQUIRES_VIOLATION [2021-08-27 06:00:10,518 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location appendErr2REQUIRES_VIOLATION [2021-08-27 06:00:10,518 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location appendErr3REQUIRES_VIOLATION [2021-08-27 06:00:10,519 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location appendErr4REQUIRES_VIOLATION [2021-08-27 06:00:10,519 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location appendErr5REQUIRES_VIOLATION [2021-08-27 06:00:10,519 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location appendErr6REQUIRES_VIOLATION [2021-08-27 06:00:10,519 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location appendErr7REQUIRES_VIOLATION [2021-08-27 06:00:10,519 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location appendErr8REQUIRES_VIOLATION [2021-08-27 06:00:10,519 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location appendErr9REQUIRES_VIOLATION [2021-08-27 06:00:10,519 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location appendErr10REQUIRES_VIOLATION [2021-08-27 06:00:10,519 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location appendErr11REQUIRES_VIOLATION [2021-08-27 06:00:10,520 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location appendErr12REQUIRES_VIOLATION [2021-08-27 06:00:10,520 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location appendErr13REQUIRES_VIOLATION [2021-08-27 06:00:10,520 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-08-27 06:00:10,524 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-27 06:00:10,533 WARN L418 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2021-08-27 06:00:10,545 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.08 06:00:10 BoogieIcfgContainer [2021-08-27 06:00:10,545 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-27 06:00:10,546 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-27 06:00:10,546 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-27 06:00:10,546 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-27 06:00:10,547 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 06:00:01" (3/4) ... [2021-08-27 06:00:10,549 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-08-27 06:00:10,549 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-27 06:00:10,549 INFO L168 Benchmark]: Toolchain (without parser) took 9802.79 ms. Allocated memory was 69.2 MB in the beginning and 260.0 MB in the end (delta: 190.8 MB). Free memory was 50.9 MB in the beginning and 171.3 MB in the end (delta: -120.4 MB). Peak memory consumption was 68.6 MB. Max. memory is 16.1 GB. [2021-08-27 06:00:10,550 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 69.2 MB. Free memory was 52.1 MB in the beginning and 52.0 MB in the end (delta: 63.7 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-27 06:00:10,550 INFO L168 Benchmark]: CACSL2BoogieTranslator took 324.50 ms. Allocated memory is still 69.2 MB. Free memory was 50.8 MB in the beginning and 47.2 MB in the end (delta: 3.6 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2021-08-27 06:00:10,550 INFO L168 Benchmark]: Boogie Preprocessor took 39.80 ms. Allocated memory is still 69.2 MB. Free memory was 47.2 MB in the beginning and 44.4 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-08-27 06:00:10,550 INFO L168 Benchmark]: RCFGBuilder took 572.60 ms. Allocated memory was 69.2 MB in the beginning and 102.8 MB in the end (delta: 33.6 MB). Free memory was 44.4 MB in the beginning and 75.5 MB in the end (delta: -31.1 MB). Peak memory consumption was 28.3 MB. Max. memory is 16.1 GB. [2021-08-27 06:00:10,551 INFO L168 Benchmark]: TraceAbstraction took 8858.88 ms. Allocated memory was 102.8 MB in the beginning and 260.0 MB in the end (delta: 157.3 MB). Free memory was 74.9 MB in the beginning and 172.4 MB in the end (delta: -97.5 MB). Peak memory consumption was 59.9 MB. Max. memory is 16.1 GB. [2021-08-27 06:00:10,551 INFO L168 Benchmark]: Witness Printer took 2.98 ms. Allocated memory is still 260.0 MB. Free memory was 172.4 MB in the beginning and 171.3 MB in the end (delta: 1.0 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-27 06:00:10,552 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 69.2 MB. Free memory was 52.1 MB in the beginning and 52.0 MB in the end (delta: 63.7 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 324.50 ms. Allocated memory is still 69.2 MB. Free memory was 50.8 MB in the beginning and 47.2 MB in the end (delta: 3.6 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 39.80 ms. Allocated memory is still 69.2 MB. Free memory was 47.2 MB in the beginning and 44.4 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 572.60 ms. Allocated memory was 69.2 MB in the beginning and 102.8 MB in the end (delta: 33.6 MB). Free memory was 44.4 MB in the beginning and 75.5 MB in the end (delta: -31.1 MB). Peak memory consumption was 28.3 MB. Max. memory is 16.1 GB. * TraceAbstraction took 8858.88 ms. Allocated memory was 102.8 MB in the beginning and 260.0 MB in the end (delta: 157.3 MB). Free memory was 74.9 MB in the beginning and 172.4 MB in the end (delta: -97.5 MB). Peak memory consumption was 59.9 MB. Max. memory is 16.1 GB. * Witness Printer took 2.98 ms. Allocated memory is still 260.0 MB. Free memory was 172.4 MB in the beginning and 171.3 MB in the end (delta: 1.0 MB). There was no memory consumed. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 539]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 539. Possible FailurePath: [L524] int c = 0; VAL [\old(c)=51, c=0] [L541] struct item *list = ((void *)0); [L542] int length = 0; VAL [\old(c)=0, c=0, length=0, list={3:0}] [L544] CALL append(&list) VAL [\old(c)=0, c=0, plist={3:0}] [L531] c++ [L532] struct item *item = malloc(sizeof *item); [L533] EXPR \read(**plist) VAL [\old(c)=0, \read(**plist)={0:0}, c=1, item={1:0}, plist={3:0}, plist={3:0}] [L533] item->next = *plist VAL [\old(c)=0, \read(**plist)={0:0}, c=1, item={1:0}, plist={3:0}, plist={3:0}] [L534] EXPR item->next VAL [\old(c)=0, c=1, item={1:0}, item->next={0:0}, plist={3:0}, plist={3:0}] [L534-L536] EXPR (item->next) ? item->next->data : malloc(sizeof *item) [L534-L536] EXPR (item->next) ? item->next->data : malloc(sizeof *item) VAL [(item->next) ? item->next->data : malloc(sizeof *item)={-1:0}, \old(c)=0, c=1, item={1:0}, item->next={0:0}, malloc(sizeof *item)={-1:0}, plist={3:0}, plist={3:0}] [L534-L536] item->data = (item->next) ? item->next->data : malloc(sizeof *item) VAL [(item->next) ? item->next->data : malloc(sizeof *item)={-1:0}, \old(c)=0, c=1, item={1:0}, item->next={0:0}, malloc(sizeof *item)={-1:0}, plist={3:0}, plist={3:0}] [L537] *plist = item VAL [\old(c)=0, c=1, item={1:0}, plist={3:0}, plist={3:0}] [L544] RET append(&list) VAL [\old(c)=0, c=1, length=0, list={3:0}] [L545] length++ VAL [\old(c)=0, c=1, length=1, list={3:0}] [L546] COND FALSE !(__VERIFIER_nondet_int() && c < 20) [L547] COND TRUE length > 0 VAL [\old(c)=0, c=1, length=1, list={3:0}] [L548] COND FALSE !(length < 0) VAL [\old(c)=0, c=1, length=1, list={3:0}] [L551] EXPR \read(*list) VAL [\old(c)=0, \read(*list)={1:0}, c=1, length=1, list={3:0}] [L551] EXPR list->next VAL [\old(c)=0, \read(*list)={1:0}, c=1, length=1, list={3:0}, list->next={0:0}] [L551] struct item *next = list->next; [L552] EXPR \read(*list) VAL [\old(c)=0, \read(*list)={1:0}, c=1, length=1, list={3:0}, next={0:0}] [L552] free(list) VAL [\old(c)=0, \read(*list)={1:0}, c=1, length=1, list={3:0}, next={0:0}] [L552] free(list) VAL [\old(c)=0, \read(*list)={1:0}, c=1, length=1, list={3:0}, next={0:0}] [L552] free(list) [L553] list = next VAL [\old(c)=0, c=1, length=1, list={3:0}, next={0:0}] [L554] length-- VAL [\old(c)=0, c=1, length=0, list={3:0}, next={0:0}] [L556] COND FALSE !(length > 0) VAL [\old(c)=0, c=1, length=0, list={3:0}, next={0:0}] [L562] return 0; [L541] struct item *list = ((void *)0); [L562] return 0; VAL [\old(c)=0, \result=0, c=1, length=0, next={0:0}] - UnprovableResult [Line: 549]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 549]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 549]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 549]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 549]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 549]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 549]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 551]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 551]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 551]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 551]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 552]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 552]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 552]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 552]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 552]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 553]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 553]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 557]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 557]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 557]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 557]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 558]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 558]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 558]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 558]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 558]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 559]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 559]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 533]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 533]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 533]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 533]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 534]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 534]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 535]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 535]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 535]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 535]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 534]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 534]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 537]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 537]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 10 procedures, 117 locations, 44 error locations. Started 1 CEGAR loops. OverallTime: 8792.3ms, OverallIterations: 18, TraceHistogramMax: 2, EmptinessCheckTime: 15.9ms, AutomataDifference: 4207.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 13.3ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 911 SDtfs, 809 SDslu, 2714 SDs, 0 SdLazy, 3967 SolverSat, 165 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2054.6ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 264 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 269 ImplicationChecksByTransitivity, 2791.4ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=100occurred in iteration=2, InterpolantAutomatonStates: 133, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 79.7ms AutomataMinimizationTime, 17 MinimizatonAttempts, 62 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 68.8ms SsaConstructionTime, 258.8ms SatisfiabilityAnalysisTime, 3200.1ms InterpolantComputationTime, 473 NumberOfCodeBlocks, 473 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 419 ConstructedInterpolants, 12 QuantifiedInterpolants, 3907 SizeOfPredicates, 32 NumberOfNonLiveVariables, 504 ConjunctsInSsa, 83 ConjunctsInUnsatCore, 19 InterpolantComputations, 15 PerfectInterpolantSequences, 6/28 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2021-08-27 06:00:10,600 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... ### Bit-precise run ### This is Ultimate 0.2.1-dev-20ed64e [2021-08-27 06:00:12,362 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-27 06:00:12,364 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-27 06:00:12,383 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-27 06:00:12,384 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-27 06:00:12,385 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-27 06:00:12,386 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-27 06:00:12,387 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-27 06:00:12,388 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-27 06:00:12,389 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-27 06:00:12,389 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-27 06:00:12,390 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-27 06:00:12,390 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-27 06:00:12,391 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-27 06:00:12,392 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-27 06:00:12,393 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-27 06:00:12,393 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-27 06:00:12,394 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-27 06:00:12,395 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-27 06:00:12,396 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-27 06:00:12,397 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-27 06:00:12,398 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-27 06:00:12,399 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-27 06:00:12,400 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-27 06:00:12,401 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-27 06:00:12,402 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-27 06:00:12,402 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-27 06:00:12,403 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-27 06:00:12,403 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-27 06:00:12,404 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-27 06:00:12,404 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-27 06:00:12,405 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-27 06:00:12,405 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-27 06:00:12,406 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-27 06:00:12,407 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-27 06:00:12,407 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-27 06:00:12,408 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-27 06:00:12,408 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-27 06:00:12,408 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-27 06:00:12,409 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-27 06:00:12,409 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-27 06:00:12,410 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2021-08-27 06:00:12,425 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-27 06:00:12,426 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-27 06:00:12,426 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-27 06:00:12,426 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-27 06:00:12,427 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-27 06:00:12,427 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-27 06:00:12,427 INFO L138 SettingsManager]: * Use SBE=true [2021-08-27 06:00:12,428 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-27 06:00:12,428 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-27 06:00:12,428 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-08-27 06:00:12,428 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-27 06:00:12,428 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-27 06:00:12,428 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-27 06:00:12,429 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-08-27 06:00:12,429 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-08-27 06:00:12,429 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-08-27 06:00:12,429 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-27 06:00:12,429 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-08-27 06:00:12,429 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-08-27 06:00:12,429 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-08-27 06:00:12,441 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-27 06:00:12,441 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-27 06:00:12,441 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-27 06:00:12,441 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-27 06:00:12,442 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-27 06:00:12,442 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-27 06:00:12,442 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-27 06:00:12,442 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-27 06:00:12,442 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-08-27 06:00:12,442 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-08-27 06:00:12,443 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-27 06:00:12,443 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-08-27 06:00:12,443 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 86beb7e463e80bf4cd7303ba718fa4bc3c1db625 [2021-08-27 06:00:12,660 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-27 06:00:12,680 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-27 06:00:12,682 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-27 06:00:12,683 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-27 06:00:12,684 INFO L275 PluginConnector]: CDTParser initialized [2021-08-27 06:00:12,688 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-ext-properties/test-0232_1-1.i [2021-08-27 06:00:12,736 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/842618c1c/e0171218c25e4b46ab6593e2ecda1af9/FLAGd5b1b2d30 [2021-08-27 06:00:13,133 INFO L306 CDTParser]: Found 1 translation units. [2021-08-27 06:00:13,133 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext-properties/test-0232_1-1.i [2021-08-27 06:00:13,140 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/842618c1c/e0171218c25e4b46ab6593e2ecda1af9/FLAGd5b1b2d30 [2021-08-27 06:00:13,530 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/842618c1c/e0171218c25e4b46ab6593e2ecda1af9 [2021-08-27 06:00:13,536 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-27 06:00:13,557 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-08-27 06:00:13,560 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-27 06:00:13,560 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-27 06:00:13,577 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-27 06:00:13,578 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 06:00:13" (1/1) ... [2021-08-27 06:00:13,578 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45d51dea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:00:13, skipping insertion in model container [2021-08-27 06:00:13,579 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 06:00:13" (1/1) ... [2021-08-27 06:00:13,583 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-27 06:00:13,633 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-27 06:00:13,910 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 06:00:13,921 INFO L203 MainTranslator]: Completed pre-run [2021-08-27 06:00:13,960 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 06:00:13,986 INFO L208 MainTranslator]: Completed translation [2021-08-27 06:00:13,987 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:00:13 WrapperNode [2021-08-27 06:00:13,987 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-27 06:00:13,989 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-27 06:00:13,989 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-27 06:00:13,989 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-27 06:00:13,997 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:00:13" (1/1) ... [2021-08-27 06:00:13,998 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:00:13" (1/1) ... [2021-08-27 06:00:14,026 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:00:13" (1/1) ... [2021-08-27 06:00:14,026 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:00:13" (1/1) ... [2021-08-27 06:00:14,051 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:00:13" (1/1) ... [2021-08-27 06:00:14,054 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:00:13" (1/1) ... [2021-08-27 06:00:14,058 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:00:13" (1/1) ... [2021-08-27 06:00:14,066 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-27 06:00:14,072 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-27 06:00:14,072 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-27 06:00:14,072 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-27 06:00:14,073 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:00:13" (1/1) ... [2021-08-27 06:00:14,078 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-27 06:00:14,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 06:00:14,092 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-08-27 06:00:14,105 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-08-27 06:00:14,123 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2021-08-27 06:00:14,123 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-27 06:00:14,123 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.setCurrentRoundingMode [2021-08-27 06:00:14,124 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2021-08-27 06:00:14,124 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2021-08-27 06:00:14,124 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2021-08-27 06:00:14,125 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint16_identity [2021-08-27 06:00:14,125 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint32_identity [2021-08-27 06:00:14,125 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint64_identity [2021-08-27 06:00:14,125 INFO L138 BoogieDeclarations]: Found implementation of procedure append [2021-08-27 06:00:14,125 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2021-08-27 06:00:14,126 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2021-08-27 06:00:14,126 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2021-08-27 06:00:14,126 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2021-08-27 06:00:14,126 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2021-08-27 06:00:14,126 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2021-08-27 06:00:14,126 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-27 06:00:14,126 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2021-08-27 06:00:14,126 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2021-08-27 06:00:14,126 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2021-08-27 06:00:14,127 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2021-08-27 06:00:14,127 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2021-08-27 06:00:14,127 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2021-08-27 06:00:14,127 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2021-08-27 06:00:14,127 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2021-08-27 06:00:14,127 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2021-08-27 06:00:14,127 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2021-08-27 06:00:14,127 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2021-08-27 06:00:14,127 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2021-08-27 06:00:14,128 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2021-08-27 06:00:14,128 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2021-08-27 06:00:14,128 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2021-08-27 06:00:14,128 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2021-08-27 06:00:14,128 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2021-08-27 06:00:14,128 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2021-08-27 06:00:14,128 INFO L130 BoogieDeclarations]: Found specification of procedure __uint16_identity [2021-08-27 06:00:14,128 INFO L130 BoogieDeclarations]: Found specification of procedure __uint32_identity [2021-08-27 06:00:14,128 INFO L130 BoogieDeclarations]: Found specification of procedure __uint64_identity [2021-08-27 06:00:14,129 INFO L130 BoogieDeclarations]: Found specification of procedure select [2021-08-27 06:00:14,129 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2021-08-27 06:00:14,129 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2021-08-27 06:00:14,129 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2021-08-27 06:00:14,129 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2021-08-27 06:00:14,129 INFO L130 BoogieDeclarations]: Found specification of procedure random [2021-08-27 06:00:14,129 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2021-08-27 06:00:14,130 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2021-08-27 06:00:14,130 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2021-08-27 06:00:14,130 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2021-08-27 06:00:14,130 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2021-08-27 06:00:14,131 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2021-08-27 06:00:14,131 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2021-08-27 06:00:14,131 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2021-08-27 06:00:14,131 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2021-08-27 06:00:14,131 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2021-08-27 06:00:14,131 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2021-08-27 06:00:14,131 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2021-08-27 06:00:14,131 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2021-08-27 06:00:14,132 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2021-08-27 06:00:14,132 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2021-08-27 06:00:14,132 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2021-08-27 06:00:14,132 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2021-08-27 06:00:14,132 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2021-08-27 06:00:14,133 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2021-08-27 06:00:14,133 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2021-08-27 06:00:14,133 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2021-08-27 06:00:14,134 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2021-08-27 06:00:14,134 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2021-08-27 06:00:14,134 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2021-08-27 06:00:14,134 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2021-08-27 06:00:14,135 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2021-08-27 06:00:14,135 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2021-08-27 06:00:14,135 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2021-08-27 06:00:14,135 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2021-08-27 06:00:14,135 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2021-08-27 06:00:14,135 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2021-08-27 06:00:14,135 INFO L130 BoogieDeclarations]: Found specification of procedure free [2021-08-27 06:00:14,135 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2021-08-27 06:00:14,135 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2021-08-27 06:00:14,135 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2021-08-27 06:00:14,136 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2021-08-27 06:00:14,136 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2021-08-27 06:00:14,136 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2021-08-27 06:00:14,136 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2021-08-27 06:00:14,136 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2021-08-27 06:00:14,136 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2021-08-27 06:00:14,137 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2021-08-27 06:00:14,137 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2021-08-27 06:00:14,137 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2021-08-27 06:00:14,137 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2021-08-27 06:00:14,137 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2021-08-27 06:00:14,137 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2021-08-27 06:00:14,137 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2021-08-27 06:00:14,138 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2021-08-27 06:00:14,138 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2021-08-27 06:00:14,138 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2021-08-27 06:00:14,138 INFO L130 BoogieDeclarations]: Found specification of procedure system [2021-08-27 06:00:14,138 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2021-08-27 06:00:14,138 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2021-08-27 06:00:14,138 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2021-08-27 06:00:14,138 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2021-08-27 06:00:14,138 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2021-08-27 06:00:14,138 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2021-08-27 06:00:14,139 INFO L130 BoogieDeclarations]: Found specification of procedure div [2021-08-27 06:00:14,139 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2021-08-27 06:00:14,139 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2021-08-27 06:00:14,139 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2021-08-27 06:00:14,139 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2021-08-27 06:00:14,140 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2021-08-27 06:00:14,140 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2021-08-27 06:00:14,140 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2021-08-27 06:00:14,140 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2021-08-27 06:00:14,140 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2021-08-27 06:00:14,141 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2021-08-27 06:00:14,141 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2021-08-27 06:00:14,141 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2021-08-27 06:00:14,141 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2021-08-27 06:00:14,141 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2021-08-27 06:00:14,141 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2021-08-27 06:00:14,141 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2021-08-27 06:00:14,141 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2021-08-27 06:00:14,141 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2021-08-27 06:00:14,141 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2021-08-27 06:00:14,142 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2021-08-27 06:00:14,142 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2021-08-27 06:00:14,142 INFO L130 BoogieDeclarations]: Found specification of procedure append [2021-08-27 06:00:14,142 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-08-27 06:00:14,143 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-08-27 06:00:14,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-08-27 06:00:14,144 INFO L130 BoogieDeclarations]: Found specification of procedure main [2021-08-27 06:00:14,145 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-08-27 06:00:14,145 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-08-27 06:00:14,146 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2021-08-27 06:00:14,146 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-08-27 06:00:14,146 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-27 06:00:14,146 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.setCurrentRoundingMode [2021-08-27 06:00:14,147 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2021-08-27 06:00:14,152 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2021-08-27 06:00:14,681 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-27 06:00:14,681 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2021-08-27 06:00:14,683 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 06:00:14 BoogieIcfgContainer [2021-08-27 06:00:14,683 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-27 06:00:14,684 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-27 06:00:14,685 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-27 06:00:14,687 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-27 06:00:14,687 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.08 06:00:13" (1/3) ... [2021-08-27 06:00:14,687 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a7c3fd0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 06:00:14, skipping insertion in model container [2021-08-27 06:00:14,687 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:00:13" (2/3) ... [2021-08-27 06:00:14,688 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a7c3fd0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 06:00:14, skipping insertion in model container [2021-08-27 06:00:14,688 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 06:00:14" (3/3) ... [2021-08-27 06:00:14,689 INFO L111 eAbstractionObserver]: Analyzing ICFG test-0232_1-1.i [2021-08-27 06:00:14,692 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-27 06:00:14,693 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 44 error locations. [2021-08-27 06:00:14,732 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-27 06:00:14,738 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-08-27 06:00:14,738 INFO L340 AbstractCegarLoop]: Starting to check reachability of 44 error locations. [2021-08-27 06:00:14,752 INFO L276 IsEmpty]: Start isEmpty. Operand has 98 states, 48 states have (on average 2.0416666666666665) internal successors, (98), 91 states have internal predecessors, (98), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-08-27 06:00:14,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-08-27 06:00:14,758 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:00:14,758 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:00:14,759 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting appendErr0REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE (and 39 more)] === [2021-08-27 06:00:14,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:00:14,763 INFO L82 PathProgramCache]: Analyzing trace with hash -784082766, now seen corresponding path program 1 times [2021-08-27 06:00:14,771 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 06:00:14,772 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1004538986] [2021-08-27 06:00:14,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:00:14,773 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 06:00:14,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 06:00:14,775 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 06:00:14,807 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-08-27 06:00:14,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:00:14,942 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 7 conjunts are in the unsatisfiable core [2021-08-27 06:00:14,946 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:00:15,011 INFO L388 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 [2021-08-27 06:00:15,085 INFO L354 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2021-08-27 06:00:15,086 INFO L388 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 16 treesize of output 21 [2021-08-27 06:00:15,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:00:15,125 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:00:15,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:00:15,204 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 06:00:15,204 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1004538986] [2021-08-27 06:00:15,205 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1004538986] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 06:00:15,206 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:00:15,206 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 5 [2021-08-27 06:00:15,207 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602304961] [2021-08-27 06:00:15,211 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-27 06:00:15,211 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 06:00:15,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-27 06:00:15,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-27 06:00:15,223 INFO L87 Difference]: Start difference. First operand has 98 states, 48 states have (on average 2.0416666666666665) internal successors, (98), 91 states have internal predecessors, (98), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 6 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:00:15,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:00:15,466 INFO L93 Difference]: Finished difference Result 94 states and 98 transitions. [2021-08-27 06:00:15,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-27 06:00:15,468 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 9 [2021-08-27 06:00:15,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:00:15,473 INFO L225 Difference]: With dead ends: 94 [2021-08-27 06:00:15,473 INFO L226 Difference]: Without dead ends: 91 [2021-08-27 06:00:15,474 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 52.9ms TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2021-08-27 06:00:15,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2021-08-27 06:00:15,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 90. [2021-08-27 06:00:15,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 47 states have (on average 1.9148936170212767) internal successors, (90), 84 states have internal predecessors, (90), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-08-27 06:00:15,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 95 transitions. [2021-08-27 06:00:15,497 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 95 transitions. Word has length 9 [2021-08-27 06:00:15,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:00:15,497 INFO L470 AbstractCegarLoop]: Abstraction has 90 states and 95 transitions. [2021-08-27 06:00:15,497 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:00:15,498 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 95 transitions. [2021-08-27 06:00:15,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-08-27 06:00:15,498 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:00:15,498 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:00:15,511 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-08-27 06:00:15,705 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 06:00:15,707 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting appendErr1REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE (and 39 more)] === [2021-08-27 06:00:15,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:00:15,707 INFO L82 PathProgramCache]: Analyzing trace with hash -784082765, now seen corresponding path program 1 times [2021-08-27 06:00:15,708 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 06:00:15,708 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1971078669] [2021-08-27 06:00:15,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:00:15,708 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 06:00:15,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 06:00:15,709 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 06:00:15,711 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-08-27 06:00:15,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:00:15,837 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 14 conjunts are in the unsatisfiable core [2021-08-27 06:00:15,839 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:00:15,860 INFO L388 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 [2021-08-27 06:00:15,874 INFO L388 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 [2021-08-27 06:00:15,932 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-08-27 06:00:15,933 INFO L388 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 27 treesize of output 29 [2021-08-27 06:00:15,938 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-08-27 06:00:15,938 INFO L388 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 26 treesize of output 22 [2021-08-27 06:00:15,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:00:15,959 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:00:16,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:00:16,240 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 06:00:16,240 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1971078669] [2021-08-27 06:00:16,241 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1971078669] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 06:00:16,241 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:00:16,241 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2021-08-27 06:00:16,241 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059605201] [2021-08-27 06:00:16,242 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-08-27 06:00:16,242 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 06:00:16,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-27 06:00:16,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-08-27 06:00:16,243 INFO L87 Difference]: Start difference. First operand 90 states and 95 transitions. Second operand has 8 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:00:29,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:00:29,371 INFO L93 Difference]: Finished difference Result 123 states and 130 transitions. [2021-08-27 06:00:29,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-27 06:00:29,371 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 9 [2021-08-27 06:00:29,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:00:29,373 INFO L225 Difference]: With dead ends: 123 [2021-08-27 06:00:29,373 INFO L226 Difference]: Without dead ends: 123 [2021-08-27 06:00:29,374 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 271.3ms TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2021-08-27 06:00:29,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2021-08-27 06:00:29,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 95. [2021-08-27 06:00:29,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 55 states have (on average 1.8) internal successors, (99), 89 states have internal predecessors, (99), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-08-27 06:00:29,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 104 transitions. [2021-08-27 06:00:29,379 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 104 transitions. Word has length 9 [2021-08-27 06:00:29,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:00:29,380 INFO L470 AbstractCegarLoop]: Abstraction has 95 states and 104 transitions. [2021-08-27 06:00:29,380 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:00:29,380 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 104 transitions. [2021-08-27 06:00:29,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-08-27 06:00:29,380 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:00:29,380 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:00:29,391 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-08-27 06:00:29,582 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 06:00:29,583 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting appendErr2REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE (and 39 more)] === [2021-08-27 06:00:29,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:00:29,583 INFO L82 PathProgramCache]: Analyzing trace with hash 1463238141, now seen corresponding path program 1 times [2021-08-27 06:00:29,583 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 06:00:29,583 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [621053466] [2021-08-27 06:00:29,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:00:29,584 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 06:00:29,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 06:00:29,599 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 06:00:29,629 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-08-27 06:00:29,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:00:29,786 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-27 06:00:29,788 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:00:29,810 INFO L388 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 [2021-08-27 06:00:29,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:00:29,823 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:00:29,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:00:29,854 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 06:00:29,854 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [621053466] [2021-08-27 06:00:29,854 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [621053466] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 06:00:29,854 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:00:29,855 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2021-08-27 06:00:29,855 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274164947] [2021-08-27 06:00:29,855 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-27 06:00:29,855 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 06:00:29,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 06:00:29,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 06:00:29,857 INFO L87 Difference]: Start difference. First operand 95 states and 104 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:00:29,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:00:29,991 INFO L93 Difference]: Finished difference Result 91 states and 100 transitions. [2021-08-27 06:00:29,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 06:00:29,992 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2021-08-27 06:00:29,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:00:29,992 INFO L225 Difference]: With dead ends: 91 [2021-08-27 06:00:29,993 INFO L226 Difference]: Without dead ends: 91 [2021-08-27 06:00:29,993 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.6ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 06:00:29,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2021-08-27 06:00:29,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2021-08-27 06:00:29,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 55 states have (on average 1.7272727272727273) internal successors, (95), 85 states have internal predecessors, (95), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-08-27 06:00:29,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 100 transitions. [2021-08-27 06:00:29,997 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 100 transitions. Word has length 10 [2021-08-27 06:00:29,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:00:29,998 INFO L470 AbstractCegarLoop]: Abstraction has 91 states and 100 transitions. [2021-08-27 06:00:29,998 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:00:29,998 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 100 transitions. [2021-08-27 06:00:29,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-08-27 06:00:29,998 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:00:29,998 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:00:30,007 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-08-27 06:00:30,205 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 06:00:30,205 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting appendErr3REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE (and 39 more)] === [2021-08-27 06:00:30,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:00:30,206 INFO L82 PathProgramCache]: Analyzing trace with hash 1463238142, now seen corresponding path program 1 times [2021-08-27 06:00:30,206 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 06:00:30,207 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [836305578] [2021-08-27 06:00:30,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:00:30,207 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 06:00:30,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 06:00:30,209 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 06:00:30,211 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-08-27 06:00:30,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:00:30,369 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-27 06:00:30,370 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:00:30,403 INFO L388 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 [2021-08-27 06:00:30,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:00:30,427 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:00:30,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:00:30,505 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 06:00:30,505 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [836305578] [2021-08-27 06:00:30,506 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [836305578] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 06:00:30,506 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:00:30,506 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2021-08-27 06:00:30,506 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342115140] [2021-08-27 06:00:30,507 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 06:00:30,507 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 06:00:30,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 06:00:30,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-27 06:00:30,508 INFO L87 Difference]: Start difference. First operand 91 states and 100 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:00:30,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:00:30,732 INFO L93 Difference]: Finished difference Result 87 states and 96 transitions. [2021-08-27 06:00:30,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 06:00:30,733 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2021-08-27 06:00:30,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:00:30,733 INFO L225 Difference]: With dead ends: 87 [2021-08-27 06:00:30,733 INFO L226 Difference]: Without dead ends: 87 [2021-08-27 06:00:30,734 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 31.4ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-27 06:00:30,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2021-08-27 06:00:30,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2021-08-27 06:00:30,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 55 states have (on average 1.6545454545454545) internal successors, (91), 81 states have internal predecessors, (91), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-08-27 06:00:30,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 96 transitions. [2021-08-27 06:00:30,737 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 96 transitions. Word has length 10 [2021-08-27 06:00:30,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:00:30,738 INFO L470 AbstractCegarLoop]: Abstraction has 87 states and 96 transitions. [2021-08-27 06:00:30,738 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:00:30,738 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 96 transitions. [2021-08-27 06:00:30,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-08-27 06:00:30,738 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:00:30,738 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:00:30,747 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-08-27 06:00:30,948 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 06:00:30,949 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting appendErr8REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE (and 39 more)] === [2021-08-27 06:00:30,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:00:30,949 INFO L82 PathProgramCache]: Analyzing trace with hash 1627228125, now seen corresponding path program 1 times [2021-08-27 06:00:30,949 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 06:00:30,949 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [77223745] [2021-08-27 06:00:30,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:00:30,949 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 06:00:30,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 06:00:30,951 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 06:00:30,956 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-08-27 06:00:31,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:00:31,121 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 17 conjunts are in the unsatisfiable core [2021-08-27 06:00:31,122 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:00:31,376 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-08-27 06:00:31,380 INFO L388 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 45 treesize of output 40 [2021-08-27 06:00:31,403 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-08-27 06:00:31,406 INFO L388 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 41 treesize of output 36 [2021-08-27 06:00:31,512 INFO L388 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 29 treesize of output 21 [2021-08-27 06:00:31,516 INFO L388 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 18 treesize of output 10 [2021-08-27 06:00:31,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:00:31,562 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:00:31,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:00:31,724 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 06:00:31,724 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [77223745] [2021-08-27 06:00:31,724 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [77223745] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 06:00:31,725 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:00:31,725 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 9 [2021-08-27 06:00:31,725 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681259175] [2021-08-27 06:00:31,726 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-08-27 06:00:31,727 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 06:00:31,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-27 06:00:31,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-08-27 06:00:31,728 INFO L87 Difference]: Start difference. First operand 87 states and 96 transitions. Second operand has 9 states, 8 states have (on average 1.625) internal successors, (13), 8 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:00:32,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:00:32,367 INFO L93 Difference]: Finished difference Result 99 states and 109 transitions. [2021-08-27 06:00:32,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-08-27 06:00:32,368 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.625) internal successors, (13), 8 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2021-08-27 06:00:32,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:00:32,371 INFO L225 Difference]: With dead ends: 99 [2021-08-27 06:00:32,371 INFO L226 Difference]: Without dead ends: 99 [2021-08-27 06:00:32,371 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 376.2ms TimeCoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2021-08-27 06:00:32,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2021-08-27 06:00:32,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 94. [2021-08-27 06:00:32,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 61 states have (on average 1.5901639344262295) internal successors, (97), 87 states have internal predecessors, (97), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2021-08-27 06:00:32,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 104 transitions. [2021-08-27 06:00:32,396 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 104 transitions. Word has length 15 [2021-08-27 06:00:32,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:00:32,397 INFO L470 AbstractCegarLoop]: Abstraction has 94 states and 104 transitions. [2021-08-27 06:00:32,397 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.625) internal successors, (13), 8 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:00:32,397 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 104 transitions. [2021-08-27 06:00:32,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-08-27 06:00:32,398 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:00:32,398 INFO L512 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] [2021-08-27 06:00:32,407 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Ended with exit code 0 [2021-08-27 06:00:32,607 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 06:00:32,608 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr9REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE (and 39 more)] === [2021-08-27 06:00:32,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:00:32,609 INFO L82 PathProgramCache]: Analyzing trace with hash -578453285, now seen corresponding path program 1 times [2021-08-27 06:00:32,611 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 06:00:32,612 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [743755777] [2021-08-27 06:00:32,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:00:32,612 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 06:00:32,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 06:00:32,613 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 06:00:32,615 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-08-27 06:00:32,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:00:32,868 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 8 conjunts are in the unsatisfiable core [2021-08-27 06:00:32,870 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:00:33,095 INFO L388 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 22 treesize of output 18 [2021-08-27 06:00:33,202 INFO L388 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 25 treesize of output 17 [2021-08-27 06:00:33,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:00:33,219 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:00:33,396 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 42 [2021-08-27 06:00:33,520 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-08-27 06:00:33,521 INFO L388 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 43 treesize of output 40 [2021-08-27 06:00:33,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:00:33,609 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 06:00:33,609 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [743755777] [2021-08-27 06:00:33,609 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [743755777] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 06:00:33,609 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:00:33,609 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 7 [2021-08-27 06:00:33,609 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981964725] [2021-08-27 06:00:33,610 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-08-27 06:00:33,610 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 06:00:33,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-27 06:00:33,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-08-27 06:00:33,611 INFO L87 Difference]: Start difference. First operand 94 states and 104 transitions. Second operand has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 8 states have internal predecessors, (22), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-08-27 06:00:34,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:00:34,177 INFO L93 Difference]: Finished difference Result 110 states and 116 transitions. [2021-08-27 06:00:34,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-27 06:00:34,177 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 8 states have internal predecessors, (22), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2021-08-27 06:00:34,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:00:34,178 INFO L225 Difference]: With dead ends: 110 [2021-08-27 06:00:34,179 INFO L226 Difference]: Without dead ends: 110 [2021-08-27 06:00:34,180 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 151.1ms TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-08-27 06:00:34,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2021-08-27 06:00:34,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 94. [2021-08-27 06:00:34,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 61 states have (on average 1.5737704918032787) internal successors, (96), 87 states have internal predecessors, (96), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2021-08-27 06:00:34,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 103 transitions. [2021-08-27 06:00:34,196 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 103 transitions. Word has length 24 [2021-08-27 06:00:34,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:00:34,199 INFO L470 AbstractCegarLoop]: Abstraction has 94 states and 103 transitions. [2021-08-27 06:00:34,199 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 8 states have internal predecessors, (22), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-08-27 06:00:34,201 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 103 transitions. [2021-08-27 06:00:34,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-08-27 06:00:34,201 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:00:34,201 INFO L512 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] [2021-08-27 06:00:34,209 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2021-08-27 06:00:34,409 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 06:00:34,409 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr10REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE (and 39 more)] === [2021-08-27 06:00:34,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:00:34,409 INFO L82 PathProgramCache]: Analyzing trace with hash -578453284, now seen corresponding path program 1 times [2021-08-27 06:00:34,409 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 06:00:34,409 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [705472718] [2021-08-27 06:00:34,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:00:34,410 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 06:00:34,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 06:00:34,412 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 06:00:34,413 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2021-08-27 06:00:34,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:00:34,605 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 11 conjunts are in the unsatisfiable core [2021-08-27 06:00:34,607 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:00:34,873 INFO L388 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 [2021-08-27 06:00:34,916 INFO L388 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 17 treesize of output 13 [2021-08-27 06:00:35,052 INFO L388 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 31 treesize of output 23 [2021-08-27 06:00:35,056 INFO L388 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 12 [2021-08-27 06:00:35,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:00:35,083 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:00:35,489 INFO L388 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 60 treesize of output 56 [2021-08-27 06:00:35,493 INFO L388 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 90 treesize of output 82 [2021-08-27 06:00:35,772 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 28 [2021-08-27 06:00:35,890 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2021-08-27 06:00:36,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:00:36,140 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 06:00:36,140 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [705472718] [2021-08-27 06:00:36,140 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [705472718] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 06:00:36,140 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:00:36,140 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 11 [2021-08-27 06:00:36,141 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800542825] [2021-08-27 06:00:36,141 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-08-27 06:00:36,141 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 06:00:36,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-08-27 06:00:36,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2021-08-27 06:00:36,142 INFO L87 Difference]: Start difference. First operand 94 states and 103 transitions. Second operand has 12 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 12 states have internal predecessors, (35), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2021-08-27 06:00:37,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:00:37,225 INFO L93 Difference]: Finished difference Result 105 states and 111 transitions. [2021-08-27 06:00:37,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-27 06:00:37,226 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 12 states have internal predecessors, (35), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) Word has length 24 [2021-08-27 06:00:37,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:00:37,227 INFO L225 Difference]: With dead ends: 105 [2021-08-27 06:00:37,227 INFO L226 Difference]: Without dead ends: 105 [2021-08-27 06:00:37,227 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 396.7ms TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2021-08-27 06:00:37,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2021-08-27 06:00:37,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 93. [2021-08-27 06:00:37,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 61 states have (on average 1.540983606557377) internal successors, (94), 86 states have internal predecessors, (94), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2021-08-27 06:00:37,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 101 transitions. [2021-08-27 06:00:37,229 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 101 transitions. Word has length 24 [2021-08-27 06:00:37,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:00:37,229 INFO L470 AbstractCegarLoop]: Abstraction has 93 states and 101 transitions. [2021-08-27 06:00:37,229 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 12 states have internal predecessors, (35), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2021-08-27 06:00:37,229 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 101 transitions. [2021-08-27 06:00:37,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-08-27 06:00:37,230 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:00:37,230 INFO L512 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] [2021-08-27 06:00:37,241 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2021-08-27 06:00:37,430 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 06:00:37,431 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr2REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE (and 39 more)] === [2021-08-27 06:00:37,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:00:37,433 INFO L82 PathProgramCache]: Analyzing trace with hash -578467219, now seen corresponding path program 1 times [2021-08-27 06:00:37,433 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 06:00:37,433 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1406438991] [2021-08-27 06:00:37,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:00:37,433 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 06:00:37,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 06:00:37,434 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 06:00:37,436 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2021-08-27 06:00:37,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:00:37,712 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-27 06:00:37,713 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:00:37,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:00:37,800 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:00:37,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:00:37,895 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 06:00:37,895 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1406438991] [2021-08-27 06:00:37,895 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1406438991] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 06:00:37,895 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:00:37,895 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-08-27 06:00:37,896 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633825821] [2021-08-27 06:00:37,896 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-27 06:00:37,896 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 06:00:37,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-27 06:00:37,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-08-27 06:00:37,897 INFO L87 Difference]: Start difference. First operand 93 states and 101 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-08-27 06:00:38,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:00:38,001 INFO L93 Difference]: Finished difference Result 138 states and 149 transitions. [2021-08-27 06:00:38,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-27 06:00:38,001 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 24 [2021-08-27 06:00:38,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:00:38,003 INFO L225 Difference]: With dead ends: 138 [2021-08-27 06:00:38,003 INFO L226 Difference]: Without dead ends: 138 [2021-08-27 06:00:38,003 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 44.5ms TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2021-08-27 06:00:38,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2021-08-27 06:00:38,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 96. [2021-08-27 06:00:38,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 71 states have (on average 1.4507042253521127) internal successors, (103), 86 states have internal predecessors, (103), 6 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-08-27 06:00:38,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 114 transitions. [2021-08-27 06:00:38,008 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 114 transitions. Word has length 24 [2021-08-27 06:00:38,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:00:38,009 INFO L470 AbstractCegarLoop]: Abstraction has 96 states and 114 transitions. [2021-08-27 06:00:38,009 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-08-27 06:00:38,009 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 114 transitions. [2021-08-27 06:00:38,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-08-27 06:00:38,011 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:00:38,012 INFO L512 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] [2021-08-27 06:00:38,019 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2021-08-27 06:00:38,220 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 06:00:38,221 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr13ASSERT_VIOLATIONMEMORY_FREE === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE (and 39 more)] === [2021-08-27 06:00:38,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:00:38,222 INFO L82 PathProgramCache]: Analyzing trace with hash -1292973192, now seen corresponding path program 1 times [2021-08-27 06:00:38,222 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 06:00:38,222 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [775906351] [2021-08-27 06:00:38,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:00:38,223 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 06:00:38,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 06:00:38,224 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 06:00:38,226 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2021-08-27 06:00:38,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:00:38,504 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 8 conjunts are in the unsatisfiable core [2021-08-27 06:00:38,506 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:00:38,679 INFO L388 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 [2021-08-27 06:00:38,748 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-08-27 06:00:38,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:00:38,762 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:00:38,898 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2021-08-27 06:00:39,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:00:39,057 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 06:00:39,057 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [775906351] [2021-08-27 06:00:39,058 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [775906351] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 06:00:39,058 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:00:39,058 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2021-08-27 06:00:39,058 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921021311] [2021-08-27 06:00:39,059 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-27 06:00:39,059 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 06:00:39,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-27 06:00:39,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-27 06:00:39,060 INFO L87 Difference]: Start difference. First operand 96 states and 114 transitions. Second operand has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-08-27 06:00:39,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:00:39,322 INFO L93 Difference]: Finished difference Result 108 states and 123 transitions. [2021-08-27 06:00:39,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-27 06:00:39,323 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 27 [2021-08-27 06:00:39,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:00:39,323 INFO L225 Difference]: With dead ends: 108 [2021-08-27 06:00:39,323 INFO L226 Difference]: Without dead ends: 108 [2021-08-27 06:00:39,324 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 76.7ms TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-08-27 06:00:39,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2021-08-27 06:00:39,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 95. [2021-08-27 06:00:39,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 71 states have (on average 1.4225352112676057) internal successors, (101), 85 states have internal predecessors, (101), 6 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-08-27 06:00:39,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 112 transitions. [2021-08-27 06:00:39,326 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 112 transitions. Word has length 27 [2021-08-27 06:00:39,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:00:39,326 INFO L470 AbstractCegarLoop]: Abstraction has 95 states and 112 transitions. [2021-08-27 06:00:39,326 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-08-27 06:00:39,326 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 112 transitions. [2021-08-27 06:00:39,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-08-27 06:00:39,327 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:00:39,327 INFO L512 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] [2021-08-27 06:00:39,340 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2021-08-27 06:00:39,534 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 06:00:39,535 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting appendErr8REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE (and 39 more)] === [2021-08-27 06:00:39,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:00:39,537 INFO L82 PathProgramCache]: Analyzing trace with hash -556090162, now seen corresponding path program 1 times [2021-08-27 06:00:39,537 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 06:00:39,538 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1903093557] [2021-08-27 06:00:39,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:00:39,538 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 06:00:39,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 06:00:39,539 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 06:00:39,540 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2021-08-27 06:00:39,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:00:39,838 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 20 conjunts are in the unsatisfiable core [2021-08-27 06:00:39,839 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:00:39,921 INFO L388 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 [2021-08-27 06:00:40,014 INFO L388 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 22 treesize of output 18 [2021-08-27 06:00:40,094 INFO L354 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2021-08-27 06:00:40,095 INFO L388 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 24 treesize of output 29 [2021-08-27 06:00:40,248 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-08-27 06:00:40,249 INFO L388 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 44 treesize of output 39 [2021-08-27 06:00:40,458 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-08-27 06:00:40,458 INFO L388 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 57 treesize of output 41 [2021-08-27 06:00:40,509 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:00:40,509 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:00:40,775 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 42 [2021-08-27 06:00:41,041 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:00:41,042 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 06:00:41,042 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1903093557] [2021-08-27 06:00:41,042 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1903093557] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-27 06:00:41,042 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 06:00:41,042 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2021-08-27 06:00:41,042 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116411761] [2021-08-27 06:00:41,043 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-08-27 06:00:41,043 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 06:00:41,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-08-27 06:00:41,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2021-08-27 06:00:41,044 INFO L87 Difference]: Start difference. First operand 95 states and 112 transitions. Second operand has 17 states, 16 states have (on average 2.1875) internal successors, (35), 17 states have internal predecessors, (35), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-08-27 06:00:52,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:00:52,610 INFO L93 Difference]: Finished difference Result 107 states and 122 transitions. [2021-08-27 06:00:52,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-08-27 06:00:52,611 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.1875) internal successors, (35), 17 states have internal predecessors, (35), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 29 [2021-08-27 06:00:52,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:00:52,612 INFO L225 Difference]: With dead ends: 107 [2021-08-27 06:00:52,612 INFO L226 Difference]: Without dead ends: 107 [2021-08-27 06:00:52,612 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 791.5ms TimeCoverageRelationStatistics Valid=121, Invalid=385, Unknown=0, NotChecked=0, Total=506 [2021-08-27 06:00:52,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2021-08-27 06:00:52,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 94. [2021-08-27 06:00:52,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 71 states have (on average 1.408450704225352) internal successors, (100), 84 states have internal predecessors, (100), 6 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-08-27 06:00:52,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 111 transitions. [2021-08-27 06:00:52,615 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 111 transitions. Word has length 29 [2021-08-27 06:00:52,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:00:52,615 INFO L470 AbstractCegarLoop]: Abstraction has 94 states and 111 transitions. [2021-08-27 06:00:52,615 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.1875) internal successors, (35), 17 states have internal predecessors, (35), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-08-27 06:00:52,615 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 111 transitions. [2021-08-27 06:00:52,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-08-27 06:00:52,616 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:00:52,616 INFO L512 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] [2021-08-27 06:00:52,625 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2021-08-27 06:00:52,816 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 06:00:52,817 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting appendErr9REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE (and 39 more)] === [2021-08-27 06:00:52,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:00:52,817 INFO L82 PathProgramCache]: Analyzing trace with hash -556090161, now seen corresponding path program 1 times [2021-08-27 06:00:52,817 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 06:00:52,817 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1364166300] [2021-08-27 06:00:52,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:00:52,818 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 06:00:52,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 06:00:52,819 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 06:00:52,821 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2021-08-27 06:00:53,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:00:53,165 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 30 conjunts are in the unsatisfiable core [2021-08-27 06:00:53,166 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:00:53,390 INFO L388 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 [2021-08-27 06:00:53,398 INFO L388 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 27 treesize of output 23 [2021-08-27 06:00:53,521 INFO L354 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2021-08-27 06:00:53,521 INFO L388 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 23 treesize of output 23 [2021-08-27 06:00:53,530 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-08-27 06:00:53,658 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-08-27 06:00:53,658 INFO L388 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 55 treesize of output 50 [2021-08-27 06:00:53,687 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-08-27 06:00:53,687 INFO L388 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 51 treesize of output 42 [2021-08-27 06:00:53,826 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 36 [2021-08-27 06:00:53,831 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2021-08-27 06:00:53,878 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:00:53,878 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:00:55,448 INFO L388 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 105 treesize of output 101 [2021-08-27 06:00:55,452 INFO L388 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 150 treesize of output 134 [2021-08-27 06:00:57,586 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_append_~item~0.base_40 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_append_~item~0.base_40))) (let ((.cse0 (bvadd (_ bv8 32) c_append_~item~0.offset))) (and (= c_append_~plist.offset |c_append_#in~plist.offset|) (= |c_append_#in~plist.base| c_append_~plist.base) (bvule (bvadd (_ bv4 32) c_append_~item~0.offset) .cse0) (bvule .cse0 (select (store |c_#length| v_append_~item~0.base_40 (_ bv8 32)) c_append_~item~0.base)))))) is different from false [2021-08-27 06:00:57,676 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 58 [2021-08-27 06:00:57,691 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-08-27 06:00:57,691 INFO L388 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 58 treesize of output 57 [2021-08-27 06:00:57,927 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:00:57,928 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 06:00:57,928 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1364166300] [2021-08-27 06:00:57,928 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1364166300] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-27 06:00:57,928 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 06:00:57,928 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 17 [2021-08-27 06:00:57,928 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60405863] [2021-08-27 06:00:57,928 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-08-27 06:00:57,929 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 06:00:57,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-08-27 06:00:57,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=233, Unknown=1, NotChecked=30, Total=306 [2021-08-27 06:00:57,929 INFO L87 Difference]: Start difference. First operand 94 states and 111 transitions. Second operand has 18 states, 17 states have (on average 2.5294117647058822) internal successors, (43), 18 states have internal predecessors, (43), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2021-08-27 06:01:08,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:01:08,045 INFO L93 Difference]: Finished difference Result 113 states and 127 transitions. [2021-08-27 06:01:08,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-08-27 06:01:08,047 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.5294117647058822) internal successors, (43), 18 states have internal predecessors, (43), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) Word has length 29 [2021-08-27 06:01:08,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:01:08,047 INFO L225 Difference]: With dead ends: 113 [2021-08-27 06:01:08,048 INFO L226 Difference]: Without dead ends: 113 [2021-08-27 06:01:08,048 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 10620.5ms TimeCoverageRelationStatistics Valid=140, Invalid=513, Unknown=1, NotChecked=48, Total=702 [2021-08-27 06:01:08,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2021-08-27 06:01:08,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 98. [2021-08-27 06:01:08,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 75 states have (on average 1.3733333333333333) internal successors, (103), 88 states have internal predecessors, (103), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-08-27 06:01:08,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 114 transitions. [2021-08-27 06:01:08,050 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 114 transitions. Word has length 29 [2021-08-27 06:01:08,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:01:08,050 INFO L470 AbstractCegarLoop]: Abstraction has 98 states and 114 transitions. [2021-08-27 06:01:08,050 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.5294117647058822) internal successors, (43), 18 states have internal predecessors, (43), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2021-08-27 06:01:08,050 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 114 transitions. [2021-08-27 06:01:08,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-08-27 06:01:08,051 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:01:08,051 INFO L512 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] [2021-08-27 06:01:08,062 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Ended with exit code 0 [2021-08-27 06:01:08,258 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 06:01:08,259 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr14ASSERT_VIOLATIONMEMORY_FREE === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE (and 39 more)] === [2021-08-27 06:01:08,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:01:08,259 INFO L82 PathProgramCache]: Analyzing trace with hash -1427463172, now seen corresponding path program 1 times [2021-08-27 06:01:08,260 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 06:01:08,260 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1097011122] [2021-08-27 06:01:08,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:01:08,260 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 06:01:08,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 06:01:08,261 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 06:01:08,263 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2021-08-27 06:01:08,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:01:08,676 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 10 conjunts are in the unsatisfiable core [2021-08-27 06:01:08,678 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:01:08,913 INFO L388 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 19 treesize of output 15 [2021-08-27 06:01:09,041 INFO L388 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 [2021-08-27 06:01:09,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:01:09,076 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:01:09,264 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2021-08-27 06:01:09,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:01:09,423 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 06:01:09,423 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1097011122] [2021-08-27 06:01:09,423 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1097011122] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 06:01:09,423 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:01:09,423 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 5] imperfect sequences [] total 10 [2021-08-27 06:01:09,423 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595327350] [2021-08-27 06:01:09,424 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-08-27 06:01:09,424 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 06:01:09,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-08-27 06:01:09,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2021-08-27 06:01:09,424 INFO L87 Difference]: Start difference. First operand 98 states and 114 transitions. Second operand has 11 states, 10 states have (on average 4.6) internal successors, (46), 11 states have internal predecessors, (46), 2 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2021-08-27 06:01:10,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:01:10,064 INFO L93 Difference]: Finished difference Result 110 states and 123 transitions. [2021-08-27 06:01:10,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-08-27 06:01:10,065 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.6) internal successors, (46), 11 states have internal predecessors, (46), 2 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) Word has length 28 [2021-08-27 06:01:10,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:01:10,066 INFO L225 Difference]: With dead ends: 110 [2021-08-27 06:01:10,066 INFO L226 Difference]: Without dead ends: 110 [2021-08-27 06:01:10,066 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 229.2ms TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2021-08-27 06:01:10,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2021-08-27 06:01:10,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 97. [2021-08-27 06:01:10,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 75 states have (on average 1.3466666666666667) internal successors, (101), 87 states have internal predecessors, (101), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-08-27 06:01:10,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 112 transitions. [2021-08-27 06:01:10,068 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 112 transitions. Word has length 28 [2021-08-27 06:01:10,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:01:10,068 INFO L470 AbstractCegarLoop]: Abstraction has 97 states and 112 transitions. [2021-08-27 06:01:10,068 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.6) internal successors, (46), 11 states have internal predecessors, (46), 2 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2021-08-27 06:01:10,068 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 112 transitions. [2021-08-27 06:01:10,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-08-27 06:01:10,068 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:01:10,068 INFO L512 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] [2021-08-27 06:01:10,083 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2021-08-27 06:01:10,269 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 06:01:10,269 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr15ASSERT_VIOLATIONMEMORY_FREE === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE (and 39 more)] === [2021-08-27 06:01:10,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:01:10,269 INFO L82 PathProgramCache]: Analyzing trace with hash -1301685254, now seen corresponding path program 1 times [2021-08-27 06:01:10,270 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 06:01:10,270 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1952638244] [2021-08-27 06:01:10,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:01:10,270 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 06:01:10,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 06:01:10,279 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 06:01:10,280 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2021-08-27 06:01:10,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:01:10,701 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 8 conjunts are in the unsatisfiable core [2021-08-27 06:01:10,703 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:01:10,865 INFO L388 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 22 treesize of output 18 [2021-08-27 06:01:10,927 INFO L388 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 25 treesize of output 17 [2021-08-27 06:01:10,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:01:10,947 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:01:11,117 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 42 [2021-08-27 06:01:11,237 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-08-27 06:01:11,237 INFO L388 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 44 treesize of output 41 [2021-08-27 06:01:11,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:01:11,330 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 06:01:11,331 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1952638244] [2021-08-27 06:01:11,331 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1952638244] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 06:01:11,331 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:01:11,331 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 7 [2021-08-27 06:01:11,331 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502261043] [2021-08-27 06:01:11,331 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-08-27 06:01:11,331 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 06:01:11,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-27 06:01:11,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-08-27 06:01:11,332 INFO L87 Difference]: Start difference. First operand 97 states and 112 transitions. Second operand has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 8 states have internal predecessors, (27), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-08-27 06:01:11,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:01:11,840 INFO L93 Difference]: Finished difference Result 106 states and 118 transitions. [2021-08-27 06:01:11,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-27 06:01:11,840 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 8 states have internal predecessors, (27), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 29 [2021-08-27 06:01:11,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:01:11,842 INFO L225 Difference]: With dead ends: 106 [2021-08-27 06:01:11,842 INFO L226 Difference]: Without dead ends: 106 [2021-08-27 06:01:11,843 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 48 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 153.0ms TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-08-27 06:01:11,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2021-08-27 06:01:11,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 96. [2021-08-27 06:01:11,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 75 states have (on average 1.32) internal successors, (99), 86 states have internal predecessors, (99), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-08-27 06:01:11,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 110 transitions. [2021-08-27 06:01:11,845 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 110 transitions. Word has length 29 [2021-08-27 06:01:11,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:01:11,845 INFO L470 AbstractCegarLoop]: Abstraction has 96 states and 110 transitions. [2021-08-27 06:01:11,845 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 8 states have internal predecessors, (27), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-08-27 06:01:11,845 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 110 transitions. [2021-08-27 06:01:11,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-08-27 06:01:11,849 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:01:11,849 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:01:11,858 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Ended with exit code 0 [2021-08-27 06:01:12,056 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 06:01:12,056 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr16REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE (and 39 more)] === [2021-08-27 06:01:12,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:01:12,057 INFO L82 PathProgramCache]: Analyzing trace with hash -1697537089, now seen corresponding path program 1 times [2021-08-27 06:01:12,057 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 06:01:12,057 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1878941796] [2021-08-27 06:01:12,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:01:12,058 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 06:01:12,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 06:01:12,058 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 06:01:12,060 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2021-08-27 06:01:12,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:01:12,472 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 14 conjunts are in the unsatisfiable core [2021-08-27 06:01:12,473 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:01:12,483 INFO L388 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 [2021-08-27 06:01:12,585 INFO L388 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 [2021-08-27 06:01:12,641 INFO L388 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 17 treesize of output 13 [2021-08-27 06:01:12,678 INFO L354 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2021-08-27 06:01:12,678 INFO L388 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 19 treesize of output 19 [2021-08-27 06:01:12,742 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2021-08-27 06:01:12,792 INFO L354 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2021-08-27 06:01:12,792 INFO L388 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 21 treesize of output 26 [2021-08-27 06:01:12,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:01:12,831 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:01:13,036 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 48 [2021-08-27 06:01:13,162 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 26 [2021-08-27 06:01:13,286 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2021-08-27 06:01:13,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:01:13,448 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 06:01:13,448 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1878941796] [2021-08-27 06:01:13,448 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1878941796] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 06:01:13,448 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:01:13,448 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 8] imperfect sequences [] total 13 [2021-08-27 06:01:13,448 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162512307] [2021-08-27 06:01:13,448 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-08-27 06:01:13,449 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 06:01:13,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-08-27 06:01:13,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2021-08-27 06:01:13,450 INFO L87 Difference]: Start difference. First operand 96 states and 110 transitions. Second operand has 14 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 12 states have internal predecessors, (37), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2021-08-27 06:01:18,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:01:18,253 INFO L93 Difference]: Finished difference Result 119 states and 133 transitions. [2021-08-27 06:01:18,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-08-27 06:01:18,253 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 12 states have internal predecessors, (37), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 30 [2021-08-27 06:01:18,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:01:18,254 INFO L225 Difference]: With dead ends: 119 [2021-08-27 06:01:18,254 INFO L226 Difference]: Without dead ends: 119 [2021-08-27 06:01:18,254 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 425.4ms TimeCoverageRelationStatistics Valid=76, Invalid=304, Unknown=0, NotChecked=0, Total=380 [2021-08-27 06:01:18,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2021-08-27 06:01:18,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 95. [2021-08-27 06:01:18,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 75 states have (on average 1.2933333333333332) internal successors, (97), 85 states have internal predecessors, (97), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-08-27 06:01:18,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 108 transitions. [2021-08-27 06:01:18,256 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 108 transitions. Word has length 30 [2021-08-27 06:01:18,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:01:18,257 INFO L470 AbstractCegarLoop]: Abstraction has 95 states and 108 transitions. [2021-08-27 06:01:18,257 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 12 states have internal predecessors, (37), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2021-08-27 06:01:18,257 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 108 transitions. [2021-08-27 06:01:18,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-08-27 06:01:18,257 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:01:18,257 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:01:18,267 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2021-08-27 06:01:18,465 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 06:01:18,465 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr17REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE (and 39 more)] === [2021-08-27 06:01:18,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:01:18,466 INFO L82 PathProgramCache]: Analyzing trace with hash -1697537088, now seen corresponding path program 1 times [2021-08-27 06:01:18,466 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 06:01:18,466 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1278923363] [2021-08-27 06:01:18,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:01:18,466 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 06:01:18,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 06:01:18,467 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 06:01:18,469 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2021-08-27 06:01:18,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:01:18,939 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-27 06:01:18,940 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:01:19,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:01:19,067 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:01:19,169 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2021-08-27 06:01:19,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:01:19,252 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 06:01:19,252 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1278923363] [2021-08-27 06:01:19,253 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1278923363] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 06:01:19,253 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:01:19,253 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2021-08-27 06:01:19,253 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524157449] [2021-08-27 06:01:19,253 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-27 06:01:19,253 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 06:01:19,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-27 06:01:19,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2021-08-27 06:01:19,254 INFO L87 Difference]: Start difference. First operand 95 states and 108 transitions. Second operand has 6 states, 5 states have (on average 7.6) internal successors, (38), 6 states have internal predecessors, (38), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-08-27 06:01:19,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:01:19,302 INFO L93 Difference]: Finished difference Result 93 states and 105 transitions. [2021-08-27 06:01:19,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 06:01:19,302 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.6) internal successors, (38), 6 states have internal predecessors, (38), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 30 [2021-08-27 06:01:19,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:01:19,303 INFO L225 Difference]: With dead ends: 93 [2021-08-27 06:01:19,303 INFO L226 Difference]: Without dead ends: 93 [2021-08-27 06:01:19,303 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 37.9ms TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2021-08-27 06:01:19,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2021-08-27 06:01:19,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 86. [2021-08-27 06:01:19,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 70 states have (on average 1.2) internal successors, (84), 76 states have internal predecessors, (84), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-08-27 06:01:19,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 95 transitions. [2021-08-27 06:01:19,305 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 95 transitions. Word has length 30 [2021-08-27 06:01:19,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:01:19,305 INFO L470 AbstractCegarLoop]: Abstraction has 86 states and 95 transitions. [2021-08-27 06:01:19,306 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.6) internal successors, (38), 6 states have internal predecessors, (38), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-08-27 06:01:19,306 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 95 transitions. [2021-08-27 06:01:19,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-08-27 06:01:19,306 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:01:19,306 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:01:19,317 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2021-08-27 06:01:19,506 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 06:01:19,507 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr29ENSURES_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE (and 39 more)] === [2021-08-27 06:01:19,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:01:19,507 INFO L82 PathProgramCache]: Analyzing trace with hash -840371735, now seen corresponding path program 1 times [2021-08-27 06:01:19,507 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 06:01:19,507 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1314687377] [2021-08-27 06:01:19,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:01:19,507 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 06:01:19,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 06:01:19,508 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 06:01:19,510 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2021-08-27 06:01:20,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 06:01:20,087 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 06:01:20,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 06:01:20,233 INFO L133 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2021-08-27 06:01:20,233 INFO L626 BasicCegarLoop]: Counterexample is feasible [2021-08-27 06:01:20,233 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location mainErr29ENSURES_VIOLATIONMEMORY_LEAK [2021-08-27 06:01:20,234 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr0REQUIRES_VIOLATION [2021-08-27 06:01:20,234 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr1REQUIRES_VIOLATION [2021-08-27 06:01:20,234 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr2REQUIRES_VIOLATION [2021-08-27 06:01:20,235 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr3REQUIRES_VIOLATION [2021-08-27 06:01:20,235 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr4ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 06:01:20,235 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr5ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 06:01:20,235 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr6ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 06:01:20,235 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr7REQUIRES_VIOLATION [2021-08-27 06:01:20,235 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr8REQUIRES_VIOLATION [2021-08-27 06:01:20,235 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr9REQUIRES_VIOLATION [2021-08-27 06:01:20,235 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr10REQUIRES_VIOLATION [2021-08-27 06:01:20,235 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr11REQUIRES_VIOLATION [2021-08-27 06:01:20,235 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr12REQUIRES_VIOLATION [2021-08-27 06:01:20,235 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr13ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 06:01:20,235 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr14ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 06:01:20,235 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr15ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 06:01:20,235 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr16REQUIRES_VIOLATION [2021-08-27 06:01:20,235 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr17REQUIRES_VIOLATION [2021-08-27 06:01:20,235 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr18REQUIRES_VIOLATION [2021-08-27 06:01:20,235 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr19REQUIRES_VIOLATION [2021-08-27 06:01:20,235 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr20REQUIRES_VIOLATION [2021-08-27 06:01:20,235 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr21REQUIRES_VIOLATION [2021-08-27 06:01:20,236 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr22REQUIRES_VIOLATION [2021-08-27 06:01:20,236 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr23REQUIRES_VIOLATION [2021-08-27 06:01:20,236 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr24ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 06:01:20,236 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr25ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 06:01:20,236 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr26ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 06:01:20,236 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr27REQUIRES_VIOLATION [2021-08-27 06:01:20,236 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr28REQUIRES_VIOLATION [2021-08-27 06:01:20,236 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location appendErr0REQUIRES_VIOLATION [2021-08-27 06:01:20,236 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location appendErr1REQUIRES_VIOLATION [2021-08-27 06:01:20,236 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location appendErr2REQUIRES_VIOLATION [2021-08-27 06:01:20,236 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location appendErr3REQUIRES_VIOLATION [2021-08-27 06:01:20,236 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location appendErr4REQUIRES_VIOLATION [2021-08-27 06:01:20,236 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location appendErr5REQUIRES_VIOLATION [2021-08-27 06:01:20,236 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location appendErr6REQUIRES_VIOLATION [2021-08-27 06:01:20,236 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location appendErr7REQUIRES_VIOLATION [2021-08-27 06:01:20,236 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location appendErr8REQUIRES_VIOLATION [2021-08-27 06:01:20,237 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location appendErr9REQUIRES_VIOLATION [2021-08-27 06:01:20,237 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location appendErr10REQUIRES_VIOLATION [2021-08-27 06:01:20,237 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location appendErr11REQUIRES_VIOLATION [2021-08-27 06:01:20,237 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location appendErr12REQUIRES_VIOLATION [2021-08-27 06:01:20,237 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location appendErr13REQUIRES_VIOLATION [2021-08-27 06:01:20,261 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2021-08-27 06:01:20,437 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 06:01:20,456 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-27 06:01:20,465 WARN L418 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2021-08-27 06:01:20,485 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.08 06:01:20 BoogieIcfgContainer [2021-08-27 06:01:20,491 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-27 06:01:20,492 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-27 06:01:20,492 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-27 06:01:20,492 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-27 06:01:20,493 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 06:00:14" (3/4) ... [2021-08-27 06:01:20,494 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-08-27 06:01:20,495 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-27 06:01:20,496 INFO L168 Benchmark]: Toolchain (without parser) took 66957.60 ms. Allocated memory was 81.8 MB in the beginning and 132.1 MB in the end (delta: 50.3 MB). Free memory was 46.4 MB in the beginning and 80.6 MB in the end (delta: -34.1 MB). Peak memory consumption was 16.0 MB. Max. memory is 16.1 GB. [2021-08-27 06:01:20,496 INFO L168 Benchmark]: CDTParser took 0.29 ms. Allocated memory is still 81.8 MB. Free memory was 64.3 MB in the beginning and 64.2 MB in the end (delta: 73.2 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-27 06:01:20,496 INFO L168 Benchmark]: CACSL2BoogieTranslator took 428.41 ms. Allocated memory is still 81.8 MB. Free memory was 46.2 MB in the beginning and 58.4 MB in the end (delta: -12.2 MB). Peak memory consumption was 6.5 MB. Max. memory is 16.1 GB. [2021-08-27 06:01:20,497 INFO L168 Benchmark]: Boogie Preprocessor took 82.86 ms. Allocated memory is still 81.8 MB. Free memory was 58.4 MB in the beginning and 55.3 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-08-27 06:01:20,497 INFO L168 Benchmark]: RCFGBuilder took 611.12 ms. Allocated memory was 81.8 MB in the beginning and 109.1 MB in the end (delta: 27.3 MB). Free memory was 55.3 MB in the beginning and 81.6 MB in the end (delta: -26.3 MB). Peak memory consumption was 24.7 MB. Max. memory is 16.1 GB. [2021-08-27 06:01:20,497 INFO L168 Benchmark]: TraceAbstraction took 65807.12 ms. Allocated memory was 109.1 MB in the beginning and 132.1 MB in the end (delta: 23.1 MB). Free memory was 81.6 MB in the beginning and 80.6 MB in the end (delta: 1.0 MB). Peak memory consumption was 22.5 MB. Max. memory is 16.1 GB. [2021-08-27 06:01:20,497 INFO L168 Benchmark]: Witness Printer took 3.34 ms. Allocated memory is still 132.1 MB. Free memory is still 80.6 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-08-27 06:01:20,498 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.29 ms. Allocated memory is still 81.8 MB. Free memory was 64.3 MB in the beginning and 64.2 MB in the end (delta: 73.2 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 428.41 ms. Allocated memory is still 81.8 MB. Free memory was 46.2 MB in the beginning and 58.4 MB in the end (delta: -12.2 MB). Peak memory consumption was 6.5 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 82.86 ms. Allocated memory is still 81.8 MB. Free memory was 58.4 MB in the beginning and 55.3 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 611.12 ms. Allocated memory was 81.8 MB in the beginning and 109.1 MB in the end (delta: 27.3 MB). Free memory was 55.3 MB in the beginning and 81.6 MB in the end (delta: -26.3 MB). Peak memory consumption was 24.7 MB. Max. memory is 16.1 GB. * TraceAbstraction took 65807.12 ms. Allocated memory was 109.1 MB in the beginning and 132.1 MB in the end (delta: 23.1 MB). Free memory was 81.6 MB in the beginning and 80.6 MB in the end (delta: 1.0 MB). Peak memory consumption was 22.5 MB. Max. memory is 16.1 GB. * Witness Printer took 3.34 ms. Allocated memory is still 132.1 MB. Free memory is still 80.6 MB. There was no memory consumed. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 539]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 539. Possible FailurePath: [L524] int c = 0; VAL [\old(c)=13, c=0] [L541] struct item *list = ((void *)0); [L542] int length = 0; VAL [\old(c)=0, c=0, length=0, list={31:0}] [L544] CALL append(&list) VAL [\old(c)=0, c=0, plist={31:0}] [L531] c++ [L532] struct item *item = malloc(sizeof *item); [L533] EXPR \read(**plist) VAL [\old(c)=0, \read(**plist)={0:0}, c=1, item={1:0}, plist={31:0}, plist={31:0}] [L533] item->next = *plist VAL [\old(c)=0, \read(**plist)={0:0}, c=1, item={1:0}, plist={31:0}, plist={31:0}] [L534] EXPR item->next VAL [\old(c)=0, c=1, item={1:0}, item->next={0:0}, plist={31:0}, plist={31:0}] [L534-L536] EXPR (item->next) ? item->next->data : malloc(sizeof *item) [L534-L536] EXPR (item->next) ? item->next->data : malloc(sizeof *item) VAL [(item->next) ? item->next->data : malloc(sizeof *item)={3:0}, \old(c)=0, c=1, item={1:0}, item->next={0:0}, malloc(sizeof *item)={3:0}, plist={31:0}, plist={31:0}] [L534-L536] item->data = (item->next) ? item->next->data : malloc(sizeof *item) VAL [(item->next) ? item->next->data : malloc(sizeof *item)={3:0}, \old(c)=0, c=1, item={1:0}, item->next={0:0}, malloc(sizeof *item)={3:0}, plist={31:0}, plist={31:0}] [L537] *plist = item VAL [\old(c)=0, c=1, item={1:0}, plist={31:0}, plist={31:0}] [L544] RET append(&list) VAL [\old(c)=0, c=1, length=0, list={31:0}] [L545] length++ VAL [\old(c)=0, c=1, length=1, list={31:0}] [L546] COND FALSE !(__VERIFIER_nondet_int() && c < 20) [L547] COND TRUE length > 0 VAL [\old(c)=0, c=1, length=1, list={31:0}] [L548] COND FALSE !(length < 0) VAL [\old(c)=0, c=1, length=1, list={31:0}] [L551] EXPR \read(*list) VAL [\old(c)=0, \read(*list)={1:0}, c=1, length=1, list={31:0}] [L551] EXPR list->next VAL [\old(c)=0, \read(*list)={1:0}, c=1, length=1, list={31:0}, list->next={0:0}] [L551] struct item *next = list->next; [L552] EXPR \read(*list) VAL [\old(c)=0, \read(*list)={1:0}, c=1, length=1, list={31:0}, next={0:0}] [L552] free(list) VAL [\old(c)=0, \read(*list)={1:0}, c=1, length=1, list={31:0}, next={0:0}] [L552] free(list) VAL [\old(c)=0, \read(*list)={1:0}, c=1, length=1, list={31:0}, next={0:0}] [L552] free(list) [L553] list = next VAL [\old(c)=0, c=1, length=1, list={31:0}, next={0:0}] [L554] length-- VAL [\old(c)=0, c=1, length=0, list={31:0}, next={0:0}] [L556] COND FALSE !(length > 0) VAL [\old(c)=0, c=1, length=0, list={31:0}, next={0:0}] [L562] return 0; [L541] struct item *list = ((void *)0); [L562] return 0; VAL [\old(c)=0, \result=0, c=1, length=0, next={0:0}] - UnprovableResult [Line: 549]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 549]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 549]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 549]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 549]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 549]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 549]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 551]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 551]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 551]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 551]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 552]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 552]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 552]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 552]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 552]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 553]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 553]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 557]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 557]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 557]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 557]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 558]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 558]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 558]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 558]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 558]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 559]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 559]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 533]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 533]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 533]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 533]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 534]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 534]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 535]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 535]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 535]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 535]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 534]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 534]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 537]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 537]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 11 procedures, 122 locations, 44 error locations. Started 1 CEGAR loops. OverallTime: 65722.9ms, OverallIterations: 16, TraceHistogramMax: 2, EmptinessCheckTime: 20.4ms, AutomataDifference: 44125.4ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 9.9ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 859 SDtfs, 1092 SDslu, 3219 SDs, 0 SdLazy, 2955 SolverSat, 154 SolverUnsat, 13 SolverUnknown, 0 SolverNotchecked, 34096.4ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 682 GetRequests, 522 SyntacticMatches, 12 SemanticMatches, 148 ConstructedPredicates, 1 IntricatePredicates, 2 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 13663.4ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=98occurred in iteration=0, InterpolantAutomatonStates: 119, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 91.4ms AutomataMinimizationTime, 15 MinimizatonAttempts, 199 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 247.2ms SsaConstructionTime, 864.6ms SatisfiabilityAnalysisTime, 13194.2ms InterpolantComputationTime, 361 NumberOfCodeBlocks, 361 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 624 ConstructedInterpolants, 34 QuantifiedInterpolants, 6181 SizeOfPredicates, 117 NumberOfNonLiveVariables, 2097 ConjunctsInSsa, 158 ConjunctsInUnsatCore, 30 InterpolantComputations, 26 PerfectInterpolantSequences, 8/28 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2021-08-27 06:01:20,550 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...