./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/forester-heap/sll-optional-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 6c24879c 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/forester-heap/sll-optional-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 8b0f1d623fff7bbdf74e6250d2f53fb98e44ca7ba1aae1265f5b0871b427fba0 --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 19:03:19,708 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 19:03:19,711 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 19:03:19,757 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 19:03:19,757 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 19:03:19,759 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 19:03:19,760 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 19:03:19,763 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 19:03:19,764 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 19:03:19,769 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 19:03:19,770 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 19:03:19,772 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 19:03:19,772 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 19:03:19,774 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 19:03:19,776 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 19:03:19,779 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 19:03:19,780 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 19:03:19,782 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 19:03:19,783 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 19:03:19,788 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 19:03:19,790 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 19:03:19,791 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 19:03:19,792 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 19:03:19,793 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 19:03:19,794 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 19:03:19,799 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 19:03:19,800 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 19:03:19,800 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 19:03:19,801 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 19:03:19,802 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 19:03:19,803 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 19:03:19,803 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 19:03:19,805 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 19:03:19,805 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 19:03:19,806 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 19:03:19,808 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 19:03:19,808 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 19:03:19,809 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 19:03:19,809 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 19:03:19,809 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 19:03:19,810 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 19:03:19,812 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 19:03:19,813 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-07-12 19:03:19,842 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 19:03:19,842 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 19:03:19,843 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 19:03:19,843 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 19:03:19,844 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 19:03:19,844 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 19:03:19,845 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 19:03:19,845 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 19:03:19,845 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 19:03:19,846 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 19:03:19,846 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-12 19:03:19,846 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-12 19:03:19,847 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 19:03:19,847 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-12 19:03:19,847 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 19:03:19,847 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-12 19:03:19,847 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-12 19:03:19,848 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-12 19:03:19,848 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 19:03:19,849 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-12 19:03:19,849 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-12 19:03:19,850 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 19:03:19,850 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 19:03:19,850 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 19:03:19,850 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 19:03:19,850 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 19:03:19,851 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 19:03:19,851 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 19:03:19,851 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 19:03:19,851 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 19:03:19,852 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 -> 8b0f1d623fff7bbdf74e6250d2f53fb98e44ca7ba1aae1265f5b0871b427fba0 [2022-07-12 19:03:20,121 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 19:03:20,158 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 19:03:20,161 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 19:03:20,162 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 19:03:20,162 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 19:03:20,164 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/sll-optional-1.i [2022-07-12 19:03:20,243 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/60c5bc49b/8dbd1efe1d864ad29d73b76721d0c23a/FLAG05713d873 [2022-07-12 19:03:20,631 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 19:03:20,632 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-optional-1.i [2022-07-12 19:03:20,642 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/60c5bc49b/8dbd1efe1d864ad29d73b76721d0c23a/FLAG05713d873 [2022-07-12 19:03:21,000 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/60c5bc49b/8dbd1efe1d864ad29d73b76721d0c23a [2022-07-12 19:03:21,002 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 19:03:21,004 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 19:03:21,008 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 19:03:21,008 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 19:03:21,014 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 19:03:21,015 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 07:03:21" (1/1) ... [2022-07-12 19:03:21,016 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a6bf172 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:03:21, skipping insertion in model container [2022-07-12 19:03:21,017 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 07:03:21" (1/1) ... [2022-07-12 19:03:21,023 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 19:03:21,056 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 19:03:21,331 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-optional-1.i[22688,22701] [2022-07-12 19:03:21,337 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 19:03:21,348 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 19:03:21,378 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-optional-1.i[22688,22701] [2022-07-12 19:03:21,381 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 19:03:21,403 INFO L208 MainTranslator]: Completed translation [2022-07-12 19:03:21,404 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:03:21 WrapperNode [2022-07-12 19:03:21,404 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 19:03:21,405 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 19:03:21,405 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 19:03:21,406 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 19:03:21,412 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:03:21" (1/1) ... [2022-07-12 19:03:21,427 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:03:21" (1/1) ... [2022-07-12 19:03:21,463 INFO L137 Inliner]: procedures = 119, calls = 41, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 136 [2022-07-12 19:03:21,464 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 19:03:21,465 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 19:03:21,465 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 19:03:21,465 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 19:03:21,470 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:03:21" (1/1) ... [2022-07-12 19:03:21,470 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:03:21" (1/1) ... [2022-07-12 19:03:21,474 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:03:21" (1/1) ... [2022-07-12 19:03:21,475 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:03:21" (1/1) ... [2022-07-12 19:03:21,481 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:03:21" (1/1) ... [2022-07-12 19:03:21,485 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:03:21" (1/1) ... [2022-07-12 19:03:21,487 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:03:21" (1/1) ... [2022-07-12 19:03:21,490 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 19:03:21,490 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 19:03:21,491 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 19:03:21,491 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 19:03:21,492 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:03:21" (1/1) ... [2022-07-12 19:03:21,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 19:03:21,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 19:03:21,525 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) [2022-07-12 19:03:21,528 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 [2022-07-12 19:03:21,554 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-12 19:03:21,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-12 19:03:21,555 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-12 19:03:21,555 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 19:03:21,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-12 19:03:21,555 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-12 19:03:21,555 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 19:03:21,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 19:03:21,555 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 19:03:21,556 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 19:03:21,634 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 19:03:21,636 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 19:03:22,070 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 19:03:22,079 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 19:03:22,079 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2022-07-12 19:03:22,082 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 07:03:22 BoogieIcfgContainer [2022-07-12 19:03:22,082 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 19:03:22,084 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 19:03:22,085 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 19:03:22,088 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 19:03:22,088 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 07:03:21" (1/3) ... [2022-07-12 19:03:22,089 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ea2bc71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 07:03:22, skipping insertion in model container [2022-07-12 19:03:22,089 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:03:21" (2/3) ... [2022-07-12 19:03:22,090 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ea2bc71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 07:03:22, skipping insertion in model container [2022-07-12 19:03:22,090 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 07:03:22" (3/3) ... [2022-07-12 19:03:22,093 INFO L111 eAbstractionObserver]: Analyzing ICFG sll-optional-1.i [2022-07-12 19:03:22,112 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 19:03:22,112 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 66 error locations. [2022-07-12 19:03:22,153 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 19:03:22,159 INFO L357 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, mAutomataTypeConcurrency=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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@6bd09fc2, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@7c348322 [2022-07-12 19:03:22,159 INFO L358 AbstractCegarLoop]: Starting to check reachability of 66 error locations. [2022-07-12 19:03:22,163 INFO L276 IsEmpty]: Start isEmpty. Operand has 143 states, 76 states have (on average 2.0921052631578947) internal successors, (159), 142 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:03:22,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-07-12 19:03:22,169 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:03:22,169 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-07-12 19:03:22,170 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2022-07-12 19:03:22,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:03:22,191 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2022-07-12 19:03:22,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:03:22,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954305030] [2022-07-12 19:03:22,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:03:22,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:03:22,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:03:22,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:03:22,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:03:22,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954305030] [2022-07-12 19:03:22,336 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954305030] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:03:22,337 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:03:22,337 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 19:03:22,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861852219] [2022-07-12 19:03:22,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:03:22,342 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 19:03:22,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:03:22,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 19:03:22,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 19:03:22,371 INFO L87 Difference]: Start difference. First operand has 143 states, 76 states have (on average 2.0921052631578947) internal successors, (159), 142 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:03:22,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:03:22,541 INFO L93 Difference]: Finished difference Result 145 states and 155 transitions. [2022-07-12 19:03:22,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 19:03:22,544 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-07-12 19:03:22,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:03:22,557 INFO L225 Difference]: With dead ends: 145 [2022-07-12 19:03:22,557 INFO L226 Difference]: Without dead ends: 141 [2022-07-12 19:03:22,559 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 19:03:22,563 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 128 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 19:03:22,564 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 84 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 19:03:22,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2022-07-12 19:03:22,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 135. [2022-07-12 19:03:22,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 78 states have (on average 1.8846153846153846) internal successors, (147), 134 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:03:22,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 147 transitions. [2022-07-12 19:03:22,612 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 147 transitions. Word has length 3 [2022-07-12 19:03:22,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:03:22,612 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 147 transitions. [2022-07-12 19:03:22,613 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:03:22,613 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 147 transitions. [2022-07-12 19:03:22,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-07-12 19:03:22,613 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:03:22,614 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-07-12 19:03:22,614 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 19:03:22,614 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2022-07-12 19:03:22,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:03:22,616 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2022-07-12 19:03:22,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:03:22,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019905518] [2022-07-12 19:03:22,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:03:22,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:03:22,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:03:22,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:03:22,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:03:22,674 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019905518] [2022-07-12 19:03:22,675 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019905518] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:03:22,675 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:03:22,675 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 19:03:22,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547902522] [2022-07-12 19:03:22,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:03:22,677 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 19:03:22,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:03:22,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 19:03:22,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 19:03:22,678 INFO L87 Difference]: Start difference. First operand 135 states and 147 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:03:22,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:03:22,768 INFO L93 Difference]: Finished difference Result 131 states and 143 transitions. [2022-07-12 19:03:22,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 19:03:22,769 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-07-12 19:03:22,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:03:22,770 INFO L225 Difference]: With dead ends: 131 [2022-07-12 19:03:22,770 INFO L226 Difference]: Without dead ends: 131 [2022-07-12 19:03:22,771 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 19:03:22,772 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 105 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 19:03:22,772 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 97 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 19:03:22,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2022-07-12 19:03:22,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 127. [2022-07-12 19:03:22,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 78 states have (on average 1.7820512820512822) internal successors, (139), 126 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:03:22,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 139 transitions. [2022-07-12 19:03:22,786 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 139 transitions. Word has length 3 [2022-07-12 19:03:22,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:03:22,786 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 139 transitions. [2022-07-12 19:03:22,786 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:03:22,786 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 139 transitions. [2022-07-12 19:03:22,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-12 19:03:22,787 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:03:22,787 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:03:22,787 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-12 19:03:22,787 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2022-07-12 19:03:22,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:03:22,788 INFO L85 PathProgramCache]: Analyzing trace with hash 171916845, now seen corresponding path program 1 times [2022-07-12 19:03:22,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:03:22,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429167920] [2022-07-12 19:03:22,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:03:22,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:03:22,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:03:22,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:03:22,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:03:22,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429167920] [2022-07-12 19:03:22,876 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429167920] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:03:22,876 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:03:22,877 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 19:03:22,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122922504] [2022-07-12 19:03:22,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:03:22,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 19:03:22,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:03:22,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 19:03:22,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 19:03:22,879 INFO L87 Difference]: Start difference. First operand 127 states and 139 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:03:23,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:03:23,057 INFO L93 Difference]: Finished difference Result 171 states and 188 transitions. [2022-07-12 19:03:23,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 19:03:23,058 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-07-12 19:03:23,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:03:23,059 INFO L225 Difference]: With dead ends: 171 [2022-07-12 19:03:23,059 INFO L226 Difference]: Without dead ends: 171 [2022-07-12 19:03:23,059 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-12 19:03:23,061 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 51 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 19:03:23,061 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 313 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 19:03:23,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2022-07-12 19:03:23,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 126. [2022-07-12 19:03:23,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 78 states have (on average 1.7692307692307692) internal successors, (138), 125 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:03:23,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 138 transitions. [2022-07-12 19:03:23,068 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 138 transitions. Word has length 11 [2022-07-12 19:03:23,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:03:23,068 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 138 transitions. [2022-07-12 19:03:23,068 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:03:23,068 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 138 transitions. [2022-07-12 19:03:23,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-12 19:03:23,069 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:03:23,069 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:03:23,069 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-12 19:03:23,070 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2022-07-12 19:03:23,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:03:23,070 INFO L85 PathProgramCache]: Analyzing trace with hash 171916846, now seen corresponding path program 1 times [2022-07-12 19:03:23,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:03:23,071 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861703309] [2022-07-12 19:03:23,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:03:23,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:03:23,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:03:23,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:03:23,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:03:23,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861703309] [2022-07-12 19:03:23,156 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861703309] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:03:23,156 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:03:23,156 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 19:03:23,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036634671] [2022-07-12 19:03:23,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:03:23,157 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 19:03:23,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:03:23,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 19:03:23,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 19:03:23,158 INFO L87 Difference]: Start difference. First operand 126 states and 138 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:03:23,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:03:23,309 INFO L93 Difference]: Finished difference Result 125 states and 137 transitions. [2022-07-12 19:03:23,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 19:03:23,309 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-07-12 19:03:23,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:03:23,311 INFO L225 Difference]: With dead ends: 125 [2022-07-12 19:03:23,311 INFO L226 Difference]: Without dead ends: 125 [2022-07-12 19:03:23,311 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-12 19:03:23,313 INFO L413 NwaCegarLoop]: 129 mSDtfsCounter, 2 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 19:03:23,314 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 349 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 19:03:23,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2022-07-12 19:03:23,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2022-07-12 19:03:23,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 78 states have (on average 1.7564102564102564) internal successors, (137), 124 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:03:23,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 137 transitions. [2022-07-12 19:03:23,318 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 137 transitions. Word has length 11 [2022-07-12 19:03:23,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:03:23,319 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 137 transitions. [2022-07-12 19:03:23,323 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:03:23,323 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 137 transitions. [2022-07-12 19:03:23,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-12 19:03:23,324 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:03:23,324 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:03:23,324 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-12 19:03:23,325 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2022-07-12 19:03:23,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:03:23,325 INFO L85 PathProgramCache]: Analyzing trace with hash -468215045, now seen corresponding path program 1 times [2022-07-12 19:03:23,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:03:23,326 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240116400] [2022-07-12 19:03:23,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:03:23,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:03:23,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:03:23,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:03:23,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:03:23,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240116400] [2022-07-12 19:03:23,386 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240116400] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:03:23,386 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:03:23,386 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 19:03:23,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224165774] [2022-07-12 19:03:23,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:03:23,387 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 19:03:23,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:03:23,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 19:03:23,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 19:03:23,388 INFO L87 Difference]: Start difference. First operand 125 states and 137 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:03:23,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:03:23,510 INFO L93 Difference]: Finished difference Result 127 states and 138 transitions. [2022-07-12 19:03:23,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 19:03:23,511 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-07-12 19:03:23,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:03:23,512 INFO L225 Difference]: With dead ends: 127 [2022-07-12 19:03:23,512 INFO L226 Difference]: Without dead ends: 127 [2022-07-12 19:03:23,513 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-12 19:03:23,517 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 171 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 19:03:23,519 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 73 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 19:03:23,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2022-07-12 19:03:23,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 118. [2022-07-12 19:03:23,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 84 states have (on average 1.6071428571428572) internal successors, (135), 117 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:03:23,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 135 transitions. [2022-07-12 19:03:23,528 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 135 transitions. Word has length 12 [2022-07-12 19:03:23,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:03:23,528 INFO L495 AbstractCegarLoop]: Abstraction has 118 states and 135 transitions. [2022-07-12 19:03:23,528 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:03:23,529 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 135 transitions. [2022-07-12 19:03:23,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-12 19:03:23,529 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:03:23,529 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:03:23,529 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-12 19:03:23,530 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2022-07-12 19:03:23,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:03:23,530 INFO L85 PathProgramCache]: Analyzing trace with hash -468215044, now seen corresponding path program 1 times [2022-07-12 19:03:23,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:03:23,531 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734518912] [2022-07-12 19:03:23,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:03:23,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:03:23,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:03:23,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:03:23,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:03:23,645 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734518912] [2022-07-12 19:03:23,645 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734518912] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:03:23,645 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:03:23,646 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 19:03:23,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705921424] [2022-07-12 19:03:23,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:03:23,646 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 19:03:23,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:03:23,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 19:03:23,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-12 19:03:23,648 INFO L87 Difference]: Start difference. First operand 118 states and 135 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:03:23,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:03:23,862 INFO L93 Difference]: Finished difference Result 171 states and 189 transitions. [2022-07-12 19:03:23,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 19:03:23,862 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-07-12 19:03:23,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:03:23,865 INFO L225 Difference]: With dead ends: 171 [2022-07-12 19:03:23,865 INFO L226 Difference]: Without dead ends: 171 [2022-07-12 19:03:23,866 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-07-12 19:03:23,868 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 180 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 19:03:23,869 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 151 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 19:03:23,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2022-07-12 19:03:23,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 146. [2022-07-12 19:03:23,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 112 states have (on average 1.5267857142857142) internal successors, (171), 145 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:03:23,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 171 transitions. [2022-07-12 19:03:23,886 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 171 transitions. Word has length 12 [2022-07-12 19:03:23,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:03:23,887 INFO L495 AbstractCegarLoop]: Abstraction has 146 states and 171 transitions. [2022-07-12 19:03:23,887 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:03:23,889 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 171 transitions. [2022-07-12 19:03:23,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-12 19:03:23,889 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:03:23,890 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:03:23,890 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-12 19:03:23,890 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2022-07-12 19:03:23,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:03:23,891 INFO L85 PathProgramCache]: Analyzing trace with hash -2003220227, now seen corresponding path program 1 times [2022-07-12 19:03:23,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:03:23,892 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781789162] [2022-07-12 19:03:23,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:03:23,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:03:23,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:03:23,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:03:23,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:03:23,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781789162] [2022-07-12 19:03:23,982 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781789162] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:03:23,982 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:03:23,982 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 19:03:23,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243746703] [2022-07-12 19:03:23,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:03:23,983 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 19:03:23,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:03:23,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 19:03:23,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 19:03:23,984 INFO L87 Difference]: Start difference. First operand 146 states and 171 transitions. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:03:24,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:03:24,151 INFO L93 Difference]: Finished difference Result 146 states and 171 transitions. [2022-07-12 19:03:24,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 19:03:24,151 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-07-12 19:03:24,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:03:24,152 INFO L225 Difference]: With dead ends: 146 [2022-07-12 19:03:24,152 INFO L226 Difference]: Without dead ends: 146 [2022-07-12 19:03:24,153 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-07-12 19:03:24,153 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 63 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 19:03:24,154 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 273 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 19:03:24,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2022-07-12 19:03:24,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 145. [2022-07-12 19:03:24,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 112 states have (on average 1.5178571428571428) internal successors, (170), 144 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:03:24,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 170 transitions. [2022-07-12 19:03:24,157 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 170 transitions. Word has length 16 [2022-07-12 19:03:24,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:03:24,158 INFO L495 AbstractCegarLoop]: Abstraction has 145 states and 170 transitions. [2022-07-12 19:03:24,158 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:03:24,158 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 170 transitions. [2022-07-12 19:03:24,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-12 19:03:24,158 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:03:24,158 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:03:24,159 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-12 19:03:24,159 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2022-07-12 19:03:24,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:03:24,159 INFO L85 PathProgramCache]: Analyzing trace with hash -2003220226, now seen corresponding path program 1 times [2022-07-12 19:03:24,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:03:24,159 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268579466] [2022-07-12 19:03:24,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:03:24,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:03:24,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:03:24,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:03:24,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:03:24,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268579466] [2022-07-12 19:03:24,222 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268579466] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:03:24,222 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:03:24,223 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 19:03:24,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910342906] [2022-07-12 19:03:24,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:03:24,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 19:03:24,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:03:24,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 19:03:24,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 19:03:24,224 INFO L87 Difference]: Start difference. First operand 145 states and 170 transitions. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:03:24,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:03:24,430 INFO L93 Difference]: Finished difference Result 137 states and 162 transitions. [2022-07-12 19:03:24,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-12 19:03:24,430 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-07-12 19:03:24,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:03:24,431 INFO L225 Difference]: With dead ends: 137 [2022-07-12 19:03:24,431 INFO L226 Difference]: Without dead ends: 137 [2022-07-12 19:03:24,431 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2022-07-12 19:03:24,432 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 25 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 19:03:24,432 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 323 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 19:03:24,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2022-07-12 19:03:24,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 130. [2022-07-12 19:03:24,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 107 states have (on average 1.439252336448598) internal successors, (154), 129 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:03:24,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 154 transitions. [2022-07-12 19:03:24,435 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 154 transitions. Word has length 16 [2022-07-12 19:03:24,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:03:24,435 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 154 transitions. [2022-07-12 19:03:24,436 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:03:24,436 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 154 transitions. [2022-07-12 19:03:24,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-12 19:03:24,436 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:03:24,436 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:03:24,436 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-12 19:03:24,436 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2022-07-12 19:03:24,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:03:24,440 INFO L85 PathProgramCache]: Analyzing trace with hash 2123452236, now seen corresponding path program 1 times [2022-07-12 19:03:24,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:03:24,440 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557804377] [2022-07-12 19:03:24,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:03:24,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:03:24,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:03:24,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:03:24,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:03:24,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557804377] [2022-07-12 19:03:24,492 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557804377] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:03:24,493 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:03:24,493 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 19:03:24,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470523299] [2022-07-12 19:03:24,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:03:24,494 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 19:03:24,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:03:24,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 19:03:24,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 19:03:24,495 INFO L87 Difference]: Start difference. First operand 130 states and 154 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:03:24,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:03:24,570 INFO L93 Difference]: Finished difference Result 154 states and 173 transitions. [2022-07-12 19:03:24,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 19:03:24,571 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-07-12 19:03:24,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:03:24,572 INFO L225 Difference]: With dead ends: 154 [2022-07-12 19:03:24,572 INFO L226 Difference]: Without dead ends: 154 [2022-07-12 19:03:24,572 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-12 19:03:24,573 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 153 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 19:03:24,573 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 154 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 19:03:24,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2022-07-12 19:03:24,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 130. [2022-07-12 19:03:24,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 107 states have (on average 1.4205607476635513) internal successors, (152), 129 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:03:24,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 152 transitions. [2022-07-12 19:03:24,577 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 152 transitions. Word has length 17 [2022-07-12 19:03:24,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:03:24,577 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 152 transitions. [2022-07-12 19:03:24,578 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:03:24,578 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 152 transitions. [2022-07-12 19:03:24,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-12 19:03:24,578 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:03:24,579 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:03:24,579 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-12 19:03:24,579 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2022-07-12 19:03:24,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:03:24,580 INFO L85 PathProgramCache]: Analyzing trace with hash -1866791259, now seen corresponding path program 1 times [2022-07-12 19:03:24,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:03:24,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965285605] [2022-07-12 19:03:24,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:03:24,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:03:24,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:03:24,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:03:24,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:03:24,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965285605] [2022-07-12 19:03:24,619 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965285605] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:03:24,619 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:03:24,619 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 19:03:24,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166481075] [2022-07-12 19:03:24,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:03:24,620 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 19:03:24,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:03:24,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 19:03:24,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 19:03:24,621 INFO L87 Difference]: Start difference. First operand 130 states and 152 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:03:24,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:03:24,638 INFO L93 Difference]: Finished difference Result 156 states and 186 transitions. [2022-07-12 19:03:24,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 19:03:24,639 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-07-12 19:03:24,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:03:24,640 INFO L225 Difference]: With dead ends: 156 [2022-07-12 19:03:24,640 INFO L226 Difference]: Without dead ends: 156 [2022-07-12 19:03:24,640 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-12 19:03:24,641 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 21 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 19:03:24,641 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 304 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 19:03:24,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2022-07-12 19:03:24,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 134. [2022-07-12 19:03:24,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 111 states have (on average 1.4054054054054055) internal successors, (156), 133 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:03:24,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 156 transitions. [2022-07-12 19:03:24,645 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 156 transitions. Word has length 20 [2022-07-12 19:03:24,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:03:24,645 INFO L495 AbstractCegarLoop]: Abstraction has 134 states and 156 transitions. [2022-07-12 19:03:24,645 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:03:24,646 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 156 transitions. [2022-07-12 19:03:24,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-12 19:03:24,646 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:03:24,647 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:03:24,647 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-12 19:03:24,647 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2022-07-12 19:03:24,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:03:24,648 INFO L85 PathProgramCache]: Analyzing trace with hash 72886850, now seen corresponding path program 1 times [2022-07-12 19:03:24,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:03:24,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133526387] [2022-07-12 19:03:24,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:03:24,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:03:24,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:03:24,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:03:24,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:03:24,718 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133526387] [2022-07-12 19:03:24,718 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133526387] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:03:24,718 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:03:24,718 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 19:03:24,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581021449] [2022-07-12 19:03:24,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:03:24,719 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 19:03:24,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:03:24,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 19:03:24,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-12 19:03:24,720 INFO L87 Difference]: Start difference. First operand 134 states and 156 transitions. Second operand has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:03:25,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:03:25,004 INFO L93 Difference]: Finished difference Result 247 states and 287 transitions. [2022-07-12 19:03:25,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 19:03:25,005 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-07-12 19:03:25,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:03:25,006 INFO L225 Difference]: With dead ends: 247 [2022-07-12 19:03:25,006 INFO L226 Difference]: Without dead ends: 247 [2022-07-12 19:03:25,007 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2022-07-12 19:03:25,008 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 246 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 19:03:25,008 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 274 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 19:03:25,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2022-07-12 19:03:25,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 148. [2022-07-12 19:03:25,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 125 states have (on average 1.392) internal successors, (174), 147 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:03:25,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 174 transitions. [2022-07-12 19:03:25,012 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 174 transitions. Word has length 22 [2022-07-12 19:03:25,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:03:25,013 INFO L495 AbstractCegarLoop]: Abstraction has 148 states and 174 transitions. [2022-07-12 19:03:25,013 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:03:25,013 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 174 transitions. [2022-07-12 19:03:25,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-12 19:03:25,014 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:03:25,014 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:03:25,014 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-12 19:03:25,014 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2022-07-12 19:03:25,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:03:25,015 INFO L85 PathProgramCache]: Analyzing trace with hash 72886851, now seen corresponding path program 1 times [2022-07-12 19:03:25,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:03:25,015 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642298581] [2022-07-12 19:03:25,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:03:25,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:03:25,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:03:25,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:03:25,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:03:25,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642298581] [2022-07-12 19:03:25,140 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642298581] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:03:25,140 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:03:25,140 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-12 19:03:25,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625544524] [2022-07-12 19:03:25,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:03:25,141 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 19:03:25,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:03:25,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 19:03:25,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-12 19:03:25,142 INFO L87 Difference]: Start difference. First operand 148 states and 174 transitions. Second operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:03:25,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:03:25,455 INFO L93 Difference]: Finished difference Result 224 states and 257 transitions. [2022-07-12 19:03:25,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 19:03:25,456 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-07-12 19:03:25,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:03:25,457 INFO L225 Difference]: With dead ends: 224 [2022-07-12 19:03:25,457 INFO L226 Difference]: Without dead ends: 224 [2022-07-12 19:03:25,457 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2022-07-12 19:03:25,458 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 256 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 256 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 19:03:25,458 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [256 Valid, 390 Invalid, 354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 340 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 19:03:25,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2022-07-12 19:03:25,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 144. [2022-07-12 19:03:25,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 121 states have (on average 1.3884297520661157) internal successors, (168), 143 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:03:25,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 168 transitions. [2022-07-12 19:03:25,462 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 168 transitions. Word has length 22 [2022-07-12 19:03:25,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:03:25,462 INFO L495 AbstractCegarLoop]: Abstraction has 144 states and 168 transitions. [2022-07-12 19:03:25,462 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:03:25,463 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 168 transitions. [2022-07-12 19:03:25,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-12 19:03:25,466 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:03:25,466 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:03:25,467 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-12 19:03:25,467 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2022-07-12 19:03:25,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:03:25,468 INFO L85 PathProgramCache]: Analyzing trace with hash 1318553294, now seen corresponding path program 1 times [2022-07-12 19:03:25,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:03:25,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350623410] [2022-07-12 19:03:25,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:03:25,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:03:25,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:03:25,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:03:25,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:03:25,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350623410] [2022-07-12 19:03:25,496 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350623410] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:03:25,496 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:03:25,496 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 19:03:25,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874501375] [2022-07-12 19:03:25,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:03:25,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 19:03:25,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:03:25,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 19:03:25,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 19:03:25,498 INFO L87 Difference]: Start difference. First operand 144 states and 168 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:03:25,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:03:25,504 INFO L93 Difference]: Finished difference Result 146 states and 170 transitions. [2022-07-12 19:03:25,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 19:03:25,505 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-07-12 19:03:25,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:03:25,506 INFO L225 Difference]: With dead ends: 146 [2022-07-12 19:03:25,506 INFO L226 Difference]: Without dead ends: 146 [2022-07-12 19:03:25,506 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 19:03:25,507 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 0 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 19:03:25,507 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 208 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 19:03:25,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2022-07-12 19:03:25,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2022-07-12 19:03:25,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 123 states have (on average 1.3821138211382114) internal successors, (170), 145 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:03:25,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 170 transitions. [2022-07-12 19:03:25,513 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 170 transitions. Word has length 22 [2022-07-12 19:03:25,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:03:25,513 INFO L495 AbstractCegarLoop]: Abstraction has 146 states and 170 transitions. [2022-07-12 19:03:25,513 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:03:25,514 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 170 transitions. [2022-07-12 19:03:25,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-12 19:03:25,518 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:03:25,518 INFO L195 NwaCegarLoop]: 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] [2022-07-12 19:03:25,519 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-12 19:03:25,519 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2022-07-12 19:03:25,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:03:25,520 INFO L85 PathProgramCache]: Analyzing trace with hash 116002131, now seen corresponding path program 1 times [2022-07-12 19:03:25,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:03:25,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228165844] [2022-07-12 19:03:25,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:03:25,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:03:25,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:03:25,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:03:25,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:03:25,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228165844] [2022-07-12 19:03:25,620 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1228165844] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:03:25,621 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:03:25,621 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 19:03:25,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283680059] [2022-07-12 19:03:25,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:03:25,621 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 19:03:25,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:03:25,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 19:03:25,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-12 19:03:25,623 INFO L87 Difference]: Start difference. First operand 146 states and 170 transitions. Second operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:03:25,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:03:25,884 INFO L93 Difference]: Finished difference Result 219 states and 250 transitions. [2022-07-12 19:03:25,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 19:03:25,884 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-07-12 19:03:25,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:03:25,885 INFO L225 Difference]: With dead ends: 219 [2022-07-12 19:03:25,885 INFO L226 Difference]: Without dead ends: 219 [2022-07-12 19:03:25,886 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2022-07-12 19:03:25,886 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 173 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 19:03:25,886 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 365 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 19:03:25,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2022-07-12 19:03:25,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 152. [2022-07-12 19:03:25,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 129 states have (on average 1.372093023255814) internal successors, (177), 151 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:03:25,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 177 transitions. [2022-07-12 19:03:25,890 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 177 transitions. Word has length 24 [2022-07-12 19:03:25,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:03:25,890 INFO L495 AbstractCegarLoop]: Abstraction has 152 states and 177 transitions. [2022-07-12 19:03:25,891 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:03:25,891 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 177 transitions. [2022-07-12 19:03:25,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-12 19:03:25,891 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:03:25,891 INFO L195 NwaCegarLoop]: 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] [2022-07-12 19:03:25,891 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-12 19:03:25,891 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2022-07-12 19:03:25,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:03:25,892 INFO L85 PathProgramCache]: Analyzing trace with hash 913286409, now seen corresponding path program 1 times [2022-07-12 19:03:25,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:03:25,892 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607698220] [2022-07-12 19:03:25,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:03:25,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:03:25,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:03:25,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:03:25,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:03:25,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607698220] [2022-07-12 19:03:25,940 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607698220] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:03:25,940 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:03:25,940 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 19:03:25,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718320196] [2022-07-12 19:03:25,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:03:25,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 19:03:25,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:03:25,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 19:03:25,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 19:03:25,942 INFO L87 Difference]: Start difference. First operand 152 states and 177 transitions. Second operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:03:26,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:03:26,060 INFO L93 Difference]: Finished difference Result 158 states and 184 transitions. [2022-07-12 19:03:26,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 19:03:26,060 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-07-12 19:03:26,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:03:26,061 INFO L225 Difference]: With dead ends: 158 [2022-07-12 19:03:26,061 INFO L226 Difference]: Without dead ends: 158 [2022-07-12 19:03:26,062 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-12 19:03:26,062 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 8 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 19:03:26,062 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 286 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 19:03:26,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2022-07-12 19:03:26,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 151. [2022-07-12 19:03:26,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 129 states have (on average 1.3643410852713178) internal successors, (176), 150 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:03:26,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 176 transitions. [2022-07-12 19:03:26,066 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 176 transitions. Word has length 24 [2022-07-12 19:03:26,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:03:26,066 INFO L495 AbstractCegarLoop]: Abstraction has 151 states and 176 transitions. [2022-07-12 19:03:26,066 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:03:26,066 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 176 transitions. [2022-07-12 19:03:26,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-12 19:03:26,067 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:03:26,067 INFO L195 NwaCegarLoop]: 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] [2022-07-12 19:03:26,067 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-12 19:03:26,067 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2022-07-12 19:03:26,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:03:26,068 INFO L85 PathProgramCache]: Analyzing trace with hash 913286410, now seen corresponding path program 1 times [2022-07-12 19:03:26,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:03:26,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658283072] [2022-07-12 19:03:26,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:03:26,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:03:26,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:03:26,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:03:26,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:03:26,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658283072] [2022-07-12 19:03:26,121 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658283072] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:03:26,121 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:03:26,121 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 19:03:26,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629202767] [2022-07-12 19:03:26,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:03:26,122 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 19:03:26,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:03:26,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 19:03:26,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 19:03:26,123 INFO L87 Difference]: Start difference. First operand 151 states and 176 transitions. Second operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:03:26,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:03:26,238 INFO L93 Difference]: Finished difference Result 150 states and 175 transitions. [2022-07-12 19:03:26,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 19:03:26,239 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-07-12 19:03:26,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:03:26,240 INFO L225 Difference]: With dead ends: 150 [2022-07-12 19:03:26,240 INFO L226 Difference]: Without dead ends: 150 [2022-07-12 19:03:26,240 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-12 19:03:26,241 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 2 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 19:03:26,241 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 275 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 19:03:26,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2022-07-12 19:03:26,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2022-07-12 19:03:26,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 129 states have (on average 1.3565891472868217) internal successors, (175), 149 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:03:26,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 175 transitions. [2022-07-12 19:03:26,244 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 175 transitions. Word has length 24 [2022-07-12 19:03:26,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:03:26,244 INFO L495 AbstractCegarLoop]: Abstraction has 150 states and 175 transitions. [2022-07-12 19:03:26,244 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:03:26,244 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 175 transitions. [2022-07-12 19:03:26,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-12 19:03:26,245 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:03:26,245 INFO L195 NwaCegarLoop]: 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] [2022-07-12 19:03:26,245 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-12 19:03:26,245 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2022-07-12 19:03:26,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:03:26,246 INFO L85 PathProgramCache]: Analyzing trace with hash 1848177146, now seen corresponding path program 1 times [2022-07-12 19:03:26,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:03:26,246 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195790878] [2022-07-12 19:03:26,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:03:26,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:03:26,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:03:26,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:03:26,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:03:26,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195790878] [2022-07-12 19:03:26,347 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195790878] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:03:26,347 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:03:26,347 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-12 19:03:26,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751925226] [2022-07-12 19:03:26,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:03:26,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 19:03:26,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:03:26,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 19:03:26,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-07-12 19:03:26,349 INFO L87 Difference]: Start difference. First operand 150 states and 175 transitions. Second operand has 9 states, 8 states have (on average 3.25) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:03:26,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:03:26,749 INFO L93 Difference]: Finished difference Result 309 states and 356 transitions. [2022-07-12 19:03:26,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-12 19:03:26,750 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-07-12 19:03:26,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:03:26,751 INFO L225 Difference]: With dead ends: 309 [2022-07-12 19:03:26,751 INFO L226 Difference]: Without dead ends: 309 [2022-07-12 19:03:26,752 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=112, Invalid=350, Unknown=0, NotChecked=0, Total=462 [2022-07-12 19:03:26,752 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 344 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 438 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 344 SdHoareTripleChecker+Valid, 449 SdHoareTripleChecker+Invalid, 472 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 438 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 19:03:26,752 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [344 Valid, 449 Invalid, 472 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 438 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-12 19:03:26,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2022-07-12 19:03:26,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 163. [2022-07-12 19:03:26,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 142 states have (on average 1.352112676056338) internal successors, (192), 162 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:03:26,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 192 transitions. [2022-07-12 19:03:26,757 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 192 transitions. Word has length 26 [2022-07-12 19:03:26,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:03:26,757 INFO L495 AbstractCegarLoop]: Abstraction has 163 states and 192 transitions. [2022-07-12 19:03:26,758 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:03:26,758 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 192 transitions. [2022-07-12 19:03:26,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-12 19:03:26,758 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:03:26,758 INFO L195 NwaCegarLoop]: 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] [2022-07-12 19:03:26,758 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-12 19:03:26,759 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2022-07-12 19:03:26,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:03:26,759 INFO L85 PathProgramCache]: Analyzing trace with hash 1848177147, now seen corresponding path program 1 times [2022-07-12 19:03:26,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:03:26,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410719321] [2022-07-12 19:03:26,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:03:26,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:03:26,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:03:26,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:03:26,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:03:26,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410719321] [2022-07-12 19:03:26,931 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410719321] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:03:26,931 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:03:26,931 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-12 19:03:26,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093773183] [2022-07-12 19:03:26,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:03:26,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-12 19:03:26,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:03:26,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-12 19:03:26,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-07-12 19:03:26,933 INFO L87 Difference]: Start difference. First operand 163 states and 192 transitions. Second operand has 11 states, 10 states have (on average 2.6) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:03:27,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:03:27,440 INFO L93 Difference]: Finished difference Result 252 states and 290 transitions. [2022-07-12 19:03:27,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-12 19:03:27,441 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.6) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-07-12 19:03:27,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:03:27,442 INFO L225 Difference]: With dead ends: 252 [2022-07-12 19:03:27,442 INFO L226 Difference]: Without dead ends: 252 [2022-07-12 19:03:27,442 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2022-07-12 19:03:27,443 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 229 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 580 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 557 SdHoareTripleChecker+Invalid, 603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 580 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 19:03:27,443 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 557 Invalid, 603 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 580 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-12 19:03:27,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2022-07-12 19:03:27,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 163. [2022-07-12 19:03:27,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 142 states have (on average 1.3450704225352113) internal successors, (191), 162 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:03:27,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 191 transitions. [2022-07-12 19:03:27,447 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 191 transitions. Word has length 26 [2022-07-12 19:03:27,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:03:27,447 INFO L495 AbstractCegarLoop]: Abstraction has 163 states and 191 transitions. [2022-07-12 19:03:27,447 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.6) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:03:27,447 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 191 transitions. [2022-07-12 19:03:27,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-12 19:03:27,448 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:03:27,448 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:03:27,448 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-12 19:03:27,448 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2022-07-12 19:03:27,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:03:27,448 INFO L85 PathProgramCache]: Analyzing trace with hash -1639700775, now seen corresponding path program 1 times [2022-07-12 19:03:27,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:03:27,449 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311696636] [2022-07-12 19:03:27,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:03:27,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:03:27,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:03:27,472 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:03:27,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:03:27,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311696636] [2022-07-12 19:03:27,473 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311696636] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:03:27,473 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:03:27,473 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 19:03:27,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481035696] [2022-07-12 19:03:27,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:03:27,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 19:03:27,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:03:27,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 19:03:27,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 19:03:27,475 INFO L87 Difference]: Start difference. First operand 163 states and 191 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:03:27,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:03:27,489 INFO L93 Difference]: Finished difference Result 175 states and 204 transitions. [2022-07-12 19:03:27,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 19:03:27,490 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-07-12 19:03:27,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:03:27,491 INFO L225 Difference]: With dead ends: 175 [2022-07-12 19:03:27,491 INFO L226 Difference]: Without dead ends: 175 [2022-07-12 19:03:27,491 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-12 19:03:27,492 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 10 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 19:03:27,492 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 299 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 19:03:27,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2022-07-12 19:03:27,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 167. [2022-07-12 19:03:27,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 146 states have (on average 1.3287671232876712) internal successors, (194), 166 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:03:27,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 194 transitions. [2022-07-12 19:03:27,496 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 194 transitions. Word has length 26 [2022-07-12 19:03:27,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:03:27,496 INFO L495 AbstractCegarLoop]: Abstraction has 167 states and 194 transitions. [2022-07-12 19:03:27,496 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:03:27,497 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 194 transitions. [2022-07-12 19:03:27,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-12 19:03:27,497 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:03:27,497 INFO L195 NwaCegarLoop]: 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] [2022-07-12 19:03:27,497 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-12 19:03:27,498 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2022-07-12 19:03:27,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:03:27,498 INFO L85 PathProgramCache]: Analyzing trace with hash 1067960075, now seen corresponding path program 1 times [2022-07-12 19:03:27,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:03:27,499 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856894411] [2022-07-12 19:03:27,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:03:27,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:03:27,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:03:27,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:03:27,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:03:27,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856894411] [2022-07-12 19:03:27,596 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856894411] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:03:27,596 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:03:27,596 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-12 19:03:27,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864977287] [2022-07-12 19:03:27,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:03:27,597 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-12 19:03:27,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:03:27,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-12 19:03:27,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2022-07-12 19:03:27,598 INFO L87 Difference]: Start difference. First operand 167 states and 194 transitions. Second operand has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 11 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:03:27,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:03:27,959 INFO L93 Difference]: Finished difference Result 247 states and 277 transitions. [2022-07-12 19:03:27,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-12 19:03:27,960 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 11 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-07-12 19:03:27,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:03:27,960 INFO L225 Difference]: With dead ends: 247 [2022-07-12 19:03:27,961 INFO L226 Difference]: Without dead ends: 247 [2022-07-12 19:03:27,961 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=112, Invalid=350, Unknown=0, NotChecked=0, Total=462 [2022-07-12 19:03:27,961 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 344 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 452 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 344 SdHoareTripleChecker+Valid, 478 SdHoareTripleChecker+Invalid, 494 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 452 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 19:03:27,962 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [344 Valid, 478 Invalid, 494 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 452 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 19:03:27,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2022-07-12 19:03:27,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 167. [2022-07-12 19:03:27,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 146 states have (on average 1.321917808219178) internal successors, (193), 166 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:03:27,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 193 transitions. [2022-07-12 19:03:27,965 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 193 transitions. Word has length 28 [2022-07-12 19:03:27,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:03:27,965 INFO L495 AbstractCegarLoop]: Abstraction has 167 states and 193 transitions. [2022-07-12 19:03:27,965 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 11 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:03:27,966 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 193 transitions. [2022-07-12 19:03:27,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-12 19:03:27,966 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:03:27,966 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:03:27,966 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-12 19:03:27,967 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2022-07-12 19:03:27,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:03:27,967 INFO L85 PathProgramCache]: Analyzing trace with hash 1161159390, now seen corresponding path program 1 times [2022-07-12 19:03:27,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:03:27,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156998976] [2022-07-12 19:03:27,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:03:27,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:03:27,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:03:28,039 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:03:28,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:03:28,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156998976] [2022-07-12 19:03:28,039 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156998976] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:03:28,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2094040899] [2022-07-12 19:03:28,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:03:28,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:03:28,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 19:03:28,042 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) [2022-07-12 19:03:28,046 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-12 19:03:28,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:03:28,128 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 31 conjunts are in the unsatisfiable core [2022-07-12 19:03:28,141 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:03:28,230 INFO L390 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 [2022-07-12 19:03:28,252 INFO L390 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 [2022-07-12 19:03:28,340 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:03:28,341 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-12 19:03:28,349 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:03:28,350 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-12 19:03:28,372 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:03:28,373 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-12 19:03:28,380 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:03:28,382 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-12 19:03:28,505 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:03:28,506 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-12 19:03:28,514 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:03:28,516 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:03:28,517 INFO L390 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 15 treesize of output 10 [2022-07-12 19:03:28,529 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:03:28,529 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:03:35,475 INFO L390 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 18 [2022-07-12 19:03:35,479 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:03:35,480 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:03:35,482 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2022-07-12 19:03:35,488 INFO L390 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 18 [2022-07-12 19:03:35,490 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:03:35,491 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:03:35,491 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:03:35,503 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:03:35,503 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2094040899] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 19:03:35,503 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 19:03:35,503 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 9] total 14 [2022-07-12 19:03:35,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979213909] [2022-07-12 19:03:35,504 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 19:03:35,504 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-12 19:03:35,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:03:35,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-12 19:03:35,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=141, Unknown=5, NotChecked=0, Total=182 [2022-07-12 19:03:35,505 INFO L87 Difference]: Start difference. First operand 167 states and 193 transitions. Second operand has 14 states, 14 states have (on average 5.428571428571429) internal successors, (76), 14 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:03:35,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:03:35,823 INFO L93 Difference]: Finished difference Result 208 states and 237 transitions. [2022-07-12 19:03:35,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-12 19:03:35,823 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.428571428571429) internal successors, (76), 14 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-07-12 19:03:35,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:03:35,824 INFO L225 Difference]: With dead ends: 208 [2022-07-12 19:03:35,824 INFO L226 Difference]: Without dead ends: 208 [2022-07-12 19:03:35,825 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=110, Invalid=305, Unknown=5, NotChecked=0, Total=420 [2022-07-12 19:03:35,825 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 336 mSDsluCounter, 412 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 336 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 76 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 19:03:35,825 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [336 Valid, 477 Invalid, 373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 235 Invalid, 0 Unknown, 76 Unchecked, 0.2s Time] [2022-07-12 19:03:35,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2022-07-12 19:03:35,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 180. [2022-07-12 19:03:35,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 159 states have (on average 1.3081761006289307) internal successors, (208), 179 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:03:35,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 208 transitions. [2022-07-12 19:03:35,829 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 208 transitions. Word has length 28 [2022-07-12 19:03:35,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:03:35,829 INFO L495 AbstractCegarLoop]: Abstraction has 180 states and 208 transitions. [2022-07-12 19:03:35,829 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.428571428571429) internal successors, (76), 14 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:03:35,829 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 208 transitions. [2022-07-12 19:03:35,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-12 19:03:35,829 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:03:35,830 INFO L195 NwaCegarLoop]: 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] [2022-07-12 19:03:35,858 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-12 19:03:36,030 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-07-12 19:03:36,031 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2022-07-12 19:03:36,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:03:36,031 INFO L85 PathProgramCache]: Analyzing trace with hash 1511540264, now seen corresponding path program 1 times [2022-07-12 19:03:36,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:03:36,031 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955184942] [2022-07-12 19:03:36,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:03:36,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:03:36,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:03:36,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:03:36,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:03:36,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955184942] [2022-07-12 19:03:36,136 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955184942] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:03:36,136 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:03:36,136 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-12 19:03:36,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662808723] [2022-07-12 19:03:36,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:03:36,137 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 19:03:36,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:03:36,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 19:03:36,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-12 19:03:36,138 INFO L87 Difference]: Start difference. First operand 180 states and 208 transitions. Second operand has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:03:36,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:03:36,406 INFO L93 Difference]: Finished difference Result 225 states and 256 transitions. [2022-07-12 19:03:36,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 19:03:36,409 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-07-12 19:03:36,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:03:36,410 INFO L225 Difference]: With dead ends: 225 [2022-07-12 19:03:36,410 INFO L226 Difference]: Without dead ends: 225 [2022-07-12 19:03:36,410 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2022-07-12 19:03:36,411 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 71 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 19:03:36,411 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 438 Invalid, 280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 19:03:36,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2022-07-12 19:03:36,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 186. [2022-07-12 19:03:36,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 165 states have (on average 1.303030303030303) internal successors, (215), 185 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:03:36,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 215 transitions. [2022-07-12 19:03:36,414 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 215 transitions. Word has length 30 [2022-07-12 19:03:36,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:03:36,415 INFO L495 AbstractCegarLoop]: Abstraction has 186 states and 215 transitions. [2022-07-12 19:03:36,415 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:03:36,415 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 215 transitions. [2022-07-12 19:03:36,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-07-12 19:03:36,416 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:03:36,416 INFO L195 NwaCegarLoop]: 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] [2022-07-12 19:03:36,416 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-07-12 19:03:36,416 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2022-07-12 19:03:36,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:03:36,417 INFO L85 PathProgramCache]: Analyzing trace with hash 238082658, now seen corresponding path program 1 times [2022-07-12 19:03:36,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:03:36,417 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405609690] [2022-07-12 19:03:36,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:03:36,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:03:36,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:03:36,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:03:36,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:03:36,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405609690] [2022-07-12 19:03:36,553 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405609690] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:03:36,553 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:03:36,554 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-07-12 19:03:36,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729192799] [2022-07-12 19:03:36,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:03:36,554 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-12 19:03:36,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:03:36,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-12 19:03:36,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2022-07-12 19:03:36,555 INFO L87 Difference]: Start difference. First operand 186 states and 215 transitions. Second operand has 12 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:03:37,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:03:37,212 INFO L93 Difference]: Finished difference Result 224 states and 250 transitions. [2022-07-12 19:03:37,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-12 19:03:37,212 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2022-07-12 19:03:37,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:03:37,213 INFO L225 Difference]: With dead ends: 224 [2022-07-12 19:03:37,213 INFO L226 Difference]: Without dead ends: 224 [2022-07-12 19:03:37,214 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=151, Invalid=551, Unknown=0, NotChecked=0, Total=702 [2022-07-12 19:03:37,214 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 187 mSDsluCounter, 648 mSDsCounter, 0 mSdLazyCounter, 714 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 733 SdHoareTripleChecker+Invalid, 741 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 714 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-12 19:03:37,215 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 733 Invalid, 741 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 714 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-12 19:03:37,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2022-07-12 19:03:37,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 183. [2022-07-12 19:03:37,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 162 states have (on average 1.2962962962962963) internal successors, (210), 182 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:03:37,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 210 transitions. [2022-07-12 19:03:37,220 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 210 transitions. Word has length 33 [2022-07-12 19:03:37,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:03:37,220 INFO L495 AbstractCegarLoop]: Abstraction has 183 states and 210 transitions. [2022-07-12 19:03:37,220 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:03:37,220 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 210 transitions. [2022-07-12 19:03:37,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-12 19:03:37,221 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:03:37,221 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:03:37,221 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-07-12 19:03:37,221 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2022-07-12 19:03:37,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:03:37,222 INFO L85 PathProgramCache]: Analyzing trace with hash 745727206, now seen corresponding path program 1 times [2022-07-12 19:03:37,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:03:37,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46582734] [2022-07-12 19:03:37,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:03:37,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:03:37,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:03:37,510 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:03:37,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:03:37,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46582734] [2022-07-12 19:03:37,511 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46582734] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:03:37,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [693246473] [2022-07-12 19:03:37,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:03:37,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:03:37,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 19:03:37,516 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) [2022-07-12 19:03:37,517 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-12 19:03:37,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:03:37,630 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 39 conjunts are in the unsatisfiable core [2022-07-12 19:03:37,635 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:03:37,644 INFO L390 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 [2022-07-12 19:03:37,662 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 19:03:37,686 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:03:37,688 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-12 19:03:37,749 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 19:03:37,749 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-12 19:03:37,789 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 19:03:37,799 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:03:37,800 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-12 19:03:37,847 INFO L390 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 [2022-07-12 19:03:37,899 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-12 19:03:37,923 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-12 19:03:37,933 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-12 19:03:37,984 INFO L390 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 [2022-07-12 19:03:38,019 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:03:38,020 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:03:38,080 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_681 (Array Int Int))) (not (= 2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_681) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))))) is different from false [2022-07-12 19:03:38,101 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_681 (Array Int Int))) (not (= 2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_681) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))))) is different from false [2022-07-12 19:03:38,106 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_681 (Array Int Int))) (not (= 2 (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_681) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))))) is different from false [2022-07-12 19:03:38,119 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_676 Int) (v_ArrVal_681 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_676)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_681) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) 2))) is different from false [2022-07-12 19:03:38,176 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_676 Int) (v_ArrVal_681 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_52| Int) (|v_ULTIMATE.start_main_#t~malloc7#1.base_7| Int)) (or (not (= 2 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~head~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_52| v_ArrVal_676)) |v_ULTIMATE.start_main_#t~malloc7#1.base_7| v_ArrVal_681) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_7|) 0)) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_52| |c_ULTIMATE.start_main_~head~0#1.offset|)))) is different from false [2022-07-12 19:03:38,189 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_676 Int) (v_ArrVal_674 Int) (v_ArrVal_681 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_52| Int) (|v_ULTIMATE.start_main_#t~malloc7#1.base_7| Int)) (or (not (= 2 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~head~0#1.base| (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4) v_ArrVal_674) |v_ULTIMATE.start_main_~x~0#1.offset_52| v_ArrVal_676)) |v_ULTIMATE.start_main_#t~malloc7#1.base_7| v_ArrVal_681) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_7|) 0)) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_52| |c_ULTIMATE.start_main_~head~0#1.offset|)))) is different from false [2022-07-12 19:03:38,199 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:03:38,199 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:03:38,200 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:03:38,205 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:03:38,205 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 42 [2022-07-12 19:03:38,209 INFO L390 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 39 treesize of output 27 [2022-07-12 19:03:38,212 INFO L390 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 4 [2022-07-12 19:03:38,232 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:03:38,233 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [693246473] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 19:03:38,233 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 19:03:38,233 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 14] total 35 [2022-07-12 19:03:38,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990166955] [2022-07-12 19:03:38,234 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 19:03:38,234 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-07-12 19:03:38,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:03:38,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-07-12 19:03:38,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=709, Unknown=6, NotChecked=354, Total=1190 [2022-07-12 19:03:38,236 INFO L87 Difference]: Start difference. First operand 183 states and 210 transitions. Second operand has 35 states, 35 states have (on average 2.5714285714285716) internal successors, (90), 35 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:03:40,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:03:40,628 INFO L93 Difference]: Finished difference Result 623 states and 694 transitions. [2022-07-12 19:03:40,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2022-07-12 19:03:40,629 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.5714285714285716) internal successors, (90), 35 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-07-12 19:03:40,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:03:40,631 INFO L225 Difference]: With dead ends: 623 [2022-07-12 19:03:40,631 INFO L226 Difference]: Without dead ends: 623 [2022-07-12 19:03:40,633 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 56 SyntacticMatches, 5 SemanticMatches, 75 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 1343 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=843, Invalid=4130, Unknown=21, NotChecked=858, Total=5852 [2022-07-12 19:03:40,634 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 949 mSDsluCounter, 1657 mSDsCounter, 0 mSdLazyCounter, 1419 mSolverCounterSat, 159 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 949 SdHoareTripleChecker+Valid, 1740 SdHoareTripleChecker+Invalid, 3470 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 159 IncrementalHoareTripleChecker+Valid, 1419 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1892 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-12 19:03:40,634 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [949 Valid, 1740 Invalid, 3470 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [159 Valid, 1419 Invalid, 0 Unknown, 1892 Unchecked, 0.8s Time] [2022-07-12 19:03:40,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2022-07-12 19:03:40,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 210. [2022-07-12 19:03:40,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 189 states have (on average 1.2804232804232805) internal successors, (242), 209 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:03:40,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 242 transitions. [2022-07-12 19:03:40,641 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 242 transitions. Word has length 34 [2022-07-12 19:03:40,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:03:40,641 INFO L495 AbstractCegarLoop]: Abstraction has 210 states and 242 transitions. [2022-07-12 19:03:40,641 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.5714285714285716) internal successors, (90), 35 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:03:40,642 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 242 transitions. [2022-07-12 19:03:40,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-12 19:03:40,642 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:03:40,642 INFO L195 NwaCegarLoop]: 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] [2022-07-12 19:03:40,670 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-12 19:03:40,865 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-07-12 19:03:40,865 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2022-07-12 19:03:40,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:03:40,865 INFO L85 PathProgramCache]: Analyzing trace with hash 1970599096, now seen corresponding path program 1 times [2022-07-12 19:03:40,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:03:40,866 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296075977] [2022-07-12 19:03:40,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:03:40,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:03:40,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:03:40,914 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 19:03:40,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:03:40,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296075977] [2022-07-12 19:03:40,915 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296075977] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:03:40,915 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:03:40,915 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 19:03:40,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812482413] [2022-07-12 19:03:40,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:03:40,916 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 19:03:40,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:03:40,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 19:03:40,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 19:03:40,917 INFO L87 Difference]: Start difference. First operand 210 states and 242 transitions. Second operand has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:03:41,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:03:41,002 INFO L93 Difference]: Finished difference Result 224 states and 250 transitions. [2022-07-12 19:03:41,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 19:03:41,003 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2022-07-12 19:03:41,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:03:41,004 INFO L225 Difference]: With dead ends: 224 [2022-07-12 19:03:41,004 INFO L226 Difference]: Without dead ends: 224 [2022-07-12 19:03:41,005 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-12 19:03:41,009 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 115 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 19:03:41,010 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 134 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 19:03:41,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2022-07-12 19:03:41,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 212. [2022-07-12 19:03:41,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 191 states have (on average 1.2774869109947644) internal successors, (244), 211 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:03:41,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 244 transitions. [2022-07-12 19:03:41,014 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 244 transitions. Word has length 35 [2022-07-12 19:03:41,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:03:41,015 INFO L495 AbstractCegarLoop]: Abstraction has 212 states and 244 transitions. [2022-07-12 19:03:41,015 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:03:41,015 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 244 transitions. [2022-07-12 19:03:41,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-12 19:03:41,015 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:03:41,016 INFO L195 NwaCegarLoop]: 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] [2022-07-12 19:03:41,016 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-07-12 19:03:41,016 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2022-07-12 19:03:41,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:03:41,017 INFO L85 PathProgramCache]: Analyzing trace with hash 1970588111, now seen corresponding path program 1 times [2022-07-12 19:03:41,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:03:41,017 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59633730] [2022-07-12 19:03:41,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:03:41,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:03:41,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:03:41,169 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:03:41,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:03:41,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59633730] [2022-07-12 19:03:41,170 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [59633730] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:03:41,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [619941795] [2022-07-12 19:03:41,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:03:41,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:03:41,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 19:03:41,172 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 19:03:41,203 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-12 19:03:41,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:03:41,273 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 23 conjunts are in the unsatisfiable core [2022-07-12 19:03:41,277 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:03:41,573 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:03:41,575 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:03:41,576 INFO L390 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 17 treesize of output 10 [2022-07-12 19:03:41,592 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:03:41,592 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:03:41,975 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:03:41,976 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 72 [2022-07-12 19:03:42,323 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:03:42,324 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [619941795] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 19:03:42,324 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 19:03:42,324 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 11] total 28 [2022-07-12 19:03:42,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96953384] [2022-07-12 19:03:42,324 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 19:03:42,325 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-07-12 19:03:42,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:03:42,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-07-12 19:03:42,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=640, Unknown=0, NotChecked=0, Total=756 [2022-07-12 19:03:42,326 INFO L87 Difference]: Start difference. First operand 212 states and 244 transitions. Second operand has 28 states, 28 states have (on average 3.2857142857142856) internal successors, (92), 28 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:03:43,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:03:43,120 INFO L93 Difference]: Finished difference Result 253 states and 286 transitions. [2022-07-12 19:03:43,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-07-12 19:03:43,120 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 3.2857142857142856) internal successors, (92), 28 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2022-07-12 19:03:43,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:03:43,121 INFO L225 Difference]: With dead ends: 253 [2022-07-12 19:03:43,121 INFO L226 Difference]: Without dead ends: 253 [2022-07-12 19:03:43,122 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 52 SyntacticMatches, 6 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 2 DeprecatedPredicates, 526 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=356, Invalid=1536, Unknown=0, NotChecked=0, Total=1892 [2022-07-12 19:03:43,122 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 186 mSDsluCounter, 950 mSDsCounter, 0 mSdLazyCounter, 621 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 1029 SdHoareTripleChecker+Invalid, 879 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 621 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 233 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-12 19:03:43,123 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 1029 Invalid, 879 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 621 Invalid, 0 Unknown, 233 Unchecked, 0.4s Time] [2022-07-12 19:03:43,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2022-07-12 19:03:43,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 240. [2022-07-12 19:03:43,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 219 states have (on average 1.2465753424657535) internal successors, (273), 239 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:03:43,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 273 transitions. [2022-07-12 19:03:43,127 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 273 transitions. Word has length 35 [2022-07-12 19:03:43,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:03:43,127 INFO L495 AbstractCegarLoop]: Abstraction has 240 states and 273 transitions. [2022-07-12 19:03:43,127 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 3.2857142857142856) internal successors, (92), 28 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:03:43,127 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 273 transitions. [2022-07-12 19:03:43,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-12 19:03:43,128 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:03:43,128 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:03:43,156 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-12 19:03:43,339 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:03:43,340 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2022-07-12 19:03:43,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:03:43,340 INFO L85 PathProgramCache]: Analyzing trace with hash -1824477449, now seen corresponding path program 1 times [2022-07-12 19:03:43,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:03:43,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630404232] [2022-07-12 19:03:43,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:03:43,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:03:43,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:03:43,642 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:03:43,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:03:43,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630404232] [2022-07-12 19:03:43,642 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630404232] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:03:43,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1062104091] [2022-07-12 19:03:43,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:03:43,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:03:43,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 19:03:43,644 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 19:03:43,652 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-12 19:03:43,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:03:43,745 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 44 conjunts are in the unsatisfiable core [2022-07-12 19:03:43,755 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:03:43,761 INFO L390 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 [2022-07-12 19:03:43,783 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 19:03:43,788 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 19:03:43,834 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 19:03:43,834 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-12 19:03:43,845 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:03:43,845 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-12 19:03:43,852 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:03:43,853 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-12 19:03:43,977 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 19:03:43,977 INFO L390 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 16 treesize of output 22 [2022-07-12 19:03:43,982 INFO L390 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 7 treesize of output 3 [2022-07-12 19:03:43,993 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 19:03:43,994 INFO L390 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 31 treesize of output 29 [2022-07-12 19:03:44,076 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 19:03:44,077 INFO L390 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 31 treesize of output 29 [2022-07-12 19:03:44,096 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 19:03:44,096 INFO L390 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 16 treesize of output 22 [2022-07-12 19:03:44,102 INFO L390 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 7 treesize of output 3 [2022-07-12 19:03:44,144 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 19:03:44,145 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2022-07-12 19:03:44,155 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-07-12 19:03:44,317 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-07-12 19:03:44,322 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:03:44,324 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:03:44,325 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 11 [2022-07-12 19:03:44,330 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:03:44,330 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:03:44,413 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_849 (Array Int Int))) (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_849) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4)))) (forall ((v_ArrVal_848 (Array Int Int))) (= |c_ULTIMATE.start_main_~head~0#1.offset| (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_848) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4))))) is different from false [2022-07-12 19:03:44,450 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_848 (Array Int Int))) (= |c_ULTIMATE.start_main_~head~0#1.offset| (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_848) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4)))) (forall ((v_ArrVal_849 (Array Int Int))) (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_849) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4))))) is different from false [2022-07-12 19:03:44,457 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_848 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_848) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4)) |c_ULTIMATE.start_main_~head~0#1.offset|)) (forall ((v_ArrVal_849 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_849) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4)) |c_ULTIMATE.start_main_~head~0#1.base|))) is different from false [2022-07-12 19:03:44,469 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_848 (Array Int Int)) (v_ArrVal_843 Int)) (= |c_ULTIMATE.start_main_~head~0#1.offset| (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_843)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_848) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4)))) (forall ((v_ArrVal_849 (Array Int Int))) (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_#t~malloc7#1.base|)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_849) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4))))) is different from false [2022-07-12 19:03:50,623 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:03:50,628 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:03:50,628 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 31 [2022-07-12 19:03:50,632 INFO L390 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 24 [2022-07-12 19:03:50,636 INFO L390 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 7 treesize of output 3 [2022-07-12 19:03:50,642 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:03:50,642 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:03:50,645 INFO L356 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2022-07-12 19:03:50,645 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 1 [2022-07-12 19:03:50,674 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:03:50,675 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1062104091] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 19:03:50,675 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 19:03:50,675 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 28 [2022-07-12 19:03:50,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781735683] [2022-07-12 19:03:50,675 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 19:03:50,676 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-07-12 19:03:50,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:03:50,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-07-12 19:03:50,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=459, Unknown=7, NotChecked=188, Total=756 [2022-07-12 19:03:50,677 INFO L87 Difference]: Start difference. First operand 240 states and 273 transitions. Second operand has 28 states, 28 states have (on average 3.25) internal successors, (91), 28 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:03:51,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:03:51,198 INFO L93 Difference]: Finished difference Result 277 states and 310 transitions. [2022-07-12 19:03:51,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-12 19:03:51,199 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 3.25) internal successors, (91), 28 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-07-12 19:03:51,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:03:51,200 INFO L225 Difference]: With dead ends: 277 [2022-07-12 19:03:51,200 INFO L226 Difference]: Without dead ends: 277 [2022-07-12 19:03:51,201 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 57 SyntacticMatches, 8 SemanticMatches, 34 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 270 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=208, Invalid=793, Unknown=7, NotChecked=252, Total=1260 [2022-07-12 19:03:51,201 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 208 mSDsluCounter, 802 mSDsCounter, 0 mSdLazyCounter, 465 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 875 SdHoareTripleChecker+Invalid, 1136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 465 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 635 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 19:03:51,201 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 875 Invalid, 1136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 465 Invalid, 0 Unknown, 635 Unchecked, 0.3s Time] [2022-07-12 19:03:51,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2022-07-12 19:03:51,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 251. [2022-07-12 19:03:51,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 230 states have (on average 1.2391304347826086) internal successors, (285), 250 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:03:51,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 285 transitions. [2022-07-12 19:03:51,206 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 285 transitions. Word has length 36 [2022-07-12 19:03:51,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:03:51,206 INFO L495 AbstractCegarLoop]: Abstraction has 251 states and 285 transitions. [2022-07-12 19:03:51,206 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 3.25) internal successors, (91), 28 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:03:51,206 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 285 transitions. [2022-07-12 19:03:51,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-12 19:03:51,207 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:03:51,207 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:03:51,231 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-12 19:03:51,407 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-07-12 19:03:51,408 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2022-07-12 19:03:51,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:03:51,408 INFO L85 PathProgramCache]: Analyzing trace with hash -590102785, now seen corresponding path program 1 times [2022-07-12 19:03:51,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:03:51,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907848155] [2022-07-12 19:03:51,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:03:51,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:03:51,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:03:51,693 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:03:51,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:03:51,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907848155] [2022-07-12 19:03:51,694 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907848155] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:03:51,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1476817533] [2022-07-12 19:03:51,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:03:51,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:03:51,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 19:03:51,696 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 19:03:51,700 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-12 19:03:51,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:03:51,791 INFO L263 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 44 conjunts are in the unsatisfiable core [2022-07-12 19:03:51,793 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:03:51,796 INFO L390 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 [2022-07-12 19:03:51,815 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 19:03:51,821 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 19:03:51,868 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 19:03:51,868 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-12 19:03:51,884 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:03:51,886 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-12 19:03:51,898 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:03:51,899 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-12 19:03:52,016 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 19:03:52,017 INFO L390 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 31 treesize of output 29 [2022-07-12 19:03:52,038 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 19:03:52,038 INFO L390 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 16 treesize of output 22 [2022-07-12 19:03:52,047 INFO L390 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 7 treesize of output 3 [2022-07-12 19:03:52,124 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 19:03:52,124 INFO L390 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 16 treesize of output 22 [2022-07-12 19:03:52,129 INFO L390 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 7 treesize of output 3 [2022-07-12 19:03:52,147 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 19:03:52,147 INFO L390 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 31 treesize of output 29 [2022-07-12 19:03:52,197 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 19:03:52,200 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2022-07-12 19:03:52,204 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-07-12 19:03:52,371 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-07-12 19:03:52,378 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:03:52,380 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:03:52,380 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 11 [2022-07-12 19:03:52,387 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:03:52,387 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:03:52,475 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_956 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_956) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4)) |c_ULTIMATE.start_main_~head~0#1.offset|)) (forall ((v_ArrVal_955 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_955) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4)) |c_ULTIMATE.start_main_~head~0#1.base|))) is different from false [2022-07-12 19:03:52,504 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_955 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_955) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4)) |c_ULTIMATE.start_main_~head~0#1.base|)) (forall ((v_ArrVal_956 (Array Int Int))) (= |c_ULTIMATE.start_main_~head~0#1.offset| (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_956) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4))))) is different from false [2022-07-12 19:03:52,510 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_956 (Array Int Int))) (= |c_ULTIMATE.start_main_~head~0#1.offset| (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_956) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4)))) (forall ((v_ArrVal_955 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_955) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4)) |c_ULTIMATE.start_main_~head~0#1.base|))) is different from false [2022-07-12 19:03:58,698 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:03:58,710 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:03:58,710 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 31 [2022-07-12 19:03:58,714 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:03:58,717 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:03:58,717 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 30 [2022-07-12 19:03:58,721 INFO L390 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 7 treesize of output 3 [2022-07-12 19:03:58,728 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:03:58,731 INFO L356 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2022-07-12 19:03:58,731 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 1 [2022-07-12 19:03:58,761 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:03:58,762 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1476817533] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 19:03:58,762 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 19:03:58,762 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 28 [2022-07-12 19:03:58,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078835926] [2022-07-12 19:03:58,762 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 19:03:58,764 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-07-12 19:03:58,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:03:58,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-07-12 19:03:58,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=498, Unknown=12, NotChecked=144, Total=756 [2022-07-12 19:03:58,765 INFO L87 Difference]: Start difference. First operand 251 states and 285 transitions. Second operand has 28 states, 28 states have (on average 3.25) internal successors, (91), 28 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:03:59,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:03:59,298 INFO L93 Difference]: Finished difference Result 273 states and 305 transitions. [2022-07-12 19:03:59,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-12 19:03:59,299 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 3.25) internal successors, (91), 28 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-07-12 19:03:59,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:03:59,300 INFO L225 Difference]: With dead ends: 273 [2022-07-12 19:03:59,300 INFO L226 Difference]: Without dead ends: 273 [2022-07-12 19:03:59,300 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 57 SyntacticMatches, 6 SemanticMatches, 36 ConstructedPredicates, 3 IntricatePredicates, 1 DeprecatedPredicates, 310 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=221, Invalid=969, Unknown=12, NotChecked=204, Total=1406 [2022-07-12 19:03:59,301 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 180 mSDsluCounter, 850 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 924 SdHoareTripleChecker+Invalid, 1134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 764 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 19:03:59,301 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 924 Invalid, 1134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 348 Invalid, 0 Unknown, 764 Unchecked, 0.2s Time] [2022-07-12 19:03:59,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2022-07-12 19:03:59,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 251. [2022-07-12 19:03:59,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 230 states have (on average 1.2391304347826086) internal successors, (285), 250 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:03:59,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 285 transitions. [2022-07-12 19:03:59,306 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 285 transitions. Word has length 36 [2022-07-12 19:03:59,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:03:59,306 INFO L495 AbstractCegarLoop]: Abstraction has 251 states and 285 transitions. [2022-07-12 19:03:59,306 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 3.25) internal successors, (91), 28 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:03:59,306 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 285 transitions. [2022-07-12 19:03:59,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-12 19:03:59,307 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:03:59,307 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:03:59,334 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-12 19:03:59,523 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-07-12 19:03:59,524 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2022-07-12 19:03:59,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:03:59,524 INFO L85 PathProgramCache]: Analyzing trace with hash -1501701986, now seen corresponding path program 1 times [2022-07-12 19:03:59,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:03:59,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688188319] [2022-07-12 19:03:59,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:03:59,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:03:59,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:03:59,807 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:03:59,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:03:59,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688188319] [2022-07-12 19:03:59,807 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688188319] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:03:59,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1350443736] [2022-07-12 19:03:59,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:03:59,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:03:59,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 19:03:59,810 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 19:03:59,811 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-12 19:03:59,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:03:59,917 INFO L263 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 46 conjunts are in the unsatisfiable core [2022-07-12 19:03:59,920 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:03:59,924 INFO L390 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 [2022-07-12 19:03:59,956 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-12 19:03:59,957 INFO L390 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 17 treesize of output 21 [2022-07-12 19:03:59,987 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 19:04:00,061 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 19:04:00,061 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 35 [2022-07-12 19:04:00,140 INFO L356 Elim1Store]: treesize reduction 54, result has 36.5 percent of original size [2022-07-12 19:04:00,141 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 28 treesize of output 45 [2022-07-12 19:04:00,209 INFO L356 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-07-12 19:04:00,209 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 36 [2022-07-12 19:04:00,523 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 19:04:00,523 INFO L390 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 118 treesize of output 100 [2022-07-12 19:04:00,672 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 19:04:00,672 INFO L390 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 118 treesize of output 100 [2022-07-12 19:04:00,731 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 19:04:00,731 INFO L390 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 118 treesize of output 100 [2022-07-12 19:04:01,009 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2022-07-12 19:04:01,052 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:04:01,052 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:04:01,284 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~x~0#1.offset| Int) (|v_ULTIMATE.start_main_#t~malloc7#1.base_17| Int) (v_ArrVal_1075 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_17|) 0)) (= (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_17| 1) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset| |v_ULTIMATE.start_main_#t~malloc7#1.base_17|)) |v_ULTIMATE.start_main_#t~malloc7#1.base_17| v_ArrVal_1075) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4))) 1))) is different from false [2022-07-12 19:04:01,295 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~x~0#1.offset| Int) (v_ArrVal_1069 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_17| Int) (v_ArrVal_1075 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_17|) 0)) (= (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_17| 1) (select (select (store (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1069))) (store .cse0 |c_ULTIMATE.start_main_~head~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset| |v_ULTIMATE.start_main_#t~malloc7#1.base_17|))) |v_ULTIMATE.start_main_#t~malloc7#1.base_17| v_ArrVal_1075) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4))) 1))) is different from false [2022-07-12 19:04:01,349 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:04:01,349 INFO L390 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 42 [2022-07-12 19:04:01,352 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:04:01,353 INFO L390 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 52 treesize of output 48 [2022-07-12 19:04:01,358 INFO L390 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 39 treesize of output 31 [2022-07-12 19:04:01,362 INFO L390 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 29 treesize of output 25 [2022-07-12 19:04:01,500 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:04:01,501 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1350443736] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 19:04:01,501 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 19:04:01,501 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13, 14] total 37 [2022-07-12 19:04:01,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796719837] [2022-07-12 19:04:01,501 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 19:04:01,501 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-07-12 19:04:01,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:04:01,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-07-12 19:04:01,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=1029, Unknown=53, NotChecked=138, Total=1406 [2022-07-12 19:04:01,503 INFO L87 Difference]: Start difference. First operand 251 states and 285 transitions. Second operand has 38 states, 37 states have (on average 2.5945945945945947) internal successors, (96), 38 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:04:07,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:04:07,896 INFO L93 Difference]: Finished difference Result 435 states and 494 transitions. [2022-07-12 19:04:07,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-07-12 19:04:07,896 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 2.5945945945945947) internal successors, (96), 38 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2022-07-12 19:04:07,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:04:07,898 INFO L225 Difference]: With dead ends: 435 [2022-07-12 19:04:07,898 INFO L226 Difference]: Without dead ends: 435 [2022-07-12 19:04:07,899 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 57 SyntacticMatches, 6 SemanticMatches, 56 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 854 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=423, Invalid=2586, Unknown=79, NotChecked=218, Total=3306 [2022-07-12 19:04:07,899 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 357 mSDsluCounter, 1653 mSDsCounter, 0 mSdLazyCounter, 887 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 357 SdHoareTripleChecker+Valid, 1752 SdHoareTripleChecker+Invalid, 2473 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 887 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1511 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-12 19:04:07,899 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [357 Valid, 1752 Invalid, 2473 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 887 Invalid, 0 Unknown, 1511 Unchecked, 0.4s Time] [2022-07-12 19:04:07,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2022-07-12 19:04:07,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 288. [2022-07-12 19:04:07,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 267 states have (on average 1.2397003745318351) internal successors, (331), 287 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:04:07,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 331 transitions. [2022-07-12 19:04:07,905 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 331 transitions. Word has length 38 [2022-07-12 19:04:07,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:04:07,905 INFO L495 AbstractCegarLoop]: Abstraction has 288 states and 331 transitions. [2022-07-12 19:04:07,906 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 2.5945945945945947) internal successors, (96), 38 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:04:07,906 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 331 transitions. [2022-07-12 19:04:07,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-12 19:04:07,906 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:04:07,907 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:04:07,931 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-07-12 19:04:08,119 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-07-12 19:04:08,119 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2022-07-12 19:04:08,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:04:08,120 INFO L85 PathProgramCache]: Analyzing trace with hash -1501701985, now seen corresponding path program 1 times [2022-07-12 19:04:08,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:04:08,120 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229931102] [2022-07-12 19:04:08,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:04:08,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:04:08,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:04:08,525 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:04:08,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:04:08,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229931102] [2022-07-12 19:04:08,526 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229931102] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:04:08,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [654702161] [2022-07-12 19:04:08,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:04:08,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:04:08,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 19:04:08,528 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 19:04:08,554 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-12 19:04:08,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:04:08,654 INFO L263 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 67 conjunts are in the unsatisfiable core [2022-07-12 19:04:08,661 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:04:08,664 INFO L390 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 [2022-07-12 19:04:08,683 INFO L390 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 [2022-07-12 19:04:08,698 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-12 19:04:08,699 INFO L390 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 17 treesize of output 21 [2022-07-12 19:04:08,736 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 19:04:08,744 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 19:04:08,835 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 19:04:08,835 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 54 [2022-07-12 19:04:08,838 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-07-12 19:04:08,935 INFO L356 Elim1Store]: treesize reduction 8, result has 65.2 percent of original size [2022-07-12 19:04:08,936 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 24 [2022-07-12 19:04:08,942 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-12 19:04:08,985 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:04:08,986 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 30 [2022-07-12 19:04:08,998 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:04:08,999 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-12 19:04:09,166 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 19:04:09,167 INFO L390 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 57 treesize of output 49 [2022-07-12 19:04:09,173 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:04:09,173 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-07-12 19:04:09,249 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 19:04:09,249 INFO L390 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 57 treesize of output 49 [2022-07-12 19:04:09,254 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:04:09,255 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-07-12 19:04:09,283 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 19:04:09,284 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 57 [2022-07-12 19:04:09,288 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 27 [2022-07-12 19:04:09,573 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:04:09,574 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-07-12 19:04:09,578 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:04:09,579 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:04:09,580 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 21 [2022-07-12 19:04:09,601 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:04:09,601 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:04:09,700 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1202 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1202) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4)))) (forall ((v_ArrVal_1203 (Array Int Int)) (v_ArrVal_1202 (Array Int Int))) (let ((.cse0 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1202) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1203) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0)))))) is different from false [2022-07-12 19:04:09,743 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1203 (Array Int Int)) (v_ArrVal_1202 (Array Int Int))) (let ((.cse0 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1202) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1203) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0))))) (forall ((v_ArrVal_1202 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1202) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4))))) is different from false [2022-07-12 19:04:09,751 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1203 (Array Int Int)) (v_ArrVal_1202 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|)) (.cse1 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1202) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1203) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1))))) (forall ((v_ArrVal_1202 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1202) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4))))) is different from false [2022-07-12 19:04:10,091 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1192 (Array Int Int)) (v_ArrVal_1191 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_78| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_20| Int)) (or (forall ((v_ArrVal_1193 Int) (v_ArrVal_1203 (Array Int Int)) (v_ArrVal_1202 (Array Int Int))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4))) (<= (+ 4 (select (select (store (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1192))) (store .cse0 |c_ULTIMATE.start_main_~head~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_78| 0))) |v_ULTIMATE.start_main_#t~malloc7#1.base_20| v_ArrVal_1202) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc7#1.base_20| v_ArrVal_1193) (select (select (store (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1191))) (store .cse2 |c_ULTIMATE.start_main_~head~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_78| |v_ULTIMATE.start_main_#t~malloc7#1.base_20|))) |v_ULTIMATE.start_main_#t~malloc7#1.base_20| v_ArrVal_1203) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_20|) 0)))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_78| |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((v_ArrVal_1192 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_78| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_20| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_20|) 0)) (forall ((v_ArrVal_1202 (Array Int Int))) (<= 0 (select (select (store (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1192))) (store .cse3 |c_ULTIMATE.start_main_~head~0#1.base| (store (select .cse3 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_78| 0))) |v_ULTIMATE.start_main_#t~malloc7#1.base_20| v_ArrVal_1202) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4)))))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_78| |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2022-07-12 19:04:12,267 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:04:12,268 INFO L390 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 37 [2022-07-12 19:04:12,270 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:04:12,272 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 38 [2022-07-12 19:04:12,275 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:04:12,277 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 19:04:12,280 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:04:12,281 INFO L390 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 21 treesize of output 13 [2022-07-12 19:04:12,292 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:04:12,293 INFO L390 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 96 treesize of output 87 [2022-07-12 19:04:12,295 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:04:12,297 INFO L390 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 142 treesize of output 138 [2022-07-12 19:04:12,305 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:04:12,306 INFO L390 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 130 treesize of output 100 [2022-07-12 19:04:12,310 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:04:12,311 INFO L390 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 140 treesize of output 134 [2022-07-12 19:04:12,315 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:04:12,317 INFO L390 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 66 treesize of output 54 [2022-07-12 19:04:12,322 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:04:12,324 INFO L390 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 56 treesize of output 48 [2022-07-12 19:04:12,327 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:04:12,328 INFO L390 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 100 treesize of output 88 [2022-07-12 19:04:12,331 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:04:12,333 INFO L390 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 78 treesize of output 70 [2022-07-12 19:04:18,141 WARN L233 SmtUtils]: Spent 5.75s on a formula simplification. DAG size of input: 32 DAG size of output: 31 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-12 19:04:18,163 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:04:20,228 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:04:20,229 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [654702161] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 19:04:20,229 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 19:04:20,229 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13, 14] total 41 [2022-07-12 19:04:20,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117277131] [2022-07-12 19:04:20,229 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 19:04:20,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-07-12 19:04:20,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:04:20,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-07-12 19:04:20,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=1231, Unknown=11, NotChecked=300, Total=1722 [2022-07-12 19:04:20,230 INFO L87 Difference]: Start difference. First operand 288 states and 331 transitions. Second operand has 42 states, 41 states have (on average 2.658536585365854) internal successors, (109), 42 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:04:25,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:04:25,824 INFO L93 Difference]: Finished difference Result 411 states and 467 transitions. [2022-07-12 19:04:25,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-07-12 19:04:25,824 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 41 states have (on average 2.658536585365854) internal successors, (109), 42 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2022-07-12 19:04:25,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:04:25,825 INFO L225 Difference]: With dead ends: 411 [2022-07-12 19:04:25,825 INFO L226 Difference]: Without dead ends: 411 [2022-07-12 19:04:25,827 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 55 SyntacticMatches, 3 SemanticMatches, 62 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 962 ImplicationChecksByTransitivity, 15.8s TimeCoverageRelationStatistics Valid=468, Invalid=3075, Unknown=13, NotChecked=476, Total=4032 [2022-07-12 19:04:25,827 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 377 mSDsluCounter, 1523 mSDsCounter, 0 mSdLazyCounter, 968 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 377 SdHoareTripleChecker+Valid, 1641 SdHoareTripleChecker+Invalid, 2302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 968 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1301 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-12 19:04:25,828 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [377 Valid, 1641 Invalid, 2302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 968 Invalid, 0 Unknown, 1301 Unchecked, 0.5s Time] [2022-07-12 19:04:25,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2022-07-12 19:04:25,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 299. [2022-07-12 19:04:25,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 278 states have (on average 1.2374100719424461) internal successors, (344), 298 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:04:25,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 344 transitions. [2022-07-12 19:04:25,846 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 344 transitions. Word has length 38 [2022-07-12 19:04:25,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:04:25,847 INFO L495 AbstractCegarLoop]: Abstraction has 299 states and 344 transitions. [2022-07-12 19:04:25,847 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 41 states have (on average 2.658536585365854) internal successors, (109), 42 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:04:25,847 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 344 transitions. [2022-07-12 19:04:25,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-12 19:04:25,848 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:04:25,848 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:04:25,872 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-12 19:04:26,072 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:04:26,073 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2022-07-12 19:04:26,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:04:26,073 INFO L85 PathProgramCache]: Analyzing trace with hash -1138406745, now seen corresponding path program 1 times [2022-07-12 19:04:26,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:04:26,073 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55006865] [2022-07-12 19:04:26,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:04:26,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:04:26,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:04:26,488 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:04:26,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:04:26,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55006865] [2022-07-12 19:04:26,488 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55006865] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:04:26,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [372748574] [2022-07-12 19:04:26,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:04:26,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:04:26,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 19:04:26,496 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 19:04:26,499 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-12 19:04:26,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:04:26,613 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 67 conjunts are in the unsatisfiable core [2022-07-12 19:04:26,619 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:04:26,625 INFO L390 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 [2022-07-12 19:04:26,654 INFO L390 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 [2022-07-12 19:04:26,668 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-12 19:04:26,668 INFO L390 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 17 treesize of output 21 [2022-07-12 19:04:26,699 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 19:04:26,708 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 19:04:26,795 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 19:04:26,795 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 54 [2022-07-12 19:04:26,798 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-07-12 19:04:26,896 INFO L356 Elim1Store]: treesize reduction 23, result has 47.7 percent of original size [2022-07-12 19:04:26,896 INFO L390 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 1 case distinctions, treesize of input 18 treesize of output 30 [2022-07-12 19:04:26,918 INFO L356 Elim1Store]: treesize reduction 8, result has 65.2 percent of original size [2022-07-12 19:04:26,918 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 24 [2022-07-12 19:04:26,971 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:04:26,971 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 30 [2022-07-12 19:04:26,993 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:04:26,994 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-12 19:04:27,199 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 19:04:27,200 INFO L390 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 57 treesize of output 49 [2022-07-12 19:04:27,210 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:04:27,211 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-07-12 19:04:27,322 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 19:04:27,322 INFO L390 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 57 treesize of output 49 [2022-07-12 19:04:27,329 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:04:27,330 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-07-12 19:04:27,361 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 19:04:27,362 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 57 [2022-07-12 19:04:27,366 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 27 [2022-07-12 19:04:27,667 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:04:27,667 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 21 [2022-07-12 19:04:27,672 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:04:27,673 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-07-12 19:04:27,677 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:04:27,678 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:04:27,810 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1331 (Array Int Int)) (v_ArrVal_1330 (Array Int Int))) (let ((.cse0 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1331) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1330) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0))))) (forall ((v_ArrVal_1331 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1331) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4))))) is different from false [2022-07-12 19:04:27,858 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1331 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1331) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4)))) (forall ((v_ArrVal_1331 (Array Int Int)) (v_ArrVal_1330 (Array Int Int))) (let ((.cse0 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1331) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1330) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0)))))) is different from false [2022-07-12 19:04:27,866 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1331 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1331) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4)))) (forall ((v_ArrVal_1331 (Array Int Int)) (v_ArrVal_1330 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|)) (.cse1 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1331) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1330) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1)))))) is different from false [2022-07-12 19:04:27,883 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1331 (Array Int Int))) (<= 0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_#t~malloc7#1.offset|)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1331) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4)))) (forall ((v_ArrVal_1331 (Array Int Int)) (v_ArrVal_1330 (Array Int Int))) (let ((.cse0 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_#t~malloc7#1.offset|)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1331) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0) 4) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_#t~malloc7#1.base|)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1330) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0)))))) is different from false [2022-07-12 19:04:28,132 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1320 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_83| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_23| Int)) (or (forall ((v_ArrVal_1331 (Array Int Int))) (<= 0 (select (select (store (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1320))) (store .cse0 |c_ULTIMATE.start_main_~head~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_83| 0))) |v_ULTIMATE.start_main_#t~malloc7#1.base_23| v_ArrVal_1331) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4)))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_23|) 0)))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_83| |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((v_ArrVal_1320 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_83| Int) (v_ArrVal_1319 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_23| Int)) (or (forall ((v_ArrVal_1321 Int) (v_ArrVal_1331 (Array Int Int)) (v_ArrVal_1330 (Array Int Int))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4))) (<= (+ (select (select (store (let ((.cse1 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1320))) (store .cse1 |c_ULTIMATE.start_main_~head~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_83| 0))) |v_ULTIMATE.start_main_#t~malloc7#1.base_23| v_ArrVal_1331) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 4) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc7#1.base_23| v_ArrVal_1321) (select (select (store (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1319))) (store .cse3 |c_ULTIMATE.start_main_~head~0#1.base| (store (select .cse3 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_83| |v_ULTIMATE.start_main_#t~malloc7#1.base_23|))) |v_ULTIMATE.start_main_#t~malloc7#1.base_23| v_ArrVal_1330) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_23|) 0)))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_83| |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2022-07-12 19:04:30,321 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:04:30,321 INFO L390 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 96 treesize of output 87 [2022-07-12 19:04:30,324 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:04:30,326 INFO L390 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 142 treesize of output 138 [2022-07-12 19:04:30,331 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:04:30,331 INFO L390 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 130 treesize of output 100 [2022-07-12 19:04:30,334 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:04:30,336 INFO L390 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 140 treesize of output 134 [2022-07-12 19:04:30,341 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:04:30,344 INFO L390 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 56 treesize of output 48 [2022-07-12 19:04:30,347 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:04:30,350 INFO L390 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 106 treesize of output 98 [2022-07-12 19:04:30,354 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:04:30,356 INFO L390 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 59 treesize of output 47 [2022-07-12 19:04:30,360 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:04:30,362 INFO L390 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 86 treesize of output 74 [2022-07-12 19:04:30,397 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:04:30,398 INFO L390 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 37 [2022-07-12 19:04:30,400 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:04:30,402 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 38 [2022-07-12 19:04:30,404 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:04:30,406 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 19:04:30,409 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:04:30,410 INFO L390 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 21 treesize of output 13 [2022-07-12 19:04:40,721 WARN L233 SmtUtils]: Spent 10.26s on a formula simplification. DAG size of input: 32 DAG size of output: 31 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-12 19:04:40,730 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:04:42,797 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:04:42,797 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [372748574] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 19:04:42,797 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 19:04:42,797 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13, 14] total 39 [2022-07-12 19:04:42,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293648781] [2022-07-12 19:04:42,797 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 19:04:42,798 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-07-12 19:04:42,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:04:42,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-07-12 19:04:42,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=1036, Unknown=10, NotChecked=350, Total=1560 [2022-07-12 19:04:42,799 INFO L87 Difference]: Start difference. First operand 299 states and 344 transitions. Second operand has 40 states, 39 states have (on average 2.8205128205128207) internal successors, (110), 40 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:04:50,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:04:50,024 INFO L93 Difference]: Finished difference Result 363 states and 414 transitions. [2022-07-12 19:04:50,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-07-12 19:04:50,025 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 2.8205128205128207) internal successors, (110), 40 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2022-07-12 19:04:50,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:04:50,026 INFO L225 Difference]: With dead ends: 363 [2022-07-12 19:04:50,026 INFO L226 Difference]: Without dead ends: 363 [2022-07-12 19:04:50,027 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 58 SyntacticMatches, 2 SemanticMatches, 58 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 654 ImplicationChecksByTransitivity, 22.1s TimeCoverageRelationStatistics Valid=395, Invalid=2581, Unknown=14, NotChecked=550, Total=3540 [2022-07-12 19:04:50,027 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 245 mSDsluCounter, 1087 mSDsCounter, 0 mSdLazyCounter, 548 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 1177 SdHoareTripleChecker+Invalid, 1700 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 548 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1128 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 19:04:50,027 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 1177 Invalid, 1700 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 548 Invalid, 0 Unknown, 1128 Unchecked, 0.3s Time] [2022-07-12 19:04:50,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2022-07-12 19:04:50,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 301. [2022-07-12 19:04:50,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 280 states have (on average 1.2392857142857143) internal successors, (347), 300 states have internal predecessors, (347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:04:50,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 347 transitions. [2022-07-12 19:04:50,032 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 347 transitions. Word has length 38 [2022-07-12 19:04:50,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:04:50,032 INFO L495 AbstractCegarLoop]: Abstraction has 301 states and 347 transitions. [2022-07-12 19:04:50,032 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 2.8205128205128207) internal successors, (110), 40 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:04:50,032 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 347 transitions. [2022-07-12 19:04:50,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-12 19:04:50,033 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:04:50,033 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:04:50,057 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-07-12 19:04:50,255 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2022-07-12 19:04:50,256 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2022-07-12 19:04:50,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:04:50,256 INFO L85 PathProgramCache]: Analyzing trace with hash -1790052731, now seen corresponding path program 1 times [2022-07-12 19:04:50,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:04:50,257 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613815797] [2022-07-12 19:04:50,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:04:50,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:04:50,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:04:50,357 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:04:50,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:04:50,358 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613815797] [2022-07-12 19:04:50,358 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [613815797] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:04:50,358 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1315782142] [2022-07-12 19:04:50,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:04:50,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:04:50,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 19:04:50,360 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 19:04:50,361 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-12 19:04:50,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:04:50,481 INFO L263 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 30 conjunts are in the unsatisfiable core [2022-07-12 19:04:50,483 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:04:50,700 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:04:50,701 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-12 19:04:50,704 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:04:50,706 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:04:50,706 INFO L390 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 15 treesize of output 10 [2022-07-12 19:04:50,722 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:04:50,722 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:04:50,908 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:04:50,908 INFO L390 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 42 treesize of output 45 [2022-07-12 19:04:50,917 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:04:50,917 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 56 [2022-07-12 19:04:51,103 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:04:51,103 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1315782142] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 19:04:51,103 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 19:04:51,104 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 20 [2022-07-12 19:04:51,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172393506] [2022-07-12 19:04:51,104 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 19:04:51,104 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-12 19:04:51,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:04:51,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-12 19:04:51,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2022-07-12 19:04:51,105 INFO L87 Difference]: Start difference. First operand 301 states and 347 transitions. Second operand has 20 states, 20 states have (on average 4.3) internal successors, (86), 20 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:04:51,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:04:51,369 INFO L93 Difference]: Finished difference Result 328 states and 373 transitions. [2022-07-12 19:04:51,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-12 19:04:51,369 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 4.3) internal successors, (86), 20 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2022-07-12 19:04:51,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:04:51,370 INFO L225 Difference]: With dead ends: 328 [2022-07-12 19:04:51,370 INFO L226 Difference]: Without dead ends: 328 [2022-07-12 19:04:51,370 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=84, Invalid=516, Unknown=0, NotChecked=0, Total=600 [2022-07-12 19:04:51,371 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 119 mSDsluCounter, 831 mSDsCounter, 0 mSdLazyCounter, 395 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 905 SdHoareTripleChecker+Invalid, 590 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 395 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 166 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 19:04:51,371 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 905 Invalid, 590 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 395 Invalid, 0 Unknown, 166 Unchecked, 0.2s Time] [2022-07-12 19:04:51,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2022-07-12 19:04:51,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 320. [2022-07-12 19:04:51,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 320 states, 299 states have (on average 1.2441471571906355) internal successors, (372), 319 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:04:51,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 372 transitions. [2022-07-12 19:04:51,376 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 372 transitions. Word has length 38 [2022-07-12 19:04:51,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:04:51,376 INFO L495 AbstractCegarLoop]: Abstraction has 320 states and 372 transitions. [2022-07-12 19:04:51,376 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 4.3) internal successors, (86), 20 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:04:51,377 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 372 transitions. [2022-07-12 19:04:51,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-12 19:04:51,377 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:04:51,377 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:04:51,401 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-07-12 19:04:51,591 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:04:51,592 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2022-07-12 19:04:51,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:04:51,592 INFO L85 PathProgramCache]: Analyzing trace with hash -434794642, now seen corresponding path program 1 times [2022-07-12 19:04:51,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:04:51,592 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16653760] [2022-07-12 19:04:51,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:04:51,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:04:51,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:04:51,893 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:04:51,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:04:51,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16653760] [2022-07-12 19:04:51,894 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16653760] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:04:51,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1685233091] [2022-07-12 19:04:51,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:04:51,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:04:51,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 19:04:51,895 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 19:04:51,922 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-07-12 19:04:52,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:04:52,027 INFO L263 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 60 conjunts are in the unsatisfiable core [2022-07-12 19:04:52,029 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:04:52,032 INFO L390 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 [2022-07-12 19:04:52,049 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 19:04:52,052 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 19:04:52,118 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 19:04:52,118 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-12 19:04:52,155 INFO L356 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-07-12 19:04:52,155 INFO L390 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 21 treesize of output 26 [2022-07-12 19:04:52,170 INFO L356 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-07-12 19:04:52,170 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 26 [2022-07-12 19:04:52,358 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 19:04:52,358 INFO L390 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 62 treesize of output 56 [2022-07-12 19:04:52,375 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 19:04:52,375 INFO L390 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 62 treesize of output 64 [2022-07-12 19:04:52,434 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 19:04:52,434 INFO L390 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 62 treesize of output 56 [2022-07-12 19:04:52,444 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 19:04:52,444 INFO L390 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 62 treesize of output 64 [2022-07-12 19:04:52,484 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 19:04:52,484 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-12 19:04:52,545 INFO L356 Elim1Store]: treesize reduction 72, result has 19.1 percent of original size [2022-07-12 19:04:52,546 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 69 treesize of output 55 [2022-07-12 19:04:52,567 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 19:04:52,568 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 63 [2022-07-12 19:04:52,573 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2022-07-12 19:04:52,600 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-07-12 19:04:52,797 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2022-07-12 19:04:52,798 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: Should have been eliminated by DER at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.(DerPreprocessor.java:113) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:353) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:190) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne3(DualJunctionSaa.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne2(DualJunctionSaa.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne1(DualJunctionSaa.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne0(DualJunctionSaa.java:124) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne(DualJunctionSaa.java:108) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryExhaustivelyToEliminate(DualJunctionSaa.java:93) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java:650) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:611) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:529) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:333) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:180) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:269) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:90) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:199) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:299) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:248) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:409) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:300) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:260) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:152) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-07-12 19:04:52,800 INFO L158 Benchmark]: Toolchain (without parser) took 91797.05ms. Allocated memory was 102.8MB in the beginning and 148.9MB in the end (delta: 46.1MB). Free memory was 69.7MB in the beginning and 71.8MB in the end (delta: -2.1MB). Peak memory consumption was 46.0MB. Max. memory is 16.1GB. [2022-07-12 19:04:52,801 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 81.8MB. Free memory was 51.7MB in the beginning and 51.7MB in the end (delta: 28.1kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 19:04:52,801 INFO L158 Benchmark]: CACSL2BoogieTranslator took 396.91ms. Allocated memory is still 102.8MB. Free memory was 69.3MB in the beginning and 72.4MB in the end (delta: -3.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-12 19:04:52,801 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.19ms. Allocated memory is still 102.8MB. Free memory was 72.4MB in the beginning and 69.9MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-12 19:04:52,801 INFO L158 Benchmark]: Boogie Preprocessor took 24.87ms. Allocated memory is still 102.8MB. Free memory was 69.9MB in the beginning and 68.1MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-12 19:04:52,801 INFO L158 Benchmark]: RCFGBuilder took 591.89ms. Allocated memory is still 102.8MB. Free memory was 68.1MB in the beginning and 46.3MB in the end (delta: 21.8MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2022-07-12 19:04:52,801 INFO L158 Benchmark]: TraceAbstraction took 90715.74ms. Allocated memory was 102.8MB in the beginning and 148.9MB in the end (delta: 46.1MB). Free memory was 45.7MB in the beginning and 71.8MB in the end (delta: -26.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2022-07-12 19:04:52,802 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.19ms. Allocated memory is still 81.8MB. Free memory was 51.7MB in the beginning and 51.7MB in the end (delta: 28.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 396.91ms. Allocated memory is still 102.8MB. Free memory was 69.3MB in the beginning and 72.4MB in the end (delta: -3.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 59.19ms. Allocated memory is still 102.8MB. Free memory was 72.4MB in the beginning and 69.9MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 24.87ms. Allocated memory is still 102.8MB. Free memory was 69.9MB in the beginning and 68.1MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 591.89ms. Allocated memory is still 102.8MB. Free memory was 68.1MB in the beginning and 46.3MB in the end (delta: 21.8MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 90715.74ms. Allocated memory was 102.8MB in the beginning and 148.9MB in the end (delta: 46.1MB). Free memory was 45.7MB in the beginning and 71.8MB in the end (delta: -26.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: Should have been eliminated by DER de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: Should have been eliminated by DER: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.(DerPreprocessor.java:113) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-07-12 19:04:52,861 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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/forester-heap/sll-optional-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 8b0f1d623fff7bbdf74e6250d2f53fb98e44ca7ba1aae1265f5b0871b427fba0 --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 19:04:54,709 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 19:04:54,711 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 19:04:54,744 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 19:04:54,745 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 19:04:54,746 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 19:04:54,747 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 19:04:54,748 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 19:04:54,750 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 19:04:54,751 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 19:04:54,752 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 19:04:54,756 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 19:04:54,757 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 19:04:54,760 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 19:04:54,761 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 19:04:54,762 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 19:04:54,763 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 19:04:54,764 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 19:04:54,765 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 19:04:54,766 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 19:04:54,768 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 19:04:54,769 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 19:04:54,769 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 19:04:54,770 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 19:04:54,771 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 19:04:54,774 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 19:04:54,774 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 19:04:54,774 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 19:04:54,775 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 19:04:54,776 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 19:04:54,777 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 19:04:54,777 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 19:04:54,777 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 19:04:54,778 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 19:04:54,779 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 19:04:54,780 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 19:04:54,780 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 19:04:54,780 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 19:04:54,781 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 19:04:54,781 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 19:04:54,782 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 19:04:54,783 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 19:04:54,783 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-07-12 19:04:54,804 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 19:04:54,804 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 19:04:54,804 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 19:04:54,804 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 19:04:54,805 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 19:04:54,805 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 19:04:54,806 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 19:04:54,806 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 19:04:54,806 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 19:04:54,807 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 19:04:54,807 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-12 19:04:54,807 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-12 19:04:54,807 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 19:04:54,807 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-12 19:04:54,808 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 19:04:54,808 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-12 19:04:54,808 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-12 19:04:54,808 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-12 19:04:54,808 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 19:04:54,809 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-12 19:04:54,809 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-12 19:04:54,809 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-12 19:04:54,809 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-12 19:04:54,809 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 19:04:54,810 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 19:04:54,810 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 19:04:54,810 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 19:04:54,810 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 19:04:54,810 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 19:04:54,811 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 19:04:54,811 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-12 19:04:54,811 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-12 19:04:54,811 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-12 19:04:54,811 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 -> 8b0f1d623fff7bbdf74e6250d2f53fb98e44ca7ba1aae1265f5b0871b427fba0 [2022-07-12 19:04:55,107 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 19:04:55,126 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 19:04:55,128 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 19:04:55,129 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 19:04:55,130 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 19:04:55,131 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/sll-optional-1.i [2022-07-12 19:04:55,201 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/feeb70681/678a9d5322f64fb280ed891460b00184/FLAG44df006a9 [2022-07-12 19:04:55,709 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 19:04:55,710 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-optional-1.i [2022-07-12 19:04:55,725 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/feeb70681/678a9d5322f64fb280ed891460b00184/FLAG44df006a9 [2022-07-12 19:04:56,030 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/feeb70681/678a9d5322f64fb280ed891460b00184 [2022-07-12 19:04:56,033 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 19:04:56,034 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 19:04:56,037 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 19:04:56,037 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 19:04:56,040 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 19:04:56,040 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 07:04:56" (1/1) ... [2022-07-12 19:04:56,041 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a265cf3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:04:56, skipping insertion in model container [2022-07-12 19:04:56,041 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 07:04:56" (1/1) ... [2022-07-12 19:04:56,048 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 19:04:56,086 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 19:04:56,341 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-optional-1.i[22688,22701] [2022-07-12 19:04:56,351 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 19:04:56,361 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 19:04:56,394 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-optional-1.i[22688,22701] [2022-07-12 19:04:56,396 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 19:04:56,422 INFO L208 MainTranslator]: Completed translation [2022-07-12 19:04:56,422 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:04:56 WrapperNode [2022-07-12 19:04:56,422 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 19:04:56,423 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 19:04:56,423 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 19:04:56,423 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 19:04:56,429 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:04:56" (1/1) ... [2022-07-12 19:04:56,449 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:04:56" (1/1) ... [2022-07-12 19:04:56,483 INFO L137 Inliner]: procedures = 122, calls = 41, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 132 [2022-07-12 19:04:56,483 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 19:04:56,485 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 19:04:56,485 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 19:04:56,485 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 19:04:56,492 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:04:56" (1/1) ... [2022-07-12 19:04:56,493 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:04:56" (1/1) ... [2022-07-12 19:04:56,509 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:04:56" (1/1) ... [2022-07-12 19:04:56,509 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:04:56" (1/1) ... [2022-07-12 19:04:56,517 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:04:56" (1/1) ... [2022-07-12 19:04:56,532 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:04:56" (1/1) ... [2022-07-12 19:04:56,538 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:04:56" (1/1) ... [2022-07-12 19:04:56,541 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 19:04:56,542 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 19:04:56,542 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 19:04:56,542 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 19:04:56,542 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:04:56" (1/1) ... [2022-07-12 19:04:56,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 19:04:56,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 19:04:56,576 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) [2022-07-12 19:04:56,592 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 [2022-07-12 19:04:56,621 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-07-12 19:04:56,622 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-12 19:04:56,622 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 19:04:56,622 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-12 19:04:56,622 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-12 19:04:56,622 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 19:04:56,622 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-07-12 19:04:56,622 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-12 19:04:56,623 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 19:04:56,623 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 19:04:56,766 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 19:04:56,768 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 19:04:57,290 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 19:04:57,297 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 19:04:57,297 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2022-07-12 19:04:57,299 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 07:04:57 BoogieIcfgContainer [2022-07-12 19:04:57,299 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 19:04:57,301 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 19:04:57,301 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 19:04:57,303 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 19:04:57,304 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 07:04:56" (1/3) ... [2022-07-12 19:04:57,304 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2af12402 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 07:04:57, skipping insertion in model container [2022-07-12 19:04:57,304 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:04:56" (2/3) ... [2022-07-12 19:04:57,305 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2af12402 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 07:04:57, skipping insertion in model container [2022-07-12 19:04:57,305 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 07:04:57" (3/3) ... [2022-07-12 19:04:57,306 INFO L111 eAbstractionObserver]: Analyzing ICFG sll-optional-1.i [2022-07-12 19:04:57,319 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 19:04:57,320 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 66 error locations. [2022-07-12 19:04:57,377 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 19:04:57,392 INFO L357 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, mAutomataTypeConcurrency=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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@71894b43, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@37b70dad [2022-07-12 19:04:57,392 INFO L358 AbstractCegarLoop]: Starting to check reachability of 66 error locations. [2022-07-12 19:04:57,403 INFO L276 IsEmpty]: Start isEmpty. Operand has 140 states, 73 states have (on average 2.136986301369863) internal successors, (156), 139 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:04:57,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-07-12 19:04:57,408 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:04:57,409 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-07-12 19:04:57,410 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2022-07-12 19:04:57,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:04:57,417 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2022-07-12 19:04:57,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:04:57,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1147942441] [2022-07-12 19:04:57,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:04:57,429 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:04:57,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:04:57,432 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) [2022-07-12 19:04:57,433 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-07-12 19:04:57,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:04:57,504 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-12 19:04:57,509 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:04:57,577 INFO L390 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 [2022-07-12 19:04:57,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:04:57,590 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 19:04:57,591 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:04:57,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1147942441] [2022-07-12 19:04:57,592 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1147942441] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:04:57,592 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:04:57,593 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 19:04:57,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438752817] [2022-07-12 19:04:57,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:04:57,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 19:04:57,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:04:57,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 19:04:57,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 19:04:57,634 INFO L87 Difference]: Start difference. First operand has 140 states, 73 states have (on average 2.136986301369863) internal successors, (156), 139 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:04:57,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:04:57,969 INFO L93 Difference]: Finished difference Result 142 states and 152 transitions. [2022-07-12 19:04:57,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 19:04:57,971 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-07-12 19:04:57,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:04:57,979 INFO L225 Difference]: With dead ends: 142 [2022-07-12 19:04:57,979 INFO L226 Difference]: Without dead ends: 138 [2022-07-12 19:04:57,980 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 19:04:57,983 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 125 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 19:04:57,984 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 81 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-12 19:04:57,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2022-07-12 19:04:58,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 132. [2022-07-12 19:04:58,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 75 states have (on average 1.92) internal successors, (144), 131 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:04:58,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 144 transitions. [2022-07-12 19:04:58,019 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 144 transitions. Word has length 3 [2022-07-12 19:04:58,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:04:58,020 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 144 transitions. [2022-07-12 19:04:58,020 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:04:58,020 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 144 transitions. [2022-07-12 19:04:58,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-07-12 19:04:58,021 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:04:58,021 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-07-12 19:04:58,039 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-07-12 19:04:58,237 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 19:04:58,238 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2022-07-12 19:04:58,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:04:58,239 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2022-07-12 19:04:58,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:04:58,239 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [499797193] [2022-07-12 19:04:58,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:04:58,240 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:04:58,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:04:58,241 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) [2022-07-12 19:04:58,244 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-07-12 19:04:58,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:04:58,296 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-12 19:04:58,298 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:04:58,312 INFO L390 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 [2022-07-12 19:04:58,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:04:58,328 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 19:04:58,328 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:04:58,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [499797193] [2022-07-12 19:04:58,333 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [499797193] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:04:58,334 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:04:58,334 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 19:04:58,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888877269] [2022-07-12 19:04:58,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:04:58,336 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 19:04:58,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:04:58,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 19:04:58,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 19:04:58,338 INFO L87 Difference]: Start difference. First operand 132 states and 144 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:04:58,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:04:58,628 INFO L93 Difference]: Finished difference Result 128 states and 140 transitions. [2022-07-12 19:04:58,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 19:04:58,629 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-07-12 19:04:58,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:04:58,631 INFO L225 Difference]: With dead ends: 128 [2022-07-12 19:04:58,631 INFO L226 Difference]: Without dead ends: 128 [2022-07-12 19:04:58,631 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 19:04:58,632 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 102 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 19:04:58,633 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 94 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-12 19:04:58,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2022-07-12 19:04:58,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 124. [2022-07-12 19:04:58,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 75 states have (on average 1.8133333333333332) internal successors, (136), 123 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:04:58,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 136 transitions. [2022-07-12 19:04:58,641 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 136 transitions. Word has length 3 [2022-07-12 19:04:58,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:04:58,641 INFO L495 AbstractCegarLoop]: Abstraction has 124 states and 136 transitions. [2022-07-12 19:04:58,641 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:04:58,641 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 136 transitions. [2022-07-12 19:04:58,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-12 19:04:58,642 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:04:58,642 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:04:58,652 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-07-12 19:04:58,850 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 19:04:58,851 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2022-07-12 19:04:58,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:04:58,851 INFO L85 PathProgramCache]: Analyzing trace with hash -1404186606, now seen corresponding path program 1 times [2022-07-12 19:04:58,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:04:58,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2137432409] [2022-07-12 19:04:58,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:04:58,852 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:04:58,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:04:58,854 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) [2022-07-12 19:04:58,859 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-07-12 19:04:58,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:04:58,941 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-12 19:04:58,943 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:04:58,948 INFO L390 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 [2022-07-12 19:04:58,972 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 19:04:59,006 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2022-07-12 19:04:59,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:04:59,015 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 19:04:59,016 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:04:59,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2137432409] [2022-07-12 19:04:59,018 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2137432409] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:04:59,018 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:04:59,018 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 19:04:59,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754692083] [2022-07-12 19:04:59,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:04:59,019 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 19:04:59,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:04:59,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 19:04:59,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 19:04:59,020 INFO L87 Difference]: Start difference. First operand 124 states and 136 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:04:59,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:04:59,486 INFO L93 Difference]: Finished difference Result 167 states and 184 transitions. [2022-07-12 19:04:59,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 19:04:59,488 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-07-12 19:04:59,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:04:59,489 INFO L225 Difference]: With dead ends: 167 [2022-07-12 19:04:59,489 INFO L226 Difference]: Without dead ends: 167 [2022-07-12 19:04:59,489 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-12 19:04:59,490 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 50 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-12 19:04:59,491 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 301 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-12 19:04:59,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2022-07-12 19:04:59,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 123. [2022-07-12 19:04:59,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 75 states have (on average 1.8) internal successors, (135), 122 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:04:59,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 135 transitions. [2022-07-12 19:04:59,509 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 135 transitions. Word has length 10 [2022-07-12 19:04:59,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:04:59,510 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 135 transitions. [2022-07-12 19:04:59,510 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:04:59,511 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 135 transitions. [2022-07-12 19:04:59,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-12 19:04:59,511 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:04:59,511 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:04:59,520 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-07-12 19:04:59,720 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 19:04:59,720 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2022-07-12 19:04:59,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:04:59,721 INFO L85 PathProgramCache]: Analyzing trace with hash -1404186605, now seen corresponding path program 1 times [2022-07-12 19:04:59,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:04:59,721 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [950717142] [2022-07-12 19:04:59,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:04:59,722 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:04:59,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:04:59,723 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) [2022-07-12 19:04:59,725 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-07-12 19:04:59,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:04:59,794 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-12 19:04:59,800 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:04:59,811 INFO L390 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 [2022-07-12 19:04:59,838 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 19:04:59,846 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 19:04:59,879 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2022-07-12 19:04:59,884 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-07-12 19:04:59,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:04:59,897 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 19:04:59,898 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:04:59,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [950717142] [2022-07-12 19:04:59,898 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [950717142] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:04:59,898 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:04:59,898 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 19:04:59,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357090254] [2022-07-12 19:04:59,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:04:59,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 19:04:59,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:04:59,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 19:04:59,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 19:04:59,900 INFO L87 Difference]: Start difference. First operand 123 states and 135 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:05:00,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:05:00,326 INFO L93 Difference]: Finished difference Result 122 states and 134 transitions. [2022-07-12 19:05:00,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 19:05:00,327 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-07-12 19:05:00,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:05:00,328 INFO L225 Difference]: With dead ends: 122 [2022-07-12 19:05:00,328 INFO L226 Difference]: Without dead ends: 122 [2022-07-12 19:05:00,328 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-12 19:05:00,329 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 2 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-12 19:05:00,329 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 337 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-12 19:05:00,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2022-07-12 19:05:00,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2022-07-12 19:05:00,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 75 states have (on average 1.7866666666666666) internal successors, (134), 121 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:05:00,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 134 transitions. [2022-07-12 19:05:00,345 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 134 transitions. Word has length 10 [2022-07-12 19:05:00,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:05:00,345 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 134 transitions. [2022-07-12 19:05:00,345 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:05:00,346 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 134 transitions. [2022-07-12 19:05:00,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-12 19:05:00,346 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:05:00,346 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:05:00,358 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-07-12 19:05:00,555 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 19:05:00,555 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2022-07-12 19:05:00,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:05:00,556 INFO L85 PathProgramCache]: Analyzing trace with hash 1595381600, now seen corresponding path program 1 times [2022-07-12 19:05:00,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:05:00,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [252108037] [2022-07-12 19:05:00,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:05:00,557 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:05:00,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:05:00,558 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) [2022-07-12 19:05:00,560 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-07-12 19:05:00,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:05:00,615 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-12 19:05:00,616 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:05:00,620 INFO L390 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 [2022-07-12 19:05:00,651 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-07-12 19:05:00,652 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 17 [2022-07-12 19:05:00,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:05:00,662 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 19:05:00,662 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:05:00,663 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [252108037] [2022-07-12 19:05:00,663 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [252108037] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:05:00,663 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:05:00,663 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 19:05:00,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353103444] [2022-07-12 19:05:00,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:05:00,663 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 19:05:00,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:05:00,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 19:05:00,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 19:05:00,664 INFO L87 Difference]: Start difference. First operand 122 states and 134 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:05:00,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:05:00,963 INFO L93 Difference]: Finished difference Result 124 states and 135 transitions. [2022-07-12 19:05:00,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 19:05:00,963 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-07-12 19:05:00,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:05:00,964 INFO L225 Difference]: With dead ends: 124 [2022-07-12 19:05:00,964 INFO L226 Difference]: Without dead ends: 124 [2022-07-12 19:05:00,964 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-12 19:05:00,965 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 168 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 19:05:00,965 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 69 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-12 19:05:00,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2022-07-12 19:05:00,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 115. [2022-07-12 19:05:00,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 81 states have (on average 1.6296296296296295) internal successors, (132), 114 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:05:00,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 132 transitions. [2022-07-12 19:05:00,971 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 132 transitions. Word has length 10 [2022-07-12 19:05:00,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:05:00,971 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 132 transitions. [2022-07-12 19:05:00,971 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:05:00,971 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 132 transitions. [2022-07-12 19:05:00,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-12 19:05:00,972 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:05:00,972 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:05:00,982 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-07-12 19:05:01,180 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 19:05:01,180 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2022-07-12 19:05:01,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:05:01,181 INFO L85 PathProgramCache]: Analyzing trace with hash 1595381601, now seen corresponding path program 1 times [2022-07-12 19:05:01,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:05:01,181 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1528160518] [2022-07-12 19:05:01,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:05:01,181 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:05:01,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:05:01,183 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) [2022-07-12 19:05:01,183 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-07-12 19:05:01,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:05:01,244 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-12 19:05:01,245 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:05:01,254 INFO L390 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 [2022-07-12 19:05:01,323 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 19:05:01,324 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-07-12 19:05:01,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:05:01,341 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 19:05:01,341 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:05:01,341 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1528160518] [2022-07-12 19:05:01,341 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1528160518] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:05:01,342 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:05:01,342 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 19:05:01,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692565292] [2022-07-12 19:05:01,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:05:01,342 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 19:05:01,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:05:01,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 19:05:01,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 19:05:01,344 INFO L87 Difference]: Start difference. First operand 115 states and 132 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:05:01,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:05:01,695 INFO L93 Difference]: Finished difference Result 166 states and 185 transitions. [2022-07-12 19:05:01,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 19:05:01,696 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-07-12 19:05:01,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:05:01,697 INFO L225 Difference]: With dead ends: 166 [2022-07-12 19:05:01,697 INFO L226 Difference]: Without dead ends: 166 [2022-07-12 19:05:01,697 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-12 19:05:01,698 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 168 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 19:05:01,698 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 108 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-12 19:05:01,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2022-07-12 19:05:01,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 142. [2022-07-12 19:05:01,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 108 states have (on average 1.5462962962962963) internal successors, (167), 141 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:05:01,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 167 transitions. [2022-07-12 19:05:01,703 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 167 transitions. Word has length 10 [2022-07-12 19:05:01,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:05:01,704 INFO L495 AbstractCegarLoop]: Abstraction has 142 states and 167 transitions. [2022-07-12 19:05:01,704 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:05:01,704 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 167 transitions. [2022-07-12 19:05:01,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-12 19:05:01,710 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:05:01,710 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:05:01,722 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-07-12 19:05:01,922 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 19:05:01,922 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2022-07-12 19:05:01,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:05:01,923 INFO L85 PathProgramCache]: Analyzing trace with hash 1355389539, now seen corresponding path program 1 times [2022-07-12 19:05:01,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:05:01,923 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1803465217] [2022-07-12 19:05:01,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:05:01,923 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:05:01,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:05:01,925 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) [2022-07-12 19:05:01,925 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-07-12 19:05:02,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:05:02,005 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-12 19:05:02,007 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:05:02,015 INFO L390 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 [2022-07-12 19:05:02,036 INFO L390 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 [2022-07-12 19:05:02,046 INFO L390 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 [2022-07-12 19:05:02,090 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-07-12 19:05:02,095 INFO L390 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 [2022-07-12 19:05:02,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:05:02,125 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 19:05:02,125 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:05:02,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1803465217] [2022-07-12 19:05:02,125 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1803465217] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:05:02,125 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:05:02,128 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 19:05:02,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979957483] [2022-07-12 19:05:02,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:05:02,129 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 19:05:02,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:05:02,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 19:05:02,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 19:05:02,131 INFO L87 Difference]: Start difference. First operand 142 states and 167 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:05:02,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:05:02,678 INFO L93 Difference]: Finished difference Result 134 states and 159 transitions. [2022-07-12 19:05:02,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-12 19:05:02,679 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-07-12 19:05:02,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:05:02,680 INFO L225 Difference]: With dead ends: 134 [2022-07-12 19:05:02,680 INFO L226 Difference]: Without dead ends: 134 [2022-07-12 19:05:02,680 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2022-07-12 19:05:02,681 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 24 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-12 19:05:02,681 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 305 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-12 19:05:02,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2022-07-12 19:05:02,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 128. [2022-07-12 19:05:02,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 104 states have (on average 1.4615384615384615) internal successors, (152), 127 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:05:02,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 152 transitions. [2022-07-12 19:05:02,685 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 152 transitions. Word has length 14 [2022-07-12 19:05:02,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:05:02,685 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 152 transitions. [2022-07-12 19:05:02,686 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:05:02,686 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 152 transitions. [2022-07-12 19:05:02,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-12 19:05:02,686 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:05:02,686 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:05:02,710 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-07-12 19:05:02,903 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 19:05:02,904 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2022-07-12 19:05:02,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:05:02,904 INFO L85 PathProgramCache]: Analyzing trace with hash 1355389538, now seen corresponding path program 1 times [2022-07-12 19:05:02,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:05:02,905 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1268286557] [2022-07-12 19:05:02,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:05:02,905 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:05:02,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:05:02,906 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) [2022-07-12 19:05:02,907 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-07-12 19:05:02,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:05:02,969 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-12 19:05:02,971 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:05:02,977 INFO L390 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 [2022-07-12 19:05:02,987 INFO L390 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 [2022-07-12 19:05:03,002 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-07-12 19:05:03,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:05:03,017 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 19:05:03,017 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:05:03,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1268286557] [2022-07-12 19:05:03,018 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1268286557] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:05:03,018 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:05:03,018 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 19:05:03,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105030066] [2022-07-12 19:05:03,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:05:03,019 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 19:05:03,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:05:03,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 19:05:03,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 19:05:03,020 INFO L87 Difference]: Start difference. First operand 128 states and 152 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:05:03,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:05:03,489 INFO L93 Difference]: Finished difference Result 130 states and 155 transitions. [2022-07-12 19:05:03,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 19:05:03,489 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-07-12 19:05:03,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:05:03,490 INFO L225 Difference]: With dead ends: 130 [2022-07-12 19:05:03,490 INFO L226 Difference]: Without dead ends: 130 [2022-07-12 19:05:03,490 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-07-12 19:05:03,491 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 49 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-12 19:05:03,491 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 255 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-12 19:05:03,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-07-12 19:05:03,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 127. [2022-07-12 19:05:03,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 104 states have (on average 1.4519230769230769) internal successors, (151), 126 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:05:03,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 151 transitions. [2022-07-12 19:05:03,495 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 151 transitions. Word has length 14 [2022-07-12 19:05:03,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:05:03,495 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 151 transitions. [2022-07-12 19:05:03,495 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:05:03,499 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 151 transitions. [2022-07-12 19:05:03,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-12 19:05:03,500 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:05:03,500 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:05:03,508 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-07-12 19:05:03,707 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 19:05:03,707 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2022-07-12 19:05:03,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:05:03,708 INFO L85 PathProgramCache]: Analyzing trace with hash -1163410907, now seen corresponding path program 1 times [2022-07-12 19:05:03,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:05:03,709 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1082877312] [2022-07-12 19:05:03,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:05:03,709 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:05:03,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:05:03,710 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) [2022-07-12 19:05:03,711 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-07-12 19:05:03,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:05:03,765 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-12 19:05:03,766 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:05:03,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:05:03,785 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 19:05:03,785 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:05:03,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1082877312] [2022-07-12 19:05:03,786 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1082877312] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:05:03,786 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:05:03,786 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 19:05:03,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372781007] [2022-07-12 19:05:03,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:05:03,786 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 19:05:03,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:05:03,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 19:05:03,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 19:05:03,787 INFO L87 Difference]: Start difference. First operand 127 states and 151 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:05:03,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:05:03,994 INFO L93 Difference]: Finished difference Result 150 states and 169 transitions. [2022-07-12 19:05:03,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 19:05:03,994 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-07-12 19:05:03,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:05:03,995 INFO L225 Difference]: With dead ends: 150 [2022-07-12 19:05:03,995 INFO L226 Difference]: Without dead ends: 150 [2022-07-12 19:05:03,995 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-12 19:05:03,996 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 151 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 19:05:03,996 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 148 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 19:05:03,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2022-07-12 19:05:03,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 127. [2022-07-12 19:05:03,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 104 states have (on average 1.4326923076923077) internal successors, (149), 126 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:05:04,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 149 transitions. [2022-07-12 19:05:04,000 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 149 transitions. Word has length 15 [2022-07-12 19:05:04,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:05:04,000 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 149 transitions. [2022-07-12 19:05:04,000 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:05:04,000 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 149 transitions. [2022-07-12 19:05:04,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-12 19:05:04,001 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:05:04,001 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:05:04,012 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-07-12 19:05:04,207 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 19:05:04,207 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2022-07-12 19:05:04,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:05:04,208 INFO L85 PathProgramCache]: Analyzing trace with hash 152694153, now seen corresponding path program 1 times [2022-07-12 19:05:04,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:05:04,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [105488227] [2022-07-12 19:05:04,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:05:04,209 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:05:04,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:05:04,210 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) [2022-07-12 19:05:04,212 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-07-12 19:05:04,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:05:04,270 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-12 19:05:04,271 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:05:04,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:05:04,282 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 19:05:04,282 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:05:04,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [105488227] [2022-07-12 19:05:04,282 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [105488227] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:05:04,282 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:05:04,282 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 19:05:04,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10637280] [2022-07-12 19:05:04,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:05:04,283 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 19:05:04,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:05:04,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 19:05:04,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 19:05:04,284 INFO L87 Difference]: Start difference. First operand 127 states and 149 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:05:04,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:05:04,301 INFO L93 Difference]: Finished difference Result 153 states and 183 transitions. [2022-07-12 19:05:04,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 19:05:04,301 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-07-12 19:05:04,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:05:04,302 INFO L225 Difference]: With dead ends: 153 [2022-07-12 19:05:04,302 INFO L226 Difference]: Without dead ends: 153 [2022-07-12 19:05:04,302 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-12 19:05:04,303 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 21 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 19:05:04,303 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 295 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 19:05:04,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2022-07-12 19:05:04,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 131. [2022-07-12 19:05:04,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 108 states have (on average 1.4166666666666667) internal successors, (153), 130 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:05:04,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 153 transitions. [2022-07-12 19:05:04,306 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 153 transitions. Word has length 18 [2022-07-12 19:05:04,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:05:04,307 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 153 transitions. [2022-07-12 19:05:04,307 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:05:04,307 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 153 transitions. [2022-07-12 19:05:04,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-12 19:05:04,308 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:05:04,308 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:05:04,322 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-07-12 19:05:04,516 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 19:05:04,517 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2022-07-12 19:05:04,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:05:04,517 INFO L85 PathProgramCache]: Analyzing trace with hash 718816338, now seen corresponding path program 1 times [2022-07-12 19:05:04,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:05:04,517 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [215404375] [2022-07-12 19:05:04,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:05:04,521 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:05:04,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:05:04,522 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) [2022-07-12 19:05:04,523 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-07-12 19:05:04,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:05:04,583 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-12 19:05:04,584 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:05:04,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:05:04,598 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 19:05:04,598 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:05:04,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [215404375] [2022-07-12 19:05:04,598 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [215404375] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:05:04,599 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:05:04,599 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 19:05:04,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849958539] [2022-07-12 19:05:04,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:05:04,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 19:05:04,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:05:04,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 19:05:04,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 19:05:04,600 INFO L87 Difference]: Start difference. First operand 131 states and 153 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:05:04,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:05:04,635 INFO L93 Difference]: Finished difference Result 153 states and 179 transitions. [2022-07-12 19:05:04,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 19:05:04,636 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-07-12 19:05:04,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:05:04,637 INFO L225 Difference]: With dead ends: 153 [2022-07-12 19:05:04,637 INFO L226 Difference]: Without dead ends: 153 [2022-07-12 19:05:04,637 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-12 19:05:04,638 INFO L413 NwaCegarLoop]: 101 mSDtfsCounter, 25 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 19:05:04,638 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 387 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 19:05:04,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2022-07-12 19:05:04,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 135. [2022-07-12 19:05:04,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 112 states have (on average 1.4017857142857142) internal successors, (157), 134 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:05:04,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 157 transitions. [2022-07-12 19:05:04,641 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 157 transitions. Word has length 20 [2022-07-12 19:05:04,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:05:04,642 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 157 transitions. [2022-07-12 19:05:04,642 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:05:04,642 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 157 transitions. [2022-07-12 19:05:04,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-12 19:05:04,642 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:05:04,642 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:05:04,651 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-07-12 19:05:04,850 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 19:05:04,851 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2022-07-12 19:05:04,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:05:04,851 INFO L85 PathProgramCache]: Analyzing trace with hash -526850106, now seen corresponding path program 1 times [2022-07-12 19:05:04,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:05:04,851 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [300526914] [2022-07-12 19:05:04,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:05:04,852 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:05:04,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:05:04,854 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) [2022-07-12 19:05:04,855 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-07-12 19:05:04,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:05:04,915 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-12 19:05:04,917 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:05:04,935 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 19:05:04,941 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 19:05:05,028 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:05:05,031 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:05:05,032 INFO L390 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 17 treesize of output 10 [2022-07-12 19:05:05,037 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:05:05,038 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2022-07-12 19:05: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. [2022-07-12 19:05:05,073 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 19:05:05,073 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:05:05,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [300526914] [2022-07-12 19:05:05,074 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [300526914] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:05:05,074 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:05:05,074 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-12 19:05:05,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238835812] [2022-07-12 19:05:05,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:05:05,074 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 19:05:05,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:05:05,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 19:05:05,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-12 19:05:05,075 INFO L87 Difference]: Start difference. First operand 135 states and 157 transitions. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:05:05,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:05:05,872 INFO L93 Difference]: Finished difference Result 254 states and 291 transitions. [2022-07-12 19:05:05,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-12 19:05:05,873 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-07-12 19:05:05,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:05:05,874 INFO L225 Difference]: With dead ends: 254 [2022-07-12 19:05:05,874 INFO L226 Difference]: Without dead ends: 254 [2022-07-12 19:05:05,874 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=119, Invalid=261, Unknown=0, NotChecked=0, Total=380 [2022-07-12 19:05:05,875 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 301 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 301 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-12 19:05:05,875 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [301 Valid, 406 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-12 19:05:05,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2022-07-12 19:05:05,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 144. [2022-07-12 19:05:05,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 121 states have (on average 1.3884297520661157) internal successors, (168), 143 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:05:05,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 168 transitions. [2022-07-12 19:05:05,879 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 168 transitions. Word has length 20 [2022-07-12 19:05:05,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:05:05,879 INFO L495 AbstractCegarLoop]: Abstraction has 144 states and 168 transitions. [2022-07-12 19:05:05,879 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:05:05,879 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 168 transitions. [2022-07-12 19:05:05,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-12 19:05:05,880 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:05:05,880 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:05:05,894 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2022-07-12 19:05:06,093 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 19:05:06,094 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2022-07-12 19:05:06,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:05:06,095 INFO L85 PathProgramCache]: Analyzing trace with hash 213685580, now seen corresponding path program 1 times [2022-07-12 19:05:06,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:05:06,095 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [284646508] [2022-07-12 19:05:06,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:05:06,096 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:05:06,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:05:06,097 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) [2022-07-12 19:05:06,100 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-07-12 19:05:06,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:05:06,205 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-12 19:05:06,212 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:05:06,217 INFO L390 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 [2022-07-12 19:05:06,229 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 19:05:06,248 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2022-07-12 19:05:06,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:05:06,257 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 19:05:06,257 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:05:06,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [284646508] [2022-07-12 19:05:06,257 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [284646508] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:05:06,257 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:05:06,257 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 19:05:06,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288837334] [2022-07-12 19:05:06,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:05:06,258 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 19:05:06,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:05:06,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 19:05:06,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 19:05:06,259 INFO L87 Difference]: Start difference. First operand 144 states and 168 transitions. Second operand has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:05:06,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:05:06,640 INFO L93 Difference]: Finished difference Result 149 states and 174 transitions. [2022-07-12 19:05:06,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 19:05:06,640 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-07-12 19:05:06,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:05:06,641 INFO L225 Difference]: With dead ends: 149 [2022-07-12 19:05:06,641 INFO L226 Difference]: Without dead ends: 149 [2022-07-12 19:05:06,641 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-12 19:05:06,642 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 7 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-12 19:05:06,642 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 271 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-12 19:05:06,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2022-07-12 19:05:06,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 143. [2022-07-12 19:05:06,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 121 states have (on average 1.3801652892561984) internal successors, (167), 142 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:05:06,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 167 transitions. [2022-07-12 19:05:06,645 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 167 transitions. Word has length 21 [2022-07-12 19:05:06,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:05:06,646 INFO L495 AbstractCegarLoop]: Abstraction has 143 states and 167 transitions. [2022-07-12 19:05:06,646 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:05:06,646 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 167 transitions. [2022-07-12 19:05:06,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-12 19:05:06,647 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:05:06,647 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:05:06,658 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2022-07-12 19:05:06,856 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 19:05:06,856 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2022-07-12 19:05:06,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:05:06,857 INFO L85 PathProgramCache]: Analyzing trace with hash 213685581, now seen corresponding path program 1 times [2022-07-12 19:05:06,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:05:06,857 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1403882509] [2022-07-12 19:05:06,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:05:06,857 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:05:06,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:05:06,858 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) [2022-07-12 19:05:06,859 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2022-07-12 19:05:06,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:05:06,956 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-12 19:05:06,958 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:05:06,964 INFO L390 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 [2022-07-12 19:05:06,980 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 19:05:06,987 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 19:05:07,018 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2022-07-12 19:05:07,022 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-07-12 19:05:07,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:05:07,043 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 19:05:07,043 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:05:07,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1403882509] [2022-07-12 19:05:07,043 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1403882509] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:05:07,043 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:05:07,043 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 19:05:07,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984653465] [2022-07-12 19:05:07,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:05:07,044 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 19:05:07,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:05:07,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 19:05:07,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 19:05:07,045 INFO L87 Difference]: Start difference. First operand 143 states and 167 transitions. Second operand has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:05:07,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:05:07,357 INFO L93 Difference]: Finished difference Result 142 states and 166 transitions. [2022-07-12 19:05:07,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 19:05:07,358 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-07-12 19:05:07,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:05:07,359 INFO L225 Difference]: With dead ends: 142 [2022-07-12 19:05:07,359 INFO L226 Difference]: Without dead ends: 142 [2022-07-12 19:05:07,359 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-12 19:05:07,360 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 2 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 19:05:07,360 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 263 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-12 19:05:07,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2022-07-12 19:05:07,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2022-07-12 19:05:07,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 121 states have (on average 1.371900826446281) internal successors, (166), 141 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:05:07,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 166 transitions. [2022-07-12 19:05:07,363 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 166 transitions. Word has length 21 [2022-07-12 19:05:07,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:05:07,363 INFO L495 AbstractCegarLoop]: Abstraction has 142 states and 166 transitions. [2022-07-12 19:05:07,363 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:05:07,363 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 166 transitions. [2022-07-12 19:05:07,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-12 19:05:07,364 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:05:07,364 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:05:07,377 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Ended with exit code 0 [2022-07-12 19:05:07,573 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 19:05:07,573 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2022-07-12 19:05:07,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:05:07,574 INFO L85 PathProgramCache]: Analyzing trace with hash -705595017, now seen corresponding path program 1 times [2022-07-12 19:05:07,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:05:07,574 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [543830571] [2022-07-12 19:05:07,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:05:07,574 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:05:07,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:05:07,576 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) [2022-07-12 19:05:07,577 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2022-07-12 19:05:07,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:05:07,636 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-12 19:05:07,637 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:05:07,656 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 19:05:07,660 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 19:05:07,750 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:05:07,753 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:05:07,753 INFO L390 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 17 treesize of output 10 [2022-07-12 19:05:07,760 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:05:07,760 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2022-07-12 19:05:07,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:05:07,783 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 19:05:07,783 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:05:07,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [543830571] [2022-07-12 19:05:07,784 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [543830571] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:05:07,784 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:05:07,784 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 19:05:07,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85419172] [2022-07-12 19:05:07,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:05:07,785 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 19:05:07,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:05:07,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 19:05:07,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-12 19:05:07,792 INFO L87 Difference]: Start difference. First operand 142 states and 166 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:05:08,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:05:08,270 INFO L93 Difference]: Finished difference Result 218 states and 248 transitions. [2022-07-12 19:05:08,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 19:05:08,270 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-07-12 19:05:08,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:05:08,271 INFO L225 Difference]: With dead ends: 218 [2022-07-12 19:05:08,271 INFO L226 Difference]: Without dead ends: 218 [2022-07-12 19:05:08,272 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2022-07-12 19:05:08,272 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 165 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-12 19:05:08,273 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 345 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-12 19:05:08,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2022-07-12 19:05:08,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 150. [2022-07-12 19:05:08,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 129 states have (on average 1.3488372093023255) internal successors, (174), 149 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:05:08,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 174 transitions. [2022-07-12 19:05:08,276 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 174 transitions. Word has length 22 [2022-07-12 19:05:08,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:05:08,276 INFO L495 AbstractCegarLoop]: Abstraction has 150 states and 174 transitions. [2022-07-12 19:05:08,276 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:05:08,276 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 174 transitions. [2022-07-12 19:05:08,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-12 19:05:08,277 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:05:08,277 INFO L195 NwaCegarLoop]: 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] [2022-07-12 19:05:08,287 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2022-07-12 19:05:08,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 19:05:08,483 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2022-07-12 19:05:08,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:05:08,484 INFO L85 PathProgramCache]: Analyzing trace with hash 887014990, now seen corresponding path program 1 times [2022-07-12 19:05:08,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:05:08,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [402826076] [2022-07-12 19:05:08,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:05:08,484 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:05:08,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:05:08,485 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) [2022-07-12 19:05:08,487 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2022-07-12 19:05:08,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:05:08,578 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 15 conjunts are in the unsatisfiable core [2022-07-12 19:05:08,580 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:05:08,598 INFO L356 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2022-07-12 19:05:08,599 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 21 [2022-07-12 19:05:08,677 INFO L356 Elim1Store]: treesize reduction 38, result has 39.7 percent of original size [2022-07-12 19:05:08,677 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 26 treesize of output 43 [2022-07-12 19:05:08,748 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 19:05:08,881 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 19:05:08,881 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 54 [2022-07-12 19:05:09,128 INFO L390 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 52 treesize of output 28 [2022-07-12 19:05:09,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:05:09,201 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 19:05:09,201 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:05:09,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [402826076] [2022-07-12 19:05:09,201 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [402826076] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:05:09,201 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:05:09,201 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 19:05:09,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212063349] [2022-07-12 19:05:09,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:05:09,202 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 19:05:09,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:05:09,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 19:05:09,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-07-12 19:05:09,202 INFO L87 Difference]: Start difference. First operand 150 states and 174 transitions. Second operand has 9 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:05:10,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:05:10,131 INFO L93 Difference]: Finished difference Result 239 states and 271 transitions. [2022-07-12 19:05:10,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-12 19:05:10,132 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-07-12 19:05:10,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:05:10,133 INFO L225 Difference]: With dead ends: 239 [2022-07-12 19:05:10,133 INFO L226 Difference]: Without dead ends: 239 [2022-07-12 19:05:10,133 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2022-07-12 19:05:10,134 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 301 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 301 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 80 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-12 19:05:10,134 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [301 Valid, 395 Invalid, 445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 342 Invalid, 0 Unknown, 80 Unchecked, 0.6s Time] [2022-07-12 19:05:10,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2022-07-12 19:05:10,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 162. [2022-07-12 19:05:10,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 141 states have (on average 1.3475177304964538) internal successors, (190), 161 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:05:10,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 190 transitions. [2022-07-12 19:05:10,137 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 190 transitions. Word has length 24 [2022-07-12 19:05:10,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:05:10,138 INFO L495 AbstractCegarLoop]: Abstraction has 162 states and 190 transitions. [2022-07-12 19:05:10,138 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:05:10,138 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 190 transitions. [2022-07-12 19:05:10,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-12 19:05:10,138 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:05:10,138 INFO L195 NwaCegarLoop]: 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] [2022-07-12 19:05:10,151 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2022-07-12 19:05:10,339 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 19:05:10,339 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2022-07-12 19:05:10,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:05:10,339 INFO L85 PathProgramCache]: Analyzing trace with hash 887014991, now seen corresponding path program 1 times [2022-07-12 19:05:10,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:05:10,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1002052270] [2022-07-12 19:05:10,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:05:10,340 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:05:10,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:05:10,341 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 19:05:10,343 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2022-07-12 19:05:10,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:05:10,433 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 21 conjunts are in the unsatisfiable core [2022-07-12 19:05:10,435 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:05:10,443 INFO L390 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 [2022-07-12 19:05:10,462 INFO L390 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 [2022-07-12 19:05:10,472 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 19:05:10,472 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-12 19:05:10,492 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 19:05:10,500 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 19:05:10,570 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 19:05:10,571 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-07-12 19:05:10,576 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-07-12 19:05:10,710 INFO L390 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 [2022-07-12 19:05:10,713 INFO L390 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 13 [2022-07-12 19:05:10,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:05:10,731 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 19:05:10,731 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:05:10,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1002052270] [2022-07-12 19:05:10,731 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1002052270] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:05:10,731 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:05:10,731 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 19:05:10,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22835333] [2022-07-12 19:05:10,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:05:10,732 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 19:05:10,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:05:10,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 19:05:10,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-12 19:05:10,733 INFO L87 Difference]: Start difference. First operand 162 states and 190 transitions. Second operand has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 8 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:05:11,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:05:11,746 INFO L93 Difference]: Finished difference Result 246 states and 280 transitions. [2022-07-12 19:05:11,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-12 19:05:11,747 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 8 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-07-12 19:05:11,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:05:11,748 INFO L225 Difference]: With dead ends: 246 [2022-07-12 19:05:11,748 INFO L226 Difference]: Without dead ends: 246 [2022-07-12 19:05:11,748 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2022-07-12 19:05:11,749 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 196 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 458 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 475 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 458 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-12 19:05:11,749 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 408 Invalid, 475 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 458 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-07-12 19:05:11,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2022-07-12 19:05:11,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 162. [2022-07-12 19:05:11,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 141 states have (on average 1.3404255319148937) internal successors, (189), 161 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:05:11,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 189 transitions. [2022-07-12 19:05:11,751 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 189 transitions. Word has length 24 [2022-07-12 19:05:11,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:05:11,752 INFO L495 AbstractCegarLoop]: Abstraction has 162 states and 189 transitions. [2022-07-12 19:05:11,752 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 8 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:05:11,752 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 189 transitions. [2022-07-12 19:05:11,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-12 19:05:11,752 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:05:11,752 INFO L195 NwaCegarLoop]: 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] [2022-07-12 19:05:11,763 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2022-07-12 19:05:11,955 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 19:05:11,956 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2022-07-12 19:05:11,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:05:11,956 INFO L85 PathProgramCache]: Analyzing trace with hash 809096703, now seen corresponding path program 1 times [2022-07-12 19:05:11,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:05:11,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2030668218] [2022-07-12 19:05:11,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:05:11,957 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:05:11,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:05:11,958 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 19:05:11,960 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2022-07-12 19:05:12,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:05:12,061 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 18 conjunts are in the unsatisfiable core [2022-07-12 19:05:12,063 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:05:12,066 INFO L390 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 [2022-07-12 19:05:12,076 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 19:05:12,096 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 19:05:12,096 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-12 19:05:12,126 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-07-12 19:05:12,126 INFO L390 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 23 treesize of output 22 [2022-07-12 19:05:12,132 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 19:05:12,168 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2022-07-12 19:05:12,199 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-12 19:05:12,246 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-07-12 19:05:12,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:05:12,280 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 19:05:12,280 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:05:12,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2030668218] [2022-07-12 19:05:12,280 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2030668218] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:05:12,280 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:05:12,280 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-12 19:05:12,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013611216] [2022-07-12 19:05:12,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:05:12,281 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-12 19:05:12,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:05:12,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-12 19:05:12,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2022-07-12 19:05:12,281 INFO L87 Difference]: Start difference. First operand 162 states and 189 transitions. Second operand has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:05:13,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:05:13,526 INFO L93 Difference]: Finished difference Result 242 states and 272 transitions. [2022-07-12 19:05:13,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-12 19:05:13,527 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-07-12 19:05:13,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:05:13,528 INFO L225 Difference]: With dead ends: 242 [2022-07-12 19:05:13,528 INFO L226 Difference]: Without dead ends: 242 [2022-07-12 19:05:13,528 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=112, Invalid=350, Unknown=0, NotChecked=0, Total=462 [2022-07-12 19:05:13,529 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 259 mSDsluCounter, 569 mSDsCounter, 0 mSdLazyCounter, 649 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 659 SdHoareTripleChecker+Invalid, 682 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 649 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-07-12 19:05:13,529 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 659 Invalid, 682 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 649 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-07-12 19:05:13,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2022-07-12 19:05:13,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 162. [2022-07-12 19:05:13,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 141 states have (on average 1.3333333333333333) internal successors, (188), 161 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:05:13,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 188 transitions. [2022-07-12 19:05:13,533 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 188 transitions. Word has length 26 [2022-07-12 19:05:13,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:05:13,533 INFO L495 AbstractCegarLoop]: Abstraction has 162 states and 188 transitions. [2022-07-12 19:05:13,533 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:05:13,533 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 188 transitions. [2022-07-12 19:05:13,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-12 19:05:13,534 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:05:13,534 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:05:13,547 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2022-07-12 19:05:13,745 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 19:05:13,745 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2022-07-12 19:05:13,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:05:13,746 INFO L85 PathProgramCache]: Analyzing trace with hash 748762178, now seen corresponding path program 1 times [2022-07-12 19:05:13,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:05:13,746 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [228786269] [2022-07-12 19:05:13,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:05:13,746 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:05:13,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:05:13,748 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 19:05:13,751 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2022-07-12 19:05:13,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:05:13,836 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 21 conjunts are in the unsatisfiable core [2022-07-12 19:05:13,839 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:05:13,844 INFO L390 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 [2022-07-12 19:05:13,849 INFO L390 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 [2022-07-12 19:05:13,877 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-07-12 19:05:13,878 INFO L390 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 21 treesize of output 20 [2022-07-12 19:05:13,883 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:05:13,884 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-12 19:05:13,897 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-07-12 19:05:13,897 INFO L390 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 21 treesize of output 20 [2022-07-12 19:05:13,901 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:05:13,902 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-12 19:05:13,971 INFO L390 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 [2022-07-12 19:05:13,973 INFO L390 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 [2022-07-12 19:05:13,994 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:05:13,994 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:05:14,067 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:05:14,067 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:05:14,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [228786269] [2022-07-12 19:05:14,067 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [228786269] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 19:05:14,068 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 19:05:14,068 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2022-07-12 19:05:14,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223391632] [2022-07-12 19:05:14,068 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 19:05:14,068 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 19:05:14,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:05:14,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 19:05:14,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 19:05:14,069 INFO L87 Difference]: Start difference. First operand 162 states and 188 transitions. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:05:14,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:05:14,555 INFO L93 Difference]: Finished difference Result 203 states and 232 transitions. [2022-07-12 19:05:14,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 19:05:14,556 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-07-12 19:05:14,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:05:14,557 INFO L225 Difference]: With dead ends: 203 [2022-07-12 19:05:14,557 INFO L226 Difference]: Without dead ends: 203 [2022-07-12 19:05:14,557 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-07-12 19:05:14,558 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 80 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-12 19:05:14,558 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 265 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-12 19:05:14,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2022-07-12 19:05:14,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 175. [2022-07-12 19:05:14,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 154 states have (on average 1.3181818181818181) internal successors, (203), 174 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:05:14,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 203 transitions. [2022-07-12 19:05:14,561 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 203 transitions. Word has length 26 [2022-07-12 19:05:14,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:05:14,562 INFO L495 AbstractCegarLoop]: Abstraction has 175 states and 203 transitions. [2022-07-12 19:05:14,562 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:05:14,562 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 203 transitions. [2022-07-12 19:05:14,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-12 19:05:14,562 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:05:14,562 INFO L195 NwaCegarLoop]: 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] [2022-07-12 19:05:14,573 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2022-07-12 19:05:14,763 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 19:05:14,763 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2022-07-12 19:05:14,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:05:14,764 INFO L85 PathProgramCache]: Analyzing trace with hash 1851942844, now seen corresponding path program 1 times [2022-07-12 19:05:14,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:05:14,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1970939977] [2022-07-12 19:05:14,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:05:14,764 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:05:14,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:05:14,766 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 19:05:14,799 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2022-07-12 19:05:14,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:05:14,870 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-12 19:05:14,871 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:05:15,036 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-07-12 19:05:15,040 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-07-12 19:05:15,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:05:15,069 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 19:05:15,069 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:05:15,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1970939977] [2022-07-12 19:05:15,069 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1970939977] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:05:15,069 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:05:15,069 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-12 19:05:15,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625246891] [2022-07-12 19:05:15,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:05:15,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-12 19:05:15,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:05:15,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-12 19:05:15,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-07-12 19:05:15,071 INFO L87 Difference]: Start difference. First operand 175 states and 203 transitions. Second operand has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:05:15,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:05:15,743 INFO L93 Difference]: Finished difference Result 212 states and 235 transitions. [2022-07-12 19:05:15,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-12 19:05:15,743 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-07-12 19:05:15,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:05:15,744 INFO L225 Difference]: With dead ends: 212 [2022-07-12 19:05:15,744 INFO L226 Difference]: Without dead ends: 212 [2022-07-12 19:05:15,744 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=118, Invalid=262, Unknown=0, NotChecked=0, Total=380 [2022-07-12 19:05:15,748 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 194 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 19:05:15,748 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 300 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-12 19:05:15,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2022-07-12 19:05:15,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 177. [2022-07-12 19:05:15,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 156 states have (on average 1.314102564102564) internal successors, (205), 176 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:05:15,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 205 transitions. [2022-07-12 19:05:15,757 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 205 transitions. Word has length 28 [2022-07-12 19:05:15,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:05:15,757 INFO L495 AbstractCegarLoop]: Abstraction has 177 states and 205 transitions. [2022-07-12 19:05:15,758 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:05:15,758 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 205 transitions. [2022-07-12 19:05:15,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-12 19:05:15,758 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:05:15,758 INFO L195 NwaCegarLoop]: 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] [2022-07-12 19:05:15,767 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2022-07-12 19:05:15,963 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 19:05:15,964 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2022-07-12 19:05:15,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:05:15,964 INFO L85 PathProgramCache]: Analyzing trace with hash 1693052079, now seen corresponding path program 1 times [2022-07-12 19:05:15,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:05:15,965 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [390246855] [2022-07-12 19:05:15,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:05:15,965 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:05:15,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:05:15,966 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 19:05:15,967 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2022-07-12 19:05:16,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:05:16,093 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 26 conjunts are in the unsatisfiable core [2022-07-12 19:05:16,095 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:05:16,099 INFO L390 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 [2022-07-12 19:05:16,117 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 19:05:16,134 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:05:16,135 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-12 19:05:16,165 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 19:05:16,165 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-12 19:05:16,199 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 19:05:16,204 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:05:16,204 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-12 19:05:16,236 INFO L390 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 [2022-07-12 19:05:16,273 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-12 19:05:16,293 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-12 19:05:16,302 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-12 19:05:16,336 INFO L390 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 [2022-07-12 19:05:16,362 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:05:16,362 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:05:16,422 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_605 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_605) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv8 32))) (_ bv2 32)))) is different from false [2022-07-12 19:05:16,458 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_605 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv2 32) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_605) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv8 32)))))) is different from false [2022-07-12 19:05:16,470 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_605 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv2 32) (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_605) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv8 32)))))) is different from false [2022-07-12 19:05:16,486 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_602 (_ BitVec 32)) (v_ArrVal_605 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv2 32) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_602)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_605) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv8 32)))))) is different from false [2022-07-12 19:05:16,572 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_6| (_ BitVec 32)) (v_ArrVal_602 (_ BitVec 32)) (v_ArrVal_605 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv2 32) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~head~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| v_ArrVal_602)) |v_ULTIMATE.start_main_#t~malloc7#1.base_6| v_ArrVal_605) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv8 32))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_6|) (_ bv0 1))))) is different from false [2022-07-12 19:05:16,585 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_6| (_ BitVec 32)) (v_ArrVal_602 (_ BitVec 32)) (v_ArrVal_605 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_597 (_ BitVec 32))) (or (not (= (_ bv2 32) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~head~0#1.base| (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv4 32)) v_ArrVal_597) |c_ULTIMATE.start_main_~head~0#1.offset| v_ArrVal_602)) |v_ULTIMATE.start_main_#t~malloc7#1.base_6| v_ArrVal_605) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv8 32))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_6|) (_ bv0 1))))) is different from false [2022-07-12 19:05:16,622 INFO L356 Elim1Store]: treesize reduction 78, result has 27.1 percent of original size [2022-07-12 19:05:16,622 INFO L390 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 1 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 42 [2022-07-12 19:05:16,627 INFO L390 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 39 treesize of output 27 [2022-07-12 19:05:16,634 INFO L390 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 4 [2022-07-12 19:05:16,659 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:05:16,659 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:05:16,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [390246855] [2022-07-12 19:05:16,659 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [390246855] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 19:05:16,659 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 19:05:16,659 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 24 [2022-07-12 19:05:16,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668242164] [2022-07-12 19:05:16,660 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 19:05:16,660 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-07-12 19:05:16,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:05:16,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-07-12 19:05:16,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=247, Unknown=9, NotChecked=222, Total=552 [2022-07-12 19:05:16,661 INFO L87 Difference]: Start difference. First operand 177 states and 205 transitions. Second operand has 24 states, 24 states have (on average 2.1666666666666665) internal successors, (52), 24 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:05:17,924 WARN L833 $PredicateComparison]: unable to prove that (and (not (= (_ bv2 32) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~x~0#1.offset|)))) (forall ((v_ArrVal_605 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_605) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv8 32))) (_ bv2 32))))) is different from false [2022-07-12 19:05:18,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:05:18,488 INFO L93 Difference]: Finished difference Result 490 states and 550 transitions. [2022-07-12 19:05:18,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-07-12 19:05:18,489 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.1666666666666665) internal successors, (52), 24 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-07-12 19:05:18,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:05:18,491 INFO L225 Difference]: With dead ends: 490 [2022-07-12 19:05:18,491 INFO L226 Difference]: Without dead ends: 490 [2022-07-12 19:05:18,491 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 36 SyntacticMatches, 9 SemanticMatches, 41 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 258 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=292, Invalid=984, Unknown=12, NotChecked=518, Total=1806 [2022-07-12 19:05:18,492 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 493 mSDsluCounter, 856 mSDsCounter, 0 mSdLazyCounter, 858 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 493 SdHoareTripleChecker+Valid, 918 SdHoareTripleChecker+Invalid, 2678 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 858 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1742 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-07-12 19:05:18,492 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [493 Valid, 918 Invalid, 2678 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 858 Invalid, 0 Unknown, 1742 Unchecked, 1.2s Time] [2022-07-12 19:05:18,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2022-07-12 19:05:18,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 204. [2022-07-12 19:05:18,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 183 states have (on average 1.3005464480874316) internal successors, (238), 203 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:05:18,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 238 transitions. [2022-07-12 19:05:18,498 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 238 transitions. Word has length 30 [2022-07-12 19:05:18,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:05:18,498 INFO L495 AbstractCegarLoop]: Abstraction has 204 states and 238 transitions. [2022-07-12 19:05:18,498 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.1666666666666665) internal successors, (52), 24 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:05:18,499 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 238 transitions. [2022-07-12 19:05:18,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-12 19:05:18,499 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:05:18,499 INFO L195 NwaCegarLoop]: 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] [2022-07-12 19:05:18,512 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2022-07-12 19:05:18,709 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 19:05:18,710 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2022-07-12 19:05:18,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:05:18,710 INFO L85 PathProgramCache]: Analyzing trace with hash 1418753207, now seen corresponding path program 1 times [2022-07-12 19:05:18,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:05:18,711 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2135082880] [2022-07-12 19:05:18,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:05:18,711 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:05:18,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:05:18,713 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 19:05:18,716 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2022-07-12 19:05:18,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:05:18,869 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 26 conjunts are in the unsatisfiable core [2022-07-12 19:05:18,872 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:05:18,877 INFO L390 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 [2022-07-12 19:05:18,904 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 19:05:18,922 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:05:18,924 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-12 19:05:18,961 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 19:05:18,962 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-12 19:05:18,992 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 19:05:18,998 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:05:18,999 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-12 19:05:19,032 INFO L390 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 [2022-07-12 19:05:19,078 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-12 19:05:19,096 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-12 19:05:19,111 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-12 19:05:19,156 INFO L390 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 [2022-07-12 19:05:19,189 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:05:19,189 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:05:19,255 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_663 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv2 32) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_663) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv8 32)))))) is different from false [2022-07-12 19:05:19,277 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_663 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv2 32) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_663) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv8 32)))))) is different from false [2022-07-12 19:05:19,285 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_663 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_663) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv8 32))) (_ bv2 32)))) is different from false [2022-07-12 19:05:19,302 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_663 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_657 (_ BitVec 32))) (not (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_657)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_663) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv8 32))) (_ bv2 32)))) is different from false [2022-07-12 19:05:19,391 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_9| (_ BitVec 32)) (v_ArrVal_663 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_657 (_ BitVec 32))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_9|) (_ bv0 1))) (not (= (_ bv2 32) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~head~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| v_ArrVal_657)) |v_ULTIMATE.start_main_#t~malloc7#1.base_9| v_ArrVal_663) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv8 32))))))) is different from false [2022-07-12 19:05:19,406 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_9| (_ BitVec 32)) (v_ArrVal_663 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_657 (_ BitVec 32)) (v_ArrVal_656 (_ BitVec 32))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_9|) (_ bv0 1))) (not (= (_ bv2 32) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~head~0#1.base| (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv4 32)) v_ArrVal_656) |c_ULTIMATE.start_main_~head~0#1.offset| v_ArrVal_657)) |v_ULTIMATE.start_main_#t~malloc7#1.base_9| v_ArrVal_663) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv8 32))))))) is different from false [2022-07-12 19:05:19,448 INFO L356 Elim1Store]: treesize reduction 78, result has 27.1 percent of original size [2022-07-12 19:05:19,449 INFO L390 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 1 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 42 [2022-07-12 19:05:19,452 INFO L390 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 39 treesize of output 27 [2022-07-12 19:05:19,455 INFO L390 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 4 [2022-07-12 19:05:19,485 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:05:19,486 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:05:19,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2135082880] [2022-07-12 19:05:19,486 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2135082880] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 19:05:19,486 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 19:05:19,486 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 24 [2022-07-12 19:05:19,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480942203] [2022-07-12 19:05:19,486 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 19:05:19,486 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-07-12 19:05:19,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:05:19,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-07-12 19:05:19,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=246, Unknown=10, NotChecked=222, Total=552 [2022-07-12 19:05:19,487 INFO L87 Difference]: Start difference. First operand 204 states and 238 transitions. Second operand has 24 states, 24 states have (on average 2.1666666666666665) internal successors, (52), 24 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:05:20,879 WARN L833 $PredicateComparison]: unable to prove that (and (= (_ bv1 1) (select |c_#valid| |c_ULTIMATE.start_main_~head~0#1.base|)) (not (= (_ bv2 32) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~x~0#1.offset|)))) (forall ((v_ArrVal_663 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_663) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv8 32))) (_ bv2 32)))) (= |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv0 32))) is different from false [2022-07-12 19:05:21,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:05:21,728 INFO L93 Difference]: Finished difference Result 541 states and 610 transitions. [2022-07-12 19:05:21,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-07-12 19:05:21,729 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.1666666666666665) internal successors, (52), 24 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-07-12 19:05:21,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:05:21,731 INFO L225 Difference]: With dead ends: 541 [2022-07-12 19:05:21,731 INFO L226 Difference]: Without dead ends: 541 [2022-07-12 19:05:21,732 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 38 SyntacticMatches, 7 SemanticMatches, 43 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 298 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=325, Invalid=1096, Unknown=13, NotChecked=546, Total=1980 [2022-07-12 19:05:21,732 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 451 mSDsluCounter, 935 mSDsCounter, 0 mSdLazyCounter, 1065 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 451 SdHoareTripleChecker+Valid, 1026 SdHoareTripleChecker+Invalid, 2434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 1065 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1291 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-07-12 19:05:21,732 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [451 Valid, 1026 Invalid, 2434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 1065 Invalid, 0 Unknown, 1291 Unchecked, 1.5s Time] [2022-07-12 19:05:21,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2022-07-12 19:05:21,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 202. [2022-07-12 19:05:21,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 181 states have (on average 1.298342541436464) internal successors, (235), 201 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:05:21,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 235 transitions. [2022-07-12 19:05:21,738 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 235 transitions. Word has length 30 [2022-07-12 19:05:21,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:05:21,738 INFO L495 AbstractCegarLoop]: Abstraction has 202 states and 235 transitions. [2022-07-12 19:05:21,739 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.1666666666666665) internal successors, (52), 24 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:05:21,739 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 235 transitions. [2022-07-12 19:05:21,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-07-12 19:05:21,739 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:05:21,739 INFO L195 NwaCegarLoop]: 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] [2022-07-12 19:05:21,755 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Forceful destruction successful, exit code 0 [2022-07-12 19:05:21,949 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 19:05:21,950 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2022-07-12 19:05:21,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:05:21,950 INFO L85 PathProgramCache]: Analyzing trace with hash 753554603, now seen corresponding path program 1 times [2022-07-12 19:05:21,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:05:21,950 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [359428953] [2022-07-12 19:05:21,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:05:21,951 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:05:21,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:05:21,952 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 19:05:21,952 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2022-07-12 19:05:22,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:05:22,060 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 24 conjunts are in the unsatisfiable core [2022-07-12 19:05:22,062 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:05:22,064 INFO L390 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 [2022-07-12 19:05:22,075 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 19:05:22,075 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-12 19:05:22,083 INFO L390 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 6 treesize of output 5 [2022-07-12 19:05:22,087 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 19:05:22,143 INFO L356 Elim1Store]: treesize reduction 43, result has 17.3 percent of original size [2022-07-12 19:05:22,143 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 47 [2022-07-12 19:05:22,148 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 39 [2022-07-12 19:05:22,353 INFO L356 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2022-07-12 19:05:22,354 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 87 treesize of output 40 [2022-07-12 19:05:22,359 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 10 [2022-07-12 19:05:22,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:05:22,415 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 19:05:22,415 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:05:22,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [359428953] [2022-07-12 19:05:22,415 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [359428953] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:05:22,415 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:05:22,415 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-07-12 19:05:22,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63408746] [2022-07-12 19:05:22,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:05:22,416 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-12 19:05:22,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:05:22,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-12 19:05:22,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2022-07-12 19:05:22,416 INFO L87 Difference]: Start difference. First operand 202 states and 235 transitions. Second operand has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:05:23,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:05:23,689 INFO L93 Difference]: Finished difference Result 283 states and 317 transitions. [2022-07-12 19:05:23,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-12 19:05:23,690 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-07-12 19:05:23,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:05:23,691 INFO L225 Difference]: With dead ends: 283 [2022-07-12 19:05:23,691 INFO L226 Difference]: Without dead ends: 283 [2022-07-12 19:05:23,691 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=120, Invalid=530, Unknown=0, NotChecked=0, Total=650 [2022-07-12 19:05:23,692 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 157 mSDsluCounter, 627 mSDsCounter, 0 mSdLazyCounter, 648 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 708 SdHoareTripleChecker+Invalid, 744 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 648 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 76 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-07-12 19:05:23,692 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 708 Invalid, 744 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 648 Invalid, 0 Unknown, 76 Unchecked, 1.0s Time] [2022-07-12 19:05:23,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2022-07-12 19:05:23,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 199. [2022-07-12 19:05:23,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 178 states have (on average 1.2921348314606742) internal successors, (230), 198 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:05:23,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 230 transitions. [2022-07-12 19:05:23,696 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 230 transitions. Word has length 31 [2022-07-12 19:05:23,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:05:23,696 INFO L495 AbstractCegarLoop]: Abstraction has 199 states and 230 transitions. [2022-07-12 19:05:23,696 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:05:23,696 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 230 transitions. [2022-07-12 19:05:23,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-12 19:05:23,697 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:05:23,697 INFO L195 NwaCegarLoop]: 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] [2022-07-12 19:05:23,710 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Forceful destruction successful, exit code 0 [2022-07-12 19:05:23,907 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 19:05:23,907 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2022-07-12 19:05:23,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:05:23,907 INFO L85 PathProgramCache]: Analyzing trace with hash -1978341344, now seen corresponding path program 1 times [2022-07-12 19:05:23,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:05:23,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [369017560] [2022-07-12 19:05:23,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:05:23,908 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:05:23,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:05:23,909 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 19:05:23,911 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2022-07-12 19:05:24,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:05:24,062 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 31 conjunts are in the unsatisfiable core [2022-07-12 19:05:24,068 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:05:24,072 INFO L390 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 [2022-07-12 19:05:24,092 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 19:05:24,096 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 19:05:24,157 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 19:05:24,157 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-12 19:05:24,184 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:05:24,185 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-12 19:05:24,191 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:05:24,191 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-12 19:05:24,298 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 19:05:24,298 INFO L390 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 16 treesize of output 22 [2022-07-12 19:05:24,305 INFO L390 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 7 treesize of output 3 [2022-07-12 19:05:24,336 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 19:05:24,336 INFO L390 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 31 treesize of output 29 [2022-07-12 19:05:24,398 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 19:05:24,398 INFO L390 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 16 treesize of output 22 [2022-07-12 19:05:24,405 INFO L390 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 7 treesize of output 3 [2022-07-12 19:05:24,418 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 19:05:24,418 INFO L390 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 31 treesize of output 29 [2022-07-12 19:05:24,451 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 19:05:24,451 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2022-07-12 19:05:24,455 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-07-12 19:05:24,585 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:05:24,586 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:05:24,589 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:05:24,589 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 14 [2022-07-12 19:05:24,595 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:05:24,596 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2022-07-12 19:05:24,644 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:05:24,644 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:05:24,780 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_759 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_759) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv4 32))))) (forall ((v_ArrVal_760 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~head~0#1.offset| (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_760) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv4 32)))))) is different from false [2022-07-12 19:05:24,818 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_760 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~head~0#1.offset| (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_760) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv4 32))))) (forall ((v_ArrVal_759 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_759) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv4 32)))))) is different from false [2022-07-12 19:05:24,830 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_759 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_759) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv4 32))))) (forall ((v_ArrVal_760 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~head~0#1.offset| (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_760) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv4 32)))))) is different from false [2022-07-12 19:05:24,854 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_760 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_752 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~head~0#1.offset| (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_752)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_760) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv4 32))))) (forall ((v_ArrVal_759 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_#t~malloc7#1.base|)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_759) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv4 32)))))) is different from false [2022-07-12 19:05:25,164 INFO L356 Elim1Store]: treesize reduction 23, result has 45.2 percent of original size [2022-07-12 19:05:25,165 INFO L390 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 31 [2022-07-12 19:05:25,168 INFO L390 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 24 [2022-07-12 19:05:25,172 INFO L390 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 7 treesize of output 3 [2022-07-12 19:05:25,179 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:05:25,183 INFO L356 Elim1Store]: treesize reduction 41, result has 2.4 percent of original size [2022-07-12 19:05:25,183 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 1 [2022-07-12 19:05:25,221 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:05:25,221 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:05:25,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [369017560] [2022-07-12 19:05:25,221 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [369017560] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 19:05:25,221 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 19:05:25,221 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 23 [2022-07-12 19:05:25,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935163461] [2022-07-12 19:05:25,221 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 19:05:25,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-07-12 19:05:25,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:05:25,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-07-12 19:05:25,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=278, Unknown=11, NotChecked=148, Total=506 [2022-07-12 19:05:25,222 INFO L87 Difference]: Start difference. First operand 199 states and 230 transitions. Second operand has 23 states, 23 states have (on average 2.652173913043478) internal successors, (61), 23 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:05:26,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:05:26,916 INFO L93 Difference]: Finished difference Result 328 states and 364 transitions. [2022-07-12 19:05:26,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-12 19:05:26,917 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.652173913043478) internal successors, (61), 23 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-07-12 19:05:26,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:05:26,918 INFO L225 Difference]: With dead ends: 328 [2022-07-12 19:05:26,918 INFO L226 Difference]: Without dead ends: 328 [2022-07-12 19:05:26,918 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 41 SyntacticMatches, 6 SemanticMatches, 32 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=208, Invalid=667, Unknown=11, NotChecked=236, Total=1122 [2022-07-12 19:05:26,919 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 352 mSDsluCounter, 846 mSDsCounter, 0 mSdLazyCounter, 971 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 352 SdHoareTripleChecker+Valid, 932 SdHoareTripleChecker+Invalid, 1871 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 971 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 851 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-07-12 19:05:26,919 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [352 Valid, 932 Invalid, 1871 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 971 Invalid, 0 Unknown, 851 Unchecked, 1.2s Time] [2022-07-12 19:05:26,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2022-07-12 19:05:26,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 206. [2022-07-12 19:05:26,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 185 states have (on average 1.281081081081081) internal successors, (237), 205 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:05:26,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 237 transitions. [2022-07-12 19:05:26,924 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 237 transitions. Word has length 32 [2022-07-12 19:05:26,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:05:26,924 INFO L495 AbstractCegarLoop]: Abstraction has 206 states and 237 transitions. [2022-07-12 19:05:26,927 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.652173913043478) internal successors, (61), 23 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:05:26,928 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 237 transitions. [2022-07-12 19:05:26,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-07-12 19:05:26,928 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:05:26,928 INFO L195 NwaCegarLoop]: 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] [2022-07-12 19:05:26,941 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (25)] Forceful destruction successful, exit code 0 [2022-07-12 19:05:27,139 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 19:05:27,139 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2022-07-12 19:05:27,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:05:27,140 INFO L85 PathProgramCache]: Analyzing trace with hash -1630199823, now seen corresponding path program 1 times [2022-07-12 19:05:27,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:05:27,140 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [534578961] [2022-07-12 19:05:27,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:05:27,141 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:05:27,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:05:27,142 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 19:05:27,143 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2022-07-12 19:05:27,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:05:27,230 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-12 19:05:27,231 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:05:27,331 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 19:05:27,331 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 19:05:27,331 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:05:27,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [534578961] [2022-07-12 19:05:27,332 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [534578961] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:05:27,332 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:05:27,332 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 19:05:27,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811216614] [2022-07-12 19:05:27,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:05:27,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 19:05:27,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:05:27,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 19:05:27,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-12 19:05:27,333 INFO L87 Difference]: Start difference. First operand 206 states and 237 transitions. Second operand has 5 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:05:27,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:05:27,578 INFO L93 Difference]: Finished difference Result 227 states and 252 transitions. [2022-07-12 19:05:27,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 19:05:27,579 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2022-07-12 19:05:27,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:05:27,580 INFO L225 Difference]: With dead ends: 227 [2022-07-12 19:05:27,580 INFO L226 Difference]: Without dead ends: 227 [2022-07-12 19:05:27,580 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-07-12 19:05:27,581 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 185 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 19:05:27,581 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 129 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 19:05:27,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2022-07-12 19:05:27,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 208. [2022-07-12 19:05:27,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 187 states have (on average 1.2780748663101604) internal successors, (239), 207 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:05:27,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 239 transitions. [2022-07-12 19:05:27,593 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 239 transitions. Word has length 33 [2022-07-12 19:05:27,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:05:27,593 INFO L495 AbstractCegarLoop]: Abstraction has 208 states and 239 transitions. [2022-07-12 19:05:27,593 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:05:27,593 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 239 transitions. [2022-07-12 19:05:27,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-07-12 19:05:27,594 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:05:27,594 INFO L195 NwaCegarLoop]: 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] [2022-07-12 19:05:27,603 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (26)] Forceful destruction successful, exit code 0 [2022-07-12 19:05:27,803 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 19:05:27,804 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2022-07-12 19:05:27,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:05:27,805 INFO L85 PathProgramCache]: Analyzing trace with hash -1630210808, now seen corresponding path program 1 times [2022-07-12 19:05:27,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:05:27,805 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [912510971] [2022-07-12 19:05:27,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:05:27,805 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:05:27,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:05:27,807 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 19:05:27,808 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2022-07-12 19:05:27,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:05:27,897 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-12 19:05:27,898 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:05:28,003 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2022-07-12 19:05:28,016 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:05:28,016 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:05:28,110 INFO L356 Elim1Store]: treesize reduction 8, result has 46.7 percent of original size [2022-07-12 19:05:28,110 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 15 [2022-07-12 19:05:28,119 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:05:28,119 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:05:28,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [912510971] [2022-07-12 19:05:28,119 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [912510971] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 19:05:28,119 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 19:05:28,119 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2022-07-12 19:05:28,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507309123] [2022-07-12 19:05:28,120 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 19:05:28,120 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-12 19:05:28,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:05:28,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-12 19:05:28,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-07-12 19:05:28,120 INFO L87 Difference]: Start difference. First operand 208 states and 239 transitions. Second operand has 10 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:05:28,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:05:28,835 INFO L93 Difference]: Finished difference Result 298 states and 332 transitions. [2022-07-12 19:05:28,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-12 19:05:28,835 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2022-07-12 19:05:28,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:05:28,836 INFO L225 Difference]: With dead ends: 298 [2022-07-12 19:05:28,836 INFO L226 Difference]: Without dead ends: 298 [2022-07-12 19:05:28,837 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=195, Unknown=0, NotChecked=0, Total=272 [2022-07-12 19:05:28,837 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 262 mSDsluCounter, 410 mSDsCounter, 0 mSdLazyCounter, 358 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 492 SdHoareTripleChecker+Invalid, 404 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-12 19:05:28,837 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [262 Valid, 492 Invalid, 404 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 358 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-12 19:05:28,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2022-07-12 19:05:28,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 257. [2022-07-12 19:05:28,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 236 states have (on average 1.2796610169491525) internal successors, (302), 256 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:05:28,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 302 transitions. [2022-07-12 19:05:28,842 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 302 transitions. Word has length 33 [2022-07-12 19:05:28,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:05:28,843 INFO L495 AbstractCegarLoop]: Abstraction has 257 states and 302 transitions. [2022-07-12 19:05:28,843 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:05:28,843 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 302 transitions. [2022-07-12 19:05:28,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-12 19:05:28,843 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:05:28,844 INFO L195 NwaCegarLoop]: 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] [2022-07-12 19:05:28,854 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (27)] Forceful destruction successful, exit code 0 [2022-07-12 19:05:29,052 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 19:05:29,053 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2022-07-12 19:05:29,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:05:29,053 INFO L85 PathProgramCache]: Analyzing trace with hash 1399931191, now seen corresponding path program 1 times [2022-07-12 19:05:29,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:05:29,053 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1799806673] [2022-07-12 19:05:29,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:05:29,054 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:05:29,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:05:29,055 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 19:05:29,057 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2022-07-12 19:05:29,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:05:29,250 INFO L263 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 28 conjunts are in the unsatisfiable core [2022-07-12 19:05:29,252 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:05:29,255 INFO L390 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 [2022-07-12 19:05:29,284 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-12 19:05:29,284 INFO L390 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 17 treesize of output 24 [2022-07-12 19:05:29,305 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 19:05:29,374 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 19:05:29,375 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 35 [2022-07-12 19:05:29,456 INFO L356 Elim1Store]: treesize reduction 48, result has 43.5 percent of original size [2022-07-12 19:05:29,456 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 31 treesize of output 54 [2022-07-12 19:05:29,506 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:05:29,507 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 32 [2022-07-12 19:05:29,675 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 19:05:29,675 INFO L390 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 59 treesize of output 51 [2022-07-12 19:05:29,732 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 19:05:29,733 INFO L390 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 59 treesize of output 51 [2022-07-12 19:05:29,768 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 19:05:29,768 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 51 [2022-07-12 19:05:29,982 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 23 [2022-07-12 19:05:30,011 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:05:30,011 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:05:30,090 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_865 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_865) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv4 32)))))) is different from false [2022-07-12 19:05:30,153 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_865 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_865) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv4 32)))) (_ bv1 1))) is different from false [2022-07-12 19:05:30,170 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_865 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select |c_#valid| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_#t~malloc7#1.base|)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_865) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv4 32)))) (_ bv1 1))) is different from false [2022-07-12 19:05:30,184 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_15| (_ BitVec 32)) (v_ArrVal_860 (_ BitVec 1)) (v_ArrVal_865 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_15|) (_ bv0 1))) (= (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_15| v_ArrVal_860) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |v_ULTIMATE.start_main_#t~malloc7#1.base_15|)) |v_ULTIMATE.start_main_#t~malloc7#1.base_15| v_ArrVal_865) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv4 32)))) (_ bv1 1)))) is different from false [2022-07-12 19:05:30,199 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_15| (_ BitVec 32)) (v_ArrVal_860 (_ BitVec 1)) (v_ArrVal_865 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_15|) (_ bv0 1))) (= (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_15| v_ArrVal_860) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_#t~malloc7#1.base_15|)) |v_ULTIMATE.start_main_#t~malloc7#1.base_15| v_ArrVal_865) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv4 32)))) (_ bv1 1)))) is different from false [2022-07-12 19:05:30,217 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_15| (_ BitVec 32)) (v_ArrVal_860 (_ BitVec 1)) (v_ArrVal_859 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_865 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_15|) (_ bv0 1))) (= (_ bv1 1) (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_15| v_ArrVal_860) (select (select (store (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_859))) (store .cse0 |c_ULTIMATE.start_main_~head~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_#t~malloc7#1.base_15|))) |v_ULTIMATE.start_main_#t~malloc7#1.base_15| v_ArrVal_865) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv4 32))))))) is different from false [2022-07-12 19:05:30,230 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_15| (_ BitVec 32)) (v_ArrVal_860 (_ BitVec 1)) (v_ArrVal_859 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_865 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_15|) (_ bv0 1))) (= (_ bv1 1) (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_15| v_ArrVal_860) (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv4 32)))) (select (select (store (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) v_ArrVal_859))) (store .cse0 |c_ULTIMATE.start_main_~head~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_#t~malloc7#1.base_15|))) |v_ULTIMATE.start_main_#t~malloc7#1.base_15| v_ArrVal_865) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1)))))) is different from false [2022-07-12 19:05:30,252 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:05:30,253 INFO L390 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 42 [2022-07-12 19:05:30,255 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:05:30,258 INFO L390 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 34 [2022-07-12 19:05:30,262 INFO L390 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 16 treesize of output 12 [2022-07-12 19:05:32,474 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-07-12 19:05:32,475 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:05:32,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1799806673] [2022-07-12 19:05:32,475 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1799806673] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 19:05:32,475 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 19:05:32,475 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 26 [2022-07-12 19:05:32,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126892240] [2022-07-12 19:05:32,476 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 19:05:32,476 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-07-12 19:05:32,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:05:32,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-07-12 19:05:32,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=302, Unknown=8, NotChecked=294, Total=702 [2022-07-12 19:05:32,477 INFO L87 Difference]: Start difference. First operand 257 states and 302 transitions. Second operand has 27 states, 26 states have (on average 2.576923076923077) internal successors, (67), 27 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:05:34,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:05:34,405 INFO L93 Difference]: Finished difference Result 418 states and 495 transitions. [2022-07-12 19:05:34,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-12 19:05:34,406 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.576923076923077) internal successors, (67), 27 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-07-12 19:05:34,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:05:34,407 INFO L225 Difference]: With dead ends: 418 [2022-07-12 19:05:34,407 INFO L226 Difference]: Without dead ends: 418 [2022-07-12 19:05:34,408 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 41 SyntacticMatches, 10 SemanticMatches, 34 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 235 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=208, Invalid=624, Unknown=8, NotChecked=420, Total=1260 [2022-07-12 19:05:34,408 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 228 mSDsluCounter, 1109 mSDsCounter, 0 mSdLazyCounter, 886 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 1236 SdHoareTripleChecker+Invalid, 2367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 886 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1443 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-07-12 19:05:34,408 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 1236 Invalid, 2367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 886 Invalid, 0 Unknown, 1443 Unchecked, 1.4s Time] [2022-07-12 19:05:34,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2022-07-12 19:05:34,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 280. [2022-07-12 19:05:34,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 259 states have (on average 1.277992277992278) internal successors, (331), 279 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:05:34,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 331 transitions. [2022-07-12 19:05:34,414 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 331 transitions. Word has length 34 [2022-07-12 19:05:34,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:05:34,414 INFO L495 AbstractCegarLoop]: Abstraction has 280 states and 331 transitions. [2022-07-12 19:05:34,414 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.576923076923077) internal successors, (67), 27 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:05:34,415 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 331 transitions. [2022-07-12 19:05:34,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-12 19:05:34,415 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:05:34,415 INFO L195 NwaCegarLoop]: 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] [2022-07-12 19:05:34,429 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (28)] Forceful destruction successful, exit code 0 [2022-07-12 19:05:34,626 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 19:05:34,626 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2022-07-12 19:05:34,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:05:34,626 INFO L85 PathProgramCache]: Analyzing trace with hash 1399931192, now seen corresponding path program 1 times [2022-07-12 19:05:34,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:05:34,627 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1917214265] [2022-07-12 19:05:34,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:05:34,627 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:05:34,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:05:34,628 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 19:05:34,630 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (29)] Waiting until timeout for monitored process [2022-07-12 19:05:34,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:05:34,821 INFO L263 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 41 conjunts are in the unsatisfiable core [2022-07-12 19:05:34,823 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:05:34,827 INFO L390 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 [2022-07-12 19:05:34,859 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-12 19:05:34,860 INFO L390 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 17 treesize of output 24 [2022-07-12 19:05:34,868 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 19:05:34,892 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 19:05:34,900 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 19:05:34,991 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 19:05:34,991 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 57 [2022-07-12 19:05:34,996 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-07-12 19:05:35,089 INFO L356 Elim1Store]: treesize reduction 23, result has 47.7 percent of original size [2022-07-12 19:05:35,089 INFO L390 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 1 case distinctions, treesize of input 18 treesize of output 30 [2022-07-12 19:05:35,128 INFO L356 Elim1Store]: treesize reduction 8, result has 65.2 percent of original size [2022-07-12 19:05:35,128 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2022-07-12 19:05:35,201 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:05:35,202 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 30 [2022-07-12 19:05:35,226 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:05:35,227 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-12 19:05:35,390 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 19:05:35,391 INFO L390 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 16 treesize of output 22 [2022-07-12 19:05:35,396 INFO L390 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 7 treesize of output 3 [2022-07-12 19:05:35,413 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 19:05:35,414 INFO L390 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 57 treesize of output 49 [2022-07-12 19:05:35,507 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 19:05:35,508 INFO L390 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 57 treesize of output 49 [2022-07-12 19:05:35,527 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:05:35,528 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-12 19:05:35,554 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 19:05:35,554 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 57 [2022-07-12 19:05:35,560 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-07-12 19:05:35,812 INFO L390 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 [2022-07-12 19:05:35,816 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:05:35,816 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 21 [2022-07-12 19:05:35,839 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:05:35,839 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:05:36,095 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_938 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_938) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv4 32))))) (bvule .cse0 (bvadd (_ bv4 32) .cse0)))) (forall ((v_ArrVal_938 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_939 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv4 32)))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_938) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_939) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1)))))) is different from false [2022-07-12 19:05:36,148 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_938 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_938) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv4 32))))) (bvule .cse0 (bvadd (_ bv4 32) .cse0)))) (forall ((v_ArrVal_938 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_939 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv4 32)))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_938) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_939) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1)))))) is different from false [2022-07-12 19:05:36,185 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_938 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_939 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|)) (.cse1 (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv4 32)))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_938) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_939) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1))))) (forall ((v_ArrVal_938 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_938) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv4 32))))) (bvule .cse2 (bvadd (_ bv4 32) .cse2))))) is different from false [2022-07-12 19:05:36,231 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_938 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_931 (_ BitVec 32))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_931)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_938) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv4 32))))) (bvule .cse0 (bvadd (_ bv4 32) .cse0)))) (forall ((v_ArrVal_938 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_939 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_931 (_ BitVec 32))) (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv4 32)))) (bvule (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_931)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_938) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1)) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_#t~malloc7#1.base|)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_939) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1)))))) is different from false [2022-07-12 19:05:38,915 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_927 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc7#1.base_18| (_ BitVec 32)) (v_ArrVal_928 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_18|) (_ bv0 1))) (forall ((v_ArrVal_938 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_939 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_931 (_ BitVec 32)) (v_ArrVal_929 (_ BitVec 32))) (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv4 32)))) (bvule (bvadd (_ bv4 32) (select (select (store (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_928))) (store .cse0 |c_ULTIMATE.start_main_~head~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| v_ArrVal_931))) |v_ULTIMATE.start_main_#t~malloc7#1.base_18| v_ArrVal_938) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc7#1.base_18| v_ArrVal_929) (select (select (store (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_927))) (store .cse2 |c_ULTIMATE.start_main_~head~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_#t~malloc7#1.base_18|))) |v_ULTIMATE.start_main_#t~malloc7#1.base_18| v_ArrVal_939) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1))))))) (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_18| (_ BitVec 32)) (v_ArrVal_928 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_938 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_931 (_ BitVec 32))) (let ((.cse3 (select (select (store (let ((.cse4 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_928))) (store .cse4 |c_ULTIMATE.start_main_~head~0#1.base| (store (select .cse4 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| v_ArrVal_931))) |v_ULTIMATE.start_main_#t~malloc7#1.base_18| v_ArrVal_938) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv4 32))))) (bvule .cse3 (bvadd (_ bv4 32) .cse3)))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_18|) (_ bv0 1)))))) is different from false [2022-07-12 19:05:38,960 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_927 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc7#1.base_18| (_ BitVec 32)) (v_ArrVal_928 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_938 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_939 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_931 (_ BitVec 32)) (v_ArrVal_929 (_ BitVec 32))) (let ((.cse2 (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv4 32)))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (bvule (bvadd (_ bv4 32) (select (select (store (let ((.cse0 (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_928))) (store .cse0 |c_ULTIMATE.start_main_~head~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| v_ArrVal_931))) |v_ULTIMATE.start_main_#t~malloc7#1.base_18| v_ArrVal_938) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc7#1.base_18| v_ArrVal_929) (select (select (store (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_927))) (store .cse3 |c_ULTIMATE.start_main_~head~0#1.base| (store (select .cse3 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_#t~malloc7#1.base_18|))) |v_ULTIMATE.start_main_#t~malloc7#1.base_18| v_ArrVal_939) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_18|) (_ bv0 1))))) (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_18| (_ BitVec 32)) (v_ArrVal_928 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_938 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_931 (_ BitVec 32))) (let ((.cse4 (let ((.cse6 (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv4 32)))) (select (select (store (let ((.cse5 (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base|) .cse6) v_ArrVal_928))) (store .cse5 |c_ULTIMATE.start_main_~head~0#1.base| (store (select .cse5 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| v_ArrVal_931))) |v_ULTIMATE.start_main_#t~malloc7#1.base_18| v_ArrVal_938) |c_ULTIMATE.start_main_~head~0#1.base|) .cse6)))) (bvule .cse4 (bvadd (_ bv4 32) .cse4)))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_18|) (_ bv0 1)))))) is different from false [2022-07-12 19:05:39,015 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:05:39,016 INFO L390 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 96 treesize of output 87 [2022-07-12 19:05:39,030 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:05:39,030 INFO L390 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 76 treesize of output 67 [2022-07-12 19:05:39,034 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:05:39,038 INFO L390 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 96 treesize of output 84 [2022-07-12 19:05:39,042 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:05:39,044 INFO L390 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 108 treesize of output 90 [2022-07-12 19:05:39,055 INFO L390 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 46 treesize of output 38 [2022-07-12 19:05:39,059 INFO L390 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 78 treesize of output 70 [2022-07-12 19:05:39,364 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:05:39,364 INFO L390 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 62 [2022-07-12 19:05:39,367 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:05:39,370 INFO L390 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 50 treesize of output 32 [2022-07-12 19:05:39,378 INFO L390 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 17 treesize of output 9 [2022-07-12 19:06:22,881 WARN L233 SmtUtils]: Spent 43.04s on a formula simplification. DAG size of input: 61 DAG size of output: 51 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-12 19:06:22,929 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:06:22,937 INFO L390 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 114 treesize of output 110 [2022-07-12 19:06:23,005 INFO L390 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 203 treesize of output 195 [2022-07-12 19:06:23,084 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:06:29,673 WARN L233 SmtUtils]: Spent 6.02s on a formula simplification. DAG size of input: 19 DAG size of output: 15 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-12 19:06:29,693 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:06:29,693 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:06:29,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1917214265] [2022-07-12 19:06:29,694 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1917214265] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 19:06:29,694 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 19:06:29,694 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 26 [2022-07-12 19:06:29,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876875983] [2022-07-12 19:06:29,694 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 19:06:29,694 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-07-12 19:06:29,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:06:29,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-07-12 19:06:29,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=349, Unknown=9, NotChecked=258, Total=702 [2022-07-12 19:06:29,695 INFO L87 Difference]: Start difference. First operand 280 states and 331 transitions. Second operand has 27 states, 26 states have (on average 2.576923076923077) internal successors, (67), 27 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:06:36,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:06:36,592 INFO L93 Difference]: Finished difference Result 455 states and 532 transitions. [2022-07-12 19:06:36,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-07-12 19:06:36,593 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.576923076923077) internal successors, (67), 27 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-07-12 19:06:36,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:06:36,595 INFO L225 Difference]: With dead ends: 455 [2022-07-12 19:06:36,595 INFO L226 Difference]: Without dead ends: 455 [2022-07-12 19:06:36,595 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 40 SyntacticMatches, 4 SemanticMatches, 40 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 55.9s TimeCoverageRelationStatistics Valid=260, Invalid=1015, Unknown=9, NotChecked=438, Total=1722 [2022-07-12 19:06:36,596 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 386 mSDsluCounter, 1127 mSDsCounter, 0 mSdLazyCounter, 1410 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 386 SdHoareTripleChecker+Valid, 1234 SdHoareTripleChecker+Invalid, 3133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 1410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1671 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2022-07-12 19:06:36,596 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [386 Valid, 1234 Invalid, 3133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 1410 Invalid, 0 Unknown, 1671 Unchecked, 4.1s Time] [2022-07-12 19:06:36,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2022-07-12 19:06:36,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 280. [2022-07-12 19:06:36,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 259 states have (on average 1.274131274131274) internal successors, (330), 279 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:06:36,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 330 transitions. [2022-07-12 19:06:36,601 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 330 transitions. Word has length 34 [2022-07-12 19:06:36,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:06:36,601 INFO L495 AbstractCegarLoop]: Abstraction has 280 states and 330 transitions. [2022-07-12 19:06:36,601 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.576923076923077) internal successors, (67), 27 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:06:36,602 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 330 transitions. [2022-07-12 19:06:36,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-12 19:06:36,602 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:06:36,602 INFO L195 NwaCegarLoop]: 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] [2022-07-12 19:06:36,610 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (29)] Ended with exit code 0 [2022-07-12 19:06:36,802 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 19:06:36,803 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2022-07-12 19:06:36,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:06:36,803 INFO L85 PathProgramCache]: Analyzing trace with hash 956849775, now seen corresponding path program 1 times [2022-07-12 19:06:36,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:06:36,803 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1480534707] [2022-07-12 19:06:36,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:06:36,804 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:06:36,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:06:36,805 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 19:06:36,805 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (30)] Waiting until timeout for monitored process [2022-07-12 19:06:37,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:06:37,040 INFO L263 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 34 conjunts are in the unsatisfiable core [2022-07-12 19:06:37,043 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:06:37,048 INFO L390 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 [2022-07-12 19:06:37,084 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 19:06:37,111 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:06:37,112 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-12 19:06:37,181 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 19:06:37,181 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-12 19:06:37,227 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:06:37,228 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-12 19:06:37,245 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 19:06:37,290 INFO L390 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 [2022-07-12 19:06:37,351 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-12 19:06:37,372 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-12 19:06:37,400 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 19:06:37,400 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-12 19:06:37,429 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 19:06:37,439 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-12 19:06:37,497 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2022-07-12 19:06:37,530 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-12 19:06:37,589 INFO L390 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 [2022-07-12 19:06:37,630 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:06:37,630 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:06:37,780 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1009 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_1009) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv8 32))) (_ bv2 32)))) is different from false [2022-07-12 19:06:37,794 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1009 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv2 32) (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~x~0#1.offset|)) v_ArrVal_1009) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv8 32)))))) is different from false [2022-07-12 19:06:37,812 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1006 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1009 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1006) |c_ULTIMATE.start_main_#t~malloc10#1.base| v_ArrVal_1009) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv8 32))) (_ bv2 32)))) is different from false [2022-07-12 19:06:37,830 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc10#1.base_11| (_ BitVec 32))) (or (forall ((v_ArrVal_1006 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1009 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv2 32) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1006) |v_ULTIMATE.start_main_#t~malloc10#1.base_11| v_ArrVal_1009) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv8 32)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc10#1.base_11|) (_ bv0 1))))) is different from false [2022-07-12 19:06:37,845 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1006 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc10#1.base_11| (_ BitVec 32)) (v_ArrVal_1009 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc10#1.base_11|) (_ bv0 1))) (not (= (_ bv2 32) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1006) |v_ULTIMATE.start_main_#t~malloc10#1.base_11| v_ArrVal_1009) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv8 32))))))) is different from false [2022-07-12 19:06:37,879 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1006 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc10#1.base_11| (_ BitVec 32)) (v_ArrVal_1009 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv2 32) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1006) |v_ULTIMATE.start_main_#t~malloc10#1.base_11| v_ArrVal_1009) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv8 32))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc10#1.base_11|) (_ bv0 1))))) is different from false [2022-07-12 19:06:37,894 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-12 19:06:37,894 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-07-12 19:06:37,903 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1006 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc10#1.base_11| (_ BitVec 32)) (v_ArrVal_1009 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= |v_ULTIMATE.start_main_#t~malloc10#1.base_11| |c_ULTIMATE.start_main_~x~0#1.base|) (not (= (_ bv2 32) (select (select (store (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1006) |v_ULTIMATE.start_main_#t~malloc10#1.base_11| v_ArrVal_1009) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv8 32))))))) is different from false [2022-07-12 19:06:37,926 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1006 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc10#1.base_11| (_ BitVec 32)) (v_ArrVal_1009 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1001 (_ BitVec 32))) (or (= |v_ULTIMATE.start_main_#t~malloc10#1.base_11| |c_ULTIMATE.start_main_~x~0#1.base|) (not (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_1001)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1006) |v_ULTIMATE.start_main_#t~malloc10#1.base_11| v_ArrVal_1009) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv8 32))) (_ bv2 32))))) is different from false [2022-07-12 19:06:38,112 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1006 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc10#1.base_11| (_ BitVec 32)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_21| (_ BitVec 32)) (v_ArrVal_1009 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1001 (_ BitVec 32))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_21|) (_ bv0 1))) (= |c_ULTIMATE.start_main_~head~0#1.base| |v_ULTIMATE.start_main_#t~malloc10#1.base_11|) (not (= (_ bv2 32) (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~head~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| v_ArrVal_1001)) |v_ULTIMATE.start_main_#t~malloc7#1.base_21| v_ArrVal_1006) |v_ULTIMATE.start_main_#t~malloc10#1.base_11| v_ArrVal_1009) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv8 32))))))) is different from false [2022-07-12 19:06:38,141 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_997 (_ BitVec 32)) (v_ArrVal_1006 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc10#1.base_11| (_ BitVec 32)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_21| (_ BitVec 32)) (v_ArrVal_1009 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1001 (_ BitVec 32))) (or (not (= (_ bv2 32) (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~head~0#1.base| (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv4 32)) v_ArrVal_997) |c_ULTIMATE.start_main_~head~0#1.offset| v_ArrVal_1001)) |v_ULTIMATE.start_main_#t~malloc7#1.base_21| v_ArrVal_1006) |v_ULTIMATE.start_main_#t~malloc10#1.base_11| v_ArrVal_1009) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv8 32))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_21|) (_ bv0 1))) (= |c_ULTIMATE.start_main_~head~0#1.base| |v_ULTIMATE.start_main_#t~malloc10#1.base_11|))) is different from false [2022-07-12 19:06:38,219 INFO L356 Elim1Store]: treesize reduction 78, result has 27.1 percent of original size [2022-07-12 19:06:38,219 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 45 [2022-07-12 19:06:38,226 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:06:38,229 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 27 [2022-07-12 19:06:38,234 INFO L390 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 4 [2022-07-12 19:06:38,284 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:06:38,285 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:06:38,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1480534707] [2022-07-12 19:06:38,285 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1480534707] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 19:06:38,285 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 19:06:38,285 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18] total 31 [2022-07-12 19:06:38,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067909964] [2022-07-12 19:06:38,285 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 19:06:38,285 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-07-12 19:06:38,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:06:38,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-07-12 19:06:38,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=350, Unknown=11, NotChecked=470, Total=930 [2022-07-12 19:06:38,286 INFO L87 Difference]: Start difference. First operand 280 states and 330 transitions. Second operand has 31 states, 31 states have (on average 1.935483870967742) internal successors, (60), 31 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:06:41,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:06:41,055 INFO L93 Difference]: Finished difference Result 609 states and 706 transitions. [2022-07-12 19:06:41,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-07-12 19:06:41,056 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 1.935483870967742) internal successors, (60), 31 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-07-12 19:06:41,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:06:41,057 INFO L225 Difference]: With dead ends: 609 [2022-07-12 19:06:41,058 INFO L226 Difference]: Without dead ends: 609 [2022-07-12 19:06:41,058 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 36 SyntacticMatches, 6 SemanticMatches, 53 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 442 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=416, Invalid=1593, Unknown=11, NotChecked=950, Total=2970 [2022-07-12 19:06:41,059 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 536 mSDsluCounter, 1027 mSDsCounter, 0 mSdLazyCounter, 905 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 536 SdHoareTripleChecker+Valid, 1094 SdHoareTripleChecker+Invalid, 3451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 905 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2449 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-07-12 19:06:41,059 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [536 Valid, 1094 Invalid, 3451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 905 Invalid, 0 Unknown, 2449 Unchecked, 1.7s Time] [2022-07-12 19:06:41,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2022-07-12 19:06:41,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 295. [2022-07-12 19:06:41,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 274 states have (on average 1.2664233576642336) internal successors, (347), 294 states have internal predecessors, (347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:06:41,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 347 transitions. [2022-07-12 19:06:41,065 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 347 transitions. Word has length 34 [2022-07-12 19:06:41,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:06:41,066 INFO L495 AbstractCegarLoop]: Abstraction has 295 states and 347 transitions. [2022-07-12 19:06:41,066 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 1.935483870967742) internal successors, (60), 31 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:06:41,066 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 347 transitions. [2022-07-12 19:06:41,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-12 19:06:41,067 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:06:41,067 INFO L195 NwaCegarLoop]: 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] [2022-07-12 19:06:41,077 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (30)] Ended with exit code 0 [2022-07-12 19:06:41,277 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 19:06:41,277 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2022-07-12 19:06:41,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:06:41,278 INFO L85 PathProgramCache]: Analyzing trace with hash 1654366839, now seen corresponding path program 1 times [2022-07-12 19:06:41,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:06:41,278 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2023383396] [2022-07-12 19:06:41,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:06:41,278 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:06:41,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:06:41,279 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 19:06:41,281 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (31)] Waiting until timeout for monitored process [2022-07-12 19:06:41,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:06:41,453 INFO L263 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 34 conjunts are in the unsatisfiable core [2022-07-12 19:06:41,456 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:06:41,460 INFO L390 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 [2022-07-12 19:06:41,484 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 19:06:41,506 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:06:41,506 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-12 19:06:41,555 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 19:06:41,556 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-12 19:06:41,596 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 19:06:41,606 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:06:41,607 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-12 19:06:41,657 INFO L390 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 [2022-07-12 19:06:41,720 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-12 19:06:41,748 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-12 19:06:41,774 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 19:06:41,774 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-12 19:06:41,806 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 19:06:41,813 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-12 19:06:41,871 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2022-07-12 19:06:41,904 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-12 19:06:41,962 INFO L390 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 [2022-07-12 19:06:42,004 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:06:42,004 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:06:42,108 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1079 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv2 32) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_1079) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv8 32)))))) is different from false [2022-07-12 19:06:42,117 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1079 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~x~0#1.offset|)) v_ArrVal_1079) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv8 32))) (_ bv2 32)))) is different from false [2022-07-12 19:06:42,136 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1079 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1076 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv2 32) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1076) |c_ULTIMATE.start_main_#t~malloc10#1.base| v_ArrVal_1079) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv8 32)))))) is different from false [2022-07-12 19:06:42,163 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc10#1.base_14| (_ BitVec 32))) (or (forall ((v_ArrVal_1079 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1076 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1076) |v_ULTIMATE.start_main_#t~malloc10#1.base_14| v_ArrVal_1079) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv8 32))) (_ bv2 32)))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc10#1.base_14|) (_ bv0 1))))) is different from false [2022-07-12 19:06:42,178 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1079 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1076 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc10#1.base_14| (_ BitVec 32))) (or (not (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1076) |v_ULTIMATE.start_main_#t~malloc10#1.base_14| v_ArrVal_1079) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv8 32))) (_ bv2 32))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc10#1.base_14|) (_ bv0 1))))) is different from false [2022-07-12 19:06:42,217 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1079 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1076 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc10#1.base_14| (_ BitVec 32))) (or (not (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1076) |v_ULTIMATE.start_main_#t~malloc10#1.base_14| v_ArrVal_1079) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv8 32))) (_ bv2 32))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc10#1.base_14|) (_ bv0 1))))) is different from false [2022-07-12 19:06:42,243 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-12 19:06:42,243 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-07-12 19:06:42,255 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1079 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1076 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc10#1.base_14| (_ BitVec 32))) (or (not (= (_ bv2 32) (select (select (store (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1076) |v_ULTIMATE.start_main_#t~malloc10#1.base_14| v_ArrVal_1079) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv8 32))))) (= |v_ULTIMATE.start_main_#t~malloc10#1.base_14| |c_ULTIMATE.start_main_~x~0#1.base|))) is different from false [2022-07-12 19:06:42,282 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1079 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1076 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc10#1.base_14| (_ BitVec 32)) (v_ArrVal_1073 (_ BitVec 32))) (or (= |v_ULTIMATE.start_main_#t~malloc10#1.base_14| |c_ULTIMATE.start_main_~x~0#1.base|) (not (= (_ bv2 32) (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_1073)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1076) |v_ULTIMATE.start_main_#t~malloc10#1.base_14| v_ArrVal_1079) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv8 32))))))) is different from false [2022-07-12 19:06:42,313 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_24| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_24|))) (forall ((v_ArrVal_1079 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1076 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc10#1.base_14| (_ BitVec 32)) (v_ArrVal_1073 (_ BitVec 32))) (or (not (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_1073)) |v_ULTIMATE.start_main_#t~malloc7#1.base_24| v_ArrVal_1076) |v_ULTIMATE.start_main_#t~malloc10#1.base_14| v_ArrVal_1079) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv8 32))) (_ bv2 32))) (= |v_ULTIMATE.start_main_#t~malloc10#1.base_14| |c_ULTIMATE.start_main_~x~0#1.base|))))) is different from false [2022-07-12 19:06:42,336 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1079 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1076 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc10#1.base_14| (_ BitVec 32)) (v_ArrVal_1073 (_ BitVec 32)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_24| (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| |v_ULTIMATE.start_main_#t~malloc10#1.base_14|) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_24|))) (not (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~head~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| v_ArrVal_1073)) |v_ULTIMATE.start_main_#t~malloc7#1.base_24| v_ArrVal_1076) |v_ULTIMATE.start_main_#t~malloc10#1.base_14| v_ArrVal_1079) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv8 32))) (_ bv2 32))))) is different from false [2022-07-12 19:06:42,358 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1069 (_ BitVec 32)) (v_ArrVal_1079 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1076 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc10#1.base_14| (_ BitVec 32)) (v_ArrVal_1073 (_ BitVec 32)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_24| (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| |v_ULTIMATE.start_main_#t~malloc10#1.base_14|) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_24|))) (not (= (_ bv2 32) (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~head~0#1.base| (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv4 32)) v_ArrVal_1069) |c_ULTIMATE.start_main_~head~0#1.offset| v_ArrVal_1073)) |v_ULTIMATE.start_main_#t~malloc7#1.base_24| v_ArrVal_1076) |v_ULTIMATE.start_main_#t~malloc10#1.base_14| v_ArrVal_1079) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv8 32))))))) is different from false [2022-07-12 19:06:42,412 INFO L356 Elim1Store]: treesize reduction 78, result has 27.1 percent of original size [2022-07-12 19:06:42,413 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 45 [2022-07-12 19:06:42,417 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:06:42,420 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 27 [2022-07-12 19:06:42,424 INFO L390 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 4 [2022-07-12 19:06:42,452 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-07-12 19:06:42,452 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:06:42,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2023383396] [2022-07-12 19:06:42,452 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2023383396] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 19:06:42,452 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 19:06:42,452 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18] total 31 [2022-07-12 19:06:42,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475848083] [2022-07-12 19:06:42,452 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 19:06:42,452 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-07-12 19:06:42,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:06:42,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-07-12 19:06:42,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=315, Unknown=11, NotChecked=506, Total=930 [2022-07-12 19:06:42,453 INFO L87 Difference]: Start difference. First operand 295 states and 347 transitions. Second operand has 31 states, 31 states have (on average 1.935483870967742) internal successors, (60), 31 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:06:45,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:06:45,441 INFO L93 Difference]: Finished difference Result 447 states and 510 transitions. [2022-07-12 19:06:45,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-07-12 19:06:45,442 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 1.935483870967742) internal successors, (60), 31 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-07-12 19:06:45,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:06:45,443 INFO L225 Difference]: With dead ends: 447 [2022-07-12 19:06:45,443 INFO L226 Difference]: Without dead ends: 447 [2022-07-12 19:06:45,444 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 37 SyntacticMatches, 6 SemanticMatches, 50 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 320 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=370, Invalid=1303, Unknown=11, NotChecked=968, Total=2652 [2022-07-12 19:06:45,448 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 428 mSDsluCounter, 694 mSDsCounter, 0 mSdLazyCounter, 1073 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 428 SdHoareTripleChecker+Valid, 783 SdHoareTripleChecker+Invalid, 3001 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 1073 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1840 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-07-12 19:06:45,449 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [428 Valid, 783 Invalid, 3001 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 1073 Invalid, 0 Unknown, 1840 Unchecked, 2.0s Time] [2022-07-12 19:06:45,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2022-07-12 19:06:45,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 287. [2022-07-12 19:06:45,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 266 states have (on average 1.2669172932330828) internal successors, (337), 286 states have internal predecessors, (337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:06:45,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 337 transitions. [2022-07-12 19:06:45,454 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 337 transitions. Word has length 34 [2022-07-12 19:06:45,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:06:45,454 INFO L495 AbstractCegarLoop]: Abstraction has 287 states and 337 transitions. [2022-07-12 19:06:45,454 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 1.935483870967742) internal successors, (60), 31 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:06:45,454 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 337 transitions. [2022-07-12 19:06:45,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-12 19:06:45,455 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:06:45,455 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:06:45,467 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (31)] Forceful destruction successful, exit code 0 [2022-07-12 19:06:45,666 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 19:06:45,667 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2022-07-12 19:06:45,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:06:45,667 INFO L85 PathProgramCache]: Analyzing trace with hash -199673176, now seen corresponding path program 1 times [2022-07-12 19:06:45,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:06:45,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [651060964] [2022-07-12 19:06:45,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:06:45,668 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:06:45,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:06:45,669 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 19:06:45,670 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (32)] Waiting until timeout for monitored process [2022-07-12 19:06:45,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:06:45,854 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 33 conjunts are in the unsatisfiable core [2022-07-12 19:06:45,856 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:06:45,863 INFO L390 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 [2022-07-12 19:06:45,894 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 19:06:45,918 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 19:06:45,918 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-12 19:06:45,940 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:06:45,941 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-12 19:06:45,966 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 19:06:46,007 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2022-07-12 19:06:46,037 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-12 19:06:46,095 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 19:06:46,095 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-12 19:06:46,136 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:06:46,136 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-12 19:06:46,150 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 19:06:46,197 INFO L390 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 [2022-07-12 19:06:46,257 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-12 19:06:46,280 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-12 19:06:46,294 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-12 19:06:46,345 INFO L390 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 [2022-07-12 19:06:46,385 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:06:46,385 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:06:46,469 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1148 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1148) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv8 32))) (_ bv2 32))) is different from false [2022-07-12 19:06:46,497 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1148 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1148) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv8 32))) (_ bv2 32))) is different from false [2022-07-12 19:06:46,505 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1148 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1148) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv8 32))) (_ bv2 32))) is different from false [2022-07-12 19:06:46,521 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1148 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1145 (_ BitVec 32))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_1145)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1148) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv8 32))) (_ bv2 32))) is different from false [2022-07-12 19:06:48,639 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_27| (_ BitVec 32)) (v_ArrVal_1148 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1145 (_ BitVec 32))) (or (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~head~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| v_ArrVal_1145)) |v_ULTIMATE.start_main_#t~malloc7#1.base_27| v_ArrVal_1148) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv8 32))) (_ bv2 32)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_27|) (_ bv0 1))))) is different from false [2022-07-12 19:06:48,659 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1141 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc7#1.base_27| (_ BitVec 32)) (v_ArrVal_1148 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1145 (_ BitVec 32))) (or (= (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1141))) (store .cse0 |c_ULTIMATE.start_main_~head~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| v_ArrVal_1145))) |v_ULTIMATE.start_main_#t~malloc7#1.base_27| v_ArrVal_1148) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv8 32))) (_ bv2 32)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_27|) (_ bv0 1))))) is different from false [2022-07-12 19:06:48,680 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1141 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc7#1.base_27| (_ BitVec 32)) (v_ArrVal_1148 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1145 (_ BitVec 32))) (or (= (select (select (store (let ((.cse0 (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv4 32))) v_ArrVal_1141))) (store .cse0 |c_ULTIMATE.start_main_~head~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| v_ArrVal_1145))) |v_ULTIMATE.start_main_#t~malloc7#1.base_27| v_ArrVal_1148) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv8 32))) (_ bv2 32)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_27|) (_ bv0 1))))) is different from false [2022-07-12 19:06:48,717 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-12 19:06:48,717 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-07-12 19:06:48,731 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1141 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc7#1.base_27| (_ BitVec 32)) (v_ArrVal_1139 (_ BitVec 32)) (v_ArrVal_1148 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1145 (_ BitVec 32))) (or (= (_ bv2 32) (select (select (store (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~head~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv4 32)) v_ArrVal_1139)) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1141))) (store .cse0 |c_ULTIMATE.start_main_~head~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| v_ArrVal_1145))) |v_ULTIMATE.start_main_#t~malloc7#1.base_27| v_ArrVal_1148) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv8 32)))) (= |c_ULTIMATE.start_main_~head~0#1.base| |v_ULTIMATE.start_main_#t~malloc7#1.base_27|))) is different from false [2022-07-12 19:06:48,765 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc3#1.base_17| (_ BitVec 32))) (or (forall ((v_ArrVal_1141 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc7#1.base_27| (_ BitVec 32)) (v_ArrVal_1139 (_ BitVec 32)) (v_ArrVal_1148 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1145 (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| |v_ULTIMATE.start_main_#t~malloc7#1.base_27|) (= (_ bv2 32) (select (select (store (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~head~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv4 32)) v_ArrVal_1139)) |v_ULTIMATE.start_main_#t~malloc3#1.base_17| v_ArrVal_1141))) (store .cse0 |c_ULTIMATE.start_main_~head~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| v_ArrVal_1145))) |v_ULTIMATE.start_main_#t~malloc7#1.base_27| v_ArrVal_1148) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv8 32)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_17|) (_ bv0 1))))) is different from false [2022-07-12 19:06:48,807 INFO L356 Elim1Store]: treesize reduction 27, result has 43.8 percent of original size [2022-07-12 19:06:48,807 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 56 treesize of output 47 [2022-07-12 19:06:48,813 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:06:48,817 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2022-07-12 19:06:48,822 INFO L390 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 7 treesize of output 3 [2022-07-12 19:06:48,862 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:06:48,863 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:06:48,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [651060964] [2022-07-12 19:06:48,863 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [651060964] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 19:06:48,863 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 19:06:48,863 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17] total 29 [2022-07-12 19:06:48,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308924233] [2022-07-12 19:06:48,863 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 19:06:48,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-07-12 19:06:48,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:06:48,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-07-12 19:06:48,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=311, Unknown=10, NotChecked=396, Total=812 [2022-07-12 19:06:48,867 INFO L87 Difference]: Start difference. First operand 287 states and 337 transitions. Second operand has 29 states, 29 states have (on average 2.103448275862069) internal successors, (61), 29 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:06:51,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:06:51,793 INFO L93 Difference]: Finished difference Result 393 states and 450 transitions. [2022-07-12 19:06:51,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-07-12 19:06:51,794 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.103448275862069) internal successors, (61), 29 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-07-12 19:06:51,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:06:51,795 INFO L225 Difference]: With dead ends: 393 [2022-07-12 19:06:51,795 INFO L226 Difference]: Without dead ends: 393 [2022-07-12 19:06:51,796 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 44 SyntacticMatches, 6 SemanticMatches, 45 ConstructedPredicates, 9 IntricatePredicates, 1 DeprecatedPredicates, 246 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=320, Invalid=1109, Unknown=13, NotChecked=720, Total=2162 [2022-07-12 19:06:51,796 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 473 mSDsluCounter, 859 mSDsCounter, 0 mSdLazyCounter, 954 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 473 SdHoareTripleChecker+Valid, 946 SdHoareTripleChecker+Invalid, 2323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 954 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1309 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-07-12 19:06:51,796 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [473 Valid, 946 Invalid, 2323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 954 Invalid, 0 Unknown, 1309 Unchecked, 1.8s Time] [2022-07-12 19:06:51,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2022-07-12 19:06:51,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 293. [2022-07-12 19:06:51,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 272 states have (on average 1.2647058823529411) internal successors, (344), 292 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:06:51,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 344 transitions. [2022-07-12 19:06:51,800 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 344 transitions. Word has length 36 [2022-07-12 19:06:51,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:06:51,801 INFO L495 AbstractCegarLoop]: Abstraction has 293 states and 344 transitions. [2022-07-12 19:06:51,801 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 2.103448275862069) internal successors, (61), 29 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:06:51,801 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 344 transitions. [2022-07-12 19:06:51,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-12 19:06:51,802 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:06:51,802 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:06:51,813 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (32)] Ended with exit code 0 [2022-07-12 19:06:52,012 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 19:06:52,013 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2022-07-12 19:06:52,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:06:52,013 INFO L85 PathProgramCache]: Analyzing trace with hash 1423076272, now seen corresponding path program 1 times [2022-07-12 19:06:52,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:06:52,013 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [460982488] [2022-07-12 19:06:52,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:06:52,014 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:06:52,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:06:52,015 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 19:06:52,015 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (33)] Waiting until timeout for monitored process [2022-07-12 19:06:52,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:06:52,195 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 33 conjunts are in the unsatisfiable core [2022-07-12 19:06:52,197 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:06:52,202 INFO L390 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 [2022-07-12 19:06:52,223 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 19:06:52,247 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 19:06:52,247 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-12 19:06:52,274 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 19:06:52,279 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:06:52,280 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-12 19:06:52,324 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2022-07-12 19:06:52,349 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-12 19:06:52,405 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 19:06:52,406 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-12 19:06:52,441 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 19:06:52,454 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:06:52,455 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-12 19:06:52,503 INFO L390 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 [2022-07-12 19:06:52,561 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-12 19:06:52,587 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-12 19:06:52,599 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-12 19:06:52,652 INFO L390 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 [2022-07-12 19:06:52,693 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:06:52,693 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:06:52,765 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1217 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1217) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv8 32))) (_ bv2 32))) is different from false [2022-07-12 19:06:52,800 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1217 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv2 32) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1217) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv8 32))))) is different from false [2022-07-12 19:06:52,810 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1217 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv2 32) (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1217) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv8 32))))) is different from false [2022-07-12 19:06:52,828 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1212 (_ BitVec 32)) (v_ArrVal_1217 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv2 32) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_1212)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1217) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv8 32))))) is different from false [2022-07-12 19:06:52,848 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_30| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_30|))) (forall ((v_ArrVal_1212 (_ BitVec 32)) (v_ArrVal_1217 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv2 32) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_1212)) |v_ULTIMATE.start_main_#t~malloc7#1.base_30| v_ArrVal_1217) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv8 32))))))) is different from false [2022-07-12 19:06:52,861 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1212 (_ BitVec 32)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_30| (_ BitVec 32)) (v_ArrVal_1217 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_30|))) (= (_ bv2 32) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~head~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| v_ArrVal_1212)) |v_ULTIMATE.start_main_#t~malloc7#1.base_30| v_ArrVal_1217) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv8 32)))))) is different from false [2022-07-12 19:06:52,889 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1212 (_ BitVec 32)) (v_ArrVal_1210 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc7#1.base_30| (_ BitVec 32)) (v_ArrVal_1217 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_30|))) (= (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1210))) (store .cse0 |c_ULTIMATE.start_main_~head~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| v_ArrVal_1212))) |v_ULTIMATE.start_main_#t~malloc7#1.base_30| v_ArrVal_1217) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv8 32))) (_ bv2 32)))) is different from false [2022-07-12 19:06:52,906 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1212 (_ BitVec 32)) (v_ArrVal_1210 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc7#1.base_30| (_ BitVec 32)) (v_ArrVal_1217 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_30|))) (= (select (select (store (let ((.cse0 (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv4 32))) v_ArrVal_1210))) (store .cse0 |c_ULTIMATE.start_main_~head~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| v_ArrVal_1212))) |v_ULTIMATE.start_main_#t~malloc7#1.base_30| v_ArrVal_1217) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv8 32))) (_ bv2 32)))) is different from false [2022-07-12 19:06:52,938 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-12 19:06:52,938 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-07-12 19:06:52,962 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1212 (_ BitVec 32)) (v_ArrVal_1210 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1208 (_ BitVec 32)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_30| (_ BitVec 32)) (v_ArrVal_1217 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select (select (store (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~head~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv4 32)) v_ArrVal_1208)) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1210))) (store .cse0 |c_ULTIMATE.start_main_~head~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| v_ArrVal_1212))) |v_ULTIMATE.start_main_#t~malloc7#1.base_30| v_ArrVal_1217) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv8 32))) (_ bv2 32)) (= |c_ULTIMATE.start_main_~head~0#1.base| |v_ULTIMATE.start_main_#t~malloc7#1.base_30|))) is different from false [2022-07-12 19:06:53,073 INFO L356 Elim1Store]: treesize reduction 27, result has 43.8 percent of original size [2022-07-12 19:06:53,074 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 56 treesize of output 47 [2022-07-12 19:06:53,084 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:06:53,086 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2022-07-12 19:06:53,090 INFO L390 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 7 treesize of output 3 [2022-07-12 19:06:53,116 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-07-12 19:06:53,117 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:06:53,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [460982488] [2022-07-12 19:06:53,117 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [460982488] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 19:06:53,117 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 19:06:53,117 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17] total 29 [2022-07-12 19:06:53,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395012041] [2022-07-12 19:06:53,117 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 19:06:53,118 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-07-12 19:06:53,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:06:53,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-07-12 19:06:53,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=306, Unknown=13, NotChecked=396, Total=812 [2022-07-12 19:06:53,119 INFO L87 Difference]: Start difference. First operand 293 states and 344 transitions. Second operand has 29 states, 29 states have (on average 2.103448275862069) internal successors, (61), 29 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:06:56,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:06:56,312 INFO L93 Difference]: Finished difference Result 396 states and 451 transitions. [2022-07-12 19:06:56,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-07-12 19:06:56,313 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.103448275862069) internal successors, (61), 29 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-07-12 19:06:56,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:06:56,314 INFO L225 Difference]: With dead ends: 396 [2022-07-12 19:06:56,314 INFO L226 Difference]: Without dead ends: 396 [2022-07-12 19:06:56,315 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 44 SyntacticMatches, 4 SemanticMatches, 44 ConstructedPredicates, 9 IntricatePredicates, 1 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=307, Invalid=1048, Unknown=13, NotChecked=702, Total=2070 [2022-07-12 19:06:56,315 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 285 mSDsluCounter, 952 mSDsCounter, 0 mSdLazyCounter, 1203 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 1043 SdHoareTripleChecker+Invalid, 2751 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 1203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1494 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-07-12 19:06:56,316 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [285 Valid, 1043 Invalid, 2751 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 1203 Invalid, 0 Unknown, 1494 Unchecked, 2.3s Time] [2022-07-12 19:06:56,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2022-07-12 19:06:56,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 287. [2022-07-12 19:06:56,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 266 states have (on average 1.263157894736842) internal successors, (336), 286 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:06:56,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 336 transitions. [2022-07-12 19:06:56,320 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 336 transitions. Word has length 36 [2022-07-12 19:06:56,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:06:56,321 INFO L495 AbstractCegarLoop]: Abstraction has 287 states and 336 transitions. [2022-07-12 19:06:56,321 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 2.103448275862069) internal successors, (61), 29 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:06:56,321 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 336 transitions. [2022-07-12 19:06:56,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-12 19:06:56,322 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:06:56,322 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:06:56,338 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (33)] Forceful destruction successful, exit code 0 [2022-07-12 19:06:56,532 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 19:06:56,532 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr54REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2022-07-12 19:06:56,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:06:56,533 INFO L85 PathProgramCache]: Analyzing trace with hash -2087466742, now seen corresponding path program 1 times [2022-07-12 19:06:56,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:06:56,533 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [574306692] [2022-07-12 19:06:56,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:06:56,533 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:06:56,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:06:56,535 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 19:06:56,535 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (34)] Waiting until timeout for monitored process [2022-07-12 19:06:56,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:06:56,640 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 15 conjunts are in the unsatisfiable core [2022-07-12 19:06:56,641 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:06:56,781 INFO L390 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 [2022-07-12 19:06:56,785 INFO L390 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 [2022-07-12 19:06:56,833 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:06:56,833 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:06:56,956 INFO L356 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-07-12 19:06:56,957 INFO L390 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 24 treesize of output 23 [2022-07-12 19:06:56,967 INFO L356 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-07-12 19:06:56,967 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 12 [2022-07-12 19:06:57,024 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:06:57,025 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:06:57,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [574306692] [2022-07-12 19:06:57,025 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [574306692] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 19:06:57,025 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 19:06:57,025 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2022-07-12 19:06:57,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286136743] [2022-07-12 19:06:57,025 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 19:06:57,025 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-12 19:06:57,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:06:57,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-12 19:06:57,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-07-12 19:06:57,026 INFO L87 Difference]: Start difference. First operand 287 states and 336 transitions. Second operand has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 11 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:06:58,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:06:58,310 INFO L93 Difference]: Finished difference Result 381 states and 444 transitions. [2022-07-12 19:06:58,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-12 19:06:58,311 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 11 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-07-12 19:06:58,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:06:58,312 INFO L225 Difference]: With dead ends: 381 [2022-07-12 19:06:58,312 INFO L226 Difference]: Without dead ends: 381 [2022-07-12 19:06:58,312 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2022-07-12 19:06:58,313 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 237 mSDsluCounter, 450 mSDsCounter, 0 mSdLazyCounter, 510 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 520 SdHoareTripleChecker+Invalid, 550 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 510 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-07-12 19:06:58,313 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 520 Invalid, 550 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 510 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-07-12 19:06:58,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2022-07-12 19:06:58,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 314. [2022-07-12 19:06:58,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 314 states, 293 states have (on average 1.2627986348122866) internal successors, (370), 313 states have internal predecessors, (370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:06:58,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 370 transitions. [2022-07-12 19:06:58,316 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 370 transitions. Word has length 36 [2022-07-12 19:06:58,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:06:58,316 INFO L495 AbstractCegarLoop]: Abstraction has 314 states and 370 transitions. [2022-07-12 19:06:58,316 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 11 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:06:58,317 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 370 transitions. [2022-07-12 19:06:58,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-12 19:06:58,317 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:06:58,317 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:06:58,325 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (34)] Forceful destruction successful, exit code 0 [2022-07-12 19:06:58,523 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 19:06:58,524 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2022-07-12 19:06:58,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:06:58,524 INFO L85 PathProgramCache]: Analyzing trace with hash -799151648, now seen corresponding path program 1 times [2022-07-12 19:06:58,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:06:58,525 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1215260964] [2022-07-12 19:06:58,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:06:58,525 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:06:58,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:06:58,526 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 19:06:58,527 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (35)] Waiting until timeout for monitored process [2022-07-12 19:06:58,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:06:58,714 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 38 conjunts are in the unsatisfiable core [2022-07-12 19:06:58,716 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:06:58,721 INFO L390 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 [2022-07-12 19:06:58,766 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 19:06:58,775 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 19:06:58,834 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 19:06:58,834 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-12 19:06:58,886 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:06:58,887 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-12 19:06:58,900 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:06:58,901 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-12 19:06:59,060 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 19:06:59,060 INFO L390 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 16 treesize of output 22 [2022-07-12 19:06:59,066 INFO L390 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 7 treesize of output 3 [2022-07-12 19:06:59,088 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 19:06:59,089 INFO L390 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 31 treesize of output 29 [2022-07-12 19:06:59,152 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 19:06:59,152 INFO L390 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 16 treesize of output 22 [2022-07-12 19:06:59,161 INFO L390 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 7 treesize of output 3 [2022-07-12 19:06:59,176 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 19:06:59,176 INFO L390 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 31 treesize of output 29 [2022-07-12 19:06:59,218 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 19:06:59,218 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-12 19:06:59,266 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:06:59,293 INFO L356 Elim1Store]: treesize reduction 62, result has 21.5 percent of original size [2022-07-12 19:06:59,293 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 36 [2022-07-12 19:06:59,312 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-12 19:06:59,503 INFO L356 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2022-07-12 19:06:59,503 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 64 treesize of output 63 [2022-07-12 19:06:59,510 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-07-12 19:06:59,520 INFO L390 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 20 treesize of output 12 [2022-07-12 19:06:59,752 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:06:59,753 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:06:59,755 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:06:59,756 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 14 [2022-07-12 19:06:59,763 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:06:59,764 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2022-07-12 19:06:59,812 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:06:59,812 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:06:59,955 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1309 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_1309) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv4 32))))) (forall ((v_ArrVal_1310 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~head~0#1.offset| (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_1310) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv4 32)))))) is different from false [2022-07-12 19:06:59,967 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1309 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~x~0#1.offset|)) v_ArrVal_1309) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv4 32))))) (forall ((v_ArrVal_1310 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~x~0#1.offset|)) v_ArrVal_1310) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv4 32))) |c_ULTIMATE.start_main_~head~0#1.offset|))) is different from false [2022-07-12 19:06:59,988 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1310 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1307 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~head~0#1.offset| (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1307) |c_ULTIMATE.start_main_#t~malloc10#1.base| v_ArrVal_1310) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv4 32))))) (forall ((v_ArrVal_1309 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_~x~0#1.offset| (_ BitVec 32))) (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~x~0#1.offset|) |c_ULTIMATE.start_main_#t~malloc10#1.base|)) |c_ULTIMATE.start_main_#t~malloc10#1.base| v_ArrVal_1309) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv4 32)))))) is different from false [2022-07-12 19:07:02,162 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:07:02,163 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 24 [2022-07-12 19:07:02,180 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1309 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_~x~0#1.offset| (_ BitVec 32)) (v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select v_arrayElimArr_13 (bvadd (_ bv4 32) |ULTIMATE.start_main_~x~0#1.offset|)))) (or (not (= (select |c_#valid| .cse0) (_ bv0 1))) (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_13) .cse0 v_ArrVal_1309) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv4 32))))))) (forall ((|v_ULTIMATE.start_main_#t~malloc10#1.base_19| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc10#1.base_19|))) (forall ((v_ArrVal_1310 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1307 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~head~0#1.offset| (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1307) |v_ULTIMATE.start_main_#t~malloc10#1.base_19| v_ArrVal_1310) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv4 32)))))))) is different from false [2022-07-12 19:07:02,246 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1309 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_~x~0#1.offset| (_ BitVec 32)) (v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select v_arrayElimArr_13 (bvadd (_ bv4 32) |ULTIMATE.start_main_~x~0#1.offset|)))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_arrayElimArr_13) .cse0 v_ArrVal_1309) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv4 32)))) (not (= (select |c_#valid| .cse0) (_ bv0 1)))))) (forall ((|v_ULTIMATE.start_main_#t~malloc10#1.base_19| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc10#1.base_19|))) (forall ((v_ArrVal_1310 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1307 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~head~0#1.offset| (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1307) |v_ULTIMATE.start_main_#t~malloc10#1.base_19| v_ArrVal_1310) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv4 32)))))))) is different from false [2022-07-12 19:07:02,309 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:07:02,309 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 68 treesize of output 90 [2022-07-12 19:07:02,376 INFO L390 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 7 treesize of output 3 [2022-07-12 19:07:02,448 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2022-07-12 19:07:02,530 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1309 (Array (_ BitVec 32) (_ BitVec 32))) (v_subst_1 (_ BitVec 32)) (v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select v_arrayElimArr_13 (bvadd (_ bv4 32) v_subst_1)))) (or (= .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (store (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_arrayElimArr_13) .cse0 v_ArrVal_1309) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv4 32))))))) (forall ((|v_ULTIMATE.start_main_#t~malloc10#1.base_19| (_ BitVec 32)) (v_ArrVal_1310 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1307 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= |v_ULTIMATE.start_main_#t~malloc10#1.base_19| |c_ULTIMATE.start_main_~x~0#1.base|) (= |c_ULTIMATE.start_main_~head~0#1.offset| (select (select (store (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1307) |v_ULTIMATE.start_main_#t~malloc10#1.base_19| v_ArrVal_1310) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv4 32))))))) is different from false [2022-07-12 19:07:02,589 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1300 (_ BitVec 32)) (|v_ULTIMATE.start_main_#t~malloc10#1.base_19| (_ BitVec 32)) (v_ArrVal_1310 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1307 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= |v_ULTIMATE.start_main_#t~malloc10#1.base_19| |c_ULTIMATE.start_main_~x~0#1.base|) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_1300)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1307) |v_ULTIMATE.start_main_#t~malloc10#1.base_19| v_ArrVal_1310) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv4 32))) |c_ULTIMATE.start_main_~head~0#1.offset|))) (forall ((v_ArrVal_1309 (Array (_ BitVec 32) (_ BitVec 32))) (v_subst_1 (_ BitVec 32)) (v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select v_arrayElimArr_13 (bvadd (_ bv4 32) v_subst_1)))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_#t~malloc7#1.base|)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_arrayElimArr_13) .cse0 v_ArrVal_1309) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv4 32)))) (= .cse0 |c_ULTIMATE.start_main_~x~0#1.base|))))) is different from false [2022-07-12 19:07:02,639 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_33| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_33|))) (forall ((v_ArrVal_1300 (_ BitVec 32)) (|v_ULTIMATE.start_main_#t~malloc10#1.base_19| (_ BitVec 32)) (v_ArrVal_1310 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1307 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= |c_ULTIMATE.start_main_~head~0#1.offset| (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_1300)) |v_ULTIMATE.start_main_#t~malloc7#1.base_33| v_ArrVal_1307) |v_ULTIMATE.start_main_#t~malloc10#1.base_19| v_ArrVal_1310) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv4 32)))) (= |v_ULTIMATE.start_main_#t~malloc10#1.base_19| |c_ULTIMATE.start_main_~x~0#1.base|))))) (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_33| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_33|))) (forall ((v_ArrVal_1309 (Array (_ BitVec 32) (_ BitVec 32))) (v_subst_1 (_ BitVec 32)) (v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select v_arrayElimArr_13 (bvadd (_ bv4 32) v_subst_1)))) (or (= .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |v_ULTIMATE.start_main_#t~malloc7#1.base_33|)) |v_ULTIMATE.start_main_#t~malloc7#1.base_33| v_arrayElimArr_13) .cse0 v_ArrVal_1309) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv4 32)))))))))) is different from false [2022-07-12 19:07:02,929 INFO L356 Elim1Store]: treesize reduction 23, result has 45.2 percent of original size [2022-07-12 19:07:02,930 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 38 [2022-07-12 19:07:02,933 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:07:02,939 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-07-12 19:07:02,940 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 30 [2022-07-12 19:07:02,950 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:07:02,951 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 19 [2022-07-12 19:07:02,966 INFO L356 Elim1Store]: treesize reduction 41, result has 2.4 percent of original size [2022-07-12 19:07:02,966 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 1 [2022-07-12 19:07:03,018 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-07-12 19:07:03,019 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:07:03,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1215260964] [2022-07-12 19:07:03,019 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1215260964] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 19:07:03,019 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 19:07:03,019 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17] total 30 [2022-07-12 19:07:03,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583466673] [2022-07-12 19:07:03,019 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 19:07:03,019 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-07-12 19:07:03,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:07:03,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-07-12 19:07:03,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=384, Unknown=13, NotChecked=376, Total=870 [2022-07-12 19:07:03,020 INFO L87 Difference]: Start difference. First operand 314 states and 370 transitions. Second operand has 30 states, 30 states have (on average 2.3) internal successors, (69), 30 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:07:23,974 WARN L233 SmtUtils]: Spent 18.22s on a formula simplification. DAG size of input: 61 DAG size of output: 40 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)