./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 eb692b52 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-?-eb692b5 [2022-07-20 06:07:32,282 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-20 06:07:32,284 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-20 06:07:32,315 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-20 06:07:32,315 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-20 06:07:32,316 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-20 06:07:32,318 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-20 06:07:32,319 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-20 06:07:32,320 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-20 06:07:32,326 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-20 06:07:32,328 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-20 06:07:32,331 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-20 06:07:32,332 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-20 06:07:32,333 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-20 06:07:32,335 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-20 06:07:32,336 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-20 06:07:32,336 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-20 06:07:32,338 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-20 06:07:32,343 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-20 06:07:32,344 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-20 06:07:32,350 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-20 06:07:32,350 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-20 06:07:32,351 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-20 06:07:32,352 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-20 06:07:32,353 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-20 06:07:32,355 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-20 06:07:32,357 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-20 06:07:32,358 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-20 06:07:32,359 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-20 06:07:32,360 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-20 06:07:32,361 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-20 06:07:32,362 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-20 06:07:32,363 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-20 06:07:32,364 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-20 06:07:32,364 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-20 06:07:32,365 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-20 06:07:32,365 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-20 06:07:32,365 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-20 06:07:32,366 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-20 06:07:32,366 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-20 06:07:32,366 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-20 06:07:32,368 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-20 06:07:32,369 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-07-20 06:07:32,385 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-20 06:07:32,389 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-20 06:07:32,389 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-20 06:07:32,389 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-20 06:07:32,390 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-20 06:07:32,390 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-20 06:07:32,390 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-20 06:07:32,390 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-20 06:07:32,390 INFO L138 SettingsManager]: * Use SBE=true [2022-07-20 06:07:32,391 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-20 06:07:32,391 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-20 06:07:32,392 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-20 06:07:32,392 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-20 06:07:32,392 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-20 06:07:32,392 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-20 06:07:32,392 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-20 06:07:32,392 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-20 06:07:32,392 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-20 06:07:32,393 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-20 06:07:32,393 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-20 06:07:32,393 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-20 06:07:32,393 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-20 06:07:32,393 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-20 06:07:32,393 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-20 06:07:32,394 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-20 06:07:32,394 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 06:07:32,394 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-20 06:07:32,394 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-20 06:07:32,394 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-20 06:07:32,394 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-20 06:07:32,395 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-20 06:07:32,703 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-20 06:07:32,732 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-20 06:07:32,734 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-20 06:07:32,735 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-20 06:07:32,736 INFO L275 PluginConnector]: CDTParser initialized [2022-07-20 06:07:32,736 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-20 06:07:32,784 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/040c4dde8/ac588b1b07074f08baef6a768b7ef788/FLAG6816224ae [2022-07-20 06:07:33,209 INFO L306 CDTParser]: Found 1 translation units. [2022-07-20 06:07:33,210 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-optional-1.i [2022-07-20 06:07:33,217 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/040c4dde8/ac588b1b07074f08baef6a768b7ef788/FLAG6816224ae [2022-07-20 06:07:33,589 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/040c4dde8/ac588b1b07074f08baef6a768b7ef788 [2022-07-20 06:07:33,591 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-20 06:07:33,592 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-20 06:07:33,594 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-20 06:07:33,594 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-20 06:07:33,601 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-20 06:07:33,602 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 06:07:33" (1/1) ... [2022-07-20 06:07:33,603 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2177546f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:07:33, skipping insertion in model container [2022-07-20 06:07:33,603 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 06:07:33" (1/1) ... [2022-07-20 06:07:33,608 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-20 06:07:33,646 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-20 06:07:33,880 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-20 06:07:33,891 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 06:07:33,898 INFO L203 MainTranslator]: Completed pre-run [2022-07-20 06:07:33,939 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-20 06:07:33,942 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 06:07:33,976 INFO L208 MainTranslator]: Completed translation [2022-07-20 06:07:33,976 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:07:33 WrapperNode [2022-07-20 06:07:33,976 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-20 06:07:33,977 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-20 06:07:33,977 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-20 06:07:33,977 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-20 06:07:33,982 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:07:33" (1/1) ... [2022-07-20 06:07:33,996 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:07:33" (1/1) ... [2022-07-20 06:07:34,011 INFO L137 Inliner]: procedures = 119, calls = 41, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 136 [2022-07-20 06:07:34,012 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-20 06:07:34,013 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-20 06:07:34,013 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-20 06:07:34,013 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-20 06:07:34,019 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:07:33" (1/1) ... [2022-07-20 06:07:34,019 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:07:33" (1/1) ... [2022-07-20 06:07:34,021 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:07:33" (1/1) ... [2022-07-20 06:07:34,022 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:07:33" (1/1) ... [2022-07-20 06:07:34,027 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:07:33" (1/1) ... [2022-07-20 06:07:34,030 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:07:33" (1/1) ... [2022-07-20 06:07:34,031 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:07:33" (1/1) ... [2022-07-20 06:07:34,033 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-20 06:07:34,033 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-20 06:07:34,034 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-20 06:07:34,034 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-20 06:07:34,034 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:07:33" (1/1) ... [2022-07-20 06:07:34,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 06:07:34,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:07:34,068 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-20 06:07:34,078 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-20 06:07:34,096 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-20 06:07:34,096 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-20 06:07:34,097 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-20 06:07:34,097 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-20 06:07:34,097 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-20 06:07:34,097 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-20 06:07:34,097 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-20 06:07:34,097 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-20 06:07:34,097 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-20 06:07:34,097 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-20 06:07:34,159 INFO L234 CfgBuilder]: Building ICFG [2022-07-20 06:07:34,160 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-20 06:07:34,577 INFO L275 CfgBuilder]: Performing block encoding [2022-07-20 06:07:34,583 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-20 06:07:34,583 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2022-07-20 06:07:34,585 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 06:07:34 BoogieIcfgContainer [2022-07-20 06:07:34,585 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-20 06:07:34,587 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-20 06:07:34,587 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-20 06:07:34,590 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-20 06:07:34,590 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.07 06:07:33" (1/3) ... [2022-07-20 06:07:34,591 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10c92c0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 06:07:34, skipping insertion in model container [2022-07-20 06:07:34,591 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:07:33" (2/3) ... [2022-07-20 06:07:34,591 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10c92c0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 06:07:34, skipping insertion in model container [2022-07-20 06:07:34,591 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 06:07:34" (3/3) ... [2022-07-20 06:07:34,593 INFO L111 eAbstractionObserver]: Analyzing ICFG sll-optional-1.i [2022-07-20 06:07:34,605 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-20 06:07:34,605 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 66 error locations. [2022-07-20 06:07:34,651 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-20 06:07:34,656 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@78acf3be, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@181e0d75 [2022-07-20 06:07:34,657 INFO L358 AbstractCegarLoop]: Starting to check reachability of 66 error locations. [2022-07-20 06:07:34,661 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-20 06:07:34,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-07-20 06:07:34,665 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:07:34,666 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-07-20 06:07:34,666 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-20 06:07:34,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:07:34,684 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2022-07-20 06:07:34,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:07:34,703 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031751743] [2022-07-20 06:07:34,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:07:34,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:07:34,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:07:34,825 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-20 06:07:34,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:07:34,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031751743] [2022-07-20 06:07:34,827 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031751743] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:07:34,827 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:07:34,827 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-20 06:07:34,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335998891] [2022-07-20 06:07:34,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:07:34,832 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 06:07:34,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:07:34,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 06:07:34,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 06:07:34,861 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-20 06:07:35,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:07:35,011 INFO L93 Difference]: Finished difference Result 145 states and 155 transitions. [2022-07-20 06:07:35,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 06:07:35,013 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-20 06:07:35,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:07:35,024 INFO L225 Difference]: With dead ends: 145 [2022-07-20 06:07:35,024 INFO L226 Difference]: Without dead ends: 141 [2022-07-20 06:07:35,025 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-20 06:07:35,030 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-20 06:07:35,032 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-20 06:07:35,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2022-07-20 06:07:35,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 135. [2022-07-20 06:07:35,062 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-20 06:07:35,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 147 transitions. [2022-07-20 06:07:35,064 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 147 transitions. Word has length 3 [2022-07-20 06:07:35,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:07:35,065 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 147 transitions. [2022-07-20 06:07:35,065 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-20 06:07:35,066 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 147 transitions. [2022-07-20 06:07:35,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-07-20 06:07:35,066 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:07:35,066 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-07-20 06:07:35,066 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-20 06:07:35,067 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-20 06:07:35,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:07:35,067 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2022-07-20 06:07:35,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:07:35,067 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685880253] [2022-07-20 06:07:35,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:07:35,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:07:35,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:07:35,102 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-20 06:07:35,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:07:35,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685880253] [2022-07-20 06:07:35,103 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685880253] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:07:35,103 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:07:35,103 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-20 06:07:35,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977951775] [2022-07-20 06:07:35,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:07:35,105 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 06:07:35,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:07:35,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 06:07:35,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 06:07:35,106 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-20 06:07:35,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:07:35,197 INFO L93 Difference]: Finished difference Result 131 states and 143 transitions. [2022-07-20 06:07:35,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 06:07:35,198 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-20 06:07:35,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:07:35,202 INFO L225 Difference]: With dead ends: 131 [2022-07-20 06:07:35,202 INFO L226 Difference]: Without dead ends: 131 [2022-07-20 06:07:35,206 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-20 06:07:35,207 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-20 06:07:35,207 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-20 06:07:35,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2022-07-20 06:07:35,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 127. [2022-07-20 06:07:35,221 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-20 06:07:35,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 139 transitions. [2022-07-20 06:07:35,224 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 139 transitions. Word has length 3 [2022-07-20 06:07:35,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:07:35,225 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 139 transitions. [2022-07-20 06:07:35,226 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-20 06:07:35,226 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 139 transitions. [2022-07-20 06:07:35,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-20 06:07:35,228 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:07:35,228 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:07:35,228 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-20 06:07:35,229 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-20 06:07:35,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:07:35,235 INFO L85 PathProgramCache]: Analyzing trace with hash 171916845, now seen corresponding path program 1 times [2022-07-20 06:07:35,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:07:35,235 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27890364] [2022-07-20 06:07:35,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:07:35,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:07:35,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:07:35,287 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-20 06:07:35,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:07:35,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27890364] [2022-07-20 06:07:35,287 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27890364] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:07:35,288 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:07:35,288 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 06:07:35,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499382908] [2022-07-20 06:07:35,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:07:35,288 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-20 06:07:35,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:07:35,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-20 06:07:35,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-20 06:07:35,289 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-20 06:07:35,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:07:35,464 INFO L93 Difference]: Finished difference Result 171 states and 188 transitions. [2022-07-20 06:07:35,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 06:07:35,465 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-20 06:07:35,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:07:35,466 INFO L225 Difference]: With dead ends: 171 [2022-07-20 06:07:35,466 INFO L226 Difference]: Without dead ends: 171 [2022-07-20 06:07:35,466 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-20 06:07:35,467 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.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:07:35,467 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.1s Time] [2022-07-20 06:07:35,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2022-07-20 06:07:35,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 126. [2022-07-20 06:07:35,473 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-20 06:07:35,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 138 transitions. [2022-07-20 06:07:35,477 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 138 transitions. Word has length 11 [2022-07-20 06:07:35,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:07:35,477 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 138 transitions. [2022-07-20 06:07:35,477 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-20 06:07:35,478 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 138 transitions. [2022-07-20 06:07:35,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-20 06:07:35,478 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:07:35,478 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:07:35,478 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-20 06:07:35,478 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-20 06:07:35,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:07:35,479 INFO L85 PathProgramCache]: Analyzing trace with hash 171916846, now seen corresponding path program 1 times [2022-07-20 06:07:35,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:07:35,479 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110837410] [2022-07-20 06:07:35,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:07:35,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:07:35,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:07:35,606 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-20 06:07:35,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:07:35,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110837410] [2022-07-20 06:07:35,606 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110837410] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:07:35,607 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:07:35,607 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 06:07:35,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430759028] [2022-07-20 06:07:35,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:07:35,607 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-20 06:07:35,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:07:35,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-20 06:07:35,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-20 06:07:35,608 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-20 06:07:35,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:07:35,721 INFO L93 Difference]: Finished difference Result 125 states and 137 transitions. [2022-07-20 06:07:35,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 06:07:35,722 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-20 06:07:35,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:07:35,723 INFO L225 Difference]: With dead ends: 125 [2022-07-20 06:07:35,723 INFO L226 Difference]: Without dead ends: 125 [2022-07-20 06:07:35,723 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-20 06:07:35,724 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-20 06:07:35,724 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-20 06:07:35,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2022-07-20 06:07:35,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2022-07-20 06:07:35,728 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-20 06:07:35,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 137 transitions. [2022-07-20 06:07:35,728 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 137 transitions. Word has length 11 [2022-07-20 06:07:35,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:07:35,729 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 137 transitions. [2022-07-20 06:07:35,729 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-20 06:07:35,729 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 137 transitions. [2022-07-20 06:07:35,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-20 06:07:35,729 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:07:35,729 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:07:35,730 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-20 06:07:35,730 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-20 06:07:35,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:07:35,730 INFO L85 PathProgramCache]: Analyzing trace with hash -468215045, now seen corresponding path program 1 times [2022-07-20 06:07:35,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:07:35,731 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252959799] [2022-07-20 06:07:35,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:07:35,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:07:35,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:07:35,771 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-20 06:07:35,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:07:35,771 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252959799] [2022-07-20 06:07:35,771 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252959799] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:07:35,772 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:07:35,772 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 06:07:35,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047917593] [2022-07-20 06:07:35,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:07:35,772 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 06:07:35,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:07:35,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 06:07:35,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 06:07:35,773 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-20 06:07:35,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:07:35,876 INFO L93 Difference]: Finished difference Result 127 states and 138 transitions. [2022-07-20 06:07:35,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-20 06:07:35,876 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-20 06:07:35,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:07:35,877 INFO L225 Difference]: With dead ends: 127 [2022-07-20 06:07:35,877 INFO L226 Difference]: Without dead ends: 127 [2022-07-20 06:07:35,877 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-20 06:07:35,878 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-20 06:07:35,878 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-20 06:07:35,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2022-07-20 06:07:35,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 118. [2022-07-20 06:07:35,881 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-20 06:07:35,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 135 transitions. [2022-07-20 06:07:35,882 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 135 transitions. Word has length 12 [2022-07-20 06:07:35,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:07:35,882 INFO L495 AbstractCegarLoop]: Abstraction has 118 states and 135 transitions. [2022-07-20 06:07:35,882 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-20 06:07:35,882 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 135 transitions. [2022-07-20 06:07:35,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-20 06:07:35,883 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:07:35,883 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:07:35,883 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-20 06:07:35,883 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-20 06:07:35,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:07:35,884 INFO L85 PathProgramCache]: Analyzing trace with hash -468215044, now seen corresponding path program 1 times [2022-07-20 06:07:35,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:07:35,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577759312] [2022-07-20 06:07:35,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:07:35,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:07:35,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:07:35,947 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-20 06:07:35,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:07:35,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577759312] [2022-07-20 06:07:35,948 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577759312] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:07:35,948 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:07:35,948 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-20 06:07:35,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983094304] [2022-07-20 06:07:35,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:07:35,949 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 06:07:35,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:07:35,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 06:07:35,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-20 06:07:35,949 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-20 06:07:36,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:07:36,117 INFO L93 Difference]: Finished difference Result 171 states and 189 transitions. [2022-07-20 06:07:36,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-20 06:07:36,118 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-20 06:07:36,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:07:36,119 INFO L225 Difference]: With dead ends: 171 [2022-07-20 06:07:36,119 INFO L226 Difference]: Without dead ends: 171 [2022-07-20 06:07:36,119 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-20 06:07:36,120 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-20 06:07:36,120 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-20 06:07:36,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2022-07-20 06:07:36,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 146. [2022-07-20 06:07:36,123 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-20 06:07:36,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 171 transitions. [2022-07-20 06:07:36,124 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 171 transitions. Word has length 12 [2022-07-20 06:07:36,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:07:36,124 INFO L495 AbstractCegarLoop]: Abstraction has 146 states and 171 transitions. [2022-07-20 06:07:36,125 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-20 06:07:36,125 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 171 transitions. [2022-07-20 06:07:36,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-20 06:07:36,125 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:07:36,125 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:07:36,125 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-20 06:07:36,126 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-20 06:07:36,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:07:36,126 INFO L85 PathProgramCache]: Analyzing trace with hash -2003220227, now seen corresponding path program 1 times [2022-07-20 06:07:36,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:07:36,126 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409768031] [2022-07-20 06:07:36,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:07:36,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:07:36,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:07:36,164 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-20 06:07:36,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:07:36,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409768031] [2022-07-20 06:07:36,164 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409768031] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:07:36,164 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:07:36,164 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-20 06:07:36,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874097251] [2022-07-20 06:07:36,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:07:36,165 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 06:07:36,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:07:36,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 06:07:36,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 06:07:36,166 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-20 06:07:36,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:07:36,322 INFO L93 Difference]: Finished difference Result 146 states and 171 transitions. [2022-07-20 06:07:36,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-20 06:07:36,323 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-20 06:07:36,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:07:36,324 INFO L225 Difference]: With dead ends: 146 [2022-07-20 06:07:36,324 INFO L226 Difference]: Without dead ends: 146 [2022-07-20 06:07:36,324 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-20 06:07:36,328 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-20 06:07:36,328 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-20 06:07:36,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2022-07-20 06:07:36,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 145. [2022-07-20 06:07:36,340 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-20 06:07:36,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 170 transitions. [2022-07-20 06:07:36,343 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 170 transitions. Word has length 16 [2022-07-20 06:07:36,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:07:36,343 INFO L495 AbstractCegarLoop]: Abstraction has 145 states and 170 transitions. [2022-07-20 06:07:36,344 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-20 06:07:36,344 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 170 transitions. [2022-07-20 06:07:36,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-20 06:07:36,345 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:07:36,345 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:07:36,345 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-20 06:07:36,345 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-20 06:07:36,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:07:36,346 INFO L85 PathProgramCache]: Analyzing trace with hash -2003220226, now seen corresponding path program 1 times [2022-07-20 06:07:36,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:07:36,346 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668359732] [2022-07-20 06:07:36,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:07:36,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:07:36,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:07:36,411 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-20 06:07:36,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:07:36,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668359732] [2022-07-20 06:07:36,412 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668359732] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:07:36,412 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:07:36,412 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-20 06:07:36,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760879613] [2022-07-20 06:07:36,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:07:36,413 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 06:07:36,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:07:36,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 06:07:36,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 06:07:36,414 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-20 06:07:36,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:07:36,599 INFO L93 Difference]: Finished difference Result 137 states and 162 transitions. [2022-07-20 06:07:36,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-20 06:07:36,600 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-20 06:07:36,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:07:36,600 INFO L225 Difference]: With dead ends: 137 [2022-07-20 06:07:36,601 INFO L226 Difference]: Without dead ends: 137 [2022-07-20 06:07:36,601 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-20 06:07:36,601 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-20 06:07:36,602 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-20 06:07:36,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2022-07-20 06:07:36,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 130. [2022-07-20 06:07:36,607 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-20 06:07:36,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 154 transitions. [2022-07-20 06:07:36,607 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 154 transitions. Word has length 16 [2022-07-20 06:07:36,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:07:36,608 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 154 transitions. [2022-07-20 06:07:36,608 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-20 06:07:36,608 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 154 transitions. [2022-07-20 06:07:36,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-20 06:07:36,611 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:07:36,611 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:07:36,611 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-20 06:07:36,611 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-20 06:07:36,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:07:36,612 INFO L85 PathProgramCache]: Analyzing trace with hash 2123452236, now seen corresponding path program 1 times [2022-07-20 06:07:36,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:07:36,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199106933] [2022-07-20 06:07:36,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:07:36,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:07:36,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:07:36,666 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-20 06:07:36,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:07:36,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199106933] [2022-07-20 06:07:36,667 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199106933] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:07:36,667 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:07:36,667 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 06:07:36,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605768058] [2022-07-20 06:07:36,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:07:36,668 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 06:07:36,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:07:36,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 06:07:36,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 06:07:36,669 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-20 06:07:36,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:07:36,747 INFO L93 Difference]: Finished difference Result 154 states and 173 transitions. [2022-07-20 06:07:36,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 06:07:36,748 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-20 06:07:36,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:07:36,748 INFO L225 Difference]: With dead ends: 154 [2022-07-20 06:07:36,748 INFO L226 Difference]: Without dead ends: 154 [2022-07-20 06:07:36,749 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-20 06:07:36,751 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-20 06:07:36,751 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-20 06:07:36,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2022-07-20 06:07:36,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 130. [2022-07-20 06:07:36,754 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-20 06:07:36,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 152 transitions. [2022-07-20 06:07:36,755 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 152 transitions. Word has length 17 [2022-07-20 06:07:36,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:07:36,755 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 152 transitions. [2022-07-20 06:07:36,755 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-20 06:07:36,755 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 152 transitions. [2022-07-20 06:07:36,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-20 06:07:36,759 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:07:36,759 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-20 06:07:36,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-20 06:07:36,759 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-20 06:07:36,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:07:36,760 INFO L85 PathProgramCache]: Analyzing trace with hash -1866791259, now seen corresponding path program 1 times [2022-07-20 06:07:36,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:07:36,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975338526] [2022-07-20 06:07:36,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:07:36,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:07:36,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:07:36,823 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-20 06:07:36,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:07:36,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975338526] [2022-07-20 06:07:36,824 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975338526] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:07:36,824 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:07:36,824 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 06:07:36,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362861538] [2022-07-20 06:07:36,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:07:36,824 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 06:07:36,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:07:36,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 06:07:36,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 06:07:36,825 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-20 06:07:36,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:07:36,839 INFO L93 Difference]: Finished difference Result 156 states and 186 transitions. [2022-07-20 06:07:36,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-20 06:07:36,840 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-20 06:07:36,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:07:36,841 INFO L225 Difference]: With dead ends: 156 [2022-07-20 06:07:36,841 INFO L226 Difference]: Without dead ends: 156 [2022-07-20 06:07:36,841 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-20 06:07:36,841 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-20 06:07:36,842 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-20 06:07:36,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2022-07-20 06:07:36,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 134. [2022-07-20 06:07:36,844 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-20 06:07:36,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 156 transitions. [2022-07-20 06:07:36,845 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 156 transitions. Word has length 20 [2022-07-20 06:07:36,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:07:36,845 INFO L495 AbstractCegarLoop]: Abstraction has 134 states and 156 transitions. [2022-07-20 06:07:36,845 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-20 06:07:36,845 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 156 transitions. [2022-07-20 06:07:36,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-20 06:07:36,846 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:07:36,846 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-20 06:07:36,846 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-20 06:07:36,846 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-20 06:07:36,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:07:36,847 INFO L85 PathProgramCache]: Analyzing trace with hash 72886850, now seen corresponding path program 1 times [2022-07-20 06:07:36,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:07:36,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081034164] [2022-07-20 06:07:36,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:07:36,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:07:36,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:07:36,936 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-20 06:07:36,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:07:36,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081034164] [2022-07-20 06:07:36,937 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081034164] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:07:36,937 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:07:36,937 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-20 06:07:36,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812695295] [2022-07-20 06:07:36,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:07:36,937 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-20 06:07:36,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:07:36,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-20 06:07:36,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-20 06:07:36,938 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-20 06:07:37,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:07:37,180 INFO L93 Difference]: Finished difference Result 247 states and 287 transitions. [2022-07-20 06:07:37,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-20 06:07:37,181 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-20 06:07:37,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:07:37,183 INFO L225 Difference]: With dead ends: 247 [2022-07-20 06:07:37,185 INFO L226 Difference]: Without dead ends: 247 [2022-07-20 06:07:37,185 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-20 06:07:37,186 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 246 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-20 06:07:37,186 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-20 06:07:37,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2022-07-20 06:07:37,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 148. [2022-07-20 06:07:37,190 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-20 06:07:37,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 174 transitions. [2022-07-20 06:07:37,191 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 174 transitions. Word has length 22 [2022-07-20 06:07:37,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:07:37,192 INFO L495 AbstractCegarLoop]: Abstraction has 148 states and 174 transitions. [2022-07-20 06:07:37,192 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-20 06:07:37,193 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 174 transitions. [2022-07-20 06:07:37,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-20 06:07:37,194 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:07:37,194 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-20 06:07:37,195 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-20 06:07:37,196 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-20 06:07:37,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:07:37,196 INFO L85 PathProgramCache]: Analyzing trace with hash 72886851, now seen corresponding path program 1 times [2022-07-20 06:07:37,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:07:37,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174889872] [2022-07-20 06:07:37,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:07:37,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:07:37,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:07:37,304 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-20 06:07:37,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:07:37,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174889872] [2022-07-20 06:07:37,304 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174889872] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:07:37,305 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:07:37,305 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-20 06:07:37,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143406909] [2022-07-20 06:07:37,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:07:37,305 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-20 06:07:37,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:07:37,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-20 06:07:37,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-20 06:07:37,306 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-20 06:07:37,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:07:37,567 INFO L93 Difference]: Finished difference Result 224 states and 257 transitions. [2022-07-20 06:07:37,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-20 06:07:37,567 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-20 06:07:37,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:07:37,568 INFO L225 Difference]: With dead ends: 224 [2022-07-20 06:07:37,568 INFO L226 Difference]: Without dead ends: 224 [2022-07-20 06:07:37,568 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-20 06:07:37,569 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 256 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-20 06:07:37,569 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-20 06:07:37,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2022-07-20 06:07:37,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 144. [2022-07-20 06:07:37,571 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-20 06:07:37,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 168 transitions. [2022-07-20 06:07:37,572 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 168 transitions. Word has length 22 [2022-07-20 06:07:37,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:07:37,572 INFO L495 AbstractCegarLoop]: Abstraction has 144 states and 168 transitions. [2022-07-20 06:07:37,572 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-20 06:07:37,572 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 168 transitions. [2022-07-20 06:07:37,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-20 06:07:37,572 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:07:37,572 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-20 06:07:37,572 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-20 06:07:37,572 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-20 06:07:37,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:07:37,573 INFO L85 PathProgramCache]: Analyzing trace with hash 1318553294, now seen corresponding path program 1 times [2022-07-20 06:07:37,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:07:37,573 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677901170] [2022-07-20 06:07:37,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:07:37,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:07:37,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:07:37,594 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-20 06:07:37,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:07:37,594 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677901170] [2022-07-20 06:07:37,594 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677901170] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:07:37,594 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:07:37,594 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 06:07:37,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093668531] [2022-07-20 06:07:37,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:07:37,595 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 06:07:37,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:07:37,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 06:07:37,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 06:07:37,596 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-20 06:07:37,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:07:37,601 INFO L93 Difference]: Finished difference Result 146 states and 170 transitions. [2022-07-20 06:07:37,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 06:07:37,602 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-20 06:07:37,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:07:37,602 INFO L225 Difference]: With dead ends: 146 [2022-07-20 06:07:37,602 INFO L226 Difference]: Without dead ends: 146 [2022-07-20 06:07:37,602 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-20 06:07:37,603 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-20 06:07:37,604 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-20 06:07:37,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2022-07-20 06:07:37,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2022-07-20 06:07:37,606 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-20 06:07:37,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 170 transitions. [2022-07-20 06:07:37,607 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 170 transitions. Word has length 22 [2022-07-20 06:07:37,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:07:37,607 INFO L495 AbstractCegarLoop]: Abstraction has 146 states and 170 transitions. [2022-07-20 06:07:37,607 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-20 06:07:37,607 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 170 transitions. [2022-07-20 06:07:37,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-20 06:07:37,607 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:07:37,607 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-20 06:07:37,608 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-20 06:07:37,608 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-20 06:07:37,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:07:37,608 INFO L85 PathProgramCache]: Analyzing trace with hash 116002131, now seen corresponding path program 1 times [2022-07-20 06:07:37,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:07:37,609 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112925283] [2022-07-20 06:07:37,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:07:37,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:07:37,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:07:37,691 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-20 06:07:37,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:07:37,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112925283] [2022-07-20 06:07:37,692 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112925283] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:07:37,692 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:07:37,692 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-20 06:07:37,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196194655] [2022-07-20 06:07:37,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:07:37,692 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-20 06:07:37,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:07:37,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-20 06:07:37,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-20 06:07:37,693 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-20 06:07:37,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:07:37,882 INFO L93 Difference]: Finished difference Result 219 states and 250 transitions. [2022-07-20 06:07:37,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-20 06:07:37,883 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-20 06:07:37,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:07:37,884 INFO L225 Difference]: With dead ends: 219 [2022-07-20 06:07:37,884 INFO L226 Difference]: Without dead ends: 219 [2022-07-20 06:07:37,884 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-20 06:07:37,884 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 173 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:07:37,884 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.1s Time] [2022-07-20 06:07:37,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2022-07-20 06:07:37,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 152. [2022-07-20 06:07:37,886 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-20 06:07:37,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 177 transitions. [2022-07-20 06:07:37,887 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 177 transitions. Word has length 24 [2022-07-20 06:07:37,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:07:37,887 INFO L495 AbstractCegarLoop]: Abstraction has 152 states and 177 transitions. [2022-07-20 06:07:37,887 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-20 06:07:37,887 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 177 transitions. [2022-07-20 06:07:37,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-20 06:07:37,887 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:07:37,887 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-20 06:07:37,887 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-20 06:07:37,888 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-20 06:07:37,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:07:37,888 INFO L85 PathProgramCache]: Analyzing trace with hash 913286409, now seen corresponding path program 1 times [2022-07-20 06:07:37,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:07:37,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901579480] [2022-07-20 06:07:37,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:07:37,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:07:37,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:07:37,934 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-20 06:07:37,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:07:37,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901579480] [2022-07-20 06:07:37,934 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901579480] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:07:37,934 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:07:37,934 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 06:07:37,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935568385] [2022-07-20 06:07:37,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:07:37,935 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-20 06:07:37,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:07:37,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-20 06:07:37,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-20 06:07:37,936 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-20 06:07:38,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:07:38,054 INFO L93 Difference]: Finished difference Result 158 states and 184 transitions. [2022-07-20 06:07:38,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 06:07:38,054 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-20 06:07:38,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:07:38,055 INFO L225 Difference]: With dead ends: 158 [2022-07-20 06:07:38,055 INFO L226 Difference]: Without dead ends: 158 [2022-07-20 06:07:38,057 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-20 06:07:38,058 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-20 06:07:38,058 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-20 06:07:38,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2022-07-20 06:07:38,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 151. [2022-07-20 06:07:38,060 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-20 06:07:38,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 176 transitions. [2022-07-20 06:07:38,060 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 176 transitions. Word has length 24 [2022-07-20 06:07:38,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:07:38,061 INFO L495 AbstractCegarLoop]: Abstraction has 151 states and 176 transitions. [2022-07-20 06:07:38,061 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-20 06:07:38,061 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 176 transitions. [2022-07-20 06:07:38,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-20 06:07:38,063 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:07:38,063 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-20 06:07:38,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-20 06:07:38,063 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-20 06:07:38,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:07:38,064 INFO L85 PathProgramCache]: Analyzing trace with hash 913286410, now seen corresponding path program 1 times [2022-07-20 06:07:38,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:07:38,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624400879] [2022-07-20 06:07:38,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:07:38,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:07:38,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:07:38,132 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-20 06:07:38,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:07:38,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624400879] [2022-07-20 06:07:38,134 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624400879] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:07:38,134 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:07:38,134 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 06:07:38,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10996211] [2022-07-20 06:07:38,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:07:38,135 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-20 06:07:38,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:07:38,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-20 06:07:38,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-20 06:07:38,136 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-20 06:07:38,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:07:38,256 INFO L93 Difference]: Finished difference Result 150 states and 175 transitions. [2022-07-20 06:07:38,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 06:07:38,256 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-20 06:07:38,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:07:38,258 INFO L225 Difference]: With dead ends: 150 [2022-07-20 06:07:38,258 INFO L226 Difference]: Without dead ends: 150 [2022-07-20 06:07:38,258 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-20 06:07:38,258 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-20 06:07:38,258 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-20 06:07:38,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2022-07-20 06:07:38,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2022-07-20 06:07:38,261 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-20 06:07:38,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 175 transitions. [2022-07-20 06:07:38,261 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 175 transitions. Word has length 24 [2022-07-20 06:07:38,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:07:38,262 INFO L495 AbstractCegarLoop]: Abstraction has 150 states and 175 transitions. [2022-07-20 06:07:38,262 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-20 06:07:38,262 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 175 transitions. [2022-07-20 06:07:38,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-20 06:07:38,262 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:07:38,262 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-20 06:07:38,263 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-20 06:07:38,263 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-20 06:07:38,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:07:38,263 INFO L85 PathProgramCache]: Analyzing trace with hash 1848177146, now seen corresponding path program 1 times [2022-07-20 06:07:38,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:07:38,263 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777732179] [2022-07-20 06:07:38,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:07:38,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:07:38,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:07:38,344 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-20 06:07:38,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:07:38,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777732179] [2022-07-20 06:07:38,345 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777732179] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:07:38,345 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:07:38,345 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-20 06:07:38,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829328863] [2022-07-20 06:07:38,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:07:38,346 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-20 06:07:38,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:07:38,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-20 06:07:38,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-07-20 06:07:38,346 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-20 06:07:38,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:07:38,709 INFO L93 Difference]: Finished difference Result 309 states and 356 transitions. [2022-07-20 06:07:38,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-20 06:07:38,710 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-20 06:07:38,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:07:38,711 INFO L225 Difference]: With dead ends: 309 [2022-07-20 06:07:38,711 INFO L226 Difference]: Without dead ends: 309 [2022-07-20 06:07:38,711 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=112, Invalid=350, Unknown=0, NotChecked=0, Total=462 [2022-07-20 06:07:38,712 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.2s IncrementalHoareTripleChecker+Time [2022-07-20 06:07:38,712 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.2s Time] [2022-07-20 06:07:38,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2022-07-20 06:07:38,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 163. [2022-07-20 06:07:38,714 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-20 06:07:38,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 192 transitions. [2022-07-20 06:07:38,715 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 192 transitions. Word has length 26 [2022-07-20 06:07:38,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:07:38,715 INFO L495 AbstractCegarLoop]: Abstraction has 163 states and 192 transitions. [2022-07-20 06:07:38,715 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-20 06:07:38,715 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 192 transitions. [2022-07-20 06:07:38,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-20 06:07:38,715 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:07:38,715 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-20 06:07:38,716 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-20 06:07:38,716 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-20 06:07:38,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:07:38,716 INFO L85 PathProgramCache]: Analyzing trace with hash 1848177147, now seen corresponding path program 1 times [2022-07-20 06:07:38,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:07:38,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144294800] [2022-07-20 06:07:38,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:07:38,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:07:38,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:07:38,854 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-20 06:07:38,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:07:38,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144294800] [2022-07-20 06:07:38,855 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144294800] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:07:38,855 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:07:38,855 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-20 06:07:38,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630818935] [2022-07-20 06:07:38,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:07:38,855 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-20 06:07:38,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:07:38,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-20 06:07:38,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-07-20 06:07:38,856 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-20 06:07:39,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:07:39,265 INFO L93 Difference]: Finished difference Result 252 states and 290 transitions. [2022-07-20 06:07:39,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-20 06:07:39,265 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-20 06:07:39,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:07:39,266 INFO L225 Difference]: With dead ends: 252 [2022-07-20 06:07:39,266 INFO L226 Difference]: Without dead ends: 252 [2022-07-20 06:07:39,267 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-20 06:07:39,267 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 229 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 580 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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-20 06:07:39,267 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-20 06:07:39,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2022-07-20 06:07:39,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 163. [2022-07-20 06:07:39,269 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-20 06:07:39,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 191 transitions. [2022-07-20 06:07:39,270 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 191 transitions. Word has length 26 [2022-07-20 06:07:39,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:07:39,270 INFO L495 AbstractCegarLoop]: Abstraction has 163 states and 191 transitions. [2022-07-20 06:07:39,270 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-20 06:07:39,270 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 191 transitions. [2022-07-20 06:07:39,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-20 06:07:39,270 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:07:39,270 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-20 06:07:39,270 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-20 06:07:39,271 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-20 06:07:39,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:07:39,271 INFO L85 PathProgramCache]: Analyzing trace with hash -1639700775, now seen corresponding path program 1 times [2022-07-20 06:07:39,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:07:39,271 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550635009] [2022-07-20 06:07:39,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:07:39,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:07:39,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:07:39,291 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-20 06:07:39,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:07:39,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550635009] [2022-07-20 06:07:39,291 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550635009] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:07:39,291 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:07:39,291 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 06:07:39,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750931553] [2022-07-20 06:07:39,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:07:39,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 06:07:39,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:07:39,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 06:07:39,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 06:07:39,293 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-20 06:07:39,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:07:39,306 INFO L93 Difference]: Finished difference Result 175 states and 204 transitions. [2022-07-20 06:07:39,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-20 06:07:39,307 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-20 06:07:39,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:07:39,308 INFO L225 Difference]: With dead ends: 175 [2022-07-20 06:07:39,308 INFO L226 Difference]: Without dead ends: 175 [2022-07-20 06:07:39,308 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-20 06:07:39,308 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-20 06:07:39,308 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-20 06:07:39,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2022-07-20 06:07:39,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 167. [2022-07-20 06:07:39,311 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-20 06:07:39,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 194 transitions. [2022-07-20 06:07:39,311 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 194 transitions. Word has length 26 [2022-07-20 06:07:39,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:07:39,311 INFO L495 AbstractCegarLoop]: Abstraction has 167 states and 194 transitions. [2022-07-20 06:07:39,311 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-20 06:07:39,312 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 194 transitions. [2022-07-20 06:07:39,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-20 06:07:39,312 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:07:39,312 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-20 06:07:39,312 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-20 06:07:39,312 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-20 06:07:39,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:07:39,313 INFO L85 PathProgramCache]: Analyzing trace with hash 1067960075, now seen corresponding path program 1 times [2022-07-20 06:07:39,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:07:39,313 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125839147] [2022-07-20 06:07:39,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:07:39,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:07:39,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:07:39,393 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-20 06:07:39,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:07:39,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125839147] [2022-07-20 06:07:39,394 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2125839147] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:07:39,394 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:07:39,394 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-20 06:07:39,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428600062] [2022-07-20 06:07:39,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:07:39,395 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-20 06:07:39,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:07:39,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-20 06:07:39,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2022-07-20 06:07:39,395 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-20 06:07:39,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:07:39,690 INFO L93 Difference]: Finished difference Result 247 states and 277 transitions. [2022-07-20 06:07:39,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-20 06:07:39,690 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-20 06:07:39,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:07:39,691 INFO L225 Difference]: With dead ends: 247 [2022-07-20 06:07:39,691 INFO L226 Difference]: Without dead ends: 247 [2022-07-20 06:07:39,692 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=112, Invalid=350, Unknown=0, NotChecked=0, Total=462 [2022-07-20 06:07:39,692 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-20 06:07:39,692 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-20 06:07:39,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2022-07-20 06:07:39,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 167. [2022-07-20 06:07:39,694 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-20 06:07:39,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 193 transitions. [2022-07-20 06:07:39,695 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 193 transitions. Word has length 28 [2022-07-20 06:07:39,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:07:39,695 INFO L495 AbstractCegarLoop]: Abstraction has 167 states and 193 transitions. [2022-07-20 06:07:39,695 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-20 06:07:39,695 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 193 transitions. [2022-07-20 06:07:39,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-20 06:07:39,704 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:07:39,704 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-20 06:07:39,704 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-20 06:07:39,704 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-20 06:07:39,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:07:39,705 INFO L85 PathProgramCache]: Analyzing trace with hash 1161159390, now seen corresponding path program 1 times [2022-07-20 06:07:39,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:07:39,705 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771151816] [2022-07-20 06:07:39,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:07:39,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:07:39,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:07:39,750 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-20 06:07:39,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:07:39,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771151816] [2022-07-20 06:07:39,751 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771151816] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:07:39,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [448654224] [2022-07-20 06:07:39,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:07:39,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:07:39,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:07:39,791 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-20 06:07:39,829 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-20 06:07:39,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:07:39,880 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 31 conjunts are in the unsatisfiable core [2022-07-20 06:07:39,885 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:07:39,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 11 treesize of output 7 [2022-07-20 06:07:39,939 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-20 06:07:39,989 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:07:39,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 21 treesize of output 20 [2022-07-20 06:07:40,002 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:07:40,003 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-20 06:07:40,026 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:07:40,027 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-20 06:07:40,032 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:07:40,033 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-20 06:07:40,142 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:07:40,143 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-20 06:07:40,148 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:07:40,149 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:07:40,150 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-20 06:07:40,157 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-20 06:07:40,158 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:07:46,244 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-20 06:07:46,247 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:07:46,247 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:07:46,249 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-20 06:07:46,252 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-20 06:07:46,253 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:07:46,254 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:07:46,254 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:07:46,265 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-20 06:07:46,265 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [448654224] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:07:46,265 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 06:07:46,265 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 9] total 14 [2022-07-20 06:07:46,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254067352] [2022-07-20 06:07:46,265 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 06:07:46,266 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-20 06:07:46,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:07:46,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-20 06:07:46,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=141, Unknown=5, NotChecked=0, Total=182 [2022-07-20 06:07:46,266 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-20 06:07:46,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:07:46,504 INFO L93 Difference]: Finished difference Result 208 states and 237 transitions. [2022-07-20 06:07:46,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-20 06:07:46,505 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-20 06:07:46,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:07:46,505 INFO L225 Difference]: With dead ends: 208 [2022-07-20 06:07:46,505 INFO L226 Difference]: Without dead ends: 208 [2022-07-20 06:07:46,506 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=110, Invalid=305, Unknown=5, NotChecked=0, Total=420 [2022-07-20 06:07:46,506 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.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:07:46,506 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.1s Time] [2022-07-20 06:07:46,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2022-07-20 06:07:46,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 180. [2022-07-20 06:07:46,508 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-20 06:07:46,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 208 transitions. [2022-07-20 06:07:46,509 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 208 transitions. Word has length 28 [2022-07-20 06:07:46,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:07:46,509 INFO L495 AbstractCegarLoop]: Abstraction has 180 states and 208 transitions. [2022-07-20 06:07:46,509 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-20 06:07:46,509 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 208 transitions. [2022-07-20 06:07:46,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-20 06:07:46,509 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:07:46,509 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-20 06:07:46,542 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-20 06:07:46,710 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-20 06:07:46,710 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-20 06:07:46,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:07:46,711 INFO L85 PathProgramCache]: Analyzing trace with hash 1511540264, now seen corresponding path program 1 times [2022-07-20 06:07:46,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:07:46,711 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578463726] [2022-07-20 06:07:46,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:07:46,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:07:46,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:07:46,776 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-20 06:07:46,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:07:46,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578463726] [2022-07-20 06:07:46,777 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578463726] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:07:46,777 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:07:46,777 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-20 06:07:46,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379063517] [2022-07-20 06:07:46,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:07:46,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-20 06:07:46,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:07:46,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-20 06:07:46,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-20 06:07:46,778 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-20 06:07:47,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:07:47,000 INFO L93 Difference]: Finished difference Result 225 states and 256 transitions. [2022-07-20 06:07:47,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-20 06:07:47,002 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-20 06:07:47,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:07:47,003 INFO L225 Difference]: With dead ends: 225 [2022-07-20 06:07:47,003 INFO L226 Difference]: Without dead ends: 225 [2022-07-20 06:07:47,003 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-20 06:07:47,004 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.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:07:47,004 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.1s Time] [2022-07-20 06:07:47,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2022-07-20 06:07:47,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 186. [2022-07-20 06:07:47,006 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-20 06:07:47,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 215 transitions. [2022-07-20 06:07:47,006 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 215 transitions. Word has length 30 [2022-07-20 06:07:47,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:07:47,006 INFO L495 AbstractCegarLoop]: Abstraction has 186 states and 215 transitions. [2022-07-20 06:07:47,006 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-20 06:07:47,006 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 215 transitions. [2022-07-20 06:07:47,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-07-20 06:07:47,007 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:07:47,007 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-20 06:07:47,007 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-07-20 06:07:47,007 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-20 06:07:47,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:07:47,007 INFO L85 PathProgramCache]: Analyzing trace with hash 238082658, now seen corresponding path program 1 times [2022-07-20 06:07:47,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:07:47,007 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702008480] [2022-07-20 06:07:47,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:07:47,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:07:47,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:07:47,109 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-20 06:07:47,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:07:47,109 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702008480] [2022-07-20 06:07:47,109 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702008480] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:07:47,109 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:07:47,109 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-07-20 06:07:47,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271936397] [2022-07-20 06:07:47,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:07:47,110 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-20 06:07:47,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:07:47,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-20 06:07:47,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2022-07-20 06:07:47,111 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-20 06:07:47,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:07:47,612 INFO L93 Difference]: Finished difference Result 224 states and 250 transitions. [2022-07-20 06:07:47,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-20 06:07:47,613 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-20 06:07:47,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:07:47,614 INFO L225 Difference]: With dead ends: 224 [2022-07-20 06:07:47,614 INFO L226 Difference]: Without dead ends: 224 [2022-07-20 06:07:47,614 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=151, Invalid=551, Unknown=0, NotChecked=0, Total=702 [2022-07-20 06:07:47,614 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.3s IncrementalHoareTripleChecker+Time [2022-07-20 06:07:47,614 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.3s Time] [2022-07-20 06:07:47,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2022-07-20 06:07:47,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 183. [2022-07-20 06:07:47,616 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-20 06:07:47,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 210 transitions. [2022-07-20 06:07:47,617 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 210 transitions. Word has length 33 [2022-07-20 06:07:47,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:07:47,617 INFO L495 AbstractCegarLoop]: Abstraction has 183 states and 210 transitions. [2022-07-20 06:07:47,617 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-20 06:07:47,617 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 210 transitions. [2022-07-20 06:07:47,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-20 06:07:47,617 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:07:47,617 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-20 06:07:47,617 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-07-20 06:07:47,618 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-20 06:07:47,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:07:47,618 INFO L85 PathProgramCache]: Analyzing trace with hash 745727206, now seen corresponding path program 1 times [2022-07-20 06:07:47,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:07:47,618 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433627771] [2022-07-20 06:07:47,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:07:47,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:07:47,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:07:47,841 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-20 06:07:47,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:07:47,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433627771] [2022-07-20 06:07:47,841 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433627771] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:07:47,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1742986580] [2022-07-20 06:07:47,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:07:47,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:07:47,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:07:47,847 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-20 06:07:47,848 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-20 06:07:47,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:07:47,969 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 39 conjunts are in the unsatisfiable core [2022-07-20 06:07:47,978 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:07:47,985 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-20 06:07:48,005 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-20 06:07:48,026 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:07:48,027 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-20 06:07:48,082 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 06:07:48,082 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-20 06:07:48,122 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-20 06:07:48,129 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:07:48,130 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-20 06:07:48,171 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-20 06:07:48,230 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-20 06:07:48,252 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-20 06:07:48,263 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-20 06:07:48,314 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-20 06:07:48,343 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-20 06:07:48,344 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:07:48,402 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-20 06:07:48,418 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-20 06:07:48,422 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-20 06:07:48,427 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-20 06:07:48,468 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-20 06:07:48,479 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-20 06:07:48,485 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:07:48,486 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:07:48,487 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:07:48,491 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:07:48,491 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-20 06:07:48,494 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-20 06:07:48,497 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-20 06:07:48,528 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-20 06:07:48,529 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1742986580] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:07:48,529 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 06:07:48,529 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 14] total 35 [2022-07-20 06:07:48,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024697755] [2022-07-20 06:07:48,530 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 06:07:48,531 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-07-20 06:07:48,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:07:48,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-07-20 06:07:48,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=709, Unknown=6, NotChecked=354, Total=1190 [2022-07-20 06:07:48,533 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-20 06:07:50,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:07:50,407 INFO L93 Difference]: Finished difference Result 623 states and 694 transitions. [2022-07-20 06:07:50,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2022-07-20 06:07:50,407 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-20 06:07:50,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:07:50,409 INFO L225 Difference]: With dead ends: 623 [2022-07-20 06:07:50,409 INFO L226 Difference]: Without dead ends: 623 [2022-07-20 06:07:50,410 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 56 SyntacticMatches, 5 SemanticMatches, 75 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 1339 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=835, Invalid=4138, Unknown=21, NotChecked=858, Total=5852 [2022-07-20 06:07:50,411 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 949 mSDsluCounter, 1606 mSDsCounter, 0 mSdLazyCounter, 1419 mSolverCounterSat, 159 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 949 SdHoareTripleChecker+Valid, 1685 SdHoareTripleChecker+Invalid, 3356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 159 IncrementalHoareTripleChecker+Valid, 1419 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1778 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-20 06:07:50,411 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [949 Valid, 1685 Invalid, 3356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [159 Valid, 1419 Invalid, 0 Unknown, 1778 Unchecked, 0.6s Time] [2022-07-20 06:07:50,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2022-07-20 06:07:50,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 210. [2022-07-20 06:07:50,415 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-20 06:07:50,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 242 transitions. [2022-07-20 06:07:50,416 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 242 transitions. Word has length 34 [2022-07-20 06:07:50,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:07:50,416 INFO L495 AbstractCegarLoop]: Abstraction has 210 states and 242 transitions. [2022-07-20 06:07:50,416 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-20 06:07:50,416 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 242 transitions. [2022-07-20 06:07:50,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-20 06:07:50,417 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:07:50,417 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-20 06:07:50,449 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-20 06:07:50,633 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-20 06:07:50,633 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-20 06:07:50,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:07:50,634 INFO L85 PathProgramCache]: Analyzing trace with hash 1970599096, now seen corresponding path program 1 times [2022-07-20 06:07:50,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:07:50,634 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793767576] [2022-07-20 06:07:50,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:07:50,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:07:50,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:07:50,677 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-20 06:07:50,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:07:50,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793767576] [2022-07-20 06:07:50,677 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793767576] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:07:50,677 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:07:50,677 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 06:07:50,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580153443] [2022-07-20 06:07:50,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:07:50,678 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 06:07:50,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:07:50,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 06:07:50,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 06:07:50,679 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-20 06:07:50,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:07:50,742 INFO L93 Difference]: Finished difference Result 224 states and 250 transitions. [2022-07-20 06:07:50,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 06:07:50,743 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-20 06:07:50,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:07:50,743 INFO L225 Difference]: With dead ends: 224 [2022-07-20 06:07:50,744 INFO L226 Difference]: Without dead ends: 224 [2022-07-20 06:07:50,744 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-20 06:07:50,747 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 115 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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-20 06:07:50,747 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-20 06:07:50,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2022-07-20 06:07:50,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 212. [2022-07-20 06:07:50,763 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-20 06:07:50,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 244 transitions. [2022-07-20 06:07:50,764 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 244 transitions. Word has length 35 [2022-07-20 06:07:50,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:07:50,764 INFO L495 AbstractCegarLoop]: Abstraction has 212 states and 244 transitions. [2022-07-20 06:07:50,764 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-20 06:07:50,765 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 244 transitions. [2022-07-20 06:07:50,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-20 06:07:50,765 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:07:50,765 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-20 06:07:50,765 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-07-20 06:07:50,765 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-20 06:07:50,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:07:50,766 INFO L85 PathProgramCache]: Analyzing trace with hash 1970588111, now seen corresponding path program 1 times [2022-07-20 06:07:50,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:07:50,766 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143344973] [2022-07-20 06:07:50,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:07:50,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:07:50,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:07:50,882 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-20 06:07:50,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:07:50,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143344973] [2022-07-20 06:07:50,883 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143344973] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:07:50,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1294717135] [2022-07-20 06:07:50,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:07:50,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:07:50,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:07:50,885 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-20 06:07:50,886 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-20 06:07:50,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:07:50,963 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 23 conjunts are in the unsatisfiable core [2022-07-20 06:07:50,964 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:07:51,199 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:07:51,201 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:07:51,201 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-20 06:07:51,214 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-20 06:07:51,214 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:07:51,520 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:07:51,520 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 30 treesize of output 27 [2022-07-20 06:07:51,680 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-20 06:07:51,680 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1294717135] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:07:51,680 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 06:07:51,680 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 11] total 28 [2022-07-20 06:07:51,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626422579] [2022-07-20 06:07:51,681 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 06:07:51,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-07-20 06:07:51,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:07:51,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-07-20 06:07:51,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=640, Unknown=0, NotChecked=0, Total=756 [2022-07-20 06:07:51,682 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-20 06:07:52,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:07:52,374 INFO L93 Difference]: Finished difference Result 253 states and 286 transitions. [2022-07-20 06:07:52,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-07-20 06:07:52,375 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-20 06:07:52,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:07:52,375 INFO L225 Difference]: With dead ends: 253 [2022-07-20 06:07:52,375 INFO L226 Difference]: Without dead ends: 253 [2022-07-20 06:07:52,376 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 52 SyntacticMatches, 6 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 2 DeprecatedPredicates, 526 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=356, Invalid=1536, Unknown=0, NotChecked=0, Total=1892 [2022-07-20 06:07:52,376 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.3s IncrementalHoareTripleChecker+Time [2022-07-20 06:07:52,376 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.3s Time] [2022-07-20 06:07:52,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2022-07-20 06:07:52,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 240. [2022-07-20 06:07:52,379 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-20 06:07:52,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 273 transitions. [2022-07-20 06:07:52,379 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 273 transitions. Word has length 35 [2022-07-20 06:07:52,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:07:52,379 INFO L495 AbstractCegarLoop]: Abstraction has 240 states and 273 transitions. [2022-07-20 06:07:52,379 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-20 06:07:52,379 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 273 transitions. [2022-07-20 06:07:52,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-20 06:07:52,380 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:07:52,380 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-20 06:07:52,413 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-20 06:07:52,583 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-20 06:07:52,584 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-20 06:07:52,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:07:52,584 INFO L85 PathProgramCache]: Analyzing trace with hash -1824477449, now seen corresponding path program 1 times [2022-07-20 06:07:52,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:07:52,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229612294] [2022-07-20 06:07:52,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:07:52,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:07:52,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:07:52,817 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-20 06:07:52,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:07:52,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229612294] [2022-07-20 06:07:52,817 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229612294] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:07:52,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [406033623] [2022-07-20 06:07:52,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:07:52,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:07:52,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:07:52,820 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-20 06:07:52,855 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-20 06:07:52,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:07:52,928 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 44 conjunts are in the unsatisfiable core [2022-07-20 06:07:52,932 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:07:52,935 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-20 06:07:52,950 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-20 06:07:52,954 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-20 06:07:52,989 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 06:07:52,989 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-20 06:07:52,997 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:07:52,998 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-20 06:07:53,003 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:07:53,003 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-20 06:07:53,093 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-20 06:07:53,093 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-20 06:07:53,098 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-20 06:07:53,106 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:07:53,107 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-20 06:07:53,163 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:07:53,164 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-20 06:07:53,187 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-20 06:07:53,187 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-20 06:07:53,190 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-20 06:07:53,220 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:07:53,220 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-20 06:07:53,223 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-20 06:07:53,388 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-20 06:07:53,393 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:07:53,394 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:07:53,394 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-20 06:07:53,400 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-20 06:07:53,400 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:07:53,463 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-20 06:07:53,494 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-20 06:07:53,499 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-20 06:07:53,508 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-20 06:07:53,640 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:07:53,643 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:07:53,644 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-20 06:07:53,647 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:07:53,648 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:07:53,648 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 44 treesize of output 28 [2022-07-20 06:07:53,651 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-20 06:07:53,655 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:07:53,657 INFO L356 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2022-07-20 06:07:53,657 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-20 06:07:53,679 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-20 06:07:53,679 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [406033623] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:07:53,680 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 06:07:53,680 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 28 [2022-07-20 06:07:53,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860691979] [2022-07-20 06:07:53,680 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 06:07:53,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-07-20 06:07:53,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:07:53,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-07-20 06:07:53,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=459, Unknown=7, NotChecked=188, Total=756 [2022-07-20 06:07:53,681 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-20 06:07:54,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:07:54,158 INFO L93 Difference]: Finished difference Result 277 states and 310 transitions. [2022-07-20 06:07:54,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-20 06:07:54,159 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-20 06:07:54,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:07:54,160 INFO L225 Difference]: With dead ends: 277 [2022-07-20 06:07:54,160 INFO L226 Difference]: Without dead ends: 277 [2022-07-20 06:07:54,160 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 57 SyntacticMatches, 8 SemanticMatches, 34 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 270 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=208, Invalid=793, Unknown=7, NotChecked=252, Total=1260 [2022-07-20 06:07:54,160 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.2s IncrementalHoareTripleChecker+Time [2022-07-20 06:07:54,161 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.2s Time] [2022-07-20 06:07:54,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2022-07-20 06:07:54,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 251. [2022-07-20 06:07:54,163 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-20 06:07:54,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 285 transitions. [2022-07-20 06:07:54,164 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 285 transitions. Word has length 36 [2022-07-20 06:07:54,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:07:54,164 INFO L495 AbstractCegarLoop]: Abstraction has 251 states and 285 transitions. [2022-07-20 06:07:54,164 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-20 06:07:54,164 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 285 transitions. [2022-07-20 06:07:54,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-20 06:07:54,164 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:07:54,164 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-20 06:07:54,199 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-20 06:07:54,375 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-20 06:07:54,375 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-20 06:07:54,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:07:54,376 INFO L85 PathProgramCache]: Analyzing trace with hash -590102785, now seen corresponding path program 1 times [2022-07-20 06:07:54,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:07:54,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382892143] [2022-07-20 06:07:54,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:07:54,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:07:54,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:07:54,596 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-20 06:07:54,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:07:54,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382892143] [2022-07-20 06:07:54,597 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382892143] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:07:54,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [905896603] [2022-07-20 06:07:54,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:07:54,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:07:54,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:07:54,598 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-20 06:07:54,633 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-20 06:07:54,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:07:54,718 INFO L263 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 44 conjunts are in the unsatisfiable core [2022-07-20 06:07:54,720 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:07:54,723 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-20 06:07:54,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-20 06:07:54,741 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-20 06:07:54,769 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 06:07:54,769 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-20 06:07:54,794 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:07:54,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, 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-20 06:07:54,801 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:07:54,802 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-20 06:07:54,892 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:07:54,892 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-20 06:07:54,908 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-20 06:07:54,908 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-20 06:07:54,915 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-20 06:07:54,984 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-20 06:07:54,984 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-20 06:07:54,987 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-20 06:07:55,000 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:07:55,001 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-20 06:07:55,035 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:07:55,036 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-20 06:07:55,039 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-20 06:07:55,173 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-20 06:07:55,177 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:07:55,179 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:07:55,179 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-20 06:07:55,184 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-20 06:07:55,185 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:07:55,258 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-20 06:07:55,279 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-20 06:07:55,285 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-20 06:07:55,455 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:07:55,458 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:07:55,458 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-20 06:07:55,461 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-20 06:07:55,463 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-20 06:07:55,467 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:07:55,469 INFO L356 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2022-07-20 06:07:55,469 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-20 06:07:55,491 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-20 06:07:55,491 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [905896603] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:07:55,492 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 06:07:55,492 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 28 [2022-07-20 06:07:55,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52576731] [2022-07-20 06:07:55,492 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 06:07:55,492 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-07-20 06:07:55,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:07:55,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-07-20 06:07:55,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=498, Unknown=11, NotChecked=144, Total=756 [2022-07-20 06:07:55,493 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-20 06:07:55,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:07:55,916 INFO L93 Difference]: Finished difference Result 273 states and 305 transitions. [2022-07-20 06:07:55,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-20 06:07:55,917 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-20 06:07:55,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:07:55,917 INFO L225 Difference]: With dead ends: 273 [2022-07-20 06:07:55,918 INFO L226 Difference]: Without dead ends: 273 [2022-07-20 06:07:55,918 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 57 SyntacticMatches, 6 SemanticMatches, 36 ConstructedPredicates, 3 IntricatePredicates, 1 DeprecatedPredicates, 309 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=222, Invalid=969, Unknown=11, NotChecked=204, Total=1406 [2022-07-20 06:07:55,918 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 180 mSDsluCounter, 803 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 877 SdHoareTripleChecker+Invalid, 1060 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 690 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 06:07:55,918 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 877 Invalid, 1060 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 348 Invalid, 0 Unknown, 690 Unchecked, 0.2s Time] [2022-07-20 06:07:55,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2022-07-20 06:07:55,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 251. [2022-07-20 06:07:55,921 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-20 06:07:55,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 285 transitions. [2022-07-20 06:07:55,921 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 285 transitions. Word has length 36 [2022-07-20 06:07:55,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:07:55,922 INFO L495 AbstractCegarLoop]: Abstraction has 251 states and 285 transitions. [2022-07-20 06:07:55,922 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-20 06:07:55,922 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 285 transitions. [2022-07-20 06:07:55,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-20 06:07:55,922 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:07:55,922 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-20 06:07:55,948 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-20 06:07:56,131 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-20 06:07:56,131 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-20 06:07:56,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:07:56,132 INFO L85 PathProgramCache]: Analyzing trace with hash -1501701986, now seen corresponding path program 1 times [2022-07-20 06:07:56,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:07:56,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471305312] [2022-07-20 06:07:56,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:07:56,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:07:56,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:07:56,383 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-20 06:07:56,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:07:56,383 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471305312] [2022-07-20 06:07:56,383 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471305312] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:07:56,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1621899870] [2022-07-20 06:07:56,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:07:56,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:07:56,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:07:56,385 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-20 06:07:56,386 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-20 06:07:56,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:07:56,483 INFO L263 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 46 conjunts are in the unsatisfiable core [2022-07-20 06:07:56,485 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:07:56,488 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-20 06:07:56,509 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-20 06:07:56,510 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-20 06:07:56,536 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-20 06:07:56,580 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:07:56,581 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-20 06:07:56,652 INFO L356 Elim1Store]: treesize reduction 54, result has 36.5 percent of original size [2022-07-20 06:07:56,653 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-20 06:07:56,700 INFO L356 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-07-20 06:07:56,701 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-20 06:07:56,937 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:07:56,938 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-20 06:07:57,057 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:07:57,057 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-20 06:07:57,105 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:07:57,105 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-20 06:07:57,344 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-20 06:07:57,375 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-20 06:07:57,375 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:07:58,915 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-20 06:07:58,925 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-20 06:07:58,973 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:07:58,973 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-20 06:07:58,975 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:07:58,977 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-20 06:07:58,980 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-20 06:07:58,985 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-20 06:07:59,124 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-20 06:07:59,124 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1621899870] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:07:59,124 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 06:07:59,125 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13, 14] total 37 [2022-07-20 06:07:59,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942339254] [2022-07-20 06:07:59,125 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 06:07:59,125 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-07-20 06:07:59,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:07:59,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-07-20 06:07:59,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=1014, Unknown=68, NotChecked=138, Total=1406 [2022-07-20 06:07:59,126 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-20 06:08:04,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:08:04,442 INFO L93 Difference]: Finished difference Result 435 states and 494 transitions. [2022-07-20 06:08:04,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-07-20 06:08:04,442 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-20 06:08:04,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:08:04,443 INFO L225 Difference]: With dead ends: 435 [2022-07-20 06:08:04,443 INFO L226 Difference]: Without dead ends: 435 [2022-07-20 06:08:04,444 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 57 SyntacticMatches, 7 SemanticMatches, 55 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 828 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=412, Invalid=2478, Unknown=88, NotChecked=214, Total=3192 [2022-07-20 06:08:04,444 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 357 mSDsluCounter, 1653 mSDsCounter, 0 mSdLazyCounter, 887 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 357 SdHoareTripleChecker+Valid, 1752 SdHoareTripleChecker+Invalid, 2489 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 887 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1527 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-20 06:08:04,444 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [357 Valid, 1752 Invalid, 2489 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 887 Invalid, 0 Unknown, 1527 Unchecked, 0.4s Time] [2022-07-20 06:08:04,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2022-07-20 06:08:04,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 288. [2022-07-20 06:08:04,447 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-20 06:08:04,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 331 transitions. [2022-07-20 06:08:04,448 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 331 transitions. Word has length 38 [2022-07-20 06:08:04,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:08:04,448 INFO L495 AbstractCegarLoop]: Abstraction has 288 states and 331 transitions. [2022-07-20 06:08:04,448 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-20 06:08:04,448 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 331 transitions. [2022-07-20 06:08:04,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-20 06:08:04,448 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:08:04,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:08:04,468 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-20 06:08:04,649 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-20 06:08:04,649 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-20 06:08:04,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:08:04,650 INFO L85 PathProgramCache]: Analyzing trace with hash -1501701985, now seen corresponding path program 1 times [2022-07-20 06:08:04,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:08:04,650 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421645605] [2022-07-20 06:08:04,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:08:04,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:08:04,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:08:04,982 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-20 06:08:04,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:08:04,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421645605] [2022-07-20 06:08:04,982 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421645605] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:08:04,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [274391647] [2022-07-20 06:08:04,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:08:04,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:08:04,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:08:04,984 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-20 06:08:04,985 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-20 06:08:05,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:08:05,090 INFO L263 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 67 conjunts are in the unsatisfiable core [2022-07-20 06:08:05,092 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:08:05,094 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-20 06:08:05,106 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-20 06:08:05,119 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-20 06:08:05,119 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-20 06:08:05,149 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-20 06:08:05,156 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-20 06:08:05,239 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:08:05,239 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-20 06:08:05,242 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-20 06:08:05,331 INFO L356 Elim1Store]: treesize reduction 8, result has 65.2 percent of original size [2022-07-20 06:08:05,331 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-20 06:08:05,338 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-20 06:08:05,377 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:08:05,377 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-20 06:08:05,391 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:08:05,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, 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-20 06:08:05,559 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:08:05,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, 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-20 06:08:05,563 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:08:05,563 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-20 06:08:05,628 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:08:05,628 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-20 06:08:05,631 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:08:05,632 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-20 06:08:05,654 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:08:05,654 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-20 06:08:05,657 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-20 06:08:05,862 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:08:05,863 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-20 06:08:05,866 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:08:05,867 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:08:05,867 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-20 06:08:05,883 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-20 06:08:05,884 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:08:06,014 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-20 06:08:06,048 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-20 06:08:06,053 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-20 06:08:06,064 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1202 (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_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 (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_1202) |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_1203) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0)))))) is different from false [2022-07-20 06:08:06,358 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1192 (Array Int Int)) (v_ArrVal_1191 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_20| Int) (|v_ULTIMATE.start_main_~x~0#1.offset_78| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_20|) 0)) (and (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))))) (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-20 06:08:06,507 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:08:06,507 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-20 06:08:06,509 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:08:06,510 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-20 06:08:06,511 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:08:06,512 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-20 06:08:06,514 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:08:06,514 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-20 06:08:06,521 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:08:06,521 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 1 case distinctions, treesize of input 96 treesize of output 87 [2022-07-20 06:08:06,522 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:08:06,523 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:08:06,540 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 73 treesize of output 69 [2022-07-20 06:08:06,544 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:08:06,544 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 1 case distinctions, treesize of input 60 treesize of output 51 [2022-07-20 06:08:06,546 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:08:06,546 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:08:06,547 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 37 treesize of output 33 [2022-07-20 06:08:06,548 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:08:06,549 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 30 treesize of output 22 [2022-07-20 06:08:06,551 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:08:06,552 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-20 06:08:06,612 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:08:06,665 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-20 06:08:06,665 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [274391647] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:08:06,665 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 06:08:06,665 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13, 14] total 41 [2022-07-20 06:08:06,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963108946] [2022-07-20 06:08:06,665 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 06:08:06,666 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-07-20 06:08:06,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:08:06,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-07-20 06:08:06,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=1162, Unknown=11, NotChecked=370, Total=1722 [2022-07-20 06:08:06,667 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-20 06:08:10,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:08:10,709 INFO L93 Difference]: Finished difference Result 445 states and 512 transitions. [2022-07-20 06:08:10,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-07-20 06:08:10,710 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-20 06:08:10,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:08:10,712 INFO L225 Difference]: With dead ends: 445 [2022-07-20 06:08:10,712 INFO L226 Difference]: Without dead ends: 445 [2022-07-20 06:08:10,713 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 56 SyntacticMatches, 3 SemanticMatches, 61 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 819 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=440, Invalid=2872, Unknown=14, NotChecked=580, Total=3906 [2022-07-20 06:08:10,713 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 394 mSDsluCounter, 1645 mSDsCounter, 0 mSdLazyCounter, 857 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 394 SdHoareTripleChecker+Valid, 1788 SdHoareTripleChecker+Invalid, 2837 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 857 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1951 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-20 06:08:10,713 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [394 Valid, 1788 Invalid, 2837 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 857 Invalid, 0 Unknown, 1951 Unchecked, 0.4s Time] [2022-07-20 06:08:10,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2022-07-20 06:08:10,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 299. [2022-07-20 06:08:10,718 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-20 06:08:10,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 344 transitions. [2022-07-20 06:08:10,718 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 344 transitions. Word has length 38 [2022-07-20 06:08:10,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:08:10,719 INFO L495 AbstractCegarLoop]: Abstraction has 299 states and 344 transitions. [2022-07-20 06:08:10,719 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-20 06:08:10,719 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 344 transitions. [2022-07-20 06:08:10,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-20 06:08:10,720 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:08:10,720 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-20 06:08:10,752 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-20 06:08:10,920 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-20 06:08:10,921 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-20 06:08:10,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:08:10,921 INFO L85 PathProgramCache]: Analyzing trace with hash -1138406745, now seen corresponding path program 1 times [2022-07-20 06:08:10,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:08:10,921 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685227134] [2022-07-20 06:08:10,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:08:10,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:08:10,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:08:11,278 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-20 06:08:11,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:08:11,279 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685227134] [2022-07-20 06:08:11,279 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685227134] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:08:11,279 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [666871586] [2022-07-20 06:08:11,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:08:11,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:08:11,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:08:11,280 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-20 06:08:11,281 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-20 06:08:11,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:08:11,386 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 67 conjunts are in the unsatisfiable core [2022-07-20 06:08:11,391 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:08:11,395 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-20 06:08:11,413 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-20 06:08:11,421 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-20 06:08:11,422 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-20 06:08:11,442 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-20 06:08:11,457 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-20 06:08:11,518 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:08:11,518 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-20 06:08:11,521 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-20 06:08:11,602 INFO L356 Elim1Store]: treesize reduction 23, result has 47.7 percent of original size [2022-07-20 06:08:11,602 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-20 06:08:11,622 INFO L356 Elim1Store]: treesize reduction 8, result has 65.2 percent of original size [2022-07-20 06:08:11,622 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-20 06:08:11,687 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:08:11,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, 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-20 06:08:11,695 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:08:11,695 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-20 06:08:11,887 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:08:11,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, 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-20 06:08:11,890 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:08:11,891 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-20 06:08:11,945 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:08:11,945 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-20 06:08:11,948 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:08:11,948 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-20 06:08:11,969 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:08:11,969 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-20 06:08:11,973 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-20 06:08:12,233 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:08:12,236 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-20 06:08:12,240 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:08:12,241 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-20 06:08:12,243 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-20 06:08:12,243 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:08:12,350 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-20 06:08:12,391 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-20 06:08:12,397 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-20 06:08:12,409 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-20 06:08:12,577 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_23| Int) (|v_ULTIMATE.start_main_~x~0#1.offset_83| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_23|) 0)) (and (forall ((v_ArrVal_1331 (Array Int Int))) (<= 0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |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)))) (forall ((v_ArrVal_1321 Int) (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_~head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |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|) .cse0) 4) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc7#1.base_23| v_ArrVal_1321) (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|) |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|) .cse0)))))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_83| |c_ULTIMATE.start_main_~head~0#1.offset|)))) is different from false [2022-07-20 06:08:12,651 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_23| Int) (|v_ULTIMATE.start_main_~x~0#1.offset_83| Int) (v_ArrVal_1320 (Array Int Int)) (v_ArrVal_1319 (Array Int Int))) (or (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|)) (and (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)))) (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)))))))) is different from false [2022-07-20 06:08:12,850 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:08:12,850 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-20 06:08:12,851 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:08:12,852 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-20 06:08:12,854 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:08:12,855 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-20 06:08:12,856 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:08:12,857 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-20 06:08:12,865 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:08:12,865 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 1 case distinctions, treesize of input 96 treesize of output 87 [2022-07-20 06:08:12,866 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:08:12,867 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:08:12,868 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 73 treesize of output 69 [2022-07-20 06:08:12,871 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:08:12,872 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 1 case distinctions, treesize of input 60 treesize of output 51 [2022-07-20 06:08:12,873 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:08:12,873 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:08:12,875 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 37 treesize of output 33 [2022-07-20 06:08:12,876 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:08:12,877 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 30 treesize of output 22 [2022-07-20 06:08:12,879 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:08:12,880 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-20 06:08:12,931 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:08:12,980 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-20 06:08:12,981 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [666871586] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:08:12,981 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 06:08:12,981 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13, 14] total 39 [2022-07-20 06:08:12,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523427293] [2022-07-20 06:08:12,981 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 06:08:12,981 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-07-20 06:08:12,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:08:12,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-07-20 06:08:12,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=976, Unknown=12, NotChecked=414, Total=1560 [2022-07-20 06:08:12,982 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-20 06:08:26,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:08:26,875 INFO L93 Difference]: Finished difference Result 474 states and 535 transitions. [2022-07-20 06:08:26,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-07-20 06:08:26,875 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-20 06:08:26,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:08:26,876 INFO L225 Difference]: With dead ends: 474 [2022-07-20 06:08:26,876 INFO L226 Difference]: Without dead ends: 474 [2022-07-20 06:08:26,877 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 55 SyntacticMatches, 10 SemanticMatches, 65 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 1028 ImplicationChecksByTransitivity, 14.0s TimeCoverageRelationStatistics Valid=578, Invalid=3090, Unknown=16, NotChecked=738, Total=4422 [2022-07-20 06:08:26,877 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 460 mSDsluCounter, 1858 mSDsCounter, 0 mSdLazyCounter, 1362 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 460 SdHoareTripleChecker+Valid, 1967 SdHoareTripleChecker+Invalid, 3561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 1362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2136 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-20 06:08:26,878 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [460 Valid, 1967 Invalid, 3561 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 1362 Invalid, 0 Unknown, 2136 Unchecked, 0.7s Time] [2022-07-20 06:08:26,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2022-07-20 06:08:26,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 301. [2022-07-20 06:08:26,881 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-20 06:08:26,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 347 transitions. [2022-07-20 06:08:26,881 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 347 transitions. Word has length 38 [2022-07-20 06:08:26,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:08:26,881 INFO L495 AbstractCegarLoop]: Abstraction has 301 states and 347 transitions. [2022-07-20 06:08:26,881 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-20 06:08:26,881 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 347 transitions. [2022-07-20 06:08:26,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-20 06:08:26,882 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:08:26,882 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-20 06:08:26,938 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-07-20 06:08:27,082 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-20 06:08:27,082 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-20 06:08:27,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:08:27,083 INFO L85 PathProgramCache]: Analyzing trace with hash -1790052731, now seen corresponding path program 1 times [2022-07-20 06:08:27,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:08:27,083 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551742629] [2022-07-20 06:08:27,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:08:27,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:08:27,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:08:27,165 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-20 06:08:27,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:08:27,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551742629] [2022-07-20 06:08:27,166 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551742629] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:08:27,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2096214775] [2022-07-20 06:08:27,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:08:27,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:08:27,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:08:27,168 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-20 06:08:27,169 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-20 06:08:27,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:08:27,275 INFO L263 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 30 conjunts are in the unsatisfiable core [2022-07-20 06:08:27,276 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:08:27,448 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:08:27,449 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-20 06:08:27,451 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:08:27,453 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:08:27,453 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-20 06:08:27,467 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-20 06:08:27,468 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:08:27,624 INFO L356 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-07-20 06:08:27,624 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-20 06:08:27,630 INFO L356 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-07-20 06:08:27,630 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-20 06:08:27,773 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-20 06:08:27,773 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2096214775] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:08:27,774 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 06:08:27,774 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 20 [2022-07-20 06:08:27,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591161019] [2022-07-20 06:08:27,774 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 06:08:27,774 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-20 06:08:27,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:08:27,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-20 06:08:27,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2022-07-20 06:08:27,775 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-20 06:08:28,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:08:28,008 INFO L93 Difference]: Finished difference Result 354 states and 400 transitions. [2022-07-20 06:08:28,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-20 06:08:28,009 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-20 06:08:28,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:08:28,010 INFO L225 Difference]: With dead ends: 354 [2022-07-20 06:08:28,010 INFO L226 Difference]: Without dead ends: 354 [2022-07-20 06:08:28,010 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=80, Invalid=472, Unknown=0, NotChecked=0, Total=552 [2022-07-20 06:08:28,010 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 79 mSDsluCounter, 728 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 806 SdHoareTripleChecker+Invalid, 516 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 151 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 06:08:28,010 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 806 Invalid, 516 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 345 Invalid, 0 Unknown, 151 Unchecked, 0.2s Time] [2022-07-20 06:08:28,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2022-07-20 06:08:28,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 320. [2022-07-20 06:08:28,013 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-20 06:08:28,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 372 transitions. [2022-07-20 06:08:28,014 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 372 transitions. Word has length 38 [2022-07-20 06:08:28,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:08:28,014 INFO L495 AbstractCegarLoop]: Abstraction has 320 states and 372 transitions. [2022-07-20 06:08:28,014 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-20 06:08:28,014 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 372 transitions. [2022-07-20 06:08:28,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-20 06:08:28,014 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:08:28,015 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-20 06:08:28,048 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-20 06:08:28,215 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-20 06:08:28,215 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-20 06:08:28,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:08:28,215 INFO L85 PathProgramCache]: Analyzing trace with hash -434794642, now seen corresponding path program 1 times [2022-07-20 06:08:28,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:08:28,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861549837] [2022-07-20 06:08:28,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:08:28,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:08:28,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:08:28,561 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-20 06:08:28,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:08:28,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861549837] [2022-07-20 06:08:28,562 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861549837] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:08:28,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1671014395] [2022-07-20 06:08:28,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:08:28,562 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:08:28,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:08:28,564 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-20 06:08:28,583 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-20 06:08:28,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:08:28,680 INFO L263 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 60 conjunts are in the unsatisfiable core [2022-07-20 06:08:28,682 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:08:28,684 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-20 06:08:28,700 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-20 06:08:28,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, 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-20 06:08:28,778 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 06:08:28,778 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-20 06:08:28,811 INFO L356 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-07-20 06:08:28,812 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-20 06:08:28,829 INFO L356 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-07-20 06:08:28,829 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-20 06:08:29,016 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:08:29,016 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-20 06:08:29,024 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:08:29,025 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-20 06:08:29,107 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:08:29,107 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-20 06:08:29,130 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:08:29,130 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-20 06:08:29,181 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 06:08:29,182 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-20 06:08:29,253 INFO L356 Elim1Store]: treesize reduction 72, result has 19.1 percent of original size [2022-07-20 06:08:29,254 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-20 06:08:29,264 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:08:29,265 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-20 06:08:29,268 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2022-07-20 06:08:29,306 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-07-20 06:08:29,468 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-20 06:08:29,469 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-20 06:08:29,473 INFO L158 Benchmark]: Toolchain (without parser) took 55880.31ms. Allocated memory was 88.1MB in the beginning and 192.9MB in the end (delta: 104.9MB). Free memory was 57.0MB in the beginning and 119.1MB in the end (delta: -62.1MB). Peak memory consumption was 45.7MB. Max. memory is 16.1GB. [2022-07-20 06:08:29,473 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 88.1MB. Free memory was 68.9MB in the beginning and 68.9MB in the end (delta: 42.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-20 06:08:29,473 INFO L158 Benchmark]: CACSL2BoogieTranslator took 383.14ms. Allocated memory is still 88.1MB. Free memory was 56.8MB in the beginning and 65.4MB in the end (delta: -8.6MB). Peak memory consumption was 22.4MB. Max. memory is 16.1GB. [2022-07-20 06:08:29,473 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.00ms. Allocated memory is still 88.1MB. Free memory was 65.4MB in the beginning and 63.2MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-20 06:08:29,473 INFO L158 Benchmark]: Boogie Preprocessor took 20.25ms. Allocated memory is still 88.1MB. Free memory was 63.2MB in the beginning and 61.4MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-20 06:08:29,474 INFO L158 Benchmark]: RCFGBuilder took 551.87ms. Allocated memory is still 88.1MB. Free memory was 61.4MB in the beginning and 39.7MB in the end (delta: 21.7MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2022-07-20 06:08:29,474 INFO L158 Benchmark]: TraceAbstraction took 54885.37ms. Allocated memory was 88.1MB in the beginning and 192.9MB in the end (delta: 104.9MB). Free memory was 39.2MB in the beginning and 119.1MB in the end (delta: -79.9MB). Peak memory consumption was 25.5MB. Max. memory is 16.1GB. [2022-07-20 06:08:29,474 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.16ms. Allocated memory is still 88.1MB. Free memory was 68.9MB in the beginning and 68.9MB in the end (delta: 42.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 383.14ms. Allocated memory is still 88.1MB. Free memory was 56.8MB in the beginning and 65.4MB in the end (delta: -8.6MB). Peak memory consumption was 22.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.00ms. Allocated memory is still 88.1MB. Free memory was 65.4MB in the beginning and 63.2MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 20.25ms. Allocated memory is still 88.1MB. Free memory was 63.2MB in the beginning and 61.4MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 551.87ms. Allocated memory is still 88.1MB. Free memory was 61.4MB in the beginning and 39.7MB in the end (delta: 21.7MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 54885.37ms. Allocated memory was 88.1MB in the beginning and 192.9MB in the end (delta: 104.9MB). Free memory was 39.2MB in the beginning and 119.1MB in the end (delta: -79.9MB). Peak memory consumption was 25.5MB. 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-20 06:08:29,502 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- 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-?-eb692b5 [2022-07-20 06:08:31,392 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-20 06:08:31,394 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-20 06:08:31,444 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-20 06:08:31,445 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-20 06:08:31,446 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-20 06:08:31,450 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-20 06:08:31,452 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-20 06:08:31,454 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-20 06:08:31,455 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-20 06:08:31,456 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-20 06:08:31,456 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-20 06:08:31,457 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-20 06:08:31,461 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-20 06:08:31,463 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-20 06:08:31,466 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-20 06:08:31,467 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-20 06:08:31,467 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-20 06:08:31,468 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-20 06:08:31,469 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-20 06:08:31,470 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-20 06:08:31,472 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-20 06:08:31,474 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-20 06:08:31,475 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-20 06:08:31,476 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-20 06:08:31,483 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-20 06:08:31,484 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-20 06:08:31,485 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-20 06:08:31,486 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-20 06:08:31,486 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-20 06:08:31,487 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-20 06:08:31,487 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-20 06:08:31,488 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-20 06:08:31,489 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-20 06:08:31,490 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-20 06:08:31,491 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-20 06:08:31,491 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-20 06:08:31,491 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-20 06:08:31,491 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-20 06:08:31,492 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-20 06:08:31,492 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-20 06:08:31,494 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-20 06:08:31,495 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-07-20 06:08:31,525 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-20 06:08:31,525 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-20 06:08:31,526 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-20 06:08:31,526 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-20 06:08:31,526 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-20 06:08:31,527 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-20 06:08:31,527 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-20 06:08:31,527 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-20 06:08:31,528 INFO L138 SettingsManager]: * Use SBE=true [2022-07-20 06:08:31,528 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-20 06:08:31,528 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-20 06:08:31,529 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-20 06:08:31,529 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-20 06:08:31,529 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-20 06:08:31,529 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-20 06:08:31,529 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-20 06:08:31,529 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-20 06:08:31,530 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-20 06:08:31,530 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-20 06:08:31,530 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-20 06:08:31,530 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-20 06:08:31,530 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-20 06:08:31,530 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-20 06:08:31,531 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-20 06:08:31,531 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-20 06:08:31,531 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-20 06:08:31,531 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-20 06:08:31,531 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 06:08:31,531 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-20 06:08:31,532 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-20 06:08:31,532 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-20 06:08:31,532 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-20 06:08:31,532 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-20 06:08:31,532 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-20 06:08:31,785 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-20 06:08:31,802 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-20 06:08:31,804 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-20 06:08:31,805 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-20 06:08:31,806 INFO L275 PluginConnector]: CDTParser initialized [2022-07-20 06:08:31,807 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-20 06:08:31,845 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f33fdcb8f/7264ad17bdd544c09ecb8714cf43179f/FLAG2b901e803 [2022-07-20 06:08:32,329 INFO L306 CDTParser]: Found 1 translation units. [2022-07-20 06:08:32,332 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-optional-1.i [2022-07-20 06:08:32,347 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f33fdcb8f/7264ad17bdd544c09ecb8714cf43179f/FLAG2b901e803 [2022-07-20 06:08:32,363 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f33fdcb8f/7264ad17bdd544c09ecb8714cf43179f [2022-07-20 06:08:32,366 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-20 06:08:32,367 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-20 06:08:32,368 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-20 06:08:32,368 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-20 06:08:32,370 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-20 06:08:32,371 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 06:08:32" (1/1) ... [2022-07-20 06:08:32,372 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48b52f84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:08:32, skipping insertion in model container [2022-07-20 06:08:32,372 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 06:08:32" (1/1) ... [2022-07-20 06:08:32,377 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-20 06:08:32,414 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-20 06:08:32,610 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-20 06:08:32,629 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 06:08:32,643 INFO L203 MainTranslator]: Completed pre-run [2022-07-20 06:08:32,714 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-20 06:08:32,716 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 06:08:32,750 INFO L208 MainTranslator]: Completed translation [2022-07-20 06:08:32,750 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:08:32 WrapperNode [2022-07-20 06:08:32,751 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-20 06:08:32,751 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-20 06:08:32,751 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-20 06:08:32,751 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-20 06:08:32,755 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:08:32" (1/1) ... [2022-07-20 06:08:32,768 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:08:32" (1/1) ... [2022-07-20 06:08:32,794 INFO L137 Inliner]: procedures = 122, calls = 41, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 132 [2022-07-20 06:08:32,795 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-20 06:08:32,796 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-20 06:08:32,796 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-20 06:08:32,796 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-20 06:08:32,802 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:08:32" (1/1) ... [2022-07-20 06:08:32,802 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:08:32" (1/1) ... [2022-07-20 06:08:32,822 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:08:32" (1/1) ... [2022-07-20 06:08:32,822 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:08:32" (1/1) ... [2022-07-20 06:08:32,829 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:08:32" (1/1) ... [2022-07-20 06:08:32,832 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:08:32" (1/1) ... [2022-07-20 06:08:32,834 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:08:32" (1/1) ... [2022-07-20 06:08:32,836 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-20 06:08:32,836 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-20 06:08:32,836 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-20 06:08:32,837 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-20 06:08:32,837 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:08:32" (1/1) ... [2022-07-20 06:08:32,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 06:08:32,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:08:32,875 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-20 06:08:32,877 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-20 06:08:32,925 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-07-20 06:08:32,925 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-20 06:08:32,925 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-20 06:08:32,925 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-20 06:08:32,925 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-20 06:08:32,925 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-20 06:08:32,926 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-07-20 06:08:32,926 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-20 06:08:32,926 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-20 06:08:32,926 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-20 06:08:33,041 INFO L234 CfgBuilder]: Building ICFG [2022-07-20 06:08:33,042 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-20 06:08:33,488 INFO L275 CfgBuilder]: Performing block encoding [2022-07-20 06:08:33,494 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-20 06:08:33,494 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2022-07-20 06:08:33,496 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 06:08:33 BoogieIcfgContainer [2022-07-20 06:08:33,496 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-20 06:08:33,498 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-20 06:08:33,498 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-20 06:08:33,500 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-20 06:08:33,500 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.07 06:08:32" (1/3) ... [2022-07-20 06:08:33,501 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10a229ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 06:08:33, skipping insertion in model container [2022-07-20 06:08:33,501 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:08:32" (2/3) ... [2022-07-20 06:08:33,501 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10a229ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 06:08:33, skipping insertion in model container [2022-07-20 06:08:33,501 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 06:08:33" (3/3) ... [2022-07-20 06:08:33,502 INFO L111 eAbstractionObserver]: Analyzing ICFG sll-optional-1.i [2022-07-20 06:08:33,513 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-20 06:08:33,513 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 66 error locations. [2022-07-20 06:08:33,556 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-20 06:08:33,567 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@256158c2, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@6e2406c6 [2022-07-20 06:08:33,567 INFO L358 AbstractCegarLoop]: Starting to check reachability of 66 error locations. [2022-07-20 06:08:33,576 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-20 06:08:33,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-07-20 06:08:33,580 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:08:33,581 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-07-20 06:08:33,582 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-20 06:08:33,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:08:33,586 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2022-07-20 06:08:33,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:08:33,603 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [826053449] [2022-07-20 06:08:33,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:08:33,604 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:08:33,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:08:33,620 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-20 06:08:33,621 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-20 06:08:33,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:08:33,691 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-20 06:08:33,694 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:08:33,741 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-20 06:08:33,749 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-20 06:08:33,750 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 06:08:33,750 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:08:33,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [826053449] [2022-07-20 06:08:33,751 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [826053449] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:08:33,751 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:08:33,752 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-20 06:08:33,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47175951] [2022-07-20 06:08:33,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:08:33,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 06:08:33,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:08:33,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 06:08:33,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 06:08:33,783 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-20 06:08:33,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:08:33,998 INFO L93 Difference]: Finished difference Result 142 states and 152 transitions. [2022-07-20 06:08:33,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 06:08:34,000 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-20 06:08:34,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:08:34,006 INFO L225 Difference]: With dead ends: 142 [2022-07-20 06:08:34,007 INFO L226 Difference]: Without dead ends: 138 [2022-07-20 06:08:34,008 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-20 06:08:34,010 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 125 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2022-07-20 06:08:34,011 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.2s Time] [2022-07-20 06:08:34,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2022-07-20 06:08:34,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 132. [2022-07-20 06:08:34,049 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-20 06:08:34,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 144 transitions. [2022-07-20 06:08:34,051 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 144 transitions. Word has length 3 [2022-07-20 06:08:34,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:08:34,051 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 144 transitions. [2022-07-20 06:08:34,051 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-20 06:08:34,051 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 144 transitions. [2022-07-20 06:08:34,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-07-20 06:08:34,051 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:08:34,051 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-07-20 06:08:34,075 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-20 06:08:34,252 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-20 06:08:34,253 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-20 06:08:34,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:08:34,253 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2022-07-20 06:08:34,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:08:34,254 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1319375075] [2022-07-20 06:08:34,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:08:34,254 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:08:34,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:08:34,260 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-20 06:08:34,276 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-20 06:08:34,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:08:34,316 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-20 06:08:34,317 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:08:34,324 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-20 06:08:34,330 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-20 06:08:34,330 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 06:08:34,331 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:08:34,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1319375075] [2022-07-20 06:08:34,331 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1319375075] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:08:34,331 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:08:34,331 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-20 06:08:34,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154567690] [2022-07-20 06:08:34,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:08:34,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 06:08:34,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:08:34,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 06:08:34,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 06:08:34,333 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-20 06:08:34,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:08:34,576 INFO L93 Difference]: Finished difference Result 128 states and 140 transitions. [2022-07-20 06:08:34,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 06:08:34,577 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-20 06:08:34,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:08:34,578 INFO L225 Difference]: With dead ends: 128 [2022-07-20 06:08:34,578 INFO L226 Difference]: Without dead ends: 128 [2022-07-20 06:08:34,578 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-20 06:08:34,579 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.2s IncrementalHoareTripleChecker+Time [2022-07-20 06:08:34,579 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.2s Time] [2022-07-20 06:08:34,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2022-07-20 06:08:34,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 124. [2022-07-20 06:08:34,585 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-20 06:08:34,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 136 transitions. [2022-07-20 06:08:34,586 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 136 transitions. Word has length 3 [2022-07-20 06:08:34,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:08:34,586 INFO L495 AbstractCegarLoop]: Abstraction has 124 states and 136 transitions. [2022-07-20 06:08:34,586 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-20 06:08:34,587 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 136 transitions. [2022-07-20 06:08:34,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-20 06:08:34,587 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:08:34,587 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:08:34,612 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-20 06:08:34,795 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-20 06:08:34,796 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-20 06:08:34,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:08:34,796 INFO L85 PathProgramCache]: Analyzing trace with hash -1404186606, now seen corresponding path program 1 times [2022-07-20 06:08:34,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:08:34,797 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1182411037] [2022-07-20 06:08:34,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:08:34,797 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:08:34,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:08:34,798 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-20 06:08:34,800 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-20 06:08:34,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:08:34,858 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-20 06:08:34,859 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:08:34,864 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-20 06:08:34,880 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-20 06:08:34,898 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-20 06:08:34,905 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-20 06:08:34,905 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 06:08:34,905 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:08:34,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1182411037] [2022-07-20 06:08:34,905 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1182411037] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:08:34,905 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:08:34,905 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 06:08:34,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981695654] [2022-07-20 06:08:34,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:08:34,906 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-20 06:08:34,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:08:34,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-20 06:08:34,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-20 06:08:34,906 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-20 06:08:35,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:08:35,267 INFO L93 Difference]: Finished difference Result 167 states and 184 transitions. [2022-07-20 06:08:35,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 06:08:35,267 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-20 06:08:35,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:08:35,269 INFO L225 Difference]: With dead ends: 167 [2022-07-20 06:08:35,269 INFO L226 Difference]: Without dead ends: 167 [2022-07-20 06:08:35,269 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-20 06:08:35,270 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.3s IncrementalHoareTripleChecker+Time [2022-07-20 06:08:35,270 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.3s Time] [2022-07-20 06:08:35,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2022-07-20 06:08:35,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 123. [2022-07-20 06:08:35,274 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-20 06:08:35,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 135 transitions. [2022-07-20 06:08:35,275 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 135 transitions. Word has length 10 [2022-07-20 06:08:35,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:08:35,275 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 135 transitions. [2022-07-20 06:08:35,275 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-20 06:08:35,275 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 135 transitions. [2022-07-20 06:08:35,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-20 06:08:35,276 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:08:35,276 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:08:35,283 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-20 06:08:35,479 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-20 06:08:35,480 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-20 06:08:35,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:08:35,480 INFO L85 PathProgramCache]: Analyzing trace with hash -1404186605, now seen corresponding path program 1 times [2022-07-20 06:08:35,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:08:35,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [666042145] [2022-07-20 06:08:35,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:08:35,481 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:08:35,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:08:35,484 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-20 06:08:35,488 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-20 06:08:35,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:08:35,560 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-20 06:08:35,562 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:08:35,568 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-20 06:08:35,583 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-20 06:08:35,589 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-20 06:08:35,619 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-20 06:08:35,623 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-20 06:08:35,633 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-20 06:08:35,634 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 06:08:35,634 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:08:35,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [666042145] [2022-07-20 06:08:35,634 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [666042145] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:08:35,634 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:08:35,634 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 06:08:35,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135918519] [2022-07-20 06:08:35,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:08:35,634 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-20 06:08:35,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:08:35,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-20 06:08:35,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-20 06:08:35,635 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-20 06:08:35,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:08:35,963 INFO L93 Difference]: Finished difference Result 122 states and 134 transitions. [2022-07-20 06:08:35,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 06:08:35,964 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-20 06:08:35,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:08:35,967 INFO L225 Difference]: With dead ends: 122 [2022-07-20 06:08:35,967 INFO L226 Difference]: Without dead ends: 122 [2022-07-20 06:08:35,967 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-20 06:08:35,968 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.3s IncrementalHoareTripleChecker+Time [2022-07-20 06:08:35,968 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.3s Time] [2022-07-20 06:08:35,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2022-07-20 06:08:35,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2022-07-20 06:08:35,972 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-20 06:08:35,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 134 transitions. [2022-07-20 06:08:35,973 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 134 transitions. Word has length 10 [2022-07-20 06:08:35,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:08:35,974 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 134 transitions. [2022-07-20 06:08:35,974 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-20 06:08:35,974 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 134 transitions. [2022-07-20 06:08:35,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-20 06:08:35,974 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:08:35,974 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:08:35,983 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-20 06:08:36,175 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-20 06:08:36,175 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-20 06:08:36,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:08:36,176 INFO L85 PathProgramCache]: Analyzing trace with hash 1595381600, now seen corresponding path program 1 times [2022-07-20 06:08:36,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:08:36,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [85427646] [2022-07-20 06:08:36,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:08:36,176 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:08:36,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:08:36,178 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-20 06:08:36,179 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-20 06:08:36,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:08:36,268 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-20 06:08:36,270 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:08:36,276 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-20 06:08:36,314 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-07-20 06:08:36,314 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-20 06:08:36,333 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-20 06:08:36,333 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 06:08:36,333 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:08:36,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [85427646] [2022-07-20 06:08:36,333 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [85427646] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:08:36,333 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:08:36,333 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 06:08:36,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147636597] [2022-07-20 06:08:36,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:08:36,334 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 06:08:36,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:08:36,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 06:08:36,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 06:08:36,334 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-20 06:08:36,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:08:36,565 INFO L93 Difference]: Finished difference Result 124 states and 135 transitions. [2022-07-20 06:08:36,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-20 06:08:36,565 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-20 06:08:36,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:08:36,566 INFO L225 Difference]: With dead ends: 124 [2022-07-20 06:08:36,566 INFO L226 Difference]: Without dead ends: 124 [2022-07-20 06:08:36,566 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-20 06:08:36,567 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.2s IncrementalHoareTripleChecker+Time [2022-07-20 06:08:36,567 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.2s Time] [2022-07-20 06:08:36,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2022-07-20 06:08:36,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 115. [2022-07-20 06:08:36,578 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-20 06:08:36,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 132 transitions. [2022-07-20 06:08:36,578 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 132 transitions. Word has length 10 [2022-07-20 06:08:36,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:08:36,579 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 132 transitions. [2022-07-20 06:08:36,579 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-20 06:08:36,579 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 132 transitions. [2022-07-20 06:08:36,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-20 06:08:36,579 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:08:36,579 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:08:36,588 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-20 06:08:36,780 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-20 06:08:36,780 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-20 06:08:36,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:08:36,780 INFO L85 PathProgramCache]: Analyzing trace with hash 1595381601, now seen corresponding path program 1 times [2022-07-20 06:08:36,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:08:36,781 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [640242372] [2022-07-20 06:08:36,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:08:36,781 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:08:36,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:08:36,782 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-20 06:08:36,785 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-20 06:08:36,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:08:36,842 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-20 06:08:36,847 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:08:36,867 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-20 06:08:36,924 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:08:36,924 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-20 06:08:36,933 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-20 06:08:36,933 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 06:08:36,933 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:08:36,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [640242372] [2022-07-20 06:08:36,933 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [640242372] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:08:36,933 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:08:36,933 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 06:08:36,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616341592] [2022-07-20 06:08:36,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:08:36,934 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 06:08:36,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:08:36,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 06:08:36,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 06:08:36,934 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-20 06:08:37,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:08:37,228 INFO L93 Difference]: Finished difference Result 166 states and 185 transitions. [2022-07-20 06:08:37,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 06:08:37,229 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-20 06:08:37,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:08:37,230 INFO L225 Difference]: With dead ends: 166 [2022-07-20 06:08:37,230 INFO L226 Difference]: Without dead ends: 166 [2022-07-20 06:08:37,230 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-20 06:08:37,231 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 168 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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-20 06:08:37,231 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-20 06:08:37,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2022-07-20 06:08:37,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 142. [2022-07-20 06:08:37,234 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-20 06:08:37,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 167 transitions. [2022-07-20 06:08:37,235 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 167 transitions. Word has length 10 [2022-07-20 06:08:37,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:08:37,240 INFO L495 AbstractCegarLoop]: Abstraction has 142 states and 167 transitions. [2022-07-20 06:08:37,240 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-20 06:08:37,240 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 167 transitions. [2022-07-20 06:08:37,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-20 06:08:37,240 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:08:37,241 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:08:37,255 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-20 06:08:37,452 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-20 06:08:37,453 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-20 06:08:37,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:08:37,453 INFO L85 PathProgramCache]: Analyzing trace with hash 1355389539, now seen corresponding path program 1 times [2022-07-20 06:08:37,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:08:37,454 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [388141119] [2022-07-20 06:08:37,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:08:37,454 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:08:37,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:08:37,455 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-20 06:08:37,457 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-20 06:08:37,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:08:37,525 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-20 06:08:37,526 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:08:37,535 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-20 06:08:37,553 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-20 06:08:37,558 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-20 06:08:37,592 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-20 06:08:37,596 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-20 06:08:37,616 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-20 06:08:37,616 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 06:08:37,616 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:08:37,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [388141119] [2022-07-20 06:08:37,616 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [388141119] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:08:37,617 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:08:37,617 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-20 06:08:37,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968235226] [2022-07-20 06:08:37,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:08:37,617 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 06:08:37,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:08:37,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 06:08:37,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 06:08:37,618 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-20 06:08:38,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:08:38,065 INFO L93 Difference]: Finished difference Result 134 states and 159 transitions. [2022-07-20 06:08:38,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-20 06:08:38,066 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-20 06:08:38,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:08:38,067 INFO L225 Difference]: With dead ends: 134 [2022-07-20 06:08:38,067 INFO L226 Difference]: Without dead ends: 134 [2022-07-20 06:08:38,067 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-20 06:08:38,067 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 24 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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-20 06:08:38,068 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-20 06:08:38,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2022-07-20 06:08:38,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 128. [2022-07-20 06:08:38,071 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-20 06:08:38,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 152 transitions. [2022-07-20 06:08:38,071 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 152 transitions. Word has length 14 [2022-07-20 06:08:38,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:08:38,072 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 152 transitions. [2022-07-20 06:08:38,072 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-20 06:08:38,072 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 152 transitions. [2022-07-20 06:08:38,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-20 06:08:38,072 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:08:38,073 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:08:38,079 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Ended with exit code 0 [2022-07-20 06:08:38,279 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-20 06:08:38,280 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-20 06:08:38,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:08:38,280 INFO L85 PathProgramCache]: Analyzing trace with hash 1355389538, now seen corresponding path program 1 times [2022-07-20 06:08:38,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:08:38,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [487424655] [2022-07-20 06:08:38,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:08:38,280 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:08:38,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:08:38,283 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-20 06:08:38,284 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-20 06:08:38,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:08:38,354 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-20 06:08:38,355 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:08:38,361 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-20 06:08:38,369 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-20 06:08:38,379 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-20 06:08:38,391 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-20 06:08:38,392 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 06:08:38,392 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:08:38,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [487424655] [2022-07-20 06:08:38,392 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [487424655] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:08:38,392 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:08:38,392 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-20 06:08:38,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199640947] [2022-07-20 06:08:38,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:08:38,393 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 06:08:38,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:08:38,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 06:08:38,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 06:08:38,394 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-20 06:08:38,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:08:38,799 INFO L93 Difference]: Finished difference Result 130 states and 155 transitions. [2022-07-20 06:08:38,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-20 06:08:38,800 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-20 06:08:38,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:08:38,801 INFO L225 Difference]: With dead ends: 130 [2022-07-20 06:08:38,801 INFO L226 Difference]: Without dead ends: 130 [2022-07-20 06:08:38,801 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 9 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-20 06:08:38,801 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 49 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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-20 06:08:38,802 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-20 06:08:38,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-07-20 06:08:38,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 127. [2022-07-20 06:08:38,804 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-20 06:08:38,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 151 transitions. [2022-07-20 06:08:38,805 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 151 transitions. Word has length 14 [2022-07-20 06:08:38,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:08:38,805 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 151 transitions. [2022-07-20 06:08:38,805 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-20 06:08:38,805 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 151 transitions. [2022-07-20 06:08:38,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-20 06:08:38,805 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:08:38,805 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:08:38,817 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-20 06:08:39,018 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-20 06:08:39,018 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-20 06:08:39,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:08:39,018 INFO L85 PathProgramCache]: Analyzing trace with hash -1163410907, now seen corresponding path program 1 times [2022-07-20 06:08:39,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:08:39,019 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1900573160] [2022-07-20 06:08:39,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:08:39,019 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:08:39,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:08:39,020 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-20 06:08:39,021 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-20 06:08:39,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:08:39,074 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-20 06:08:39,075 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:08:39,093 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-20 06:08:39,093 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 06:08:39,094 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:08:39,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1900573160] [2022-07-20 06:08:39,094 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1900573160] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:08:39,094 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:08:39,094 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 06:08:39,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644042017] [2022-07-20 06:08:39,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:08:39,094 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 06:08:39,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:08:39,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 06:08:39,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 06:08:39,095 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-20 06:08:39,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:08:39,378 INFO L93 Difference]: Finished difference Result 150 states and 169 transitions. [2022-07-20 06:08:39,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 06:08:39,379 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-20 06:08:39,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:08:39,379 INFO L225 Difference]: With dead ends: 150 [2022-07-20 06:08:39,379 INFO L226 Difference]: Without dead ends: 150 [2022-07-20 06:08:39,380 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-20 06:08:39,380 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.3s IncrementalHoareTripleChecker+Time [2022-07-20 06:08:39,380 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.3s Time] [2022-07-20 06:08:39,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2022-07-20 06:08:39,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 127. [2022-07-20 06:08:39,382 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-20 06:08:39,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 149 transitions. [2022-07-20 06:08:39,383 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 149 transitions. Word has length 15 [2022-07-20 06:08:39,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:08:39,383 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 149 transitions. [2022-07-20 06:08:39,383 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-20 06:08:39,383 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 149 transitions. [2022-07-20 06:08:39,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-20 06:08:39,384 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:08:39,384 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-20 06:08:39,393 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-20 06:08:39,591 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-20 06:08:39,591 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-20 06:08:39,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:08:39,591 INFO L85 PathProgramCache]: Analyzing trace with hash 152694153, now seen corresponding path program 1 times [2022-07-20 06:08:39,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:08:39,592 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [222195473] [2022-07-20 06:08:39,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:08:39,592 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:08:39,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:08:39,593 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-20 06:08:39,595 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-20 06:08:39,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:08:39,652 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-20 06:08:39,653 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:08:39,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-20 06:08:39,662 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 06:08:39,662 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:08:39,662 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [222195473] [2022-07-20 06:08:39,662 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [222195473] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:08:39,662 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:08:39,662 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 06:08:39,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363443802] [2022-07-20 06:08:39,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:08:39,663 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 06:08:39,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:08:39,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 06:08:39,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 06:08:39,663 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-20 06:08:39,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:08:39,677 INFO L93 Difference]: Finished difference Result 153 states and 183 transitions. [2022-07-20 06:08:39,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-20 06:08:39,677 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-20 06:08:39,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:08:39,678 INFO L225 Difference]: With dead ends: 153 [2022-07-20 06:08:39,678 INFO L226 Difference]: Without dead ends: 153 [2022-07-20 06:08:39,678 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-20 06:08:39,678 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-20 06:08:39,678 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-20 06:08:39,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2022-07-20 06:08:39,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 131. [2022-07-20 06:08:39,680 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-20 06:08:39,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 153 transitions. [2022-07-20 06:08:39,681 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 153 transitions. Word has length 18 [2022-07-20 06:08:39,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:08:39,681 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 153 transitions. [2022-07-20 06:08:39,681 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-20 06:08:39,681 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 153 transitions. [2022-07-20 06:08:39,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-20 06:08:39,682 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:08:39,682 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-20 06:08:39,704 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-20 06:08:39,889 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-20 06:08:39,889 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-20 06:08:39,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:08:39,889 INFO L85 PathProgramCache]: Analyzing trace with hash 718816338, now seen corresponding path program 1 times [2022-07-20 06:08:39,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:08:39,890 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1267178841] [2022-07-20 06:08:39,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:08:39,890 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:08:39,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:08:39,891 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-20 06:08:39,892 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-20 06:08:39,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:08:39,945 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-20 06:08:39,946 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:08:39,957 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-20 06:08:39,958 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 06:08:39,958 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:08:39,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1267178841] [2022-07-20 06:08:39,958 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1267178841] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:08:39,958 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:08:39,958 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-20 06:08:39,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858235065] [2022-07-20 06:08:39,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:08:39,958 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-20 06:08:39,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:08:39,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-20 06:08:39,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-20 06:08:39,959 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-20 06:08:39,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:08:39,983 INFO L93 Difference]: Finished difference Result 153 states and 179 transitions. [2022-07-20 06:08:39,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-20 06:08:39,983 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-20 06:08:39,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:08:39,984 INFO L225 Difference]: With dead ends: 153 [2022-07-20 06:08:39,984 INFO L226 Difference]: Without dead ends: 153 [2022-07-20 06:08:39,984 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-20 06:08:39,984 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-20 06:08:39,984 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-20 06:08:39,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2022-07-20 06:08:39,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 135. [2022-07-20 06:08:39,986 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-20 06:08:39,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 157 transitions. [2022-07-20 06:08:39,987 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 157 transitions. Word has length 20 [2022-07-20 06:08:39,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:08:39,987 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 157 transitions. [2022-07-20 06:08:39,987 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-20 06:08:39,987 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 157 transitions. [2022-07-20 06:08:39,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-20 06:08:39,987 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:08:39,987 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-20 06:08:40,013 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Ended with exit code 0 [2022-07-20 06:08:40,195 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-20 06:08:40,195 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-20 06:08:40,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:08:40,196 INFO L85 PathProgramCache]: Analyzing trace with hash -526850106, now seen corresponding path program 1 times [2022-07-20 06:08:40,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:08:40,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1373898071] [2022-07-20 06:08:40,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:08:40,196 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:08:40,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:08:40,197 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-20 06:08:40,199 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-20 06:08:40,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:08:40,255 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-20 06:08:40,256 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:08:40,267 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-20 06:08:40,270 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-20 06:08:40,329 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:08:40,331 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:08:40,331 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-20 06:08:40,334 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:08:40,335 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-20 06:08:40,368 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-20 06:08:40,368 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 06:08:40,368 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:08:40,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1373898071] [2022-07-20 06:08:40,368 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1373898071] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:08:40,368 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:08:40,368 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-20 06:08:40,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912866929] [2022-07-20 06:08:40,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:08:40,369 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-20 06:08:40,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:08:40,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-20 06:08:40,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-20 06:08:40,369 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-20 06:08:41,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:08:41,427 INFO L93 Difference]: Finished difference Result 254 states and 291 transitions. [2022-07-20 06:08:41,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-20 06:08:41,428 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-20 06:08:41,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:08:41,430 INFO L225 Difference]: With dead ends: 254 [2022-07-20 06:08:41,430 INFO L226 Difference]: Without dead ends: 254 [2022-07-20 06:08:41,431 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-20 06:08:41,431 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.8s IncrementalHoareTripleChecker+Time [2022-07-20 06:08:41,432 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.8s Time] [2022-07-20 06:08:41,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2022-07-20 06:08:41,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 144. [2022-07-20 06:08:41,434 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-20 06:08:41,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 168 transitions. [2022-07-20 06:08:41,435 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 168 transitions. Word has length 20 [2022-07-20 06:08:41,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:08:41,435 INFO L495 AbstractCegarLoop]: Abstraction has 144 states and 168 transitions. [2022-07-20 06:08:41,435 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-20 06:08:41,435 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 168 transitions. [2022-07-20 06:08:41,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-20 06:08:41,438 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:08:41,438 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-20 06:08:41,447 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-20 06:08:41,645 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-20 06:08:41,646 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-20 06:08:41,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:08:41,646 INFO L85 PathProgramCache]: Analyzing trace with hash 213685580, now seen corresponding path program 1 times [2022-07-20 06:08:41,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:08:41,647 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1044495774] [2022-07-20 06:08:41,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:08:41,647 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:08:41,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:08:41,650 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-20 06:08:41,652 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-20 06:08:41,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:08:41,741 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-20 06:08:41,742 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:08:41,749 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-20 06:08:41,756 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-20 06:08:41,771 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-20 06:08:41,778 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-20 06:08:41,778 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 06:08:41,778 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:08:41,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1044495774] [2022-07-20 06:08:41,778 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1044495774] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:08:41,778 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:08:41,779 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 06:08:41,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760343577] [2022-07-20 06:08:41,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:08:41,779 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-20 06:08:41,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:08:41,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-20 06:08:41,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-20 06:08:41,780 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-20 06:08:42,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:08:42,088 INFO L93 Difference]: Finished difference Result 149 states and 174 transitions. [2022-07-20 06:08:42,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 06:08:42,088 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-20 06:08:42,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:08:42,089 INFO L225 Difference]: With dead ends: 149 [2022-07-20 06:08:42,089 INFO L226 Difference]: Without dead ends: 149 [2022-07-20 06:08:42,089 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-20 06:08:42,090 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 7 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.3s IncrementalHoareTripleChecker+Time [2022-07-20 06:08:42,090 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.3s Time] [2022-07-20 06:08:42,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2022-07-20 06:08:42,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 143. [2022-07-20 06:08:42,092 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-20 06:08:42,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 167 transitions. [2022-07-20 06:08:42,092 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 167 transitions. Word has length 21 [2022-07-20 06:08:42,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:08:42,093 INFO L495 AbstractCegarLoop]: Abstraction has 143 states and 167 transitions. [2022-07-20 06:08:42,093 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-20 06:08:42,093 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 167 transitions. [2022-07-20 06:08:42,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-20 06:08:42,093 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:08:42,093 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-20 06:08:42,101 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-20 06:08:42,300 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-20 06:08:42,301 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-20 06:08:42,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:08:42,301 INFO L85 PathProgramCache]: Analyzing trace with hash 213685581, now seen corresponding path program 1 times [2022-07-20 06:08:42,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:08:42,301 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1801264105] [2022-07-20 06:08:42,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:08:42,302 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:08:42,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:08:42,304 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-20 06:08:42,306 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-20 06:08:42,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:08:42,396 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-20 06:08:42,398 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:08:42,402 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-20 06:08:42,416 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-20 06:08:42,423 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-20 06:08:42,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 21 treesize of output 9 [2022-07-20 06:08:42,456 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-20 06:08:42,470 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-20 06:08:42,471 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 06:08:42,471 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:08:42,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1801264105] [2022-07-20 06:08:42,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1801264105] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:08:42,471 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:08:42,471 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 06:08:42,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760717077] [2022-07-20 06:08:42,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:08:42,471 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-20 06:08:42,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:08:42,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-20 06:08:42,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-20 06:08:42,472 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-20 06:08:42,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:08:42,772 INFO L93 Difference]: Finished difference Result 142 states and 166 transitions. [2022-07-20 06:08:42,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 06:08:42,772 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-20 06:08:42,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:08:42,773 INFO L225 Difference]: With dead ends: 142 [2022-07-20 06:08:42,773 INFO L226 Difference]: Without dead ends: 142 [2022-07-20 06:08:42,773 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-20 06:08:42,774 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-20 06:08:42,774 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-20 06:08:42,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2022-07-20 06:08:42,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2022-07-20 06:08:42,776 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-20 06:08:42,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 166 transitions. [2022-07-20 06:08:42,776 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 166 transitions. Word has length 21 [2022-07-20 06:08:42,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:08:42,776 INFO L495 AbstractCegarLoop]: Abstraction has 142 states and 166 transitions. [2022-07-20 06:08:42,776 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-20 06:08:42,776 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 166 transitions. [2022-07-20 06:08:42,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-20 06:08:42,777 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:08:42,777 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-20 06:08:42,789 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2022-07-20 06:08:42,987 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-20 06:08:42,987 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-20 06:08:42,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:08:42,988 INFO L85 PathProgramCache]: Analyzing trace with hash -705595017, now seen corresponding path program 1 times [2022-07-20 06:08:42,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:08:42,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [863260182] [2022-07-20 06:08:42,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:08:42,988 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:08:42,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:08:43,004 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-20 06:08:43,025 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-20 06:08:43,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:08:43,093 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-20 06:08:43,095 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:08:43,109 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-20 06:08:43,113 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-20 06:08:43,187 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:08:43,189 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:08:43,189 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-20 06:08:43,216 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:08:43,216 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-20 06:08:43,235 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-20 06:08:43,235 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 06:08:43,235 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:08:43,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [863260182] [2022-07-20 06:08:43,236 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [863260182] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:08:43,236 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:08:43,236 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-20 06:08:43,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661993085] [2022-07-20 06:08:43,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:08:43,236 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-20 06:08:43,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:08:43,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-20 06:08:43,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-20 06:08:43,237 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-20 06:08:43,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:08:43,710 INFO L93 Difference]: Finished difference Result 218 states and 248 transitions. [2022-07-20 06:08:43,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-20 06:08:43,711 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-20 06:08:43,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:08:43,712 INFO L225 Difference]: With dead ends: 218 [2022-07-20 06:08:43,712 INFO L226 Difference]: Without dead ends: 218 [2022-07-20 06:08:43,712 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-20 06:08:43,713 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-20 06:08:43,713 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-20 06:08:43,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2022-07-20 06:08:43,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 150. [2022-07-20 06:08:43,716 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-20 06:08:43,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 174 transitions. [2022-07-20 06:08:43,717 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 174 transitions. Word has length 22 [2022-07-20 06:08:43,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:08:43,717 INFO L495 AbstractCegarLoop]: Abstraction has 150 states and 174 transitions. [2022-07-20 06:08:43,717 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-20 06:08:43,717 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 174 transitions. [2022-07-20 06:08:43,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-20 06:08:43,718 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:08:43,718 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-20 06:08:43,726 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-20 06:08:43,924 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-20 06:08:43,925 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-20 06:08:43,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:08:43,925 INFO L85 PathProgramCache]: Analyzing trace with hash 887014990, now seen corresponding path program 1 times [2022-07-20 06:08:43,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:08:43,925 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [382820175] [2022-07-20 06:08:43,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:08:43,926 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:08:43,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:08:43,927 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-20 06:08:43,928 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-20 06:08:44,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:08:44,033 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 15 conjunts are in the unsatisfiable core [2022-07-20 06:08:44,034 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:08:44,048 INFO L356 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2022-07-20 06:08:44,048 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-20 06:08:44,120 INFO L356 Elim1Store]: treesize reduction 38, result has 39.7 percent of original size [2022-07-20 06:08:44,121 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-20 06:08:44,177 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-20 06:08:44,297 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:08:44,297 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-20 06:08:44,495 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-20 06:08:44,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-20 06:08:44,553 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 06:08:44,553 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:08:44,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [382820175] [2022-07-20 06:08:44,553 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [382820175] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:08:44,553 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:08:44,553 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-20 06:08:44,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761400219] [2022-07-20 06:08:44,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:08:44,553 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-20 06:08:44,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:08:44,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-20 06:08:44,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-07-20 06:08:44,554 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-20 06:08:45,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:08:45,351 INFO L93 Difference]: Finished difference Result 239 states and 271 transitions. [2022-07-20 06:08:45,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-20 06:08:45,352 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-20 06:08:45,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:08:45,353 INFO L225 Difference]: With dead ends: 239 [2022-07-20 06:08:45,353 INFO L226 Difference]: Without dead ends: 239 [2022-07-20 06:08:45,353 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-20 06:08:45,354 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.5s IncrementalHoareTripleChecker+Time [2022-07-20 06:08:45,354 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.5s Time] [2022-07-20 06:08:45,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2022-07-20 06:08:45,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 162. [2022-07-20 06:08:45,356 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-20 06:08:45,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 190 transitions. [2022-07-20 06:08:45,357 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 190 transitions. Word has length 24 [2022-07-20 06:08:45,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:08:45,357 INFO L495 AbstractCegarLoop]: Abstraction has 162 states and 190 transitions. [2022-07-20 06:08:45,357 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-20 06:08:45,357 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 190 transitions. [2022-07-20 06:08:45,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-20 06:08:45,357 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:08:45,357 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-20 06:08:45,372 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Ended with exit code 0 [2022-07-20 06:08:45,557 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-20 06:08:45,558 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-20 06:08:45,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:08:45,558 INFO L85 PathProgramCache]: Analyzing trace with hash 887014991, now seen corresponding path program 1 times [2022-07-20 06:08:45,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:08:45,558 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1476474786] [2022-07-20 06:08:45,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:08:45,559 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:08:45,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:08:45,576 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-20 06:08:45,580 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-20 06:08:45,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:08:45,713 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 21 conjunts are in the unsatisfiable core [2022-07-20 06:08:45,717 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:08:45,725 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-20 06:08:45,745 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-20 06:08:45,755 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 06:08:45,756 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-20 06:08:45,776 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-20 06:08:45,785 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-20 06:08:45,892 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:08:45,892 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-20 06:08:45,895 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-20 06:08:45,998 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-20 06:08:46,000 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-20 06:08:46,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-20 06:08:46,014 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 06:08:46,014 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:08:46,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1476474786] [2022-07-20 06:08:46,014 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1476474786] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:08:46,014 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:08:46,014 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-20 06:08:46,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261163569] [2022-07-20 06:08:46,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:08:46,015 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-20 06:08:46,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:08:46,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-20 06:08:46,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-20 06:08:46,015 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-20 06:08:46,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:08:46,741 INFO L93 Difference]: Finished difference Result 246 states and 280 transitions. [2022-07-20 06:08:46,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-20 06:08:46,742 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-20 06:08:46,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:08:46,742 INFO L225 Difference]: With dead ends: 246 [2022-07-20 06:08:46,743 INFO L226 Difference]: Without dead ends: 246 [2022-07-20 06:08:46,743 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-20 06:08:46,743 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 196 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 458 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.6s IncrementalHoareTripleChecker+Time [2022-07-20 06:08:46,743 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.6s Time] [2022-07-20 06:08:46,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2022-07-20 06:08:46,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 162. [2022-07-20 06:08:46,745 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-20 06:08:46,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 189 transitions. [2022-07-20 06:08:46,746 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 189 transitions. Word has length 24 [2022-07-20 06:08:46,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:08:46,746 INFO L495 AbstractCegarLoop]: Abstraction has 162 states and 189 transitions. [2022-07-20 06:08:46,746 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-20 06:08:46,747 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 189 transitions. [2022-07-20 06:08:46,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-20 06:08:46,747 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:08:46,747 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-20 06:08:46,757 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Ended with exit code 0 [2022-07-20 06:08:46,947 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-20 06:08:46,948 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-20 06:08:46,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:08:46,948 INFO L85 PathProgramCache]: Analyzing trace with hash 809096703, now seen corresponding path program 1 times [2022-07-20 06:08:46,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:08:46,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2064385760] [2022-07-20 06:08:46,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:08:46,949 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:08:46,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:08:46,950 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-20 06:08:46,952 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-20 06:08:47,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:08:47,053 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 18 conjunts are in the unsatisfiable core [2022-07-20 06:08:47,055 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:08:47,058 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-20 06:08:47,068 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-20 06:08:47,099 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 06:08:47,100 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-20 06:08:47,134 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-07-20 06:08:47,134 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-20 06:08:47,141 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-20 06:08:47,182 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-20 06:08:47,203 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-20 06:08:47,260 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-20 06:08:47,304 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-20 06:08:47,304 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 06:08:47,304 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:08:47,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2064385760] [2022-07-20 06:08:47,304 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2064385760] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:08:47,304 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:08:47,304 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-20 06:08:47,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006759753] [2022-07-20 06:08:47,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:08:47,306 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-20 06:08:47,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:08:47,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-20 06:08:47,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2022-07-20 06:08:47,306 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-20 06:08:48,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:08:48,562 INFO L93 Difference]: Finished difference Result 242 states and 272 transitions. [2022-07-20 06:08:48,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-20 06:08:48,569 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-20 06:08:48,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:08:48,570 INFO L225 Difference]: With dead ends: 242 [2022-07-20 06:08:48,570 INFO L226 Difference]: Without dead ends: 242 [2022-07-20 06:08:48,570 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-20 06:08:48,571 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-20 06:08:48,572 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-20 06:08:48,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2022-07-20 06:08:48,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 162. [2022-07-20 06:08:48,574 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-20 06:08:48,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 188 transitions. [2022-07-20 06:08:48,575 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 188 transitions. Word has length 26 [2022-07-20 06:08:48,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:08:48,576 INFO L495 AbstractCegarLoop]: Abstraction has 162 states and 188 transitions. [2022-07-20 06:08:48,576 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-20 06:08:48,576 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 188 transitions. [2022-07-20 06:08:48,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-20 06:08:48,577 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:08:48,577 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-20 06:08:48,584 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-20 06:08:48,784 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-20 06:08:48,785 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-20 06:08:48,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:08:48,785 INFO L85 PathProgramCache]: Analyzing trace with hash 748762178, now seen corresponding path program 1 times [2022-07-20 06:08:48,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:08:48,786 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [189015594] [2022-07-20 06:08:48,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:08:48,786 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:08:48,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:08:48,787 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-20 06:08:48,788 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-20 06:08:48,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:08:48,874 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 21 conjunts are in the unsatisfiable core [2022-07-20 06:08:48,876 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:08:48,885 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-20 06:08:48,888 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-20 06:08:48,914 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-07-20 06:08:48,914 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-20 06:08:48,919 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:08:48,920 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-20 06:08:48,933 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-07-20 06:08:48,934 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-20 06:08:48,938 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:08:48,939 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-20 06:08:48,992 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-20 06:08:48,994 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-20 06:08:49,012 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-20 06:08:49,012 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:08:49,084 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-20 06:08:49,085 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:08:49,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [189015594] [2022-07-20 06:08:49,085 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [189015594] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:08:49,085 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 06:08:49,085 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2022-07-20 06:08:49,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226999432] [2022-07-20 06:08:49,085 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 06:08:49,085 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 06:08:49,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:08:49,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 06:08:49,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 06:08:49,086 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-20 06:08:49,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:08:49,508 INFO L93 Difference]: Finished difference Result 203 states and 232 transitions. [2022-07-20 06:08:49,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-20 06:08:49,509 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-20 06:08:49,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:08:49,510 INFO L225 Difference]: With dead ends: 203 [2022-07-20 06:08:49,510 INFO L226 Difference]: Without dead ends: 203 [2022-07-20 06:08:49,510 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-20 06:08:49,510 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 80 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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-20 06:08:49,510 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-20 06:08:49,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2022-07-20 06:08:49,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 175. [2022-07-20 06:08:49,513 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-20 06:08:49,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 203 transitions. [2022-07-20 06:08:49,513 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 203 transitions. Word has length 26 [2022-07-20 06:08:49,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:08:49,513 INFO L495 AbstractCegarLoop]: Abstraction has 175 states and 203 transitions. [2022-07-20 06:08:49,513 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-20 06:08:49,514 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 203 transitions. [2022-07-20 06:08:49,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-20 06:08:49,514 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:08:49,514 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-20 06:08:49,530 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-20 06:08:49,720 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-20 06:08:49,721 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-20 06:08:49,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:08:49,721 INFO L85 PathProgramCache]: Analyzing trace with hash 1851942844, now seen corresponding path program 1 times [2022-07-20 06:08:49,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:08:49,722 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [521347293] [2022-07-20 06:08:49,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:08:49,722 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:08:49,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:08:49,724 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-20 06:08:49,725 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-20 06:08:49,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:08:49,857 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-20 06:08:49,858 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:08:50,030 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-20 06:08:50,034 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-20 06:08:50,059 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-20 06:08:50,059 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 06:08:50,059 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:08:50,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [521347293] [2022-07-20 06:08:50,059 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [521347293] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:08:50,059 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:08:50,060 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-20 06:08:50,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533779638] [2022-07-20 06:08:50,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:08:50,060 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-20 06:08:50,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:08:50,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-20 06:08:50,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-07-20 06:08:50,061 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-20 06:08:50,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:08:50,785 INFO L93 Difference]: Finished difference Result 212 states and 235 transitions. [2022-07-20 06:08:50,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-20 06:08:50,786 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-20 06:08:50,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:08:50,786 INFO L225 Difference]: With dead ends: 212 [2022-07-20 06:08:50,787 INFO L226 Difference]: Without dead ends: 212 [2022-07-20 06:08:50,787 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-20 06:08:50,787 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.4s IncrementalHoareTripleChecker+Time [2022-07-20 06:08:50,787 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.4s Time] [2022-07-20 06:08:50,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2022-07-20 06:08:50,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 177. [2022-07-20 06:08:50,789 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-20 06:08:50,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 205 transitions. [2022-07-20 06:08:50,790 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 205 transitions. Word has length 28 [2022-07-20 06:08:50,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:08:50,790 INFO L495 AbstractCegarLoop]: Abstraction has 177 states and 205 transitions. [2022-07-20 06:08:50,790 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-20 06:08:50,790 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 205 transitions. [2022-07-20 06:08:50,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-20 06:08:50,790 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:08:50,790 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-20 06:08:50,799 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-20 06:08:50,991 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-20 06:08:50,991 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-20 06:08:50,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:08:50,992 INFO L85 PathProgramCache]: Analyzing trace with hash 1693052079, now seen corresponding path program 1 times [2022-07-20 06:08:50,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:08:50,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1384466181] [2022-07-20 06:08:50,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:08:50,992 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:08:50,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:08:50,994 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-20 06:08:50,995 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-20 06:08:51,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:08:51,164 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 26 conjunts are in the unsatisfiable core [2022-07-20 06:08:51,167 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:08:51,173 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-20 06:08:51,200 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-20 06:08:51,222 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:08:51,223 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-20 06:08:51,265 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 06:08:51,265 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-20 06:08:51,311 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-20 06:08:51,316 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:08:51,317 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-20 06:08:51,357 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-20 06:08:51,393 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-20 06:08:51,411 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-20 06:08:51,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, 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-20 06:08:51,453 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-20 06:08:51,477 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-20 06:08:51,478 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:08:51,554 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-20 06:08:51,624 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-20 06:08:51,630 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-20 06:08:51,641 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-20 06:08:51,758 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-20 06:08:51,772 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-20 06:08:51,807 INFO L356 Elim1Store]: treesize reduction 78, result has 27.1 percent of original size [2022-07-20 06:08:51,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, 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-20 06:08:51,811 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-20 06:08:51,813 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-20 06:08:51,835 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-20 06:08:51,835 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:08:51,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1384466181] [2022-07-20 06:08:51,835 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1384466181] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:08:51,835 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 06:08:51,835 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 24 [2022-07-20 06:08:51,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62821564] [2022-07-20 06:08:51,835 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 06:08:51,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-07-20 06:08:51,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:08:51,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-07-20 06:08:51,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=247, Unknown=9, NotChecked=222, Total=552 [2022-07-20 06:08:51,836 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-20 06:08:52,972 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-20 06:08:53,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:08:53,398 INFO L93 Difference]: Finished difference Result 490 states and 550 transitions. [2022-07-20 06:08:53,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-07-20 06:08:53,399 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-20 06:08:53,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:08:53,400 INFO L225 Difference]: With dead ends: 490 [2022-07-20 06:08:53,400 INFO L226 Difference]: Without dead ends: 490 [2022-07-20 06:08:53,401 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 36 SyntacticMatches, 9 SemanticMatches, 41 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 258 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=292, Invalid=984, Unknown=12, NotChecked=518, Total=1806 [2022-07-20 06:08:53,401 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 493 mSDsluCounter, 856 mSDsCounter, 0 mSdLazyCounter, 858 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s 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.0s IncrementalHoareTripleChecker+Time [2022-07-20 06:08:53,401 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.0s Time] [2022-07-20 06:08:53,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2022-07-20 06:08:53,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 204. [2022-07-20 06:08:53,405 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-20 06:08:53,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 238 transitions. [2022-07-20 06:08:53,405 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 238 transitions. Word has length 30 [2022-07-20 06:08:53,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:08:53,406 INFO L495 AbstractCegarLoop]: Abstraction has 204 states and 238 transitions. [2022-07-20 06:08:53,406 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-20 06:08:53,406 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 238 transitions. [2022-07-20 06:08:53,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-20 06:08:53,406 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:08:53,406 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-20 06:08:53,416 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-20 06:08:53,606 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-20 06:08:53,607 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-20 06:08:53,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:08:53,607 INFO L85 PathProgramCache]: Analyzing trace with hash 1418753207, now seen corresponding path program 1 times [2022-07-20 06:08:53,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:08:53,607 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [791151210] [2022-07-20 06:08:53,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:08:53,607 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:08:53,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:08:53,609 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-20 06:08:53,610 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-20 06:08:53,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:08:53,745 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 26 conjunts are in the unsatisfiable core [2022-07-20 06:08:53,753 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:08:53,762 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-20 06:08:53,781 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-20 06:08:53,796 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:08:53,796 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-20 06:08:53,827 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 06:08:53,827 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-20 06:08:53,851 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-20 06:08:53,856 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:08:53,857 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-20 06:08:53,889 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-20 06:08:53,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-20 06:08:53,940 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-20 06:08:53,948 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-20 06:08:53,982 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-20 06:08:54,006 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-20 06:08:54,006 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:08:54,063 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-20 06:08:54,091 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-20 06:08:54,096 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-20 06:08:54,107 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-20 06:08:54,173 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-20 06:08:54,183 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-20 06:08:54,215 INFO L356 Elim1Store]: treesize reduction 78, result has 27.1 percent of original size [2022-07-20 06:08:54,215 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-20 06:08:54,218 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-20 06:08:54,220 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-20 06:08:54,241 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-20 06:08:54,241 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:08:54,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [791151210] [2022-07-20 06:08:54,241 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [791151210] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:08:54,241 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 06:08:54,241 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 24 [2022-07-20 06:08:54,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843825526] [2022-07-20 06:08:54,241 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 06:08:54,242 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-07-20 06:08:54,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:08:54,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-07-20 06:08:54,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=246, Unknown=10, NotChecked=222, Total=552 [2022-07-20 06:08:54,242 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-20 06:08:55,374 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-20 06:08:56,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:08:56,129 INFO L93 Difference]: Finished difference Result 541 states and 610 transitions. [2022-07-20 06:08:56,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-07-20 06:08:56,136 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-20 06:08:56,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:08:56,137 INFO L225 Difference]: With dead ends: 541 [2022-07-20 06:08:56,137 INFO L226 Difference]: Without dead ends: 541 [2022-07-20 06:08:56,138 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 38 SyntacticMatches, 7 SemanticMatches, 43 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 298 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=325, Invalid=1096, Unknown=13, NotChecked=546, Total=1980 [2022-07-20 06:08:56,139 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 451 mSDsluCounter, 935 mSDsCounter, 0 mSdLazyCounter, 1065 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s 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.3s IncrementalHoareTripleChecker+Time [2022-07-20 06:08:56,139 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.3s Time] [2022-07-20 06:08:56,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2022-07-20 06:08:56,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 202. [2022-07-20 06:08:56,142 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-20 06:08:56,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 235 transitions. [2022-07-20 06:08:56,143 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 235 transitions. Word has length 30 [2022-07-20 06:08:56,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:08:56,143 INFO L495 AbstractCegarLoop]: Abstraction has 202 states and 235 transitions. [2022-07-20 06:08:56,143 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-20 06:08:56,143 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 235 transitions. [2022-07-20 06:08:56,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-07-20 06:08:56,144 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:08:56,144 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-20 06:08:56,166 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Ended with exit code 0 [2022-07-20 06:08:56,359 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-20 06:08:56,359 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-20 06:08:56,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:08:56,360 INFO L85 PathProgramCache]: Analyzing trace with hash 753554603, now seen corresponding path program 1 times [2022-07-20 06:08:56,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:08:56,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1209187685] [2022-07-20 06:08:56,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:08:56,360 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:08:56,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:08:56,361 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-20 06:08:56,363 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-20 06:08:56,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:08:56,477 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 24 conjunts are in the unsatisfiable core [2022-07-20 06:08:56,479 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:08:56,481 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-20 06:08:56,492 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 06:08:56,492 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-20 06:08:56,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 6 treesize of output 5 [2022-07-20 06:08:56,503 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-20 06:08:56,544 INFO L356 Elim1Store]: treesize reduction 43, result has 17.3 percent of original size [2022-07-20 06:08:56,544 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-20 06:08:56,547 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-20 06:08:56,687 INFO L356 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2022-07-20 06:08:56,687 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-20 06:08:56,692 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-20 06:08:56,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-20 06:08:56,732 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 06:08:56,732 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:08:56,732 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1209187685] [2022-07-20 06:08:56,732 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1209187685] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:08:56,732 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:08:56,732 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-07-20 06:08:56,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335461999] [2022-07-20 06:08:56,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:08:56,732 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-20 06:08:56,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:08:56,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-20 06:08:56,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2022-07-20 06:08:56,733 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-20 06:08:57,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:08:57,915 INFO L93 Difference]: Finished difference Result 283 states and 317 transitions. [2022-07-20 06:08:57,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-20 06:08:57,916 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-20 06:08:57,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:08:57,916 INFO L225 Difference]: With dead ends: 283 [2022-07-20 06:08:57,916 INFO L226 Difference]: Without dead ends: 283 [2022-07-20 06:08:57,917 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-20 06:08:57,917 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 157 mSDsluCounter, 627 mSDsCounter, 0 mSdLazyCounter, 648 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s 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, 0.8s IncrementalHoareTripleChecker+Time [2022-07-20 06:08:57,917 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 708 Invalid, 744 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 648 Invalid, 0 Unknown, 76 Unchecked, 0.8s Time] [2022-07-20 06:08:57,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2022-07-20 06:08:57,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 199. [2022-07-20 06:08:57,920 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-20 06:08:57,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 230 transitions. [2022-07-20 06:08:57,920 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 230 transitions. Word has length 31 [2022-07-20 06:08:57,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:08:57,920 INFO L495 AbstractCegarLoop]: Abstraction has 199 states and 230 transitions. [2022-07-20 06:08:57,920 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-20 06:08:57,920 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 230 transitions. [2022-07-20 06:08:57,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-20 06:08:57,920 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:08:57,920 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-20 06:08:57,928 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-20 06:08:58,121 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-20 06:08:58,121 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-20 06:08:58,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:08:58,121 INFO L85 PathProgramCache]: Analyzing trace with hash -1978341344, now seen corresponding path program 1 times [2022-07-20 06:08:58,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:08:58,122 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [665534756] [2022-07-20 06:08:58,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:08:58,122 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:08:58,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:08:58,139 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-20 06:08:58,140 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-20 06:08:58,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:08:58,275 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 31 conjunts are in the unsatisfiable core [2022-07-20 06:08:58,277 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:08:58,281 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-20 06:08:58,300 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-20 06:08:58,304 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-20 06:08:58,349 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 06:08:58,350 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-20 06:08:58,375 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:08:58,376 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-20 06:08:58,381 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:08:58,381 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-20 06:08:58,473 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-20 06:08:58,473 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-20 06:08:58,478 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-20 06:08:58,493 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:08:58,493 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-20 06:08:58,539 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-20 06:08:58,539 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-20 06:08:58,544 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-20 06:08:58,556 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:08:58,556 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-20 06:08:58,584 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:08:58,584 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-20 06:08:58,588 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-20 06:08:58,703 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:08:58,703 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:08:58,705 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:08:58,705 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-20 06:08:58,709 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:08:58,709 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-20 06:08:58,734 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-20 06:08:58,735 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:08:58,829 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-20 06:08:58,860 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-20 06:08:58,870 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-20 06:08:58,894 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-20 06:08:58,921 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_12| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_12|))) (and (forall ((v_ArrVal_760 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_752 (_ BitVec 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_752)) |v_ULTIMATE.start_main_#t~malloc7#1.base_12| v_ArrVal_760) |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_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| |v_ULTIMATE.start_main_#t~malloc7#1.base_12|)) |v_ULTIMATE.start_main_#t~malloc7#1.base_12| 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-20 06:08:59,009 INFO L356 Elim1Store]: treesize reduction 23, result has 45.2 percent of original size [2022-07-20 06:08:59,009 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-20 06:08:59,011 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-20 06:08:59,014 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-20 06:08:59,020 INFO L356 Elim1Store]: treesize reduction 41, result has 2.4 percent of original size [2022-07-20 06:08:59,020 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-20 06:08:59,043 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-20 06:08:59,043 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:08:59,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [665534756] [2022-07-20 06:08:59,043 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [665534756] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:08:59,043 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 06:08:59,044 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 23 [2022-07-20 06:08:59,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739869581] [2022-07-20 06:08:59,044 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 06:08:59,044 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-07-20 06:08:59,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:08:59,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-07-20 06:08:59,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=250, Unknown=9, NotChecked=180, Total=506 [2022-07-20 06:08:59,045 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-20 06:09:00,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:09:00,619 INFO L93 Difference]: Finished difference Result 325 states and 361 transitions. [2022-07-20 06:09:00,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-20 06:09:00,620 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-20 06:09:00,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:09:00,627 INFO L225 Difference]: With dead ends: 325 [2022-07-20 06:09:00,628 INFO L226 Difference]: Without dead ends: 325 [2022-07-20 06:09:00,628 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 40 SyntacticMatches, 7 SemanticMatches, 32 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=199, Invalid=624, Unknown=9, NotChecked=290, Total=1122 [2022-07-20 06:09:00,629 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 364 mSDsluCounter, 817 mSDsCounter, 0 mSdLazyCounter, 967 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 364 SdHoareTripleChecker+Valid, 903 SdHoareTripleChecker+Invalid, 2086 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 967 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1071 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:09:00,629 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [364 Valid, 903 Invalid, 2086 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 967 Invalid, 0 Unknown, 1071 Unchecked, 1.1s Time] [2022-07-20 06:09:00,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2022-07-20 06:09:00,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 206. [2022-07-20 06:09:00,632 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-20 06:09:00,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 237 transitions. [2022-07-20 06:09:00,633 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 237 transitions. Word has length 32 [2022-07-20 06:09:00,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:09:00,633 INFO L495 AbstractCegarLoop]: Abstraction has 206 states and 237 transitions. [2022-07-20 06:09:00,633 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-20 06:09:00,633 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 237 transitions. [2022-07-20 06:09:00,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-07-20 06:09:00,634 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:09:00,634 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-20 06:09:00,653 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-20 06:09:00,842 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-20 06:09:00,843 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-20 06:09:00,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:09:00,843 INFO L85 PathProgramCache]: Analyzing trace with hash -1630199823, now seen corresponding path program 1 times [2022-07-20 06:09:00,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:09:00,843 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1337482205] [2022-07-20 06:09:00,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:09:00,844 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:09:00,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:09:00,845 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-20 06:09:00,847 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-20 06:09:00,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:09:00,923 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-20 06:09:00,924 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:09:01,025 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-20 06:09:01,025 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 06:09:01,026 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:09:01,026 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1337482205] [2022-07-20 06:09:01,026 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1337482205] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:09:01,026 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:09:01,026 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 06:09:01,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193854865] [2022-07-20 06:09:01,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:09:01,026 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-20 06:09:01,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:09:01,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-20 06:09:01,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-20 06:09:01,027 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-20 06:09:01,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:09:01,233 INFO L93 Difference]: Finished difference Result 227 states and 252 transitions. [2022-07-20 06:09:01,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-20 06:09:01,234 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-20 06:09:01,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:09:01,234 INFO L225 Difference]: With dead ends: 227 [2022-07-20 06:09:01,234 INFO L226 Difference]: Without dead ends: 227 [2022-07-20 06:09:01,235 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-20 06:09:01,235 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 267 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 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-20 06:09:01,235 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [267 Valid, 129 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-20 06:09:01,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2022-07-20 06:09:01,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 208. [2022-07-20 06:09:01,237 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-20 06:09:01,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 239 transitions. [2022-07-20 06:09:01,238 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 239 transitions. Word has length 33 [2022-07-20 06:09:01,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:09:01,238 INFO L495 AbstractCegarLoop]: Abstraction has 208 states and 239 transitions. [2022-07-20 06:09:01,238 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-20 06:09:01,238 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 239 transitions. [2022-07-20 06:09:01,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-07-20 06:09:01,238 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:09:01,238 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-20 06:09:01,250 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-20 06:09:01,445 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-20 06:09:01,445 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-20 06:09:01,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:09:01,446 INFO L85 PathProgramCache]: Analyzing trace with hash -1630210808, now seen corresponding path program 1 times [2022-07-20 06:09:01,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:09:01,446 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1299967778] [2022-07-20 06:09:01,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:09:01,446 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:09:01,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:09:01,447 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-20 06:09:01,449 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-20 06:09:01,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:09:01,541 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-20 06:09:01,542 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:09:01,625 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-20 06:09:01,634 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-20 06:09:01,634 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:09:01,707 INFO L356 Elim1Store]: treesize reduction 8, result has 46.7 percent of original size [2022-07-20 06:09:01,707 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-20 06:09:01,714 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-20 06:09:01,714 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:09:01,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1299967778] [2022-07-20 06:09:01,714 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1299967778] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:09:01,714 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 06:09:01,714 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2022-07-20 06:09:01,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786399336] [2022-07-20 06:09:01,714 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 06:09:01,714 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-20 06:09:01,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:09:01,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-20 06:09:01,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-07-20 06:09:01,715 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-20 06:09:02,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:09:02,519 INFO L93 Difference]: Finished difference Result 298 states and 332 transitions. [2022-07-20 06:09:02,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-20 06:09:02,519 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-20 06:09:02,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:09:02,520 INFO L225 Difference]: With dead ends: 298 [2022-07-20 06:09:02,521 INFO L226 Difference]: Without dead ends: 298 [2022-07-20 06:09:02,521 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-20 06:09:02,521 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 317 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 317 SdHoareTripleChecker+Valid, 451 SdHoareTripleChecker+Invalid, 378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-20 06:09:02,521 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [317 Valid, 451 Invalid, 378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-20 06:09:02,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2022-07-20 06:09:02,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 257. [2022-07-20 06:09:02,525 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-20 06:09:02,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 302 transitions. [2022-07-20 06:09:02,526 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 302 transitions. Word has length 33 [2022-07-20 06:09:02,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:09:02,526 INFO L495 AbstractCegarLoop]: Abstraction has 257 states and 302 transitions. [2022-07-20 06:09:02,526 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-20 06:09:02,526 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 302 transitions. [2022-07-20 06:09:02,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-20 06:09:02,527 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:09:02,527 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-20 06:09:02,545 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-20 06:09:02,737 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-20 06:09:02,738 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-20 06:09:02,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:09:02,738 INFO L85 PathProgramCache]: Analyzing trace with hash 1399931191, now seen corresponding path program 1 times [2022-07-20 06:09:02,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:09:02,739 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [328096259] [2022-07-20 06:09:02,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:09:02,739 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:09:02,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:09:02,742 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-20 06:09:02,745 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-20 06:09:02,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:09:02,938 INFO L263 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 28 conjunts are in the unsatisfiable core [2022-07-20 06:09:02,940 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:09:02,944 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-20 06:09:02,971 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-20 06:09:02,971 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-20 06:09:02,995 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-20 06:09:03,049 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:09:03,050 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-20 06:09:03,115 INFO L356 Elim1Store]: treesize reduction 48, result has 43.5 percent of original size [2022-07-20 06:09:03,115 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-20 06:09:03,164 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:09:03,164 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-20 06:09:03,361 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:09:03,361 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-20 06:09:03,419 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:09:03,420 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-20 06:09:03,446 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:09:03,446 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-20 06:09:03,650 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-20 06:09:03,671 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-20 06:09:03,672 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:09:03,931 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-20 06:09:03,943 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-20 06:09:03,953 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-20 06:09:03,969 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-20 06:09:03,980 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-20 06:09:03,996 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:09:03,997 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-20 06:09:03,999 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:09:04,000 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-20 06:09:04,003 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-20 06:09:06,197 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-20 06:09:06,198 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:09:06,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [328096259] [2022-07-20 06:09:06,198 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [328096259] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:09:06,198 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 06:09:06,198 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 26 [2022-07-20 06:09:06,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338780396] [2022-07-20 06:09:06,198 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 06:09:06,199 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-07-20 06:09:06,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:09:06,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-07-20 06:09:06,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=374, Unknown=8, NotChecked=220, Total=702 [2022-07-20 06:09:06,200 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-20 06:09:06,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:09:06,588 INFO L93 Difference]: Finished difference Result 288 states and 339 transitions. [2022-07-20 06:09:06,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-20 06:09:06,589 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-20 06:09:06,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:09:06,591 INFO L225 Difference]: With dead ends: 288 [2022-07-20 06:09:06,591 INFO L226 Difference]: Without dead ends: 288 [2022-07-20 06:09:06,592 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 41 SyntacticMatches, 6 SemanticMatches, 28 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=132, Invalid=480, Unknown=8, NotChecked=250, Total=870 [2022-07-20 06:09:06,592 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 58 mSDsluCounter, 698 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 795 SdHoareTripleChecker+Invalid, 946 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 817 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 06:09:06,592 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 795 Invalid, 946 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 124 Invalid, 0 Unknown, 817 Unchecked, 0.2s Time] [2022-07-20 06:09:06,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2022-07-20 06:09:06,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 278. [2022-07-20 06:09:06,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 257 states have (on average 1.2801556420233462) internal successors, (329), 277 states have internal predecessors, (329), 0 states have call successors, (0), 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-20 06:09:06,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 329 transitions. [2022-07-20 06:09:06,595 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 329 transitions. Word has length 34 [2022-07-20 06:09:06,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:09:06,595 INFO L495 AbstractCegarLoop]: Abstraction has 278 states and 329 transitions. [2022-07-20 06:09:06,596 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-20 06:09:06,596 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 329 transitions. [2022-07-20 06:09:06,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-20 06:09:06,596 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:09:06,596 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-20 06:09:06,617 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-20 06:09:06,804 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-20 06:09:06,804 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-20 06:09:06,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:09:06,805 INFO L85 PathProgramCache]: Analyzing trace with hash 1399931192, now seen corresponding path program 1 times [2022-07-20 06:09:06,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:09:06,805 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1454409471] [2022-07-20 06:09:06,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:09:06,805 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:09:06,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:09:06,806 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-20 06:09:06,808 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-20 06:09:06,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:09:06,998 INFO L263 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 41 conjunts are in the unsatisfiable core [2022-07-20 06:09:07,001 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:09:07,004 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-20 06:09:07,031 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-20 06:09:07,031 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-20 06:09:07,038 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-20 06:09:07,058 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-20 06:09:07,065 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-20 06:09:07,139 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:09:07,140 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-20 06:09:07,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, 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-20 06:09:07,229 INFO L356 Elim1Store]: treesize reduction 23, result has 47.7 percent of original size [2022-07-20 06:09:07,229 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-20 06:09:07,256 INFO L356 Elim1Store]: treesize reduction 8, result has 65.2 percent of original size [2022-07-20 06:09:07,257 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-20 06:09:07,310 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:09:07,311 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-20 06:09:07,328 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:09:07,329 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-20 06:09:07,476 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-20 06:09:07,476 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-20 06:09:07,480 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-20 06:09:07,494 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:09:07,494 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-20 06:09:07,566 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:09:07,566 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-20 06:09:07,581 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:09:07,582 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-20 06:09:07,599 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:09:07,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, 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-20 06:09:07,604 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-20 06:09:07,799 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-20 06:09:07,803 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:09:07,803 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-20 06:09:07,825 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-20 06:09:07,826 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:09:08,057 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-20 06:09:08,109 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-20 06:09:08,130 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-20 06:09:08,196 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-20 06:09:09,145 WARN L833 $PredicateComparison]: unable to prove that (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))) (and (forall ((v_ArrVal_938 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_931 (_ BitVec 32))) (let ((.cse0 (select (select (store (let ((.cse1 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_928))) (store .cse1 |c_ULTIMATE.start_main_~head~0#1.base| (store (select .cse1 |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 .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)) (v_ArrVal_929 (_ BitVec 32))) (let ((.cse3 (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv4 32)))) (bvule (bvadd (_ bv4 32) (select (select (store (let ((.cse2 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_928))) (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_ArrVal_931))) |v_ULTIMATE.start_main_#t~malloc7#1.base_18| v_ArrVal_938) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc7#1.base_18| v_ArrVal_929) (select (select (store (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_927))) (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_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|) .cse3)))))))) is different from false [2022-07-20 06:09:09,196 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_18| (_ BitVec 32))) (or (and (forall ((v_ArrVal_927 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_938 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_928 (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)))))) (forall ((v_ArrVal_938 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_928 (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-20 06:09:09,255 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:09:09,255 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-20 06:09:09,266 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:09:09,266 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-20 06:09:09,269 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:09:09,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 96 treesize of output 84 [2022-07-20 06:09:09,274 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:09:09,276 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-20 06:09:09,284 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-20 06:09:09,287 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-20 06:09:09,546 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:09:09,546 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-20 06:09:09,549 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:09:09,550 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-20 06:09:09,557 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-20 06:09:09,921 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:09:09,922 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-20 06:09:09,925 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:09:09,928 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-20 06:09:09,932 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 13 treesize of output 5 [2022-07-20 06:09:09,945 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-07-20 06:09:09,945 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 1 case distinctions, treesize of input 99 treesize of output 1 [2022-07-20 06:09:15,042 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-20 06:09:15,042 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:09:15,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1454409471] [2022-07-20 06:09:15,042 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1454409471] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:09:15,042 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 06:09:15,042 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 26 [2022-07-20 06:09:15,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329325350] [2022-07-20 06:09:15,042 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 06:09:15,043 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-07-20 06:09:15,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:09:15,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-07-20 06:09:15,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=343, Unknown=15, NotChecked=258, Total=702 [2022-07-20 06:09:15,043 INFO L87 Difference]: Start difference. First operand 278 states and 329 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-20 06:09:23,083 WARN L833 $PredicateComparison]: unable to prove that (and (= (_ bv1 1) (select |c_#valid| |c_ULTIMATE.start_main_~head~0#1.base|)) (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)))) (= |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv0 32))) is different from false [2022-07-20 06:09:25,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:09:25,303 INFO L93 Difference]: Finished difference Result 700 states and 837 transitions. [2022-07-20 06:09:25,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-07-20 06:09:25,304 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-20 06:09:25,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:09:25,306 INFO L225 Difference]: With dead ends: 700 [2022-07-20 06:09:25,306 INFO L226 Difference]: Without dead ends: 700 [2022-07-20 06:09:25,307 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 42 SyntacticMatches, 6 SemanticMatches, 45 ConstructedPredicates, 7 IntricatePredicates, 1 DeprecatedPredicates, 309 ImplicationChecksByTransitivity, 13.7s TimeCoverageRelationStatistics Valid=336, Invalid=1234, Unknown=18, NotChecked=574, Total=2162 [2022-07-20 06:09:25,307 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 535 mSDsluCounter, 963 mSDsCounter, 0 mSdLazyCounter, 1089 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 535 SdHoareTripleChecker+Valid, 1068 SdHoareTripleChecker+Invalid, 3108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 1089 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1955 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-07-20 06:09:25,308 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [535 Valid, 1068 Invalid, 3108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 1089 Invalid, 0 Unknown, 1955 Unchecked, 3.0s Time] [2022-07-20 06:09:25,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 700 states. [2022-07-20 06:09:25,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 700 to 302. [2022-07-20 06:09:25,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 281 states have (on average 1.2775800711743772) internal successors, (359), 301 states have internal predecessors, (359), 0 states have call successors, (0), 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-20 06:09:25,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 359 transitions. [2022-07-20 06:09:25,314 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 359 transitions. Word has length 34 [2022-07-20 06:09:25,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:09:25,314 INFO L495 AbstractCegarLoop]: Abstraction has 302 states and 359 transitions. [2022-07-20 06:09:25,314 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-20 06:09:25,314 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 359 transitions. [2022-07-20 06:09:25,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-20 06:09:25,314 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:09:25,315 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-20 06:09:25,323 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (29)] Forceful destruction successful, exit code 0 [2022-07-20 06:09:25,515 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-20 06:09:25,515 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-20 06:09:25,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:09:25,516 INFO L85 PathProgramCache]: Analyzing trace with hash -1521281985, now seen corresponding path program 1 times [2022-07-20 06:09:25,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:09:25,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1701787568] [2022-07-20 06:09:25,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:09:25,516 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:09:25,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:09:25,517 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-20 06:09:25,518 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-20 06:09:25,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:09:25,737 INFO L263 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 28 conjunts are in the unsatisfiable core [2022-07-20 06:09:25,739 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:09:25,743 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-20 06:09:25,779 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-20 06:09:25,779 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-20 06:09:25,802 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-20 06:09:25,870 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:09:25,870 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 37 treesize of output 38 [2022-07-20 06:09:25,961 INFO L356 Elim1Store]: treesize reduction 48, result has 43.5 percent of original size [2022-07-20 06:09:25,962 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 34 treesize of output 57 [2022-07-20 06:09:26,038 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:09:26,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, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 33 [2022-07-20 06:09:26,268 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:09:26,268 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 60 treesize of output 52 [2022-07-20 06:09:26,355 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:09:26,355 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 60 treesize of output 52 [2022-07-20 06:09:26,391 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:09:26,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 2 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 52 [2022-07-20 06:09:26,692 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 48 treesize of output 24 [2022-07-20 06:09:26,732 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-20 06:09:26,733 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:09:26,801 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1004 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1004) |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-20 06:09:26,832 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1004 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1004) |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-20 06:09:26,969 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1004 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc7#1.base_21| (_ BitVec 32)) (v_ArrVal_999 (_ BitVec 1))) (or (= (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_21| v_ArrVal_999) (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_21|)) |v_ULTIMATE.start_main_#t~malloc7#1.base_21| v_ArrVal_1004) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv4 32)))) (_ bv1 1)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_21|) (_ bv0 1))))) is different from false [2022-07-20 06:09:26,981 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1004 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc7#1.base_21| (_ BitVec 32)) (v_ArrVal_999 (_ BitVec 1))) (or (= (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_21| v_ArrVal_999) (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_21|)) |v_ULTIMATE.start_main_#t~malloc7#1.base_21| v_ArrVal_1004) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv4 32)))) (_ bv1 1)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_21|) (_ bv0 1))))) is different from false [2022-07-20 06:09:27,002 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1004 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc7#1.base_21| (_ BitVec 32)) (v_ArrVal_998 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_999 (_ BitVec 1))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_21|) (_ bv0 1))) (= (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_21| v_ArrVal_999) (select (select (store (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_998))) (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_21|))) |v_ULTIMATE.start_main_#t~malloc7#1.base_21| v_ArrVal_1004) |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-20 06:09:27,017 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1004 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc7#1.base_21| (_ BitVec 32)) (v_ArrVal_998 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_999 (_ BitVec 1))) (or (= (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_21| v_ArrVal_999) (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_998))) (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_21|))) |v_ULTIMATE.start_main_#t~malloc7#1.base_21| v_ArrVal_1004) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1))) (_ bv1 1)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_21|) (_ bv0 1))))) is different from false [2022-07-20 06:09:27,038 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:09:27,038 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-20 06:09:27,047 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:09:27,049 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-20 06:09:27,053 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-20 06:09:29,281 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-20 06:09:29,281 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:09:29,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1701787568] [2022-07-20 06:09:29,282 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1701787568] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:09:29,282 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 06:09:29,282 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 26 [2022-07-20 06:09:29,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925433806] [2022-07-20 06:09:29,282 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 06:09:29,282 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-07-20 06:09:29,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:09:29,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-07-20 06:09:29,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=337, Unknown=8, NotChecked=258, Total=702 [2022-07-20 06:09:29,283 INFO L87 Difference]: Start difference. First operand 302 states and 359 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-20 06:09:29,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:09:29,966 INFO L93 Difference]: Finished difference Result 338 states and 402 transitions. [2022-07-20 06:09:29,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-20 06:09:29,967 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-20 06:09:29,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:09:29,967 INFO L225 Difference]: With dead ends: 338 [2022-07-20 06:09:29,968 INFO L226 Difference]: Without dead ends: 338 [2022-07-20 06:09:29,968 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 42 SyntacticMatches, 5 SemanticMatches, 28 ConstructedPredicates, 6 IntricatePredicates, 2 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=125, Invalid=443, Unknown=8, NotChecked=294, Total=870 [2022-07-20 06:09:29,968 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 52 mSDsluCounter, 978 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 1102 SdHoareTripleChecker+Invalid, 976 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 824 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-20 06:09:29,968 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 1102 Invalid, 976 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 151 Invalid, 0 Unknown, 824 Unchecked, 0.4s Time] [2022-07-20 06:09:29,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2022-07-20 06:09:29,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 301. [2022-07-20 06:09:29,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 280 states have (on average 1.275) internal successors, (357), 300 states have internal predecessors, (357), 0 states have call successors, (0), 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-20 06:09:29,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 357 transitions. [2022-07-20 06:09:29,971 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 357 transitions. Word has length 34 [2022-07-20 06:09:29,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:09:29,971 INFO L495 AbstractCegarLoop]: Abstraction has 301 states and 357 transitions. [2022-07-20 06:09:29,972 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-20 06:09:29,972 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 357 transitions. [2022-07-20 06:09:29,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-20 06:09:29,972 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:09:29,972 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-20 06:09:29,990 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (30)] Ended with exit code 0 [2022-07-20 06:09:30,189 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-20 06:09:30,190 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-20 06:09:30,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:09:30,190 INFO L85 PathProgramCache]: Analyzing trace with hash 956849775, now seen corresponding path program 1 times [2022-07-20 06:09:30,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:09:30,190 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [667624553] [2022-07-20 06:09:30,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:09:30,190 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:09:30,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:09:30,192 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-20 06:09:30,193 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-20 06:09:30,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:09:30,355 INFO L263 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 34 conjunts are in the unsatisfiable core [2022-07-20 06:09:30,357 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:09:30,362 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-20 06:09:30,379 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-20 06:09:30,393 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:09:30,393 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-20 06:09:30,432 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 06:09:30,432 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-20 06:09:30,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, 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-20 06:09:30,490 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:09:30,490 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-20 06:09:30,528 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-20 06:09:30,579 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-20 06:09:30,596 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-20 06:09:30,615 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 06:09:30,615 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-20 06:09:30,642 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-20 06:09:30,651 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-20 06:09:30,697 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-20 06:09:30,723 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-20 06:09:30,774 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-20 06:09:30,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-20 06:09:30,812 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:09:30,895 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1074 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv2 32) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_1074) |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-20 06:09:30,902 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1074 (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_1074) |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-20 06:09:30,914 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1074 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1073 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1073) |c_ULTIMATE.start_main_#t~malloc10#1.base| v_ArrVal_1074) |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-20 06:09:30,926 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc10#1.base_12| (_ BitVec 32))) (or (forall ((v_ArrVal_1074 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1073 (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_1073) |v_ULTIMATE.start_main_#t~malloc10#1.base_12| v_ArrVal_1074) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv8 32)))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc10#1.base_12|))))) is different from false [2022-07-20 06:09:30,937 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1074 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1073 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc10#1.base_12| (_ BitVec 32))) (or (not (= (_ bv2 32) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1073) |v_ULTIMATE.start_main_#t~malloc10#1.base_12| v_ArrVal_1074) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv8 32))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc10#1.base_12|))))) is different from false [2022-07-20 06:09:30,961 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1074 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1073 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc10#1.base_12| (_ BitVec 32))) (or (not (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1073) |v_ULTIMATE.start_main_#t~malloc10#1.base_12| v_ArrVal_1074) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv8 32))) (_ bv2 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc10#1.base_12|))))) is different from false [2022-07-20 06:09:30,982 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-20 06:09:30,983 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-20 06:09:30,992 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1074 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1073 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc10#1.base_12| (_ BitVec 32))) (or (= |v_ULTIMATE.start_main_#t~malloc10#1.base_12| |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_1073) |v_ULTIMATE.start_main_#t~malloc10#1.base_12| v_ArrVal_1074) |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-20 06:09:31,015 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1074 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1073 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc10#1.base_12| (_ BitVec 32)) (v_ArrVal_1065 (_ BitVec 32))) (or (= |v_ULTIMATE.start_main_#t~malloc10#1.base_12| |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_1065)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1073) |v_ULTIMATE.start_main_#t~malloc10#1.base_12| v_ArrVal_1074) |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-20 06:09:31,111 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1074 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1073 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc10#1.base_12| (_ BitVec 32)) (v_ArrVal_1065 (_ 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_12|) (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_1065)) |v_ULTIMATE.start_main_#t~malloc7#1.base_24| v_ArrVal_1073) |v_ULTIMATE.start_main_#t~malloc10#1.base_12| v_ArrVal_1074) |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-20 06:09:31,128 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1074 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1073 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc10#1.base_12| (_ BitVec 32)) (v_ArrVal_1064 (_ BitVec 32)) (v_ArrVal_1065 (_ 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_12|) (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_1064) |c_ULTIMATE.start_main_~head~0#1.offset| v_ArrVal_1065)) |v_ULTIMATE.start_main_#t~malloc7#1.base_24| v_ArrVal_1073) |v_ULTIMATE.start_main_#t~malloc10#1.base_12| v_ArrVal_1074) |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-20 06:09:31,173 INFO L356 Elim1Store]: treesize reduction 78, result has 27.1 percent of original size [2022-07-20 06:09:31,173 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-20 06:09:31,179 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:09:31,181 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-20 06:09:31,184 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-20 06:09:31,215 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-20 06:09:31,215 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:09:31,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [667624553] [2022-07-20 06:09:31,216 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [667624553] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:09:31,216 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 06:09:31,216 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18] total 31 [2022-07-20 06:09:31,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130427421] [2022-07-20 06:09:31,216 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 06:09:31,216 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-07-20 06:09:31,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:09:31,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-07-20 06:09:31,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=348, Unknown=13, NotChecked=470, Total=930 [2022-07-20 06:09:31,223 INFO L87 Difference]: Start difference. First operand 301 states and 357 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-20 06:09:33,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:09:33,555 INFO L93 Difference]: Finished difference Result 630 states and 733 transitions. [2022-07-20 06:09:33,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-07-20 06:09:33,555 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-20 06:09:33,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:09:33,557 INFO L225 Difference]: With dead ends: 630 [2022-07-20 06:09:33,557 INFO L226 Difference]: Without dead ends: 630 [2022-07-20 06:09:33,558 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 36 SyntacticMatches, 6 SemanticMatches, 53 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 440 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=416, Invalid=1591, Unknown=13, NotChecked=950, Total=2970 [2022-07-20 06:09:33,558 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 642 mSDsluCounter, 685 mSDsCounter, 0 mSdLazyCounter, 813 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 642 SdHoareTripleChecker+Valid, 752 SdHoareTripleChecker+Invalid, 3417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 813 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2486 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-07-20 06:09:33,558 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [642 Valid, 752 Invalid, 3417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 813 Invalid, 0 Unknown, 2486 Unchecked, 1.4s Time] [2022-07-20 06:09:33,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2022-07-20 06:09:33,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 316. [2022-07-20 06:09:33,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 295 states have (on average 1.2677966101694915) internal successors, (374), 315 states have internal predecessors, (374), 0 states have call successors, (0), 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-20 06:09:33,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 374 transitions. [2022-07-20 06:09:33,563 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 374 transitions. Word has length 34 [2022-07-20 06:09:33,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:09:33,563 INFO L495 AbstractCegarLoop]: Abstraction has 316 states and 374 transitions. [2022-07-20 06:09:33,563 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-20 06:09:33,563 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 374 transitions. [2022-07-20 06:09:33,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-20 06:09:33,564 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:09:33,565 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-20 06:09:33,573 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (31)] Ended with exit code 0 [2022-07-20 06:09:33,772 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-20 06:09:33,773 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2022-07-20 06:09:33,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:09:33,773 INFO L85 PathProgramCache]: Analyzing trace with hash 1654366839, now seen corresponding path program 1 times [2022-07-20 06:09:33,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:09:33,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1695702027] [2022-07-20 06:09:33,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:09:33,774 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:09:33,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:09:33,775 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-20 06:09:33,783 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-20 06:09:33,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:09:33,948 INFO L263 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 34 conjunts are in the unsatisfiable core [2022-07-20 06:09:33,950 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:09:33,953 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-20 06:09:33,973 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-20 06:09:33,992 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:09:33,993 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-20 06:09:34,033 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 06:09:34,033 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-20 06:09:34,062 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-20 06:09:34,073 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:09:34,073 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-20 06:09:34,109 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-20 06:09:34,153 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-20 06:09:34,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 16 treesize of output 18 [2022-07-20 06:09:34,190 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 06:09:34,190 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-20 06:09:34,214 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-20 06:09:34,222 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-20 06:09:34,266 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-20 06:09:34,292 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-20 06:09:34,341 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-20 06:09:34,375 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-20 06:09:34,375 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:09:34,454 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1144 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_1144) |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-20 06:09:34,461 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1144 (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_1144) |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-20 06:09:34,472 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1144 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1143 (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_1143) |c_ULTIMATE.start_main_#t~malloc10#1.base| v_ArrVal_1144) |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-20 06:09:34,555 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1144 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1143 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc10#1.base_15| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc10#1.base_15|))) (not (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1143) |v_ULTIMATE.start_main_#t~malloc10#1.base_15| v_ArrVal_1144) |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-20 06:09:34,577 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1144 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1143 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc10#1.base_15| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc10#1.base_15|))) (not (= (_ bv2 32) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1143) |v_ULTIMATE.start_main_#t~malloc10#1.base_15| v_ArrVal_1144) |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-20 06:09:34,600 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-20 06:09:34,600 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-20 06:09:34,608 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1144 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1143 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc10#1.base_15| (_ 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_1143) |v_ULTIMATE.start_main_#t~malloc10#1.base_15| v_ArrVal_1144) |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_15| |c_ULTIMATE.start_main_~x~0#1.base|))) is different from false [2022-07-20 06:09:34,627 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1136 (_ BitVec 32)) (v_ArrVal_1144 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1143 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc10#1.base_15| (_ BitVec 32))) (or (= |v_ULTIMATE.start_main_#t~malloc10#1.base_15| |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_1136)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1143) |v_ULTIMATE.start_main_#t~malloc10#1.base_15| v_ArrVal_1144) |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-20 06:09:34,724 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1136 (_ BitVec 32)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_27| (_ BitVec 32)) (v_ArrVal_1144 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1143 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc10#1.base_15| (_ BitVec 32))) (or (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_1136)) |v_ULTIMATE.start_main_#t~malloc7#1.base_27| v_ArrVal_1143) |v_ULTIMATE.start_main_#t~malloc10#1.base_15| v_ArrVal_1144) |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~malloc10#1.base_15|) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_27|) (_ bv0 1))))) is different from false [2022-07-20 06:09:34,748 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1136 (_ BitVec 32)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_27| (_ BitVec 32)) (v_ArrVal_1144 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1143 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc10#1.base_15| (_ BitVec 32)) (v_ArrVal_1134 (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| |v_ULTIMATE.start_main_#t~malloc10#1.base_15|) (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_1134) |c_ULTIMATE.start_main_~head~0#1.offset| v_ArrVal_1136)) |v_ULTIMATE.start_main_#t~malloc7#1.base_27| v_ArrVal_1143) |v_ULTIMATE.start_main_#t~malloc10#1.base_15| v_ArrVal_1144) |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_27|) (_ bv0 1))))) is different from false [2022-07-20 06:09:34,790 INFO L356 Elim1Store]: treesize reduction 78, result has 27.1 percent of original size [2022-07-20 06:09:34,790 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-20 06:09:34,794 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:09:34,796 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-20 06:09:34,799 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-20 06:09:34,833 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-20 06:09:34,834 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:09:34,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1695702027] [2022-07-20 06:09:34,834 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1695702027] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:09:34,834 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 06:09:34,834 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18] total 31 [2022-07-20 06:09:34,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926501714] [2022-07-20 06:09:34,834 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 06:09:34,834 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-07-20 06:09:34,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:09:34,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-07-20 06:09:34,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=384, Unknown=13, NotChecked=432, Total=930 [2022-07-20 06:09:34,835 INFO L87 Difference]: Start difference. First operand 316 states and 374 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-20 06:09:37,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:09:37,034 INFO L93 Difference]: Finished difference Result 450 states and 518 transitions. [2022-07-20 06:09:37,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-07-20 06:09:37,047 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-20 06:09:37,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:09:37,048 INFO L225 Difference]: With dead ends: 450 [2022-07-20 06:09:37,048 INFO L226 Difference]: Without dead ends: 450 [2022-07-20 06:09:37,049 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 37 SyntacticMatches, 5 SemanticMatches, 49 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 332 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=375, Invalid=1368, Unknown=15, NotChecked=792, Total=2550 [2022-07-20 06:09:37,049 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 431 mSDsluCounter, 790 mSDsCounter, 0 mSdLazyCounter, 946 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 431 SdHoareTripleChecker+Valid, 876 SdHoareTripleChecker+Invalid, 3092 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 946 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2071 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-07-20 06:09:37,050 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [431 Valid, 876 Invalid, 3092 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 946 Invalid, 0 Unknown, 2071 Unchecked, 1.4s Time] [2022-07-20 06:09:37,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2022-07-20 06:09:37,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 308. [2022-07-20 06:09:37,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 287 states have (on average 1.2682926829268293) internal successors, (364), 307 states have internal predecessors, (364), 0 states have call successors, (0), 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-20 06:09:37,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 364 transitions. [2022-07-20 06:09:37,053 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 364 transitions. Word has length 34 [2022-07-20 06:09:37,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:09:37,054 INFO L495 AbstractCegarLoop]: Abstraction has 308 states and 364 transitions. [2022-07-20 06:09:37,054 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-20 06:09:37,054 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 364 transitions. [2022-07-20 06:09:37,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-20 06:09:37,054 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:09:37,054 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-20 06:09:37,077 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (32)] Forceful destruction successful, exit code 0 [2022-07-20 06:09:37,262 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-20 06:09:37,263 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-20 06:09:37,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:09:37,263 INFO L85 PathProgramCache]: Analyzing trace with hash -199673176, now seen corresponding path program 1 times [2022-07-20 06:09:37,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:09:37,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1869465373] [2022-07-20 06:09:37,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:09:37,264 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:09:37,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:09:37,266 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-20 06:09:37,267 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-20 06:09:37,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:09:37,449 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 33 conjunts are in the unsatisfiable core [2022-07-20 06:09:37,451 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:09:37,454 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-20 06:09:37,474 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-20 06:09:37,498 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 06:09:37,498 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-20 06:09:37,521 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-20 06:09:37,526 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:09:37,526 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-20 06:09:37,558 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-20 06:09:37,581 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-20 06:09:37,643 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 06:09:37,643 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-20 06:09:37,670 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:09:37,671 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-20 06:09:37,681 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-20 06:09:37,728 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-20 06:09:37,778 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-20 06:09:37,797 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-20 06:09:37,806 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-20 06:09:37,854 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-20 06:09:37,888 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-20 06:09:37,888 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:09:37,946 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1213 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1213) |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-20 06:09:37,963 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1213 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1213) |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-20 06:09:37,969 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1213 (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_1213) |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-20 06:09:37,981 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1213 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1210 (_ 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_1210)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1213) |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-20 06:09:38,073 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_30| (_ BitVec 32)) (v_ArrVal_1213 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1210 (_ 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_1210)) |v_ULTIMATE.start_main_#t~malloc7#1.base_30| v_ArrVal_1213) |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-20 06:09:38,091 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_30| (_ BitVec 32)) (v_ArrVal_1213 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1206 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1210 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_30|))) (= (_ bv2 32) (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1206))) (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_1210))) |v_ULTIMATE.start_main_#t~malloc7#1.base_30| v_ArrVal_1213) |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-20 06:09:38,102 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_30| (_ BitVec 32)) (v_ArrVal_1213 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1206 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1210 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_30|))) (= (_ bv2 32) (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_1206))) (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_1210))) |v_ULTIMATE.start_main_#t~malloc7#1.base_30| v_ArrVal_1213) |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-20 06:09:38,124 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-20 06:09:38,125 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-20 06:09:38,133 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1204 (_ BitVec 32)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_30| (_ BitVec 32)) (v_ArrVal_1213 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1206 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1210 (_ 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_1204)) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1206))) (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_1210))) |v_ULTIMATE.start_main_#t~malloc7#1.base_30| v_ArrVal_1213) |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_30|))) is different from false [2022-07-20 06:09:38,147 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc3#1.base_20| (_ BitVec 32))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_20|) (_ bv0 1))) (forall ((v_ArrVal_1204 (_ BitVec 32)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_30| (_ BitVec 32)) (v_ArrVal_1213 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1206 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1210 (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| |v_ULTIMATE.start_main_#t~malloc7#1.base_30|) (= (_ 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_1204)) |v_ULTIMATE.start_main_#t~malloc3#1.base_20| v_ArrVal_1206))) (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_1210))) |v_ULTIMATE.start_main_#t~malloc7#1.base_30| v_ArrVal_1213) |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-20 06:09:38,171 INFO L356 Elim1Store]: treesize reduction 27, result has 43.8 percent of original size [2022-07-20 06:09:38,171 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-20 06:09:38,179 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:09:38,180 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-20 06:09:38,182 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-20 06:09:38,202 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-20 06:09:38,202 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:09:38,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1869465373] [2022-07-20 06:09:38,203 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1869465373] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:09:38,203 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 06:09:38,203 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17] total 29 [2022-07-20 06:09:38,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741596513] [2022-07-20 06:09:38,203 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 06:09:38,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-07-20 06:09:38,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:09:38,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-07-20 06:09:38,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=309, Unknown=12, NotChecked=396, Total=812 [2022-07-20 06:09:38,204 INFO L87 Difference]: Start difference. First operand 308 states and 364 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-20 06:09:43,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:09:43,860 INFO L93 Difference]: Finished difference Result 414 states and 477 transitions. [2022-07-20 06:09:43,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-07-20 06:09:43,861 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-20 06:09:43,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:09:43,863 INFO L225 Difference]: With dead ends: 414 [2022-07-20 06:09:43,863 INFO L226 Difference]: Without dead ends: 414 [2022-07-20 06:09:43,864 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 46 SyntacticMatches, 5 SemanticMatches, 44 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=288, Invalid=1065, Unknown=15, NotChecked=702, Total=2070 [2022-07-20 06:09:43,864 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 494 mSDsluCounter, 679 mSDsCounter, 0 mSdLazyCounter, 685 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 494 SdHoareTripleChecker+Valid, 766 SdHoareTripleChecker+Invalid, 2561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 685 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1809 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-20 06:09:43,864 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [494 Valid, 766 Invalid, 2561 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 685 Invalid, 0 Unknown, 1809 Unchecked, 0.9s Time] [2022-07-20 06:09:43,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2022-07-20 06:09:43,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 314. [2022-07-20 06:09:43,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 314 states, 293 states have (on average 1.266211604095563) internal successors, (371), 313 states have internal predecessors, (371), 0 states have call successors, (0), 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-20 06:09:43,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 371 transitions. [2022-07-20 06:09:43,870 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 371 transitions. Word has length 36 [2022-07-20 06:09:43,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:09:43,870 INFO L495 AbstractCegarLoop]: Abstraction has 314 states and 371 transitions. [2022-07-20 06:09:43,871 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-20 06:09:43,871 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 371 transitions. [2022-07-20 06:09:43,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-20 06:09:43,871 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:09:43,871 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-20 06:09:43,886 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (33)] Ended with exit code 0 [2022-07-20 06:09:44,083 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-20 06:09:44,083 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2022-07-20 06:09:44,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:09:44,084 INFO L85 PathProgramCache]: Analyzing trace with hash 1423076272, now seen corresponding path program 1 times [2022-07-20 06:09:44,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:09:44,085 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1208982181] [2022-07-20 06:09:44,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:09:44,085 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:09:44,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:09:44,086 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-20 06:09:44,087 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-20 06:09:44,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:09:44,271 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 33 conjunts are in the unsatisfiable core [2022-07-20 06:09:44,273 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:09:44,288 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-20 06:09:44,307 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-20 06:09:44,331 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 06:09:44,332 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-20 06:09:44,353 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:09:44,355 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-20 06:09:44,361 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-20 06:09:44,394 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-20 06:09:44,419 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-20 06:09:44,472 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 06:09:44,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-20 06:09:44,527 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:09:44,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 21 treesize of output 20 [2022-07-20 06:09:44,536 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-20 06:09:44,581 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-20 06:09:44,678 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-20 06:09:44,705 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-20 06:09:44,716 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-20 06:09:44,777 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-20 06:09:44,824 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-20 06:09:44,824 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:09:44,904 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1282 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv2 32) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1282) |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-20 06:09:44,927 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1282 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1282) |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-20 06:09:44,937 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1282 (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_1282) |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-20 06:09:44,954 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1278 (_ BitVec 32)) (v_ArrVal_1282 (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_1278)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1282) |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-20 06:09:44,976 WARN L833 $PredicateComparison]: unable to prove that (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_1278 (_ BitVec 32)) (v_ArrVal_1282 (Array (_ BitVec 32) (_ 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_1278)) |v_ULTIMATE.start_main_#t~malloc7#1.base_33| v_ArrVal_1282) |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-20 06:09:44,991 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1278 (_ BitVec 32)) (v_ArrVal_1282 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc7#1.base_33| (_ BitVec 32))) (or (= (_ 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_1278)) |v_ULTIMATE.start_main_#t~malloc7#1.base_33| v_ArrVal_1282) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv8 32)))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_33|))))) is different from false [2022-07-20 06:09:45,017 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1278 (_ BitVec 32)) (v_ArrVal_1282 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1275 (Array (_ BitVec 32) (_ BitVec 32))) (|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|))) (= (_ bv2 32) (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1275))) (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_1278))) |v_ULTIMATE.start_main_#t~malloc7#1.base_33| v_ArrVal_1282) |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-20 06:09:45,036 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1278 (_ BitVec 32)) (v_ArrVal_1282 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1275 (Array (_ BitVec 32) (_ BitVec 32))) (|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|))) (= (_ bv2 32) (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_1275))) (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_1278))) |v_ULTIMATE.start_main_#t~malloc7#1.base_33| v_ArrVal_1282) |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-20 06:09:45,090 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-20 06:09:45,090 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-20 06:09:45,101 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1278 (_ BitVec 32)) (v_ArrVal_1282 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1275 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1274 (_ BitVec 32)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_33| (_ 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_1274)) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1275))) (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_1278))) |v_ULTIMATE.start_main_#t~malloc7#1.base_33| v_ArrVal_1282) |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_33|))) is different from false [2022-07-20 06:09:45,209 INFO L356 Elim1Store]: treesize reduction 27, result has 43.8 percent of original size [2022-07-20 06:09:45,210 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-20 06:09:45,214 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:09:45,216 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-20 06:09:45,219 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-20 06:09:45,245 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-20 06:09:45,246 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:09:45,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1208982181] [2022-07-20 06:09:45,246 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1208982181] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:09:45,246 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 06:09:45,246 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17] total 29 [2022-07-20 06:09:45,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611347542] [2022-07-20 06:09:45,247 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 06:09:45,247 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-07-20 06:09:45,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:09:45,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-07-20 06:09:45,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=309, Unknown=10, NotChecked=396, Total=812 [2022-07-20 06:09:45,248 INFO L87 Difference]: Start difference. First operand 314 states and 371 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-20 06:09:47,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:09:47,192 INFO L93 Difference]: Finished difference Result 417 states and 478 transitions. [2022-07-20 06:09:47,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-07-20 06:09:47,193 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-20 06:09:47,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:09:47,194 INFO L225 Difference]: With dead ends: 417 [2022-07-20 06:09:47,194 INFO L226 Difference]: Without dead ends: 417 [2022-07-20 06:09:47,195 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 46 SyntacticMatches, 4 SemanticMatches, 44 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=297, Invalid=1060, Unknown=11, NotChecked=702, Total=2070 [2022-07-20 06:09:47,195 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 402 mSDsluCounter, 739 mSDsCounter, 0 mSdLazyCounter, 837 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 402 SdHoareTripleChecker+Valid, 830 SdHoareTripleChecker+Invalid, 2895 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 837 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1989 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-07-20 06:09:47,195 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [402 Valid, 830 Invalid, 2895 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 837 Invalid, 0 Unknown, 1989 Unchecked, 1.3s Time] [2022-07-20 06:09:47,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2022-07-20 06:09:47,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 308. [2022-07-20 06:09:47,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 287 states have (on average 1.264808362369338) internal successors, (363), 307 states have internal predecessors, (363), 0 states have call successors, (0), 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-20 06:09:47,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 363 transitions. [2022-07-20 06:09:47,227 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 363 transitions. Word has length 36 [2022-07-20 06:09:47,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:09:47,228 INFO L495 AbstractCegarLoop]: Abstraction has 308 states and 363 transitions. [2022-07-20 06:09:47,228 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-20 06:09:47,228 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 363 transitions. [2022-07-20 06:09:47,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-20 06:09:47,228 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:09:47,229 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-20 06:09:47,245 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-20 06:09:47,429 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-20 06:09:47,429 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr54REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2022-07-20 06:09:47,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:09:47,429 INFO L85 PathProgramCache]: Analyzing trace with hash -2087466742, now seen corresponding path program 1 times [2022-07-20 06:09:47,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:09:47,430 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [217259884] [2022-07-20 06:09:47,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:09:47,430 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:09:47,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:09:47,431 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-20 06:09:47,432 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-20 06:09:47,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:09:47,567 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 15 conjunts are in the unsatisfiable core [2022-07-20 06:09:47,568 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:09:47,712 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-20 06:09:47,715 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-20 06:09:47,759 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-20 06:09:47,759 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:09:47,866 INFO L356 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-07-20 06:09:47,866 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-20 06:09:47,876 INFO L356 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-07-20 06:09:47,877 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-20 06:09:47,932 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-20 06:09:47,932 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:09:47,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [217259884] [2022-07-20 06:09:47,932 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [217259884] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:09:47,932 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 06:09:47,932 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2022-07-20 06:09:47,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228625697] [2022-07-20 06:09:47,933 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 06:09:47,933 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-20 06:09:47,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:09:47,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-20 06:09:47,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-07-20 06:09:47,933 INFO L87 Difference]: Start difference. First operand 308 states and 363 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-20 06:09:48,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:09:48,995 INFO L93 Difference]: Finished difference Result 402 states and 471 transitions. [2022-07-20 06:09:48,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-20 06:09:48,995 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-20 06:09:48,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:09:48,997 INFO L225 Difference]: With dead ends: 402 [2022-07-20 06:09:48,997 INFO L226 Difference]: Without dead ends: 402 [2022-07-20 06:09:48,997 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2022-07-20 06:09:48,997 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 237 mSDsluCounter, 480 mSDsCounter, 0 mSdLazyCounter, 545 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 550 SdHoareTripleChecker+Invalid, 585 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 545 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-20 06:09:48,997 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 550 Invalid, 585 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 545 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-07-20 06:09:49,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2022-07-20 06:09:49,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 335. [2022-07-20 06:09:49,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 314 states have (on average 1.2643312101910829) internal successors, (397), 334 states have internal predecessors, (397), 0 states have call successors, (0), 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-20 06:09:49,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 397 transitions. [2022-07-20 06:09:49,021 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 397 transitions. Word has length 36 [2022-07-20 06:09:49,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:09:49,021 INFO L495 AbstractCegarLoop]: Abstraction has 335 states and 397 transitions. [2022-07-20 06:09:49,021 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-20 06:09:49,021 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 397 transitions. [2022-07-20 06:09:49,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-20 06:09:49,022 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:09:49,022 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-20 06:09:49,037 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (35)] Forceful destruction successful, exit code 0 [2022-07-20 06:09:49,229 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 06:09:49,229 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2022-07-20 06:09:49,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:09:49,230 INFO L85 PathProgramCache]: Analyzing trace with hash -799151648, now seen corresponding path program 1 times [2022-07-20 06:09:49,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:09:49,230 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [140051461] [2022-07-20 06:09:49,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:09:49,230 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:09:49,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:09:49,245 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 06:09:49,245 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (36)] Waiting until timeout for monitored process [2022-07-20 06:09:49,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:09:49,416 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 38 conjunts are in the unsatisfiable core [2022-07-20 06:09:49,418 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:09:49,423 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-20 06:09:49,447 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-20 06:09:49,453 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-20 06:09:49,510 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 06:09:49,511 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-20 06:09:49,545 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:09:49,546 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-20 06:09:49,558 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:09:49,559 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-20 06:09:49,703 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-20 06:09:49,703 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-20 06:09:49,711 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-20 06:09:49,724 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:09:49,724 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-20 06:09:49,776 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:09:49,776 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-20 06:09:49,787 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:09:49,788 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-20 06:09:49,812 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 06:09:49,812 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-20 06:09:49,846 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:09:49,866 INFO L356 Elim1Store]: treesize reduction 62, result has 21.5 percent of original size [2022-07-20 06:09:49,867 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-20 06:09:49,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, 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-20 06:09:50,023 INFO L356 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2022-07-20 06:09:50,023 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-20 06:09:50,032 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-20 06:09:50,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 20 treesize of output 12 [2022-07-20 06:09:50,202 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:09:50,202 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:09:50,205 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:09:50,206 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-20 06:09:50,214 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:09:50,216 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-20 06:09:50,268 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-20 06:09:50,268 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:09:50,426 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1374 (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_1374) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv4 32))))) (forall ((v_ArrVal_1375 (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_1375) |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-20 06:09:50,440 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1375 (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_1375) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv4 32))))) (forall ((v_ArrVal_1374 (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|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~x~0#1.offset|)) v_ArrVal_1374) |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-20 06:09:50,465 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1372 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1374 (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_1372) |c_ULTIMATE.start_main_#t~malloc10#1.base| v_ArrVal_1374) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv4 32))))) (forall ((v_ArrVal_1375 (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_1375) |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-20 06:09:50,638 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:09:50,638 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-20 06:09:50,681 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1369 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc10#1.base_20| (_ BitVec 32))) (or (and (forall ((v_ArrVal_1372 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1374 (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_1372) |v_ULTIMATE.start_main_#t~malloc10#1.base_20| v_ArrVal_1374) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv4 32))))) (forall ((v_ArrVal_1375 (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 v_ArrVal_1369 (bvadd (_ bv4 32) |ULTIMATE.start_main_~x~0#1.offset|) |v_ULTIMATE.start_main_#t~malloc10#1.base_20|)) |v_ULTIMATE.start_main_#t~malloc10#1.base_20| v_ArrVal_1375) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv4 32)))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc10#1.base_20|))))) is different from false [2022-07-20 06:09:50,693 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:09:50,693 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-20 06:09:50,759 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:09:50,759 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-20 06:09:50,770 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:09:50,770 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-20 06:09:50,789 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc10#1.base_20| (_ BitVec 32))) (or (and (forall ((v_ArrVal_1375 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_19 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_~x~0#1.offset| (_ BitVec 32))) (or (= |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_19) |v_ULTIMATE.start_main_#t~malloc10#1.base_20| v_ArrVal_1375) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv4 32)))) (not (= (select v_arrayElimArr_19 (bvadd (_ bv4 32) |ULTIMATE.start_main_~x~0#1.offset|)) |v_ULTIMATE.start_main_#t~malloc10#1.base_20|)))) (forall ((v_ArrVal_1372 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1374 (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_1372) |v_ULTIMATE.start_main_#t~malloc10#1.base_20| v_ArrVal_1374) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv4 32)))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc10#1.base_20|))))) is different from false [2022-07-20 06:09:50,938 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-20 06:09:50,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-20 06:09:50,965 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc10#1.base_20| (_ BitVec 32))) (or (= |v_ULTIMATE.start_main_#t~malloc10#1.base_20| |c_ULTIMATE.start_main_~x~0#1.base|) (and (forall ((v_ArrVal_1375 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_19 (Array (_ BitVec 32) (_ BitVec 32))) (v_subst_1 (_ BitVec 32))) (or (not (= (select v_arrayElimArr_19 (bvadd (_ bv4 32) v_subst_1)) |v_ULTIMATE.start_main_#t~malloc10#1.base_20|)) (= |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_19) |v_ULTIMATE.start_main_#t~malloc10#1.base_20| v_ArrVal_1375) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv4 32)))))) (forall ((v_ArrVal_1372 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1374 (Array (_ BitVec 32) (_ BitVec 32)))) (= |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_1372) |v_ULTIMATE.start_main_#t~malloc10#1.base_20| v_ArrVal_1374) |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-20 06:09:51,052 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc10#1.base_20| (_ BitVec 32)) (v_ArrVal_1364 (_ BitVec 32))) (or (= |v_ULTIMATE.start_main_#t~malloc10#1.base_20| |c_ULTIMATE.start_main_~x~0#1.base|) (and (forall ((v_ArrVal_1372 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1374 (Array (_ BitVec 32) (_ BitVec 32)))) (= |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_1364)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1372) |v_ULTIMATE.start_main_#t~malloc10#1.base_20| v_ArrVal_1374) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv4 32))))) (forall ((v_ArrVal_1375 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_19 (Array (_ BitVec 32) (_ BitVec 32))) (v_subst_1 (_ BitVec 32))) (or (= (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_19) |v_ULTIMATE.start_main_#t~malloc10#1.base_20| v_ArrVal_1375) |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.base|) (not (= (select v_arrayElimArr_19 (bvadd (_ bv4 32) v_subst_1)) |v_ULTIMATE.start_main_#t~malloc10#1.base_20|))))))) is different from false [2022-07-20 06:09:51,655 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_36| (_ BitVec 32)) (|v_ULTIMATE.start_main_#t~malloc10#1.base_20| (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| |v_ULTIMATE.start_main_#t~malloc10#1.base_20|) (and (forall ((v_ArrVal_1375 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_19 (Array (_ BitVec 32) (_ BitVec 32))) (v_subst_1 (_ BitVec 32))) (or (not (= (select v_arrayElimArr_19 (bvadd (_ bv4 32) v_subst_1)) |v_ULTIMATE.start_main_#t~malloc10#1.base_20|)) (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (store (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_36|)) |v_ULTIMATE.start_main_#t~malloc7#1.base_36| v_arrayElimArr_19) |v_ULTIMATE.start_main_#t~malloc10#1.base_20| v_ArrVal_1375) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv4 32)))))) (forall ((v_ArrVal_1372 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1374 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1364 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~head~0#1.offset| (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| v_ArrVal_1364)) |v_ULTIMATE.start_main_#t~malloc7#1.base_36| v_ArrVal_1372) |v_ULTIMATE.start_main_#t~malloc10#1.base_20| v_ArrVal_1374) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv4 32)))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_36|))))) is different from false [2022-07-20 06:09:51,690 INFO L356 Elim1Store]: treesize reduction 23, result has 45.2 percent of original size [2022-07-20 06:09:51,691 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 34 [2022-07-20 06:09:51,695 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:09:51,697 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-20 06:09:51,701 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-20 06:09:51,712 INFO L356 Elim1Store]: treesize reduction 41, result has 2.4 percent of original size [2022-07-20 06:09:51,715 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 28 treesize of output 1 [2022-07-20 06:09:51,773 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-20 06:09:51,773 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:09:51,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [140051461] [2022-07-20 06:09:51,775 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [140051461] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:09:51,775 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 06:09:51,775 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18] total 31 [2022-07-20 06:09:51,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884563978] [2022-07-20 06:09:51,783 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 06:09:51,784 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-07-20 06:09:51,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:09:51,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-07-20 06:09:51,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=425, Unknown=17, NotChecked=392, Total=930 [2022-07-20 06:09:51,785 INFO L87 Difference]: Start difference. First operand 335 states and 397 transitions. Second operand has 31 states, 31 states have (on average 2.225806451612903) internal successors, (69), 31 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-20 06:09:54,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:09:54,202 INFO L93 Difference]: Finished difference Result 432 states and 498 transitions. [2022-07-20 06:09:54,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-07-20 06:09:54,202 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 2.225806451612903) internal successors, (69), 31 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) Word has length 36 [2022-07-20 06:09:54,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:09:54,203 INFO L225 Difference]: With dead ends: 432 [2022-07-20 06:09:54,203 INFO L226 Difference]: Without dead ends: 432 [2022-07-20 06:09:54,204 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 42 SyntacticMatches, 7 SemanticMatches, 44 ConstructedPredicates, 8 IntricatePredicates, 1 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=278, Invalid=1143, Unknown=17, NotChecked=632, Total=2070 [2022-07-20 06:09:54,204 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 295 mSDsluCounter, 843 mSDsCounter, 0 mSdLazyCounter, 711 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 921 SdHoareTripleChecker+Invalid, 2351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 711 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1556 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:09:54,204 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [295 Valid, 921 Invalid, 2351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 711 Invalid, 0 Unknown, 1556 Unchecked, 1.1s Time] [2022-07-20 06:09:54,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2022-07-20 06:09:54,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 336. [2022-07-20 06:09:54,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 336 states, 315 states have (on average 1.2666666666666666) internal successors, (399), 335 states have internal predecessors, (399), 0 states have call successors, (0), 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-20 06:09:54,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 399 transitions. [2022-07-20 06:09:54,208 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 399 transitions. Word has length 36 [2022-07-20 06:09:54,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:09:54,209 INFO L495 AbstractCegarLoop]: Abstraction has 336 states and 399 transitions. [2022-07-20 06:09:54,209 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 2.225806451612903) internal successors, (69), 31 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-20 06:09:54,209 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 399 transitions. [2022-07-20 06:09:54,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-20 06:09:54,209 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:09:54,209 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-20 06:09:54,219 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (36)] Forceful destruction successful, exit code 0 [2022-07-20 06:09:54,417 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 06:09:54,418 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2022-07-20 06:09:54,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:09:54,418 INFO L85 PathProgramCache]: Analyzing trace with hash 782968427, now seen corresponding path program 1 times [2022-07-20 06:09:54,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:09:54,419 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [974658617] [2022-07-20 06:09:54,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:09:54,419 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:09:54,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:09:54,420 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 06:09:54,421 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (37)] Waiting until timeout for monitored process [2022-07-20 06:09:54,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:09:54,573 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 21 conjunts are in the unsatisfiable core [2022-07-20 06:09:54,574 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:09:54,589 INFO L356 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2022-07-20 06:09:54,589 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-20 06:09:54,731 INFO L356 Elim1Store]: treesize reduction 38, result has 39.7 percent of original size [2022-07-20 06:09:54,732 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-20 06:09:54,799 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-20 06:09:54,956 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:09:54,957 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 50 treesize of output 46 [2022-07-20 06:09:55,025 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:09:55,025 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 50 treesize of output 46 [2022-07-20 06:09:55,048 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:09:55,049 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 47 treesize of output 46 [2022-07-20 06:09:55,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 44 treesize of output 28 [2022-07-20 06:09:55,401 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:09:55,401 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:09:55,584 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1428 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1428) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (_ bv1 1))) is different from false [2022-07-20 06:09:55,657 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:09:55,658 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 20 treesize of output 21 [2022-07-20 06:09:55,667 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:09:55,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, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 37 [2022-07-20 06:09:55,671 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 9 [2022-07-20 06:10:05,727 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:10:05,727 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:10:05,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [974658617] [2022-07-20 06:10:05,728 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [974658617] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:10:05,728 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 06:10:05,728 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 22 [2022-07-20 06:10:05,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519706313] [2022-07-20 06:10:05,728 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 06:10:05,728 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-07-20 06:10:05,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:10:05,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-07-20 06:10:05,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=382, Unknown=5, NotChecked=40, Total=506 [2022-07-20 06:10:05,729 INFO L87 Difference]: Start difference. First operand 336 states and 399 transitions. Second operand has 23 states, 22 states have (on average 3.272727272727273) internal successors, (72), 23 states have internal predecessors, (72), 0 states have call successors, (0), 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-20 06:10:06,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:10:06,795 INFO L93 Difference]: Finished difference Result 368 states and 436 transitions. [2022-07-20 06:10:06,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-20 06:10:06,795 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 3.272727272727273) internal successors, (72), 23 states have internal predecessors, (72), 0 states have call successors, (0), 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-20 06:10:06,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:10:06,796 INFO L225 Difference]: With dead ends: 368 [2022-07-20 06:10:06,796 INFO L226 Difference]: Without dead ends: 368 [2022-07-20 06:10:06,797 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 52 SyntacticMatches, 3 SemanticMatches, 34 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 11.0s TimeCoverageRelationStatistics Valid=253, Invalid=936, Unknown=5, NotChecked=66, Total=1260 [2022-07-20 06:10:06,797 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 224 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 536 SdHoareTripleChecker+Invalid, 838 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 559 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-20 06:10:06,797 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 536 Invalid, 838 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 243 Invalid, 0 Unknown, 559 Unchecked, 0.5s Time] [2022-07-20 06:10:06,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2022-07-20 06:10:06,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 354. [2022-07-20 06:10:06,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 333 states have (on average 1.2612612612612613) internal successors, (420), 353 states have internal predecessors, (420), 0 states have call successors, (0), 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-20 06:10:06,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 420 transitions. [2022-07-20 06:10:06,801 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 420 transitions. Word has length 36 [2022-07-20 06:10:06,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:10:06,802 INFO L495 AbstractCegarLoop]: Abstraction has 354 states and 420 transitions. [2022-07-20 06:10:06,802 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 3.272727272727273) internal successors, (72), 23 states have internal predecessors, (72), 0 states have call successors, (0), 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-20 06:10:06,802 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 420 transitions. [2022-07-20 06:10:06,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-20 06:10:06,803 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:10:06,803 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-20 06:10:06,811 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (37)] Forceful destruction successful, exit code 0 [2022-07-20 06:10:07,011 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 06:10:07,011 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2022-07-20 06:10:07,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:10:07,011 INFO L85 PathProgramCache]: Analyzing trace with hash 782968428, now seen corresponding path program 1 times [2022-07-20 06:10:07,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:10:07,011 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1354662253] [2022-07-20 06:10:07,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:10:07,012 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:10:07,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:10:07,013 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 06:10:07,014 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (38)] Waiting until timeout for monitored process [2022-07-20 06:10:07,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:10:07,184 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 29 conjunts are in the unsatisfiable core [2022-07-20 06:10:07,186 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:10:07,189 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-20 06:10:07,226 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-20 06:10:07,249 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 06:10:07,249 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-20 06:10:07,285 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-20 06:10:07,297 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-20 06:10:07,429 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:10:07,429 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-20 06:10:07,443 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:10:07,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-20 06:10:07,488 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-20 06:10:07,489 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 14 treesize of output 20 [2022-07-20 06:10:07,494 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 5 treesize of output 3 [2022-07-20 06:10:07,507 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:10:07,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 31 treesize of output 29 [2022-07-20 06:10:07,541 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:10:07,541 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-20 06:10:07,545 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 18 treesize of output 20 [2022-07-20 06:10:07,675 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-20 06:10:07,679 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 15 treesize of output 7 [2022-07-20 06:10:07,723 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:10:07,723 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:10:08,107 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1485 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1486 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1486) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1485) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((v_ArrVal_1486 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1486) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule (bvadd .cse0 (_ bv8 32)) (bvadd .cse0 (_ bv12 32)))))) is different from false [2022-07-20 06:10:08,166 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1485 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1486 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1486) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1485) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((v_ArrVal_1486 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1486) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule (bvadd .cse0 (_ bv8 32)) (bvadd .cse0 (_ bv12 32)))))) is different from false [2022-07-20 06:10:08,193 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1486 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (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_1486) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_1485 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1486 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_1486) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1485) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))))) is different from false [2022-07-20 06:10:08,223 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:10:08,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 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 38 [2022-07-20 06:10:08,230 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:10:08,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 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2022-07-20 06:10:08,244 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:10:08,244 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 52 treesize of output 55 [2022-07-20 06:10:08,265 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:10:08,265 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 82 treesize of output 81 [2022-07-20 06:10:08,273 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 34 treesize of output 30 [2022-07-20 06:10:08,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 62 treesize of output 58 [2022-07-20 06:10:08,412 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:10:08,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 30 [2022-07-20 06:10:08,446 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:10:08,446 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 44 treesize of output 43 [2022-07-20 06:10:08,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 15 treesize of output 11 [2022-07-20 06:10:08,861 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:10:08,861 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:10:08,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1354662253] [2022-07-20 06:10:08,861 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1354662253] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:10:08,862 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 06:10:08,862 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2022-07-20 06:10:08,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239597158] [2022-07-20 06:10:08,862 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 06:10:08,862 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-07-20 06:10:08,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:10:08,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-07-20 06:10:08,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=260, Unknown=3, NotChecked=102, Total=420 [2022-07-20 06:10:08,863 INFO L87 Difference]: Start difference. First operand 354 states and 420 transitions. Second operand has 21 states, 20 states have (on average 3.25) internal successors, (65), 21 states have internal predecessors, (65), 0 states have call successors, (0), 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-20 06:10:12,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:10:12,390 INFO L93 Difference]: Finished difference Result 570 states and 670 transitions. [2022-07-20 06:10:12,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-20 06:10:12,390 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 3.25) internal successors, (65), 21 states have internal predecessors, (65), 0 states have call successors, (0), 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-20 06:10:12,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:10:12,392 INFO L225 Difference]: With dead ends: 570 [2022-07-20 06:10:12,392 INFO L226 Difference]: Without dead ends: 570 [2022-07-20 06:10:12,392 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 49 SyntacticMatches, 6 SemanticMatches, 32 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=182, Invalid=757, Unknown=3, NotChecked=180, Total=1122 [2022-07-20 06:10:12,392 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 493 mSDsluCounter, 684 mSDsCounter, 0 mSdLazyCounter, 975 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 493 SdHoareTripleChecker+Valid, 777 SdHoareTripleChecker+Invalid, 1742 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 975 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 701 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-07-20 06:10:12,392 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [493 Valid, 777 Invalid, 1742 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 975 Invalid, 0 Unknown, 701 Unchecked, 2.5s Time] [2022-07-20 06:10:12,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2022-07-20 06:10:12,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 429. [2022-07-20 06:10:12,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 429 states, 408 states have (on average 1.2549019607843137) internal successors, (512), 428 states have internal predecessors, (512), 0 states have call successors, (0), 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-20 06:10:12,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 512 transitions. [2022-07-20 06:10:12,399 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 512 transitions. Word has length 36 [2022-07-20 06:10:12,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:10:12,399 INFO L495 AbstractCegarLoop]: Abstraction has 429 states and 512 transitions. [2022-07-20 06:10:12,399 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 3.25) internal successors, (65), 21 states have internal predecessors, (65), 0 states have call successors, (0), 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-20 06:10:12,399 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 512 transitions. [2022-07-20 06:10:12,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-20 06:10:12,400 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:10:12,400 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-20 06:10:12,417 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (38)] Forceful destruction successful, exit code 0 [2022-07-20 06:10:12,607 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 06:10:12,608 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2022-07-20 06:10:12,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:10:12,608 INFO L85 PathProgramCache]: Analyzing trace with hash 1037341555, now seen corresponding path program 1 times [2022-07-20 06:10:12,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:10:12,609 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [401221853] [2022-07-20 06:10:12,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:10:12,609 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:10:12,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:10:12,610 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 06:10:12,611 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (39)] Waiting until timeout for monitored process [2022-07-20 06:10:12,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:10:12,805 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 21 conjunts are in the unsatisfiable core [2022-07-20 06:10:12,806 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:10:12,820 INFO L356 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2022-07-20 06:10:12,821 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-20 06:10:12,911 INFO L356 Elim1Store]: treesize reduction 38, result has 39.7 percent of original size [2022-07-20 06:10:12,912 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-20 06:10:12,998 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-20 06:10:13,155 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:10:13,156 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 50 treesize of output 46 [2022-07-20 06:10:13,223 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:10:13,223 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 50 treesize of output 46 [2022-07-20 06:10:13,256 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:10:13,256 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 47 treesize of output 46 [2022-07-20 06:10:13,516 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 44 treesize of output 28 [2022-07-20 06:10:13,613 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:10:13,613 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:10:13,722 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1539 (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_1539) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) is different from false [2022-07-20 06:10:13,740 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1539 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1539) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (_ bv1 1))) is different from false [2022-07-20 06:10:13,812 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:10:13,813 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 20 treesize of output 21 [2022-07-20 06:10:13,823 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:10:13,823 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 34 treesize of output 37 [2022-07-20 06:10:13,827 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 9 [2022-07-20 06:10:26,855 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:10:26,855 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:10:26,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [401221853] [2022-07-20 06:10:26,855 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [401221853] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:10:26,855 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 06:10:26,855 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 22 [2022-07-20 06:10:26,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407378615] [2022-07-20 06:10:26,855 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 06:10:26,856 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-07-20 06:10:26,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:10:26,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-07-20 06:10:26,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=346, Unknown=4, NotChecked=78, Total=506 [2022-07-20 06:10:26,856 INFO L87 Difference]: Start difference. First operand 429 states and 512 transitions. Second operand has 23 states, 22 states have (on average 3.272727272727273) internal successors, (72), 23 states have internal predecessors, (72), 0 states have call successors, (0), 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-20 06:10:28,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:10:28,153 INFO L93 Difference]: Finished difference Result 494 states and 579 transitions. [2022-07-20 06:10:28,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-20 06:10:28,153 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 3.272727272727273) internal successors, (72), 23 states have internal predecessors, (72), 0 states have call successors, (0), 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-20 06:10:28,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:10:28,154 INFO L225 Difference]: With dead ends: 494 [2022-07-20 06:10:28,154 INFO L226 Difference]: Without dead ends: 494 [2022-07-20 06:10:28,155 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 51 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 13.9s TimeCoverageRelationStatistics Valid=230, Invalid=830, Unknown=4, NotChecked=126, Total=1190 [2022-07-20 06:10:28,155 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 230 mSDsluCounter, 589 mSDsCounter, 0 mSdLazyCounter, 382 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 666 SdHoareTripleChecker+Invalid, 1197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 776 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-20 06:10:28,155 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 666 Invalid, 1197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 382 Invalid, 0 Unknown, 776 Unchecked, 0.8s Time] [2022-07-20 06:10:28,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2022-07-20 06:10:28,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 411. [2022-07-20 06:10:28,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 411 states, 390 states have (on average 1.258974358974359) internal successors, (491), 410 states have internal predecessors, (491), 0 states have call successors, (0), 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-20 06:10:28,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 491 transitions. [2022-07-20 06:10:28,159 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 491 transitions. Word has length 36 [2022-07-20 06:10:28,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:10:28,159 INFO L495 AbstractCegarLoop]: Abstraction has 411 states and 491 transitions. [2022-07-20 06:10:28,160 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 3.272727272727273) internal successors, (72), 23 states have internal predecessors, (72), 0 states have call successors, (0), 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-20 06:10:28,160 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 491 transitions. [2022-07-20 06:10:28,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-20 06:10:28,160 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:10:28,160 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, 1] [2022-07-20 06:10:28,181 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (39)] Forceful destruction successful, exit code 0 [2022-07-20 06:10:28,379 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 06:10:28,379 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2022-07-20 06:10:28,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:10:28,380 INFO L85 PathProgramCache]: Analyzing trace with hash -286960362, now seen corresponding path program 1 times [2022-07-20 06:10:28,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:10:28,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1611920704] [2022-07-20 06:10:28,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:10:28,380 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:10:28,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:10:28,381 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 06:10:28,383 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (40)] Waiting until timeout for monitored process [2022-07-20 06:10:28,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:10:28,519 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-20 06:10:28,521 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:10:28,651 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-20 06:10:28,651 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:10:28,726 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-20 06:10:28,726 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:10:28,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1611920704] [2022-07-20 06:10:28,726 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1611920704] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:10:28,726 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 06:10:28,726 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2022-07-20 06:10:28,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382214855] [2022-07-20 06:10:28,726 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 06:10:28,726 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-20 06:10:28,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:10:28,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-20 06:10:28,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-07-20 06:10:28,727 INFO L87 Difference]: Start difference. First operand 411 states and 491 transitions. Second operand has 8 states, 7 states have (on average 10.428571428571429) internal successors, (73), 8 states have internal predecessors, (73), 0 states have call successors, (0), 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-20 06:10:29,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:10:29,024 INFO L93 Difference]: Finished difference Result 423 states and 502 transitions. [2022-07-20 06:10:29,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-20 06:10:29,024 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 10.428571428571429) internal successors, (73), 8 states have internal predecessors, (73), 0 states have call successors, (0), 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 37 [2022-07-20 06:10:29,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:10:29,025 INFO L225 Difference]: With dead ends: 423 [2022-07-20 06:10:29,025 INFO L226 Difference]: Without dead ends: 395 [2022-07-20 06:10:29,026 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 66 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 2 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-07-20 06:10:29,026 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 7 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 46 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-20 06:10:29,026 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 228 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 120 Invalid, 0 Unknown, 46 Unchecked, 0.3s Time] [2022-07-20 06:10:29,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2022-07-20 06:10:29,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 395. [2022-07-20 06:10:29,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 395 states, 374 states have (on average 1.267379679144385) internal successors, (474), 394 states have internal predecessors, (474), 0 states have call successors, (0), 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-20 06:10:29,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 474 transitions. [2022-07-20 06:10:29,030 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 474 transitions. Word has length 37 [2022-07-20 06:10:29,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:10:29,030 INFO L495 AbstractCegarLoop]: Abstraction has 395 states and 474 transitions. [2022-07-20 06:10:29,030 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 10.428571428571429) internal successors, (73), 8 states have internal predecessors, (73), 0 states have call successors, (0), 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-20 06:10:29,030 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 474 transitions. [2022-07-20 06:10:29,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-20 06:10:29,031 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:10:29,031 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, 1, 1] [2022-07-20 06:10:29,059 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (40)] Forceful destruction successful, exit code 0 [2022-07-20 06:10:29,238 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 06:10:29,238 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2022-07-20 06:10:29,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:10:29,239 INFO L85 PathProgramCache]: Analyzing trace with hash 859975415, now seen corresponding path program 1 times [2022-07-20 06:10:29,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:10:29,239 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1942132411] [2022-07-20 06:10:29,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:10:29,239 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:10:29,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:10:29,247 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 06:10:29,249 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (41)] Waiting until timeout for monitored process [2022-07-20 06:10:29,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:10:29,460 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 37 conjunts are in the unsatisfiable core [2022-07-20 06:10:29,462 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:10:29,478 INFO L356 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2022-07-20 06:10:29,479 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-20 06:10:29,536 INFO L356 Elim1Store]: treesize reduction 38, result has 39.7 percent of original size [2022-07-20 06:10:29,536 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-20 06:10:29,592 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-20 06:10:29,700 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:10:29,700 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-20 06:10:29,846 INFO L356 Elim1Store]: treesize reduction 85, result has 36.6 percent of original size [2022-07-20 06:10:29,846 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 52 treesize of output 85 [2022-07-20 06:10:29,980 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:10:29,981 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 67 treesize of output 48 [2022-07-20 06:10:30,326 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:10:30,326 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 85 treesize of output 73 [2022-07-20 06:10:30,412 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:10:30,412 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 85 treesize of output 73 [2022-07-20 06:10:30,490 INFO L356 Elim1Store]: treesize reduction 74, result has 44.8 percent of original size [2022-07-20 06:10:30,490 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 59 treesize of output 103 [2022-07-20 06:10:30,712 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:10:30,736 INFO L356 Elim1Store]: treesize reduction 62, result has 21.5 percent of original size [2022-07-20 06:10:30,736 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 108 treesize of output 74 [2022-07-20 06:10:31,246 INFO L356 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2022-07-20 06:10:31,246 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 155 treesize of output 130 [2022-07-20 06:10:31,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 77 treesize of output 57 [2022-07-20 06:10:33,063 INFO L356 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2022-07-20 06:10:33,064 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 4 new quantified variables, introduced 2 case distinctions, treesize of input 173 treesize of output 88 [2022-07-20 06:10:33,547 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-20 06:10:33,548 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:10:33,743 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1638 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_1638) |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-20 06:10:33,754 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1638 (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|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~x~0#1.offset|)) v_ArrVal_1638) |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-20 06:10:33,923 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1638 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc10#1.base_27| (_ BitVec 32)) (|ULTIMATE.start_main_~x~0#1.offset| (_ BitVec 32))) (or (= (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc10#1.base_27| (_ bv1 1)) (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|) |v_ULTIMATE.start_main_#t~malloc10#1.base_27|)) |v_ULTIMATE.start_main_#t~malloc10#1.base_27| v_ArrVal_1638) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv4 32)))) (_ bv1 1)) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc10#1.base_27|))))) is different from false [2022-07-20 06:10:33,933 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:10:33,933 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 25 treesize of output 29 [2022-07-20 06:10:33,945 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1638 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_~x~0#1.offset| (_ BitVec 32)) (v_arrayElimArr_27 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select v_arrayElimArr_27 (bvadd (_ bv4 32) |ULTIMATE.start_main_~x~0#1.offset|)))) (or (not (= (_ bv0 1) (select |c_#valid| .cse0))) (= (select (store |c_#valid| .cse0 (_ bv1 1)) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_27) .cse0 v_ArrVal_1638) |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-20 06:10:33,977 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1638 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_~x~0#1.offset| (_ BitVec 32)) (v_arrayElimArr_27 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select v_arrayElimArr_27 (bvadd (_ bv4 32) |ULTIMATE.start_main_~x~0#1.offset|)))) (or (not (= (_ bv0 1) (select |c_#valid| .cse0))) (= (select (store |c_#valid| .cse0 (_ bv1 1)) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_arrayElimArr_27) .cse0 v_ArrVal_1638) |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-20 06:10:33,992 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1638 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~x~0#1.offset_124| (_ BitVec 32)) (v_arrayElimArr_27 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select v_arrayElimArr_27 (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~x~0#1.offset_124|)))) (or (not (= (_ bv0 1) (select |c_#valid| .cse0))) (= (select (store |c_#valid| .cse0 (_ bv1 1)) (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_27) .cse0 v_ArrVal_1638) |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-20 06:10:34,143 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_49| (_ BitVec 32)) (v_ArrVal_1638 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~x~0#1.offset_124| (_ BitVec 32)) (v_arrayElimArr_27 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1630 (_ BitVec 1))) (let ((.cse0 (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_49| v_ArrVal_1630)) (.cse1 (select v_arrayElimArr_27 (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~x~0#1.offset_124|)))) (or (not (= (_ bv0 1) (select .cse0 .cse1))) (not (= (_ bv1 1) (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|))) (= (select (store .cse0 .cse1 (_ bv1 1)) (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_49|)) |v_ULTIMATE.start_main_#t~malloc7#1.base_49| v_arrayElimArr_27) .cse1 v_ArrVal_1638) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv4 32)))) (_ bv1 1)) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_49|)))))) is different from false [2022-07-20 06:10:34,168 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_49| (_ BitVec 32)) (v_ArrVal_1638 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~x~0#1.offset_124| (_ BitVec 32)) (v_arrayElimArr_27 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1630 (_ BitVec 1))) (let ((.cse1 (select v_arrayElimArr_27 (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~x~0#1.offset_124|))) (.cse0 (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_49| v_ArrVal_1630))) (or (= (select (store .cse0 .cse1 (_ bv1 1)) (select (select (store (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_49|)) |v_ULTIMATE.start_main_#t~malloc7#1.base_49| v_arrayElimArr_27) .cse1 v_ArrVal_1638) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv4 32)))) (_ bv1 1)) (not (= (_ bv0 1) (select .cse0 .cse1))) (not (= (select .cse0 |c_ULTIMATE.start_main_~head~0#1.base|) (_ bv1 1))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_49|)))))) is different from false [2022-07-20 06:10:34,212 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1629 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc7#1.base_49| (_ BitVec 32)) (v_ArrVal_1638 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~x~0#1.offset_124| (_ BitVec 32)) (v_arrayElimArr_27 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1630 (_ BitVec 1))) (let ((.cse1 (select v_arrayElimArr_27 (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~x~0#1.offset_124|))) (.cse0 (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_49| v_ArrVal_1630))) (or (not (= (_ bv0 1) (select .cse0 .cse1))) (= (select (store .cse0 .cse1 (_ bv1 1)) (select (select (store (store (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1629))) (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_49|))) |v_ULTIMATE.start_main_#t~malloc7#1.base_49| v_arrayElimArr_27) .cse1 v_ArrVal_1638) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv4 32)))) (_ bv1 1)) (not (= (select .cse0 |c_ULTIMATE.start_main_~head~0#1.base|) (_ bv1 1))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_49|)))))) is different from false [2022-07-20 06:10:34,240 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1629 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc7#1.base_49| (_ BitVec 32)) (v_ArrVal_1638 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~x~0#1.offset_124| (_ BitVec 32)) (v_arrayElimArr_27 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1630 (_ BitVec 1))) (let ((.cse0 (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_49| v_ArrVal_1630)) (.cse1 (select v_arrayElimArr_27 (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~x~0#1.offset_124|)))) (or (not (= (_ bv0 1) (select .cse0 .cse1))) (not (= (select .cse0 |c_ULTIMATE.start_main_~head~0#1.base|) (_ bv1 1))) (= (select (store .cse0 .cse1 (_ bv1 1)) (let ((.cse3 (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv4 32)))) (select (select (store (store (let ((.cse2 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) v_ArrVal_1629))) (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_49|))) |v_ULTIMATE.start_main_#t~malloc7#1.base_49| v_arrayElimArr_27) .cse1 v_ArrVal_1638) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (_ bv1 1)) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_49|)))))) is different from false [2022-07-20 06:10:34,275 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:10:34,275 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 65 treesize of output 56 [2022-07-20 06:10:34,279 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:10:34,279 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:10:34,282 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 60 treesize of output 48 [2022-07-20 06:10:34,286 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 57 treesize of output 45 [2022-07-20 06:10:34,290 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 19 treesize of output 15 [2022-07-20 06:10:40,581 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-20 06:10:40,582 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:10:40,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1942132411] [2022-07-20 06:10:40,582 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1942132411] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:10:40,582 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 06:10:40,582 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18] total 34 [2022-07-20 06:10:40,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599168211] [2022-07-20 06:10:40,582 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 06:10:40,582 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-07-20 06:10:40,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:10:40,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-07-20 06:10:40,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=521, Unknown=15, NotChecked=550, Total=1190 [2022-07-20 06:10:40,583 INFO L87 Difference]: Start difference. First operand 395 states and 474 transitions. Second operand has 35 states, 34 states have (on average 2.235294117647059) internal successors, (76), 35 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-20 06:10:44,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:10:44,233 INFO L93 Difference]: Finished difference Result 460 states and 550 transitions. [2022-07-20 06:10:44,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-07-20 06:10:44,234 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 2.235294117647059) internal successors, (76), 35 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 38 [2022-07-20 06:10:44,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:10:44,235 INFO L225 Difference]: With dead ends: 460 [2022-07-20 06:10:44,235 INFO L226 Difference]: Without dead ends: 460 [2022-07-20 06:10:44,235 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 40 SyntacticMatches, 11 SemanticMatches, 56 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 381 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=359, Invalid=1919, Unknown=18, NotChecked=1010, Total=3306 [2022-07-20 06:10:44,236 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 269 mSDsluCounter, 876 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 949 SdHoareTripleChecker+Invalid, 2861 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2446 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-20 06:10:44,251 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [269 Valid, 949 Invalid, 2861 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 379 Invalid, 0 Unknown, 2446 Unchecked, 0.8s Time] [2022-07-20 06:10:44,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2022-07-20 06:10:44,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 414. [2022-07-20 06:10:44,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 414 states, 393 states have (on average 1.2646310432569974) internal successors, (497), 413 states have internal predecessors, (497), 0 states have call successors, (0), 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-20 06:10:44,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 497 transitions. [2022-07-20 06:10:44,255 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 497 transitions. Word has length 38 [2022-07-20 06:10:44,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:10:44,256 INFO L495 AbstractCegarLoop]: Abstraction has 414 states and 497 transitions. [2022-07-20 06:10:44,256 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 2.235294117647059) internal successors, (76), 35 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-20 06:10:44,256 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 497 transitions. [2022-07-20 06:10:44,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-20 06:10:44,256 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:10:44,256 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, 1, 1] [2022-07-20 06:10:44,266 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (41)] Forceful destruction successful, exit code 0 [2022-07-20 06:10:44,464 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 06:10:44,465 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2022-07-20 06:10:44,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:10:44,465 INFO L85 PathProgramCache]: Analyzing trace with hash 859975416, now seen corresponding path program 1 times [2022-07-20 06:10:44,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:10:44,466 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [928136043] [2022-07-20 06:10:44,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:10:44,466 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:10:44,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:10:44,467 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 06:10:44,468 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (42)] Waiting until timeout for monitored process [2022-07-20 06:10:44,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:10:44,692 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 50 conjunts are in the unsatisfiable core [2022-07-20 06:10:44,695 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:10:44,699 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-20 06:10:44,729 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-20 06:10:44,729 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-20 06:10:44,738 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-20 06:10:44,759 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-20 06:10:44,769 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-20 06:10:44,851 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:10:44,851 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-20 06:10:44,855 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-20 06:10:44,945 INFO L356 Elim1Store]: treesize reduction 8, result has 65.2 percent of original size [2022-07-20 06:10:44,946 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-20 06:10:44,973 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-20 06:10:45,009 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:10:45,010 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-20 06:10:45,020 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:10:45,021 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-20 06:10:45,211 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:10:45,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, 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-20 06:10:45,229 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:10:45,230 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-20 06:10:45,277 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-20 06:10:45,277 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-20 06:10:45,283 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-20 06:10:45,297 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:10:45,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 57 treesize of output 49 [2022-07-20 06:10:45,350 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 06:10:45,350 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-20 06:10:45,374 INFO L356 Elim1Store]: treesize reduction 33, result has 25.0 percent of original size [2022-07-20 06:10:45,375 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 1 case distinctions, treesize of input 18 treesize of output 20 [2022-07-20 06:10:45,422 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:10:45,445 INFO L356 Elim1Store]: treesize reduction 62, result has 21.5 percent of original size [2022-07-20 06:10:45,446 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 64 treesize of output 46 [2022-07-20 06:10:45,477 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:10:45,478 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-20 06:10:45,671 INFO L356 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2022-07-20 06:10:45,672 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 105 treesize of output 92 [2022-07-20 06:10:45,679 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-20 06:10:45,689 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 17 [2022-07-20 06:10:46,113 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-20 06:10:46,120 INFO L356 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2022-07-20 06:10:46,121 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 85 treesize of output 40 [2022-07-20 06:10:46,238 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-20 06:10:46,238 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:10:46,563 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1723 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_1723) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv4 32))))) (bvule .cse0 (bvadd .cse0 (_ bv4 32))))) (forall ((v_ArrVal_1724 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1723 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv4 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_1723) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) (_ bv4 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_1724) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1)))))) is different from false [2022-07-20 06:10:46,591 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1723 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (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_1723) |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_1724 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1723 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (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|))) (.cse2 (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv4 32)))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_1723) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1724) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)))))) is different from false [2022-07-20 06:10:46,762 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1720 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1723 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1720) |c_ULTIMATE.start_main_#t~malloc10#1.base| v_ArrVal_1723) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv4 32))))) (bvule .cse0 (bvadd .cse0 (_ bv4 32))))) (forall ((v_ArrVal_1720 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_~x~0#1.offset| (_ BitVec 32)) (v_ArrVal_1724 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1723 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv4 32)))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1720) |c_ULTIMATE.start_main_#t~malloc10#1.base| v_ArrVal_1723) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) (_ bv4 32)) (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|) (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_1724) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1)))))) is different from false [2022-07-20 06:10:47,061 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:10:47,062 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 39 treesize of output 43 [2022-07-20 06:10:47,121 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1718 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc10#1.base_30| (_ BitVec 32))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc10#1.base_30|) (_ bv0 1))) (and (forall ((v_ArrVal_1720 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1723 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1720) |v_ULTIMATE.start_main_#t~malloc10#1.base_30| v_ArrVal_1723) |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_1720 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_~x~0#1.offset| (_ BitVec 32)) (v_ArrVal_1724 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1723 (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 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1720) |v_ULTIMATE.start_main_#t~malloc10#1.base_30| v_ArrVal_1723) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc10#1.base_30| (_ bv12 32)) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store v_ArrVal_1718 (bvadd (_ bv4 32) |ULTIMATE.start_main_~x~0#1.offset|) |v_ULTIMATE.start_main_#t~malloc10#1.base_30|)) |v_ULTIMATE.start_main_#t~malloc10#1.base_30| v_ArrVal_1724) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1)))))))) is different from false [2022-07-20 06:10:47,136 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:10:47,137 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 39 treesize of output 43 [2022-07-20 06:10:47,204 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:10:47,205 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 39 treesize of output 43 [2022-07-20 06:10:47,230 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:10:47,230 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 39 treesize of output 43 [2022-07-20 06:10:49,946 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc10#1.base_30| (_ BitVec 32))) (or (and (forall ((v_ArrVal_1720 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_~x~0#1.offset| (_ BitVec 32)) (v_arrayElimArr_32 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1724 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1723 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= |v_ULTIMATE.start_main_#t~malloc10#1.base_30| (select v_arrayElimArr_32 (bvadd (_ bv4 32) |ULTIMATE.start_main_~x~0#1.offset|)))) (let ((.cse0 (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_#t~mem8#1.base| v_ArrVal_1720) |v_ULTIMATE.start_main_#t~malloc10#1.base_30| v_ArrVal_1723) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc10#1.base_30| (_ bv12 32)) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_arrayElimArr_32) |v_ULTIMATE.start_main_#t~malloc10#1.base_30| v_ArrVal_1724) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0)))))) (forall ((v_ArrVal_1720 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1723 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1720) |v_ULTIMATE.start_main_#t~malloc10#1.base_30| v_ArrVal_1723) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv4 32))))) (bvule .cse1 (bvadd (_ bv4 32) .cse1))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc10#1.base_30|) (_ bv0 1))))) is different from false [2022-07-20 06:10:51,285 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-20 06:10:51,286 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-20 06:10:51,518 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc10#1.base_30| (_ BitVec 32))) (or (= |v_ULTIMATE.start_main_#t~malloc10#1.base_30| |c_ULTIMATE.start_main_~x~0#1.base|) (and (forall ((v_subst_2 (_ BitVec 32)) (v_ArrVal_1713 (_ BitVec 32)) (v_ArrVal_1720 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_32 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1724 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1723 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_32 (bvadd (_ bv4 32) v_subst_2)) |v_ULTIMATE.start_main_#t~malloc10#1.base_30|)) (let ((.cse0 (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv4 32)))) (bvule (bvadd (_ bv4 32) (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_1713)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1720) |v_ULTIMATE.start_main_#t~malloc10#1.base_30| v_ArrVal_1723) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc10#1.base_30| (_ bv12 32)) (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_32) |v_ULTIMATE.start_main_#t~malloc10#1.base_30| v_ArrVal_1724) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0)))))) (forall ((v_ArrVal_1713 (_ BitVec 32)) (v_ArrVal_1720 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1723 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (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_1713)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1720) |v_ULTIMATE.start_main_#t~malloc10#1.base_30| v_ArrVal_1723) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv4 32))))) (bvule .cse1 (bvadd (_ bv4 32) .cse1))))))) is different from false [2022-07-20 06:10:52,264 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1710 (_ BitVec 32)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_52| (_ BitVec 32)) (|v_ULTIMATE.start_main_#t~malloc10#1.base_30| (_ BitVec 32))) (or (= |v_ULTIMATE.start_main_#t~malloc10#1.base_30| |c_ULTIMATE.start_main_~x~0#1.base|) (and (forall ((v_ArrVal_1713 (_ BitVec 32)) (v_ArrVal_1720 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1723 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (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_1713)) |v_ULTIMATE.start_main_#t~malloc7#1.base_52| v_ArrVal_1720) |v_ULTIMATE.start_main_#t~malloc10#1.base_30| v_ArrVal_1723) |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_subst_2 (_ BitVec 32)) (v_ArrVal_1713 (_ BitVec 32)) (v_ArrVal_1720 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_32 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1724 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1723 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_32 (bvadd (_ bv4 32) v_subst_2)) |v_ULTIMATE.start_main_#t~malloc10#1.base_30|)) (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv4 32)))) (bvule (bvadd (_ bv4 32) (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_1713)) |v_ULTIMATE.start_main_#t~malloc7#1.base_52| v_ArrVal_1720) |v_ULTIMATE.start_main_#t~malloc10#1.base_30| v_ArrVal_1723) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1)) (select (store (store |c_#length| |v_ULTIMATE.start_main_#t~malloc7#1.base_52| v_ArrVal_1710) |v_ULTIMATE.start_main_#t~malloc10#1.base_30| (_ bv12 32)) (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_52|)) |v_ULTIMATE.start_main_#t~malloc7#1.base_52| v_arrayElimArr_32) |v_ULTIMATE.start_main_#t~malloc10#1.base_30| v_ArrVal_1724) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1))))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_52|))))) is different from false [2022-07-20 06:10:52,827 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_52| (_ BitVec 32)) (|v_ULTIMATE.start_main_#t~malloc10#1.base_30| (_ BitVec 32))) (or (and (forall ((v_ArrVal_1713 (_ BitVec 32)) (v_ArrVal_1720 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1723 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| v_ArrVal_1713)) |v_ULTIMATE.start_main_#t~malloc7#1.base_52| v_ArrVal_1720) |v_ULTIMATE.start_main_#t~malloc10#1.base_30| v_ArrVal_1723) |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_1710 (_ BitVec 32)) (v_subst_2 (_ BitVec 32)) (v_ArrVal_1713 (_ BitVec 32)) (v_ArrVal_1720 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_32 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1724 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1723 (Array (_ BitVec 32) (_ BitVec 32)))) (or (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv4 32)))) (bvule (bvadd (_ bv4 32) (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| v_ArrVal_1713)) |v_ULTIMATE.start_main_#t~malloc7#1.base_52| v_ArrVal_1720) |v_ULTIMATE.start_main_#t~malloc10#1.base_30| v_ArrVal_1723) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1)) (select (store (store |c_#length| |v_ULTIMATE.start_main_#t~malloc7#1.base_52| v_ArrVal_1710) |v_ULTIMATE.start_main_#t~malloc10#1.base_30| (_ bv12 32)) (select (select (store (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_52|)) |v_ULTIMATE.start_main_#t~malloc7#1.base_52| v_arrayElimArr_32) |v_ULTIMATE.start_main_#t~malloc10#1.base_30| v_ArrVal_1724) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1)))) (not (= (select v_arrayElimArr_32 (bvadd (_ bv4 32) v_subst_2)) |v_ULTIMATE.start_main_#t~malloc10#1.base_30|))))) (= |c_ULTIMATE.start_main_~head~0#1.base| |v_ULTIMATE.start_main_#t~malloc10#1.base_30|) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_52|))))) is different from false [2022-07-20 06:10:54,070 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1708 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1709 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc7#1.base_52| (_ BitVec 32)) (|v_ULTIMATE.start_main_#t~malloc10#1.base_30| (_ BitVec 32))) (or (and (forall ((v_ArrVal_1713 (_ BitVec 32)) (v_ArrVal_1720 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1723 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store (let ((.cse1 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1709))) (store .cse1 |c_ULTIMATE.start_main_~head~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| v_ArrVal_1713))) |v_ULTIMATE.start_main_#t~malloc7#1.base_52| v_ArrVal_1720) |v_ULTIMATE.start_main_#t~malloc10#1.base_30| v_ArrVal_1723) |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_1710 (_ BitVec 32)) (v_subst_2 (_ BitVec 32)) (v_ArrVal_1713 (_ BitVec 32)) (v_ArrVal_1720 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_32 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1724 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1723 (Array (_ BitVec 32) (_ BitVec 32)))) (or (let ((.cse3 (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv4 32)))) (bvule (bvadd (_ bv4 32) (select (select (store (store (let ((.cse2 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1709))) (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_ArrVal_1713))) |v_ULTIMATE.start_main_#t~malloc7#1.base_52| v_ArrVal_1720) |v_ULTIMATE.start_main_#t~malloc10#1.base_30| v_ArrVal_1723) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (select (store (store |c_#length| |v_ULTIMATE.start_main_#t~malloc7#1.base_52| v_ArrVal_1710) |v_ULTIMATE.start_main_#t~malloc10#1.base_30| (_ bv12 32)) (select (select (store (store (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1708))) (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_ULTIMATE.start_main_#t~malloc7#1.base_52|))) |v_ULTIMATE.start_main_#t~malloc7#1.base_52| v_arrayElimArr_32) |v_ULTIMATE.start_main_#t~malloc10#1.base_30| v_ArrVal_1724) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)))) (not (= (select v_arrayElimArr_32 (bvadd (_ bv4 32) v_subst_2)) |v_ULTIMATE.start_main_#t~malloc10#1.base_30|))))) (= |c_ULTIMATE.start_main_~head~0#1.base| |v_ULTIMATE.start_main_#t~malloc10#1.base_30|) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_52|))))) is different from false [2022-07-20 06:10:54,716 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_52| (_ BitVec 32)) (|v_ULTIMATE.start_main_#t~malloc10#1.base_30| (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| |v_ULTIMATE.start_main_#t~malloc10#1.base_30|) (and (forall ((v_ArrVal_1710 (_ BitVec 32)) (v_subst_2 (_ BitVec 32)) (v_ArrVal_1708 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1709 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1713 (_ BitVec 32)) (v_ArrVal_1720 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_32 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1724 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1723 (Array (_ BitVec 32) (_ BitVec 32)))) (or (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 (store (let ((.cse0 (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_1709))) (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_1713))) |v_ULTIMATE.start_main_#t~malloc7#1.base_52| v_ArrVal_1720) |v_ULTIMATE.start_main_#t~malloc10#1.base_30| v_ArrVal_1723) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (select (store (store |c_#length| |v_ULTIMATE.start_main_#t~malloc7#1.base_52| v_ArrVal_1710) |v_ULTIMATE.start_main_#t~malloc10#1.base_30| (_ bv12 32)) (select (select (store (store (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1708))) (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_52|))) |v_ULTIMATE.start_main_#t~malloc7#1.base_52| v_arrayElimArr_32) |v_ULTIMATE.start_main_#t~malloc10#1.base_30| v_ArrVal_1724) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))))) (not (= (select v_arrayElimArr_32 (bvadd (_ bv4 32) v_subst_2)) |v_ULTIMATE.start_main_#t~malloc10#1.base_30|)))) (forall ((v_ArrVal_1709 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1713 (_ BitVec 32)) (v_ArrVal_1720 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1723 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (let ((.cse6 (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv4 32)))) (select (select (store (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_1709))) (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_1713))) |v_ULTIMATE.start_main_#t~malloc7#1.base_52| v_ArrVal_1720) |v_ULTIMATE.start_main_#t~malloc10#1.base_30| v_ArrVal_1723) |c_ULTIMATE.start_main_~head~0#1.base|) .cse6)))) (bvule .cse4 (bvadd (_ bv4 32) .cse4))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_52|))))) is different from false [2022-07-20 06:10:55,358 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:10:55,358 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 1 case distinctions, treesize of input 97 treesize of output 68 [2022-07-20 06:10:55,367 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:10:55,367 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:10:55,375 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 50 treesize of output 32 [2022-07-20 06:10:55,394 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-20 06:10:55,491 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:10:55,491 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 1 case distinctions, treesize of input 105 treesize of output 96 [2022-07-20 06:10:55,546 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:10:55,546 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 1 case distinctions, treesize of input 85 treesize of output 76 [2022-07-20 06:10:55,557 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:10:55,558 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:10:55,558 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:10:55,569 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 56 treesize of output 44 [2022-07-20 06:10:55,578 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:10:55,579 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:10:55,579 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:10:55,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, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2022-07-20 06:10:55,610 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-20 06:10:56,724 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:10:56,724 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 1 case distinctions, treesize of input 97 treesize of output 68 [2022-07-20 06:10:56,751 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:10:56,752 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:10:56,762 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 50 treesize of output 32 [2022-07-20 06:10:56,784 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 13 treesize of output 5 [2022-07-20 06:10:56,853 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-07-20 06:10:56,853 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 1 case distinctions, treesize of input 108 treesize of output 1 [2022-07-20 06:11:08,632 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-20 06:11:08,632 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:11:08,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [928136043] [2022-07-20 06:11:08,632 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [928136043] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:11:08,632 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 06:11:08,633 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 19] total 34 [2022-07-20 06:11:08,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8987841] [2022-07-20 06:11:08,633 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 06:11:08,633 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-07-20 06:11:08,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:11:08,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-07-20 06:11:08,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=505, Unknown=26, NotChecked=550, Total=1190 [2022-07-20 06:11:08,634 INFO L87 Difference]: Start difference. First operand 414 states and 497 transitions. Second operand has 35 states, 34 states have (on average 2.2058823529411766) internal successors, (75), 35 states have internal predecessors, (75), 0 states have call successors, (0), 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-20 06:11:42,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:11:42,067 INFO L93 Difference]: Finished difference Result 591 states and 710 transitions. [2022-07-20 06:11:42,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-07-20 06:11:42,069 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 2.2058823529411766) internal successors, (75), 35 states have internal predecessors, (75), 0 states have call successors, (0), 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-20 06:11:42,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:11:42,070 INFO L225 Difference]: With dead ends: 591 [2022-07-20 06:11:42,070 INFO L226 Difference]: Without dead ends: 591 [2022-07-20 06:11:42,071 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 40 SyntacticMatches, 8 SemanticMatches, 48 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 298 ImplicationChecksByTransitivity, 41.0s TimeCoverageRelationStatistics Valid=260, Invalid=1306, Unknown=34, NotChecked=850, Total=2450 [2022-07-20 06:11:42,071 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 284 mSDsluCounter, 1080 mSDsCounter, 0 mSdLazyCounter, 895 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 1160 SdHoareTripleChecker+Invalid, 3427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 895 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2501 IncrementalHoareTripleChecker+Unchecked, 9.5s IncrementalHoareTripleChecker+Time [2022-07-20 06:11:42,071 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [284 Valid, 1160 Invalid, 3427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 895 Invalid, 0 Unknown, 2501 Unchecked, 9.5s Time] [2022-07-20 06:11:42,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2022-07-20 06:11:42,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 414. [2022-07-20 06:11:42,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 414 states, 393 states have (on average 1.262086513994911) internal successors, (496), 413 states have internal predecessors, (496), 0 states have call successors, (0), 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-20 06:11:42,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 496 transitions. [2022-07-20 06:11:42,075 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 496 transitions. Word has length 38 [2022-07-20 06:11:42,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:11:42,076 INFO L495 AbstractCegarLoop]: Abstraction has 414 states and 496 transitions. [2022-07-20 06:11:42,076 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 2.2058823529411766) internal successors, (75), 35 states have internal predecessors, (75), 0 states have call successors, (0), 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-20 06:11:42,076 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 496 transitions. [2022-07-20 06:11:42,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-20 06:11:42,077 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:11:42,077 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, 1, 1, 1] [2022-07-20 06:11:42,092 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (42)] Ended with exit code 0 [2022-07-20 06:11:42,277 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 42 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 06:11:42,277 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2022-07-20 06:11:42,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:11:42,278 INFO L85 PathProgramCache]: Analyzing trace with hash -1694180957, now seen corresponding path program 1 times [2022-07-20 06:11:42,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:11:42,278 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1984363272] [2022-07-20 06:11:42,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:11:42,278 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:11:42,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:11:42,279 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 06:11:42,281 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (43)] Waiting until timeout for monitored process [2022-07-20 06:11:42,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:11:42,480 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-20 06:11:42,481 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:11:44,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 15 treesize of output 7 [2022-07-20 06:11:45,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-20 06:11:45,011 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:11:46,321 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:11:46,321 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 23 [2022-07-20 06:11:46,813 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-20 06:11:46,813 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:11:46,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1984363272] [2022-07-20 06:11:46,814 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1984363272] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:11:46,814 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 06:11:46,814 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2022-07-20 06:11:46,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340413587] [2022-07-20 06:11:46,814 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 06:11:46,814 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-20 06:11:46,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:11:46,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-20 06:11:46,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2022-07-20 06:11:46,814 INFO L87 Difference]: Start difference. First operand 414 states and 496 transitions. Second operand has 15 states, 14 states have (on average 4.214285714285714) internal successors, (59), 15 states have internal predecessors, (59), 0 states have call successors, (0), 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-20 06:11:53,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:11:53,942 INFO L93 Difference]: Finished difference Result 532 states and 626 transitions. [2022-07-20 06:11:53,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-20 06:11:53,942 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 4.214285714285714) internal successors, (59), 15 states have internal predecessors, (59), 0 states have call successors, (0), 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 39 [2022-07-20 06:11:53,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:11:53,944 INFO L225 Difference]: With dead ends: 532 [2022-07-20 06:11:53,944 INFO L226 Difference]: Without dead ends: 532 [2022-07-20 06:11:53,944 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 61 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=121, Invalid=341, Unknown=0, NotChecked=0, Total=462 [2022-07-20 06:11:53,944 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 395 mSDsluCounter, 486 mSDsCounter, 0 mSdLazyCounter, 559 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 395 SdHoareTripleChecker+Valid, 573 SdHoareTripleChecker+Invalid, 604 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 559 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2022-07-20 06:11:53,944 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [395 Valid, 573 Invalid, 604 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 559 Invalid, 0 Unknown, 0 Unchecked, 5.7s Time] [2022-07-20 06:11:53,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2022-07-20 06:11:53,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 491. [2022-07-20 06:11:53,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 491 states, 470 states have (on average 1.2702127659574467) internal successors, (597), 490 states have internal predecessors, (597), 0 states have call successors, (0), 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-20 06:11:53,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 597 transitions. [2022-07-20 06:11:53,949 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 597 transitions. Word has length 39 [2022-07-20 06:11:53,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:11:53,949 INFO L495 AbstractCegarLoop]: Abstraction has 491 states and 597 transitions. [2022-07-20 06:11:53,949 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 4.214285714285714) internal successors, (59), 15 states have internal predecessors, (59), 0 states have call successors, (0), 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-20 06:11:53,949 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 597 transitions. [2022-07-20 06:11:53,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-07-20 06:11:53,950 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:11:53,950 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, 1, 1, 1, 1] [2022-07-20 06:11:53,973 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (43)] Forceful destruction successful, exit code 0 [2022-07-20 06:11:54,158 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 43 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 06:11:54,158 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2022-07-20 06:11:54,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:11:54,159 INFO L85 PathProgramCache]: Analyzing trace with hash -980001879, now seen corresponding path program 1 times [2022-07-20 06:11:54,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:11:54,159 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [238692826] [2022-07-20 06:11:54,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:11:54,159 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:11:54,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:11:54,161 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 06:11:54,162 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (44)] Waiting until timeout for monitored process [2022-07-20 06:11:54,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:11:54,308 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 15 conjunts are in the unsatisfiable core [2022-07-20 06:11:54,309 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:11:57,482 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 19 treesize of output 7 [2022-07-20 06:11:57,708 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-20 06:11:57,708 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:11:59,177 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:11:59,177 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 23 [2022-07-20 06:12:00,050 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-20 06:12:00,051 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:12:00,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [238692826] [2022-07-20 06:12:00,051 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [238692826] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:12:00,051 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 06:12:00,051 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 18 [2022-07-20 06:12:00,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439511562] [2022-07-20 06:12:00,051 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 06:12:00,051 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-20 06:12:00,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:12:00,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-20 06:12:00,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2022-07-20 06:12:00,052 INFO L87 Difference]: Start difference. First operand 491 states and 597 transitions. Second operand has 19 states, 18 states have (on average 4.444444444444445) internal successors, (80), 19 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)