./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-simple/sll2n_prepend_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version f4b24e32 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/list-simple/sll2n_prepend_equal.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 e4cb0386e6b22b9d67dd4f4c4c33eb167dcf1836f99794e4424c5e73e6fc14d4 --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-14 06:59:26,303 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-14 06:59:26,306 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-14 06:59:26,349 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-14 06:59:26,349 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-14 06:59:26,351 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-14 06:59:26,353 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-14 06:59:26,355 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-14 06:59:26,356 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-14 06:59:26,360 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-14 06:59:26,361 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-14 06:59:26,363 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-14 06:59:26,363 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-14 06:59:26,365 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-14 06:59:26,366 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-14 06:59:26,369 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-14 06:59:26,369 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-14 06:59:26,371 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-14 06:59:26,372 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-14 06:59:26,377 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-14 06:59:26,379 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-14 06:59:26,380 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-14 06:59:26,381 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-14 06:59:26,381 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-14 06:59:26,383 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-14 06:59:26,386 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-14 06:59:26,386 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-14 06:59:26,386 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-14 06:59:26,387 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-14 06:59:26,388 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-14 06:59:26,389 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-14 06:59:26,389 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-14 06:59:26,390 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-14 06:59:26,391 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-14 06:59:26,392 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-14 06:59:26,393 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-14 06:59:26,393 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-14 06:59:26,393 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-14 06:59:26,394 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-14 06:59:26,394 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-14 06:59:26,394 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-14 06:59:26,396 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-14 06:59:26,397 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-07-14 06:59:26,425 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-14 06:59:26,426 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-14 06:59:26,426 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-14 06:59:26,426 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-14 06:59:26,427 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-14 06:59:26,427 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-14 06:59:26,428 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-14 06:59:26,428 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-14 06:59:26,428 INFO L138 SettingsManager]: * Use SBE=true [2022-07-14 06:59:26,429 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-14 06:59:26,429 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-14 06:59:26,430 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-14 06:59:26,430 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-14 06:59:26,430 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-14 06:59:26,430 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-14 06:59:26,430 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-14 06:59:26,430 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-14 06:59:26,431 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-14 06:59:26,431 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-14 06:59:26,432 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-14 06:59:26,432 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-14 06:59:26,432 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-14 06:59:26,433 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-14 06:59:26,433 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-14 06:59:26,433 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-14 06:59:26,433 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 06:59:26,433 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-14 06:59:26,434 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-14 06:59:26,434 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-14 06:59:26,434 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-14 06:59:26,434 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 -> e4cb0386e6b22b9d67dd4f4c4c33eb167dcf1836f99794e4424c5e73e6fc14d4 [2022-07-14 06:59:26,675 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-14 06:59:26,691 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-14 06:59:26,693 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-14 06:59:26,694 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-14 06:59:26,695 INFO L275 PluginConnector]: CDTParser initialized [2022-07-14 06:59:26,696 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/sll2n_prepend_equal.i [2022-07-14 06:59:26,759 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/489bd61aa/8b008ba94817433fbf422b2eab103f88/FLAGff8137e76 [2022-07-14 06:59:27,264 INFO L306 CDTParser]: Found 1 translation units. [2022-07-14 06:59:27,268 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2n_prepend_equal.i [2022-07-14 06:59:27,286 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/489bd61aa/8b008ba94817433fbf422b2eab103f88/FLAGff8137e76 [2022-07-14 06:59:27,755 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/489bd61aa/8b008ba94817433fbf422b2eab103f88 [2022-07-14 06:59:27,757 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-14 06:59:27,758 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-14 06:59:27,759 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-14 06:59:27,760 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-14 06:59:27,762 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-14 06:59:27,763 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 06:59:27" (1/1) ... [2022-07-14 06:59:27,764 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3175a337 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:59:27, skipping insertion in model container [2022-07-14 06:59:27,764 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 06:59:27" (1/1) ... [2022-07-14 06:59:27,770 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-14 06:59:27,811 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-14 06:59:28,114 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/list-simple/sll2n_prepend_equal.i[24076,24089] [2022-07-14 06:59:28,117 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 06:59:28,126 INFO L203 MainTranslator]: Completed pre-run [2022-07-14 06:59:28,174 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/list-simple/sll2n_prepend_equal.i[24076,24089] [2022-07-14 06:59:28,177 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 06:59:28,203 INFO L208 MainTranslator]: Completed translation [2022-07-14 06:59:28,205 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:59:28 WrapperNode [2022-07-14 06:59:28,205 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-14 06:59:28,207 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-14 06:59:28,207 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-14 06:59:28,208 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-14 06:59:28,214 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:59:28" (1/1) ... [2022-07-14 06:59:28,240 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:59:28" (1/1) ... [2022-07-14 06:59:28,267 INFO L137 Inliner]: procedures = 127, calls = 30, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 106 [2022-07-14 06:59:28,267 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-14 06:59:28,269 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-14 06:59:28,269 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-14 06:59:28,269 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-14 06:59:28,276 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:59:28" (1/1) ... [2022-07-14 06:59:28,276 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:59:28" (1/1) ... [2022-07-14 06:59:28,285 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:59:28" (1/1) ... [2022-07-14 06:59:28,285 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:59:28" (1/1) ... [2022-07-14 06:59:28,302 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:59:28" (1/1) ... [2022-07-14 06:59:28,307 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:59:28" (1/1) ... [2022-07-14 06:59:28,312 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:59:28" (1/1) ... [2022-07-14 06:59:28,315 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-14 06:59:28,320 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-14 06:59:28,321 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-14 06:59:28,321 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-14 06:59:28,322 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:59:28" (1/1) ... [2022-07-14 06:59:28,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 06:59:28,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:59:28,352 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-14 06:59:28,377 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-14 06:59:28,392 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-14 06:59:28,393 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-14 06:59:28,393 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2022-07-14 06:59:28,393 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2022-07-14 06:59:28,393 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-14 06:59:28,393 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-14 06:59:28,393 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-14 06:59:28,394 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-14 06:59:28,394 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-14 06:59:28,394 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-14 06:59:28,394 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-14 06:59:28,394 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-14 06:59:28,394 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-14 06:59:28,394 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-14 06:59:28,505 INFO L234 CfgBuilder]: Building ICFG [2022-07-14 06:59:28,507 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-14 06:59:28,767 INFO L275 CfgBuilder]: Performing block encoding [2022-07-14 06:59:28,773 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-14 06:59:28,773 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-07-14 06:59:28,775 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 06:59:28 BoogieIcfgContainer [2022-07-14 06:59:28,775 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-14 06:59:28,776 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-14 06:59:28,776 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-14 06:59:28,786 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-14 06:59:28,786 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.07 06:59:27" (1/3) ... [2022-07-14 06:59:28,787 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5111ef45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 06:59:28, skipping insertion in model container [2022-07-14 06:59:28,787 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:59:28" (2/3) ... [2022-07-14 06:59:28,787 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5111ef45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 06:59:28, skipping insertion in model container [2022-07-14 06:59:28,787 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 06:59:28" (3/3) ... [2022-07-14 06:59:28,789 INFO L111 eAbstractionObserver]: Analyzing ICFG sll2n_prepend_equal.i [2022-07-14 06:59:28,801 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-14 06:59:28,801 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 27 error locations. [2022-07-14 06:59:28,845 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-14 06:59:28,851 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@1836d81a, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@184d459e [2022-07-14 06:59:28,851 INFO L358 AbstractCegarLoop]: Starting to check reachability of 27 error locations. [2022-07-14 06:59:28,855 INFO L276 IsEmpty]: Start isEmpty. Operand has 73 states, 42 states have (on average 1.8571428571428572) internal successors, (78), 69 states have internal predecessors, (78), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-14 06:59:28,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-14 06:59:28,861 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:59:28,861 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:59:28,862 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-07-14 06:59:28,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:59:28,866 INFO L85 PathProgramCache]: Analyzing trace with hash 1813073593, now seen corresponding path program 1 times [2022-07-14 06:59:28,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:59:28,874 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786460919] [2022-07-14 06:59:28,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:59:28,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:59:28,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:59:29,082 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-14 06:59:29,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:59:29,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786460919] [2022-07-14 06:59:29,083 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786460919] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:59:29,084 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:59:29,084 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 06:59:29,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439496845] [2022-07-14 06:59:29,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:59:29,089 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 06:59:29,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:59:29,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 06:59:29,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 06:59:29,121 INFO L87 Difference]: Start difference. First operand has 73 states, 42 states have (on average 1.8571428571428572) internal successors, (78), 69 states have internal predecessors, (78), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:59:29,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:59:29,232 INFO L93 Difference]: Finished difference Result 71 states and 76 transitions. [2022-07-14 06:59:29,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 06:59:29,235 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-07-14 06:59:29,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:59:29,241 INFO L225 Difference]: With dead ends: 71 [2022-07-14 06:59:29,242 INFO L226 Difference]: Without dead ends: 68 [2022-07-14 06:59:29,244 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-14 06:59:29,251 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 8 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:59:29,252 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 108 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:59:29,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-07-14 06:59:29,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2022-07-14 06:59:29,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 40 states have (on average 1.7) internal successors, (68), 64 states have internal predecessors, (68), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-14 06:59:29,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2022-07-14 06:59:29,292 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 7 [2022-07-14 06:59:29,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:59:29,292 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2022-07-14 06:59:29,293 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:59:29,293 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2022-07-14 06:59:29,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-14 06:59:29,293 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:59:29,294 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:59:29,294 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-14 06:59:29,294 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-07-14 06:59:29,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:59:29,296 INFO L85 PathProgramCache]: Analyzing trace with hash 1813073594, now seen corresponding path program 1 times [2022-07-14 06:59:29,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:59:29,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116063662] [2022-07-14 06:59:29,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:59:29,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:59:29,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:59:29,381 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-14 06:59:29,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:59:29,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116063662] [2022-07-14 06:59:29,382 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116063662] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:59:29,382 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:59:29,382 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 06:59:29,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780974321] [2022-07-14 06:59:29,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:59:29,391 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 06:59:29,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:59:29,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 06:59:29,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 06:59:29,392 INFO L87 Difference]: Start difference. First operand 68 states and 72 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:59:29,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:59:29,458 INFO L93 Difference]: Finished difference Result 66 states and 70 transitions. [2022-07-14 06:59:29,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 06:59:29,460 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-07-14 06:59:29,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:59:29,461 INFO L225 Difference]: With dead ends: 66 [2022-07-14 06:59:29,462 INFO L226 Difference]: Without dead ends: 66 [2022-07-14 06:59:29,462 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-14 06:59:29,464 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 4 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:59:29,466 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 108 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:59:29,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-07-14 06:59:29,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2022-07-14 06:59:29,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 40 states have (on average 1.65) internal successors, (66), 62 states have internal predecessors, (66), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-14 06:59:29,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 70 transitions. [2022-07-14 06:59:29,475 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 70 transitions. Word has length 7 [2022-07-14 06:59:29,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:59:29,476 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 70 transitions. [2022-07-14 06:59:29,476 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:59:29,476 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2022-07-14 06:59:29,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-14 06:59:29,477 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:59:29,477 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:59:29,477 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-14 06:59:29,478 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-07-14 06:59:29,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:59:29,479 INFO L85 PathProgramCache]: Analyzing trace with hash 1431584192, now seen corresponding path program 1 times [2022-07-14 06:59:29,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:59:29,479 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383406487] [2022-07-14 06:59:29,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:59:29,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:59:29,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:59:29,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-14 06:59:29,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:59:29,584 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-14 06:59:29,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:59:29,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383406487] [2022-07-14 06:59:29,584 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383406487] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:59:29,585 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:59:29,585 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 06:59:29,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887369039] [2022-07-14 06:59:29,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:59:29,586 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-14 06:59:29,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:59:29,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-14 06:59:29,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-14 06:59:29,587 INFO L87 Difference]: Start difference. First operand 66 states and 70 transitions. Second operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-14 06:59:29,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:59:29,748 INFO L93 Difference]: Finished difference Result 70 states and 77 transitions. [2022-07-14 06:59:29,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 06:59:29,749 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-07-14 06:59:29,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:59:29,751 INFO L225 Difference]: With dead ends: 70 [2022-07-14 06:59:29,751 INFO L226 Difference]: Without dead ends: 70 [2022-07-14 06:59:29,751 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-14 06:59:29,752 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 11 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:59:29,753 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 249 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:59:29,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-07-14 06:59:29,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 65. [2022-07-14 06:59:29,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 40 states have (on average 1.625) internal successors, (65), 61 states have internal predecessors, (65), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-14 06:59:29,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2022-07-14 06:59:29,760 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 13 [2022-07-14 06:59:29,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:59:29,760 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2022-07-14 06:59:29,761 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-14 06:59:29,761 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2022-07-14 06:59:29,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-14 06:59:29,761 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:59:29,762 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:59:29,762 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-14 06:59:29,762 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-07-14 06:59:29,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:59:29,763 INFO L85 PathProgramCache]: Analyzing trace with hash 1431584193, now seen corresponding path program 1 times [2022-07-14 06:59:29,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:59:29,779 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361392053] [2022-07-14 06:59:29,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:59:29,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:59:29,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:59:29,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-14 06:59:29,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:59:29,959 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-14 06:59:29,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:59:29,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361392053] [2022-07-14 06:59:29,961 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361392053] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:59:29,961 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:59:29,961 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 06:59:29,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397545010] [2022-07-14 06:59:29,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:59:29,963 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-14 06:59:29,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:59:29,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-14 06:59:29,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-14 06:59:29,965 INFO L87 Difference]: Start difference. First operand 65 states and 69 transitions. Second operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-14 06:59:30,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:59:30,185 INFO L93 Difference]: Finished difference Result 69 states and 76 transitions. [2022-07-14 06:59:30,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 06:59:30,186 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-07-14 06:59:30,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:59:30,191 INFO L225 Difference]: With dead ends: 69 [2022-07-14 06:59:30,191 INFO L226 Difference]: Without dead ends: 69 [2022-07-14 06:59:30,191 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-14 06:59:30,200 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 9 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 06:59:30,202 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 265 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-14 06:59:30,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-07-14 06:59:30,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 64. [2022-07-14 06:59:30,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 40 states have (on average 1.6) internal successors, (64), 60 states have internal predecessors, (64), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-14 06:59:30,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 68 transitions. [2022-07-14 06:59:30,217 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 68 transitions. Word has length 13 [2022-07-14 06:59:30,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:59:30,217 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 68 transitions. [2022-07-14 06:59:30,217 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-14 06:59:30,217 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 68 transitions. [2022-07-14 06:59:30,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-14 06:59:30,218 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:59:30,219 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:59:30,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-14 06:59:30,219 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-07-14 06:59:30,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:59:30,220 INFO L85 PathProgramCache]: Analyzing trace with hash 869381824, now seen corresponding path program 1 times [2022-07-14 06:59:30,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:59:30,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589760031] [2022-07-14 06:59:30,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:59:30,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:59:30,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:59:30,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-14 06:59:30,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:59:30,307 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-14 06:59:30,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:59:30,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589760031] [2022-07-14 06:59:30,312 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589760031] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:59:30,312 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:59:30,312 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 06:59:30,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357117347] [2022-07-14 06:59:30,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:59:30,324 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 06:59:30,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:59:30,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 06:59:30,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 06:59:30,325 INFO L87 Difference]: Start difference. First operand 64 states and 68 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-14 06:59:30,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:59:30,386 INFO L93 Difference]: Finished difference Result 70 states and 75 transitions. [2022-07-14 06:59:30,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 06:59:30,386 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-07-14 06:59:30,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:59:30,391 INFO L225 Difference]: With dead ends: 70 [2022-07-14 06:59:30,391 INFO L226 Difference]: Without dead ends: 70 [2022-07-14 06:59:30,392 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 06:59:30,395 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 4 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:59:30,396 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 159 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:59:30,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-07-14 06:59:30,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 65. [2022-07-14 06:59:30,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 41 states have (on average 1.5853658536585367) internal successors, (65), 61 states have internal predecessors, (65), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-14 06:59:30,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2022-07-14 06:59:30,409 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 15 [2022-07-14 06:59:30,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:59:30,410 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2022-07-14 06:59:30,410 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-14 06:59:30,410 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2022-07-14 06:59:30,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-14 06:59:30,411 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:59:30,411 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:59:30,411 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-14 06:59:30,412 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-07-14 06:59:30,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:59:30,412 INFO L85 PathProgramCache]: Analyzing trace with hash -206453950, now seen corresponding path program 1 times [2022-07-14 06:59:30,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:59:30,413 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687742956] [2022-07-14 06:59:30,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:59:30,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:59:30,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:59:30,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-14 06:59:30,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:59:30,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-14 06:59:30,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:59:30,527 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-14 06:59:30,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:59:30,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687742956] [2022-07-14 06:59:30,534 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687742956] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:59:30,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1396118678] [2022-07-14 06:59:30,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:59:30,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:59:30,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:59:30,543 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-14 06:59:30,557 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-14 06:59:30,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:59:30,650 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-14 06:59:30,655 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:59:30,725 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:59:30,726 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:59:30,774 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-14 06:59:30,775 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1396118678] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:59:30,775 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:59:30,775 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 6 [2022-07-14 06:59:30,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382777315] [2022-07-14 06:59:30,775 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:59:30,776 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 06:59:30,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:59:30,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 06:59:30,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-07-14 06:59:30,777 INFO L87 Difference]: Start difference. First operand 65 states and 69 transitions. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-07-14 06:59:30,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:59:30,876 INFO L93 Difference]: Finished difference Result 71 states and 76 transitions. [2022-07-14 06:59:30,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 06:59:30,877 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 28 [2022-07-14 06:59:30,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:59:30,878 INFO L225 Difference]: With dead ends: 71 [2022-07-14 06:59:30,878 INFO L226 Difference]: Without dead ends: 71 [2022-07-14 06:59:30,878 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-07-14 06:59:30,879 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 8 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:59:30,879 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 158 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:59:30,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-07-14 06:59:30,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2022-07-14 06:59:30,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 46 states have (on average 1.5217391304347827) internal successors, (70), 66 states have internal predecessors, (70), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-14 06:59:30,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 76 transitions. [2022-07-14 06:59:30,884 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 76 transitions. Word has length 28 [2022-07-14 06:59:30,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:59:30,884 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 76 transitions. [2022-07-14 06:59:30,885 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-07-14 06:59:30,885 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 76 transitions. [2022-07-14 06:59:30,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-14 06:59:30,886 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:59:30,886 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:59:30,936 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-14 06:59:31,107 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,SelfDestructingSolverStorable5 [2022-07-14 06:59:31,108 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-07-14 06:59:31,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:59:31,108 INFO L85 PathProgramCache]: Analyzing trace with hash 400923136, now seen corresponding path program 2 times [2022-07-14 06:59:31,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:59:31,109 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724801745] [2022-07-14 06:59:31,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:59:31,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:59:31,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:59:31,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-14 06:59:31,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:59:31,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 06:59:31,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:59:31,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-14 06:59:31,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:59:31,461 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-14 06:59:31,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:59:31,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724801745] [2022-07-14 06:59:31,462 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724801745] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:59:31,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1111869629] [2022-07-14 06:59:31,463 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-14 06:59:31,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:59:31,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:59:31,464 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-14 06:59:31,466 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-14 06:59:31,592 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-14 06:59:31,593 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 06:59:31,596 INFO L263 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 29 conjunts are in the unsatisfiable core [2022-07-14 06:59:31,603 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:59:31,644 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 06:59:31,678 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-14 06:59:31,755 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-14 06:59:31,756 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 18 [2022-07-14 06:59:31,869 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-14 06:59:32,055 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 06:59:32,055 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-14 06:59:32,065 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-14 06:59:32,065 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:59:32,277 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1111869629] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:59:32,277 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 06:59:32,277 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 15 [2022-07-14 06:59:32,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063369850] [2022-07-14 06:59:32,277 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 06:59:32,278 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-14 06:59:32,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:59:32,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-14 06:59:32,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2022-07-14 06:59:32,279 INFO L87 Difference]: Start difference. First operand 71 states and 76 transitions. Second operand has 16 states, 15 states have (on average 3.1333333333333333) internal successors, (47), 13 states have internal predecessors, (47), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-14 06:59:32,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:59:32,516 INFO L93 Difference]: Finished difference Result 80 states and 86 transitions. [2022-07-14 06:59:32,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-14 06:59:32,517 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.1333333333333333) internal successors, (47), 13 states have internal predecessors, (47), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) Word has length 41 [2022-07-14 06:59:32,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:59:32,518 INFO L225 Difference]: With dead ends: 80 [2022-07-14 06:59:32,518 INFO L226 Difference]: Without dead ends: 80 [2022-07-14 06:59:32,518 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 52 SyntacticMatches, 6 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=85, Invalid=377, Unknown=0, NotChecked=0, Total=462 [2022-07-14 06:59:32,519 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 83 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 100 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:59:32,519 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 320 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 208 Invalid, 0 Unknown, 100 Unchecked, 0.1s Time] [2022-07-14 06:59:32,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-07-14 06:59:32,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 68. [2022-07-14 06:59:32,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 46 states have (on average 1.4565217391304348) internal successors, (67), 63 states have internal predecessors, (67), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-14 06:59:32,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 73 transitions. [2022-07-14 06:59:32,533 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 73 transitions. Word has length 41 [2022-07-14 06:59:32,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:59:32,534 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 73 transitions. [2022-07-14 06:59:32,534 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.1333333333333333) internal successors, (47), 13 states have internal predecessors, (47), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-14 06:59:32,534 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 73 transitions. [2022-07-14 06:59:32,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-14 06:59:32,536 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:59:32,536 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:59:32,564 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-14 06:59:32,751 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,SelfDestructingSolverStorable6 [2022-07-14 06:59:32,752 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-07-14 06:59:32,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:59:32,752 INFO L85 PathProgramCache]: Analyzing trace with hash 400923137, now seen corresponding path program 1 times [2022-07-14 06:59:32,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:59:32,752 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221827196] [2022-07-14 06:59:32,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:59:32,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:59:32,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:59:32,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-14 06:59:32,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:59:32,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 06:59:32,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:59:32,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-14 06:59:33,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:59:33,018 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-07-14 06:59:33,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:59:33,018 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221827196] [2022-07-14 06:59:33,019 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221827196] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:59:33,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1240993314] [2022-07-14 06:59:33,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:59:33,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:59:33,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:59:33,021 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-14 06:59:33,028 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-14 06:59:33,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:59:33,146 INFO L263 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 26 conjunts are in the unsatisfiable core [2022-07-14 06:59:33,149 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:59:33,156 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-14 06:59:33,183 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-14 06:59:33,318 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2022-07-14 06:59:33,347 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-14 06:59:33,519 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:59:33,519 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: line 31907 column 46: unknown constant v_#length_BEFORE_CALL_2 at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1458) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:658) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:239) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:258) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.assertTerm(Scriptor.java:147) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript$DiffTransformer.checkOrAddAxiom(DiffWrapperScript.java:161) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript$DiffTransformer.convertApplicationTerm(DiffWrapperScript.java:171) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$BuildApplicationTerm.walk(TermTransformer.java:352) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.transform(TermTransformer.java:285) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.assertTerm(DiffWrapperScript.java:109) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.assertTerm(WrapperScript.java:158) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.assertTerm(ManagedScript.java:134) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:83) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:824) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:768) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:345) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:305) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:582) 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-14 06:59:33,523 INFO L158 Benchmark]: Toolchain (without parser) took 5765.22ms. Allocated memory was 115.3MB in the beginning and 153.1MB in the end (delta: 37.7MB). Free memory was 80.1MB in the beginning and 122.0MB in the end (delta: -41.9MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-14 06:59:33,524 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 79.7MB. Free memory was 58.1MB in the beginning and 58.0MB in the end (delta: 28.4kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-14 06:59:33,524 INFO L158 Benchmark]: CACSL2BoogieTranslator took 446.62ms. Allocated memory is still 115.3MB. Free memory was 79.8MB in the beginning and 83.6MB in the end (delta: -3.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-14 06:59:33,524 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.91ms. Allocated memory is still 115.3MB. Free memory was 83.6MB in the beginning and 81.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-14 06:59:33,524 INFO L158 Benchmark]: Boogie Preprocessor took 50.83ms. Allocated memory is still 115.3MB. Free memory was 81.5MB in the beginning and 79.8MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-14 06:59:33,524 INFO L158 Benchmark]: RCFGBuilder took 455.01ms. Allocated memory is still 115.3MB. Free memory was 79.8MB in the beginning and 64.2MB in the end (delta: 15.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-07-14 06:59:33,525 INFO L158 Benchmark]: TraceAbstraction took 4746.59ms. Allocated memory was 115.3MB in the beginning and 153.1MB in the end (delta: 37.7MB). Free memory was 63.7MB in the beginning and 122.0MB in the end (delta: -58.4MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-14 06:59:33,526 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.17ms. Allocated memory is still 79.7MB. Free memory was 58.1MB in the beginning and 58.0MB in the end (delta: 28.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 446.62ms. Allocated memory is still 115.3MB. Free memory was 79.8MB in the beginning and 83.6MB in the end (delta: -3.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 60.91ms. Allocated memory is still 115.3MB. Free memory was 83.6MB in the beginning and 81.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 50.83ms. Allocated memory is still 115.3MB. Free memory was 81.5MB in the beginning and 79.8MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 455.01ms. Allocated memory is still 115.3MB. Free memory was 79.8MB in the beginning and 64.2MB in the end (delta: 15.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 4746.59ms. Allocated memory was 115.3MB in the beginning and 153.1MB in the end (delta: 37.7MB). Free memory was 63.7MB in the beginning and 122.0MB in the end (delta: -58.4MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: line 31907 column 46: unknown constant v_#length_BEFORE_CALL_2 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: line 31907 column 46: unknown constant v_#length_BEFORE_CALL_2: de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1458) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-07-14 06:59:33,543 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 1 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/list-simple/sll2n_prepend_equal.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 e4cb0386e6b22b9d67dd4f4c4c33eb167dcf1836f99794e4424c5e73e6fc14d4 --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-14 06:59:35,456 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-14 06:59:35,458 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-14 06:59:35,497 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-14 06:59:35,498 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-14 06:59:35,499 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-14 06:59:35,504 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-14 06:59:35,507 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-14 06:59:35,509 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-14 06:59:35,514 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-14 06:59:35,516 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-14 06:59:35,517 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-14 06:59:35,517 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-14 06:59:35,519 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-14 06:59:35,520 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-14 06:59:35,521 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-14 06:59:35,524 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-14 06:59:35,525 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-14 06:59:35,527 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-14 06:59:35,529 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-14 06:59:35,534 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-14 06:59:35,535 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-14 06:59:35,536 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-14 06:59:35,537 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-14 06:59:35,538 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-14 06:59:35,541 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-14 06:59:35,544 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-14 06:59:35,544 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-14 06:59:35,545 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-14 06:59:35,546 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-14 06:59:35,547 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-14 06:59:35,547 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-14 06:59:35,549 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-14 06:59:35,549 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-14 06:59:35,550 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-14 06:59:35,551 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-14 06:59:35,551 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-14 06:59:35,552 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-14 06:59:35,552 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-14 06:59:35,552 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-14 06:59:35,553 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-14 06:59:35,554 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-14 06:59:35,555 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-07-14 06:59:35,590 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-14 06:59:35,591 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-14 06:59:35,591 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-14 06:59:35,591 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-14 06:59:35,592 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-14 06:59:35,592 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-14 06:59:35,593 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-14 06:59:35,593 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-14 06:59:35,593 INFO L138 SettingsManager]: * Use SBE=true [2022-07-14 06:59:35,594 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-14 06:59:35,594 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-14 06:59:35,595 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-14 06:59:35,595 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-14 06:59:35,595 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-14 06:59:35,603 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-14 06:59:35,603 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-14 06:59:35,603 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-14 06:59:35,603 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-14 06:59:35,604 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-14 06:59:35,604 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-14 06:59:35,604 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-14 06:59:35,604 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-14 06:59:35,604 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-14 06:59:35,605 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-14 06:59:35,605 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-14 06:59:35,605 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-14 06:59:35,605 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-14 06:59:35,606 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 06:59:35,606 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-14 06:59:35,606 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-14 06:59:35,606 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-14 06:59:35,607 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-14 06:59:35,607 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-14 06:59:35,607 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 -> e4cb0386e6b22b9d67dd4f4c4c33eb167dcf1836f99794e4424c5e73e6fc14d4 [2022-07-14 06:59:35,932 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-14 06:59:35,959 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-14 06:59:35,962 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-14 06:59:35,963 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-14 06:59:35,963 INFO L275 PluginConnector]: CDTParser initialized [2022-07-14 06:59:35,965 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/sll2n_prepend_equal.i [2022-07-14 06:59:36,025 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f289a2be0/b9fe78af8d684db0a64e26242baa48a0/FLAG889bd7be3 [2022-07-14 06:59:36,563 INFO L306 CDTParser]: Found 1 translation units. [2022-07-14 06:59:36,566 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2n_prepend_equal.i [2022-07-14 06:59:36,585 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f289a2be0/b9fe78af8d684db0a64e26242baa48a0/FLAG889bd7be3 [2022-07-14 06:59:37,045 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f289a2be0/b9fe78af8d684db0a64e26242baa48a0 [2022-07-14 06:59:37,047 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-14 06:59:37,049 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-14 06:59:37,052 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-14 06:59:37,052 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-14 06:59:37,055 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-14 06:59:37,056 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 06:59:37" (1/1) ... [2022-07-14 06:59:37,057 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27eab5b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:59:37, skipping insertion in model container [2022-07-14 06:59:37,057 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 06:59:37" (1/1) ... [2022-07-14 06:59:37,063 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-14 06:59:37,106 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-14 06:59:37,436 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/list-simple/sll2n_prepend_equal.i[24076,24089] [2022-07-14 06:59:37,439 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 06:59:37,451 INFO L203 MainTranslator]: Completed pre-run [2022-07-14 06:59:37,509 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/list-simple/sll2n_prepend_equal.i[24076,24089] [2022-07-14 06:59:37,511 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 06:59:37,544 INFO L208 MainTranslator]: Completed translation [2022-07-14 06:59:37,545 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:59:37 WrapperNode [2022-07-14 06:59:37,545 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-14 06:59:37,547 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-14 06:59:37,547 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-14 06:59:37,547 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-14 06:59:37,552 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:59:37" (1/1) ... [2022-07-14 06:59:37,581 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:59:37" (1/1) ... [2022-07-14 06:59:37,611 INFO L137 Inliner]: procedures = 130, calls = 30, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 107 [2022-07-14 06:59:37,611 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-14 06:59:37,613 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-14 06:59:37,613 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-14 06:59:37,613 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-14 06:59:37,620 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:59:37" (1/1) ... [2022-07-14 06:59:37,620 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:59:37" (1/1) ... [2022-07-14 06:59:37,630 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:59:37" (1/1) ... [2022-07-14 06:59:37,631 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:59:37" (1/1) ... [2022-07-14 06:59:37,645 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:59:37" (1/1) ... [2022-07-14 06:59:37,655 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:59:37" (1/1) ... [2022-07-14 06:59:37,660 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:59:37" (1/1) ... [2022-07-14 06:59:37,668 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-14 06:59:37,669 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-14 06:59:37,669 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-14 06:59:37,669 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-14 06:59:37,670 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:59:37" (1/1) ... [2022-07-14 06:59:37,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 06:59:37,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:59:37,709 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-14 06:59:37,737 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-14 06:59:37,756 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-07-14 06:59:37,756 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2022-07-14 06:59:37,757 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2022-07-14 06:59:37,757 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-14 06:59:37,757 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-14 06:59:37,757 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-14 06:59:37,757 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-14 06:59:37,757 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-14 06:59:37,758 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-14 06:59:37,758 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-07-14 06:59:37,758 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-14 06:59:37,758 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-14 06:59:37,758 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-14 06:59:37,758 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-14 06:59:37,915 INFO L234 CfgBuilder]: Building ICFG [2022-07-14 06:59:37,917 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-14 06:59:38,290 INFO L275 CfgBuilder]: Performing block encoding [2022-07-14 06:59:38,296 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-14 06:59:38,296 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-07-14 06:59:38,298 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 06:59:38 BoogieIcfgContainer [2022-07-14 06:59:38,298 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-14 06:59:38,299 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-14 06:59:38,299 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-14 06:59:38,301 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-14 06:59:38,302 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.07 06:59:37" (1/3) ... [2022-07-14 06:59:38,302 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44f675f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 06:59:38, skipping insertion in model container [2022-07-14 06:59:38,302 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:59:37" (2/3) ... [2022-07-14 06:59:38,302 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44f675f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 06:59:38, skipping insertion in model container [2022-07-14 06:59:38,303 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 06:59:38" (3/3) ... [2022-07-14 06:59:38,305 INFO L111 eAbstractionObserver]: Analyzing ICFG sll2n_prepend_equal.i [2022-07-14 06:59:38,318 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-14 06:59:38,319 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 27 error locations. [2022-07-14 06:59:38,371 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-14 06:59:38,383 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@7bfe2211, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@7a2ef6be [2022-07-14 06:59:38,383 INFO L358 AbstractCegarLoop]: Starting to check reachability of 27 error locations. [2022-07-14 06:59:38,389 INFO L276 IsEmpty]: Start isEmpty. Operand has 73 states, 42 states have (on average 1.8571428571428572) internal successors, (78), 69 states have internal predecessors, (78), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-14 06:59:38,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-14 06:59:38,395 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:59:38,396 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:59:38,397 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-07-14 06:59:38,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:59:38,403 INFO L85 PathProgramCache]: Analyzing trace with hash 1813073593, now seen corresponding path program 1 times [2022-07-14 06:59:38,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:59:38,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [826345379] [2022-07-14 06:59:38,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:59:38,415 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:59:38,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:59:38,418 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-14 06:59:38,419 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-14 06:59:38,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:59:38,504 INFO L263 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-14 06:59:38,508 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:59:38,580 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-14 06:59:38,593 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-14 06:59:38,594 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:59:38,594 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:59:38,594 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [826345379] [2022-07-14 06:59:38,596 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [826345379] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:59:38,596 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:59:38,596 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 06:59:38,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497892197] [2022-07-14 06:59:38,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:59:38,602 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 06:59:38,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:59:38,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 06:59:38,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 06:59:38,631 INFO L87 Difference]: Start difference. First operand has 73 states, 42 states have (on average 1.8571428571428572) internal successors, (78), 69 states have internal predecessors, (78), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:59:38,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:59:38,752 INFO L93 Difference]: Finished difference Result 71 states and 76 transitions. [2022-07-14 06:59:38,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 06:59:38,754 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-07-14 06:59:38,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:59:38,760 INFO L225 Difference]: With dead ends: 71 [2022-07-14 06:59:38,761 INFO L226 Difference]: Without dead ends: 68 [2022-07-14 06:59:38,762 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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-14 06:59:38,765 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 8 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:59:38,766 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 108 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:59:38,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-07-14 06:59:38,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2022-07-14 06:59:38,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 40 states have (on average 1.7) internal successors, (68), 64 states have internal predecessors, (68), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-14 06:59:38,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2022-07-14 06:59:38,797 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 7 [2022-07-14 06:59:38,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:59:38,798 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2022-07-14 06:59:38,798 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:59:38,798 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2022-07-14 06:59:38,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-14 06:59:38,798 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:59:38,799 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:59:38,811 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-07-14 06:59:39,007 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-14 06:59:39,008 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-07-14 06:59:39,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:59:39,009 INFO L85 PathProgramCache]: Analyzing trace with hash 1813073594, now seen corresponding path program 1 times [2022-07-14 06:59:39,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:59:39,009 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1544126938] [2022-07-14 06:59:39,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:59:39,010 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:59:39,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:59:39,011 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-14 06:59:39,014 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-14 06:59:39,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:59:39,080 INFO L263 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-14 06:59:39,082 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:59:39,093 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-14 06:59:39,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-14 06:59:39,109 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:59:39,110 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:59:39,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1544126938] [2022-07-14 06:59:39,110 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1544126938] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:59:39,110 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:59:39,110 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 06:59:39,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509539594] [2022-07-14 06:59:39,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:59:39,112 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 06:59:39,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:59:39,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 06:59:39,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 06:59:39,113 INFO L87 Difference]: Start difference. First operand 68 states and 72 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:59:39,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:59:39,222 INFO L93 Difference]: Finished difference Result 66 states and 70 transitions. [2022-07-14 06:59:39,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 06:59:39,222 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-07-14 06:59:39,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:59:39,223 INFO L225 Difference]: With dead ends: 66 [2022-07-14 06:59:39,224 INFO L226 Difference]: Without dead ends: 66 [2022-07-14 06:59:39,224 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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-14 06:59:39,225 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 4 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:59:39,225 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 108 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:59:39,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-07-14 06:59:39,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2022-07-14 06:59:39,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 40 states have (on average 1.65) internal successors, (66), 62 states have internal predecessors, (66), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-14 06:59:39,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 70 transitions. [2022-07-14 06:59:39,232 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 70 transitions. Word has length 7 [2022-07-14 06:59:39,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:59:39,233 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 70 transitions. [2022-07-14 06:59:39,233 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:59:39,233 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2022-07-14 06:59:39,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-14 06:59:39,234 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:59:39,234 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:59:39,247 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-14 06:59:39,446 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-14 06:59:39,447 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-07-14 06:59:39,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:59:39,448 INFO L85 PathProgramCache]: Analyzing trace with hash 1431584192, now seen corresponding path program 1 times [2022-07-14 06:59:39,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:59:39,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [639565208] [2022-07-14 06:59:39,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:59:39,449 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:59:39,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:59:39,450 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-14 06:59:39,452 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-14 06:59:39,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:59:39,531 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-14 06:59:39,533 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:59:39,542 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-14 06:59:39,574 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-14 06:59:39,574 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:59:39,574 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:59:39,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [639565208] [2022-07-14 06:59:39,575 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [639565208] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:59:39,575 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:59:39,575 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-14 06:59:39,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566993918] [2022-07-14 06:59:39,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:59:39,576 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 06:59:39,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:59:39,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 06:59:39,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 06:59:39,577 INFO L87 Difference]: Start difference. First operand 66 states and 70 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-14 06:59:39,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:59:39,805 INFO L93 Difference]: Finished difference Result 70 states and 77 transitions. [2022-07-14 06:59:39,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 06:59:39,810 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-07-14 06:59:39,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:59:39,812 INFO L225 Difference]: With dead ends: 70 [2022-07-14 06:59:39,812 INFO L226 Difference]: Without dead ends: 70 [2022-07-14 06:59:39,812 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-14 06:59:39,813 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 10 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 06:59:39,814 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 222 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-14 06:59:39,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-07-14 06:59:39,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 65. [2022-07-14 06:59:39,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 40 states have (on average 1.625) internal successors, (65), 61 states have internal predecessors, (65), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-14 06:59:39,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2022-07-14 06:59:39,823 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 13 [2022-07-14 06:59:39,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:59:39,823 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2022-07-14 06:59:39,823 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-14 06:59:39,823 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2022-07-14 06:59:39,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-14 06:59:39,824 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:59:39,824 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:59:39,833 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-14 06:59:40,024 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-14 06:59:40,025 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-07-14 06:59:40,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:59:40,025 INFO L85 PathProgramCache]: Analyzing trace with hash 1431584193, now seen corresponding path program 1 times [2022-07-14 06:59:40,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:59:40,026 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1112211165] [2022-07-14 06:59:40,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:59:40,026 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:59:40,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:59:40,032 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-14 06:59:40,035 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-14 06:59:40,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:59:40,105 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-14 06:59:40,107 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:59:40,115 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-14 06:59:40,190 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-14 06:59:40,191 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:59:40,191 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:59:40,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1112211165] [2022-07-14 06:59:40,191 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1112211165] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:59:40,191 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:59:40,192 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-14 06:59:40,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911754183] [2022-07-14 06:59:40,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:59:40,192 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 06:59:40,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:59:40,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 06:59:40,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 06:59:40,193 INFO L87 Difference]: Start difference. First operand 65 states and 69 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-14 06:59:40,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:59:40,421 INFO L93 Difference]: Finished difference Result 69 states and 76 transitions. [2022-07-14 06:59:40,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 06:59:40,422 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-07-14 06:59:40,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:59:40,422 INFO L225 Difference]: With dead ends: 69 [2022-07-14 06:59:40,423 INFO L226 Difference]: Without dead ends: 69 [2022-07-14 06:59:40,423 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-14 06:59:40,424 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 9 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 06:59:40,424 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 238 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-14 06:59:40,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-07-14 06:59:40,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 64. [2022-07-14 06:59:40,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 40 states have (on average 1.6) internal successors, (64), 60 states have internal predecessors, (64), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-14 06:59:40,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 68 transitions. [2022-07-14 06:59:40,430 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 68 transitions. Word has length 13 [2022-07-14 06:59:40,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:59:40,430 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 68 transitions. [2022-07-14 06:59:40,430 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-14 06:59:40,430 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 68 transitions. [2022-07-14 06:59:40,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-14 06:59:40,431 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:59:40,432 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:59:40,446 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-14 06:59:40,640 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-14 06:59:40,640 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-07-14 06:59:40,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:59:40,641 INFO L85 PathProgramCache]: Analyzing trace with hash 869381824, now seen corresponding path program 1 times [2022-07-14 06:59:40,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:59:40,641 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2114612704] [2022-07-14 06:59:40,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:59:40,641 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:59:40,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:59:40,643 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-14 06:59:40,645 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-14 06:59:40,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:59:40,725 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-14 06:59:40,726 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:59:40,736 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-14 06:59:40,736 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:59:40,737 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:59:40,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2114612704] [2022-07-14 06:59:40,737 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2114612704] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:59:40,737 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:59:40,737 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 06:59:40,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512108051] [2022-07-14 06:59:40,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:59:40,738 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 06:59:40,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:59:40,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 06:59:40,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 06:59:40,738 INFO L87 Difference]: Start difference. First operand 64 states and 68 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-14 06:59:40,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:59:40,745 INFO L93 Difference]: Finished difference Result 70 states and 75 transitions. [2022-07-14 06:59:40,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 06:59:40,746 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-07-14 06:59:40,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:59:40,747 INFO L225 Difference]: With dead ends: 70 [2022-07-14 06:59:40,747 INFO L226 Difference]: Without dead ends: 70 [2022-07-14 06:59:40,747 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 13 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-14 06:59:40,748 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 4 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 06:59:40,748 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 131 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 06:59:40,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-07-14 06:59:40,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 65. [2022-07-14 06:59:40,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 41 states have (on average 1.5853658536585367) internal successors, (65), 61 states have internal predecessors, (65), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-14 06:59:40,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2022-07-14 06:59:40,753 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 15 [2022-07-14 06:59:40,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:59:40,754 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2022-07-14 06:59:40,754 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-14 06:59:40,754 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2022-07-14 06:59:40,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-14 06:59:40,754 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:59:40,755 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:59:40,766 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-14 06:59:40,964 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-14 06:59:40,964 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-07-14 06:59:40,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:59:40,964 INFO L85 PathProgramCache]: Analyzing trace with hash -206453950, now seen corresponding path program 1 times [2022-07-14 06:59:40,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:59:40,965 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1564816647] [2022-07-14 06:59:40,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:59:40,965 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:59:40,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:59:40,967 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-14 06:59:40,970 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-14 06:59:41,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:59:41,094 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-14 06:59:41,096 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:59:41,123 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:59:41,123 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:59:41,178 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-14 06:59:41,181 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:59:41,181 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1564816647] [2022-07-14 06:59:41,181 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1564816647] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:59:41,182 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 06:59:41,182 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2022-07-14 06:59:41,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564041608] [2022-07-14 06:59:41,182 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 06:59:41,183 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 06:59:41,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:59:41,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 06:59:41,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-07-14 06:59:41,184 INFO L87 Difference]: Start difference. First operand 65 states and 69 transitions. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-07-14 06:59:41,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:59:41,221 INFO L93 Difference]: Finished difference Result 76 states and 82 transitions. [2022-07-14 06:59:41,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 06:59:41,222 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 28 [2022-07-14 06:59:41,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:59:41,225 INFO L225 Difference]: With dead ends: 76 [2022-07-14 06:59:41,228 INFO L226 Difference]: Without dead ends: 76 [2022-07-14 06:59:41,230 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-07-14 06:59:41,233 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 11 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 06:59:41,234 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 325 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 06:59:41,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-07-14 06:59:41,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 71. [2022-07-14 06:59:41,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 46 states have (on average 1.5217391304347827) internal successors, (70), 66 states have internal predecessors, (70), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-14 06:59:41,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 76 transitions. [2022-07-14 06:59:41,245 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 76 transitions. Word has length 28 [2022-07-14 06:59:41,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:59:41,245 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 76 transitions. [2022-07-14 06:59:41,245 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-07-14 06:59:41,246 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 76 transitions. [2022-07-14 06:59:41,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-14 06:59:41,247 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:59:41,247 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:59:41,257 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-14 06:59:41,456 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-14 06:59:41,457 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-07-14 06:59:41,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:59:41,457 INFO L85 PathProgramCache]: Analyzing trace with hash 400923136, now seen corresponding path program 2 times [2022-07-14 06:59:41,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:59:41,458 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1542595802] [2022-07-14 06:59:41,458 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-14 06:59:41,458 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:59:41,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:59:41,460 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-14 06:59:41,462 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-14 06:59:41,638 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-14 06:59:41,638 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 06:59:41,647 INFO L263 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 19 conjunts are in the unsatisfiable core [2022-07-14 06:59:41,650 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:59:41,659 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-14 06:59:41,703 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 5 [2022-07-14 06:59:41,834 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-14 06:59:41,834 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 20 treesize of output 27 [2022-07-14 06:59:41,887 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 5 [2022-07-14 06:59:41,982 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:59:41,984 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 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-14 06:59:42,192 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-07-14 06:59:42,193 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-14 06:59:42,223 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-14 06:59:42,224 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:59:42,488 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:59:42,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1542595802] [2022-07-14 06:59:42,488 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1542595802] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:59:42,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [869474550] [2022-07-14 06:59:42,488 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-14 06:59:42,489 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-14 06:59:42,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-14 06:59:42,491 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-14 06:59:42,516 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Waiting until timeout for monitored process [2022-07-14 06:59:42,730 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-14 06:59:42,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1458821814] [2022-07-14 06:59:42,730 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-14 06:59:42,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:59:42,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:59:42,737 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-14 06:59:42,742 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Forceful destruction successful, exit code 1 [2022-07-14 06:59:42,763 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-14 06:59:42,919 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-14 06:59:42,919 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 06:59:42,924 INFO L263 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 20 conjunts are in the unsatisfiable core [2022-07-14 06:59:42,928 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:59:42,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 06:59:45,028 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-14 06:59:45,028 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 18 treesize of output 25 [2022-07-14 06:59:45,166 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-14 06:59:45,167 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 18 treesize of output 25 [2022-07-14 06:59:45,331 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-07-14 06:59:45,331 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-14 06:59:45,355 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 7 proven. 8 refuted. 4 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-14 06:59:45,356 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:59:45,888 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-07-14 06:59:45,888 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1458821814] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:59:45,888 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:59:45,888 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 5] total 18 [2022-07-14 06:59:45,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542257691] [2022-07-14 06:59:45,888 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:59:45,889 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-14 06:59:45,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:59:45,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-14 06:59:45,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=314, Unknown=1, NotChecked=0, Total=380 [2022-07-14 06:59:45,897 INFO L87 Difference]: Start difference. First operand 71 states and 76 transitions. Second operand has 19 states, 18 states have (on average 3.888888888888889) internal successors, (70), 16 states have internal predecessors, (70), 4 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (8), 6 states have call predecessors, (8), 4 states have call successors, (8) [2022-07-14 06:59:46,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:59:46,316 INFO L93 Difference]: Finished difference Result 88 states and 93 transitions. [2022-07-14 06:59:46,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-14 06:59:46,317 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 3.888888888888889) internal successors, (70), 16 states have internal predecessors, (70), 4 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (8), 6 states have call predecessors, (8), 4 states have call successors, (8) Word has length 41 [2022-07-14 06:59:46,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:59:46,318 INFO L225 Difference]: With dead ends: 88 [2022-07-14 06:59:46,318 INFO L226 Difference]: Without dead ends: 88 [2022-07-14 06:59:46,318 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 106 SyntacticMatches, 18 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=119, Invalid=582, Unknown=1, NotChecked=0, Total=702 [2022-07-14 06:59:46,319 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 67 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 163 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:59:46,319 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 332 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 92 Invalid, 0 Unknown, 163 Unchecked, 0.1s Time] [2022-07-14 06:59:46,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-07-14 06:59:46,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 76. [2022-07-14 06:59:46,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 52 states have (on average 1.4230769230769231) internal successors, (74), 70 states have internal predecessors, (74), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-14 06:59:46,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 80 transitions. [2022-07-14 06:59:46,324 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 80 transitions. Word has length 41 [2022-07-14 06:59:46,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:59:46,325 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 80 transitions. [2022-07-14 06:59:46,325 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 3.888888888888889) internal successors, (70), 16 states have internal predecessors, (70), 4 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (8), 6 states have call predecessors, (8), 4 states have call successors, (8) [2022-07-14 06:59:46,325 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 80 transitions. [2022-07-14 06:59:46,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-14 06:59:46,326 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:59:46,326 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:59:46,341 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Ended with exit code 0 [2022-07-14 06:59:46,555 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-07-14 06:59:46,738 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:59:46,738 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-07-14 06:59:46,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:59:46,739 INFO L85 PathProgramCache]: Analyzing trace with hash 400923137, now seen corresponding path program 1 times [2022-07-14 06:59:46,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:59:46,739 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [164416003] [2022-07-14 06:59:46,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:59:46,739 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:59:46,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:59:46,740 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-14 06:59:46,741 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-14 06:59:46,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:59:46,912 INFO L263 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 26 conjunts are in the unsatisfiable core [2022-07-14 06:59:46,915 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:59:46,930 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-14 06:59:46,936 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-14 06:59:46,970 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-14 06:59:46,974 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-14 06:59:49,082 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:59:49,083 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 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-14 06:59:49,094 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 06:59:49,094 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 12 treesize of output 12 [2022-07-14 06:59:49,163 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-14 06:59:51,303 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:59:51,304 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-14 06:59:51,606 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-14 06:59:51,607 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 18 [2022-07-14 06:59:51,693 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:59:51,693 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:59:51,969 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:59:51,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [164416003] [2022-07-14 06:59:51,969 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [164416003] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:59:51,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1281669969] [2022-07-14 06:59:51,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:59:51,970 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-14 06:59:51,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-14 06:59:51,972 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-14 06:59:51,973 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (12)] Waiting until timeout for monitored process [2022-07-14 06:59:52,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:59:52,287 INFO L263 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 24 conjunts are in the unsatisfiable core [2022-07-14 06:59:52,293 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:59:52,302 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-14 06:59:52,318 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-14 06:59:52,450 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:59:52,452 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 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-14 06:59:52,564 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-14 06:59:54,805 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:59:54,807 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 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-14 06:59:55,013 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-14 06:59:55,153 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:59:55,154 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 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-14 06:59:55,230 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-14 06:59:55,230 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:59:55,427 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1281669969] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:59:55,428 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 06:59:55,428 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 20 [2022-07-14 06:59:55,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264248941] [2022-07-14 06:59:55,428 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 06:59:55,428 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-07-14 06:59:55,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:59:55,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-07-14 06:59:55,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=479, Unknown=3, NotChecked=0, Total=552 [2022-07-14 06:59:55,429 INFO L87 Difference]: Start difference. First operand 76 states and 80 transitions. Second operand has 21 states, 18 states have (on average 3.3333333333333335) internal successors, (60), 16 states have internal predecessors, (60), 5 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-07-14 07:00:00,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 07:00:00,869 INFO L93 Difference]: Finished difference Result 82 states and 85 transitions. [2022-07-14 07:00:00,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-14 07:00:00,870 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 18 states have (on average 3.3333333333333335) internal successors, (60), 16 states have internal predecessors, (60), 5 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 41 [2022-07-14 07:00:00,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 07:00:00,871 INFO L225 Difference]: With dead ends: 82 [2022-07-14 07:00:00,871 INFO L226 Difference]: Without dead ends: 82 [2022-07-14 07:00:00,871 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 64 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 12.2s TimeCoverageRelationStatistics Valid=115, Invalid=810, Unknown=5, NotChecked=0, Total=930 [2022-07-14 07:00:00,872 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 4 mSDsluCounter, 443 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 157 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-14 07:00:00,872 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 503 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 119 Invalid, 0 Unknown, 157 Unchecked, 0.3s Time] [2022-07-14 07:00:00,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-07-14 07:00:00,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2022-07-14 07:00:00,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 58 states have (on average 1.3620689655172413) internal successors, (79), 75 states have internal predecessors, (79), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-14 07:00:00,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 85 transitions. [2022-07-14 07:00:00,877 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 85 transitions. Word has length 41 [2022-07-14 07:00:00,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 07:00:00,877 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 85 transitions. [2022-07-14 07:00:00,877 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 18 states have (on average 3.3333333333333335) internal successors, (60), 16 states have internal predecessors, (60), 5 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-07-14 07:00:00,877 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 85 transitions. [2022-07-14 07:00:00,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-07-14 07:00:00,878 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 07:00:00,878 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 07:00:00,894 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-14 07:00:01,082 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (12)] Forceful destruction successful, exit code 0 [2022-07-14 07:00:01,279 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2022-07-14 07:00:01,279 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-07-14 07:00:01,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 07:00:01,279 INFO L85 PathProgramCache]: Analyzing trace with hash -456284671, now seen corresponding path program 1 times [2022-07-14 07:00:01,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 07:00:01,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1175711267] [2022-07-14 07:00:01,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:00:01,280 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 07:00:01,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 07:00:01,281 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-14 07:00:01,283 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-14 07:00:01,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:00:01,426 INFO L263 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-14 07:00:01,428 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 07:00:01,437 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-14 07:00:01,510 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-07-14 07:00:01,510 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 07:00:01,511 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 07:00:01,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1175711267] [2022-07-14 07:00:01,511 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1175711267] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 07:00:01,511 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 07:00:01,511 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-14 07:00:01,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064476486] [2022-07-14 07:00:01,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 07:00:01,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 07:00:01,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 07:00:01,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 07:00:01,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 07:00:01,512 INFO L87 Difference]: Start difference. First operand 82 states and 85 transitions. Second operand has 6 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-14 07:00:01,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 07:00:01,716 INFO L93 Difference]: Finished difference Result 81 states and 84 transitions. [2022-07-14 07:00:01,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 07:00:01,717 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 42 [2022-07-14 07:00:01,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 07:00:01,717 INFO L225 Difference]: With dead ends: 81 [2022-07-14 07:00:01,717 INFO L226 Difference]: Without dead ends: 81 [2022-07-14 07:00:01,718 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-14 07:00:01,718 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 44 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 07:00:01,718 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 164 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-14 07:00:01,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-07-14 07:00:01,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2022-07-14 07:00:01,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 58 states have (on average 1.3448275862068966) internal successors, (78), 74 states have internal predecessors, (78), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-14 07:00:01,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 84 transitions. [2022-07-14 07:00:01,723 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 84 transitions. Word has length 42 [2022-07-14 07:00:01,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 07:00:01,723 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 84 transitions. [2022-07-14 07:00:01,723 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-14 07:00:01,724 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 84 transitions. [2022-07-14 07:00:01,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-07-14 07:00:01,724 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 07:00:01,724 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 07:00:01,737 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Ended with exit code 0 [2022-07-14 07:00:01,934 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-14 07:00:01,935 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-07-14 07:00:01,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 07:00:01,935 INFO L85 PathProgramCache]: Analyzing trace with hash -456284672, now seen corresponding path program 1 times [2022-07-14 07:00:01,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 07:00:01,935 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [489922535] [2022-07-14 07:00:01,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:00:01,936 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 07:00:01,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 07:00:01,937 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-14 07:00:01,939 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-14 07:00:02,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:00:02,092 INFO L263 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-14 07:00:02,094 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 07:00:02,099 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 07:00:02,139 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-07-14 07:00:02,139 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 07:00:02,139 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 07:00:02,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [489922535] [2022-07-14 07:00:02,140 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [489922535] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 07:00:02,140 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 07:00:02,140 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-14 07:00:02,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701623465] [2022-07-14 07:00:02,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 07:00:02,140 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 07:00:02,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 07:00:02,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 07:00:02,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 07:00:02,141 INFO L87 Difference]: Start difference. First operand 81 states and 84 transitions. Second operand has 6 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-14 07:00:02,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 07:00:02,351 INFO L93 Difference]: Finished difference Result 92 states and 96 transitions. [2022-07-14 07:00:02,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 07:00:02,352 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 42 [2022-07-14 07:00:02,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 07:00:02,353 INFO L225 Difference]: With dead ends: 92 [2022-07-14 07:00:02,353 INFO L226 Difference]: Without dead ends: 92 [2022-07-14 07:00:02,353 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-14 07:00:02,354 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 40 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 07:00:02,354 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 161 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-14 07:00:02,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-07-14 07:00:02,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 80. [2022-07-14 07:00:02,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 58 states have (on average 1.3275862068965518) internal successors, (77), 73 states have internal predecessors, (77), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-14 07:00:02,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 83 transitions. [2022-07-14 07:00:02,358 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 83 transitions. Word has length 42 [2022-07-14 07:00:02,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 07:00:02,359 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 83 transitions. [2022-07-14 07:00:02,359 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-14 07:00:02,359 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 83 transitions. [2022-07-14 07:00:02,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-14 07:00:02,360 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 07:00:02,360 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 07:00:02,371 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Ended with exit code 0 [2022-07-14 07:00:02,567 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-14 07:00:02,568 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-07-14 07:00:02,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 07:00:02,568 INFO L85 PathProgramCache]: Analyzing trace with hash -402905503, now seen corresponding path program 1 times [2022-07-14 07:00:02,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 07:00:02,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1497026261] [2022-07-14 07:00:02,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:00:02,569 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 07:00:02,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 07:00:02,570 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-14 07:00:02,570 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-14 07:00:02,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:00:02,719 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-14 07:00:02,720 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 07:00:02,729 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-07-14 07:00:02,729 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 07:00:02,730 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 07:00:02,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1497026261] [2022-07-14 07:00:02,730 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1497026261] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 07:00:02,730 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 07:00:02,730 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 07:00:02,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846046496] [2022-07-14 07:00:02,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 07:00:02,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 07:00:02,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 07:00:02,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 07:00:02,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 07:00:02,731 INFO L87 Difference]: Start difference. First operand 80 states and 83 transitions. Second operand has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-14 07:00:02,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 07:00:02,813 INFO L93 Difference]: Finished difference Result 91 states and 95 transitions. [2022-07-14 07:00:02,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 07:00:02,813 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 44 [2022-07-14 07:00:02,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 07:00:02,814 INFO L225 Difference]: With dead ends: 91 [2022-07-14 07:00:02,814 INFO L226 Difference]: Without dead ends: 91 [2022-07-14 07:00:02,814 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 42 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-14 07:00:02,815 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 35 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 07:00:02,815 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 69 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 07:00:02,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-07-14 07:00:02,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 79. [2022-07-14 07:00:02,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 58 states have (on average 1.3103448275862069) internal successors, (76), 72 states have internal predecessors, (76), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-14 07:00:02,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 82 transitions. [2022-07-14 07:00:02,818 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 82 transitions. Word has length 44 [2022-07-14 07:00:02,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 07:00:02,819 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 82 transitions. [2022-07-14 07:00:02,819 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-14 07:00:02,819 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 82 transitions. [2022-07-14 07:00:02,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-14 07:00:02,819 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 07:00:02,819 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 07:00:02,832 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-14 07:00:03,020 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-14 07:00:03,020 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-07-14 07:00:03,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 07:00:03,021 INFO L85 PathProgramCache]: Analyzing trace with hash -402905502, now seen corresponding path program 1 times [2022-07-14 07:00:03,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 07:00:03,021 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2016990521] [2022-07-14 07:00:03,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:00:03,021 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 07:00:03,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 07:00:03,022 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-14 07:00:03,024 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-14 07:00:03,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:00:03,209 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-14 07:00:03,211 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 07:00:03,300 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-07-14 07:00:03,300 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 07:00:03,300 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 07:00:03,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2016990521] [2022-07-14 07:00:03,300 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2016990521] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 07:00:03,300 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 07:00:03,301 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 07:00:03,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039505664] [2022-07-14 07:00:03,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 07:00:03,301 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 07:00:03,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 07:00:03,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 07:00:03,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-14 07:00:03,302 INFO L87 Difference]: Start difference. First operand 79 states and 82 transitions. Second operand has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-14 07:00:03,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 07:00:03,432 INFO L93 Difference]: Finished difference Result 78 states and 81 transitions. [2022-07-14 07:00:03,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 07:00:03,434 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), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 44 [2022-07-14 07:00:03,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 07:00:03,435 INFO L225 Difference]: With dead ends: 78 [2022-07-14 07:00:03,435 INFO L226 Difference]: Without dead ends: 78 [2022-07-14 07:00:03,435 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-07-14 07:00:03,436 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 80 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 07:00:03,436 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 88 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 07:00:03,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-07-14 07:00:03,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2022-07-14 07:00:03,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 58 states have (on average 1.293103448275862) internal successors, (75), 71 states have internal predecessors, (75), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-14 07:00:03,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 81 transitions. [2022-07-14 07:00:03,439 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 81 transitions. Word has length 44 [2022-07-14 07:00:03,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 07:00:03,439 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 81 transitions. [2022-07-14 07:00:03,439 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), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-14 07:00:03,439 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 81 transitions. [2022-07-14 07:00:03,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-14 07:00:03,440 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 07:00:03,440 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 07:00:03,458 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-14 07:00:03,654 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-14 07:00:03,654 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-07-14 07:00:03,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 07:00:03,654 INFO L85 PathProgramCache]: Analyzing trace with hash -645131486, now seen corresponding path program 1 times [2022-07-14 07:00:03,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 07:00:03,655 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [295494641] [2022-07-14 07:00:03,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:00:03,655 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 07:00:03,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 07:00:03,656 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-14 07:00:03,657 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-14 07:00:03,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:00:03,810 INFO L263 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-14 07:00:03,812 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 07:00:03,840 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-07-14 07:00:03,840 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 07:00:03,840 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 07:00:03,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [295494641] [2022-07-14 07:00:03,840 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [295494641] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 07:00:03,840 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 07:00:03,840 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 07:00:03,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913354595] [2022-07-14 07:00:03,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 07:00:03,841 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 07:00:03,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 07:00:03,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 07:00:03,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 07:00:03,842 INFO L87 Difference]: Start difference. First operand 78 states and 81 transitions. Second operand has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-14 07:00:03,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 07:00:03,946 INFO L93 Difference]: Finished difference Result 89 states and 93 transitions. [2022-07-14 07:00:03,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 07:00:03,947 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 46 [2022-07-14 07:00:03,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 07:00:03,947 INFO L225 Difference]: With dead ends: 89 [2022-07-14 07:00:03,947 INFO L226 Difference]: Without dead ends: 89 [2022-07-14 07:00:03,948 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 43 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-14 07:00:03,948 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 80 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 07:00:03,948 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 83 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 07:00:03,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-07-14 07:00:03,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 77. [2022-07-14 07:00:03,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 58 states have (on average 1.2758620689655173) internal successors, (74), 70 states have internal predecessors, (74), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-14 07:00:03,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 80 transitions. [2022-07-14 07:00:03,952 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 80 transitions. Word has length 46 [2022-07-14 07:00:03,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 07:00:03,952 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 80 transitions. [2022-07-14 07:00:03,952 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-14 07:00:03,953 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 80 transitions. [2022-07-14 07:00:03,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-14 07:00:03,953 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 07:00:03,953 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 07:00:03,965 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2022-07-14 07:00:04,163 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-14 07:00:04,164 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-07-14 07:00:04,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 07:00:04,164 INFO L85 PathProgramCache]: Analyzing trace with hash -645131485, now seen corresponding path program 1 times [2022-07-14 07:00:04,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 07:00:04,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1136201906] [2022-07-14 07:00:04,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:00:04,164 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 07:00:04,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 07:00:04,166 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-14 07:00:04,167 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-14 07:00:04,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:00:04,315 INFO L263 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-14 07:00:04,317 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 07:00:04,394 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-07-14 07:00:04,395 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 07:00:04,395 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 07:00:04,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1136201906] [2022-07-14 07:00:04,395 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1136201906] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 07:00:04,395 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 07:00:04,395 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 07:00:04,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158741454] [2022-07-14 07:00:04,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 07:00:04,396 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 07:00:04,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 07:00:04,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 07:00:04,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-14 07:00:04,396 INFO L87 Difference]: Start difference. First operand 77 states and 80 transitions. Second operand has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-14 07:00:04,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 07:00:04,479 INFO L93 Difference]: Finished difference Result 75 states and 78 transitions. [2022-07-14 07:00:04,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 07:00:04,480 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 46 [2022-07-14 07:00:04,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 07:00:04,481 INFO L225 Difference]: With dead ends: 75 [2022-07-14 07:00:04,481 INFO L226 Difference]: Without dead ends: 75 [2022-07-14 07:00:04,482 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 42 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-14 07:00:04,482 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 103 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 07:00:04,482 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 70 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 07:00:04,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-07-14 07:00:04,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2022-07-14 07:00:04,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 58 states have (on average 1.2413793103448276) internal successors, (72), 68 states have internal predecessors, (72), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-14 07:00:04,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 78 transitions. [2022-07-14 07:00:04,486 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 78 transitions. Word has length 46 [2022-07-14 07:00:04,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 07:00:04,486 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 78 transitions. [2022-07-14 07:00:04,486 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-14 07:00:04,486 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 78 transitions. [2022-07-14 07:00:04,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-07-14 07:00:04,487 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 07:00:04,487 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 07:00:04,499 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Ended with exit code 0 [2022-07-14 07:00:04,698 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-14 07:00:04,698 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-07-14 07:00:04,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 07:00:04,699 INFO L85 PathProgramCache]: Analyzing trace with hash 866562379, now seen corresponding path program 1 times [2022-07-14 07:00:04,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 07:00:04,699 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [723086524] [2022-07-14 07:00:04,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:00:04,699 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 07:00:04,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 07:00:04,700 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-14 07:00:04,701 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-14 07:00:04,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:00:04,867 INFO L263 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 15 conjunts are in the unsatisfiable core [2022-07-14 07:00:04,869 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 07:00:04,882 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-14 07:00:04,948 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-14 07:00:04,962 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-07-14 07:00:04,983 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-07-14 07:00:04,983 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 07:00:04,983 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 07:00:04,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [723086524] [2022-07-14 07:00:04,983 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [723086524] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 07:00:04,983 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 07:00:04,983 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-14 07:00:04,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410760341] [2022-07-14 07:00:04,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 07:00:04,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-14 07:00:04,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 07:00:04,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-14 07:00:04,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-07-14 07:00:04,984 INFO L87 Difference]: Start difference. First operand 75 states and 78 transitions. Second operand has 10 states, 8 states have (on average 4.0) internal successors, (32), 9 states have internal predecessors, (32), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-14 07:00:05,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 07:00:05,438 INFO L93 Difference]: Finished difference Result 106 states and 112 transitions. [2022-07-14 07:00:05,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-14 07:00:05,438 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 4.0) internal successors, (32), 9 states have internal predecessors, (32), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 49 [2022-07-14 07:00:05,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 07:00:05,439 INFO L225 Difference]: With dead ends: 106 [2022-07-14 07:00:05,439 INFO L226 Difference]: Without dead ends: 106 [2022-07-14 07:00:05,439 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2022-07-14 07:00:05,440 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 136 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-14 07:00:05,440 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 203 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-14 07:00:05,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-07-14 07:00:05,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 76. [2022-07-14 07:00:05,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 60 states have (on average 1.25) internal successors, (75), 69 states have internal predecessors, (75), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-14 07:00:05,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 81 transitions. [2022-07-14 07:00:05,443 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 81 transitions. Word has length 49 [2022-07-14 07:00:05,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 07:00:05,443 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 81 transitions. [2022-07-14 07:00:05,444 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 4.0) internal successors, (32), 9 states have internal predecessors, (32), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-14 07:00:05,444 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 81 transitions. [2022-07-14 07:00:05,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-07-14 07:00:05,444 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 07:00:05,445 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 07:00:05,454 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-14 07:00:05,651 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-14 07:00:05,651 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-07-14 07:00:05,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 07:00:05,652 INFO L85 PathProgramCache]: Analyzing trace with hash 866562380, now seen corresponding path program 1 times [2022-07-14 07:00:05,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 07:00:05,655 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [371027396] [2022-07-14 07:00:05,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:00:05,655 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 07:00:05,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 07:00:05,656 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-14 07:00:05,660 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-14 07:00:05,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:00:05,818 INFO L263 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 24 conjunts are in the unsatisfiable core [2022-07-14 07:00:05,820 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 07:00:05,843 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-14 07:00:05,985 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-14 07:00:05,991 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-14 07:00:06,016 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-14 07:00:06,020 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-14 07:00:06,068 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-07-14 07:00:06,069 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 07:00:06,069 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 07:00:06,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [371027396] [2022-07-14 07:00:06,069 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [371027396] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 07:00:06,069 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 07:00:06,069 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-14 07:00:06,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578790371] [2022-07-14 07:00:06,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 07:00:06,069 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-14 07:00:06,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 07:00:06,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-14 07:00:06,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-07-14 07:00:06,070 INFO L87 Difference]: Start difference. First operand 76 states and 81 transitions. Second operand has 10 states, 8 states have (on average 4.0) internal successors, (32), 9 states have internal predecessors, (32), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-14 07:00:06,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 07:00:06,496 INFO L93 Difference]: Finished difference Result 98 states and 103 transitions. [2022-07-14 07:00:06,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-14 07:00:06,498 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 4.0) internal successors, (32), 9 states have internal predecessors, (32), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 49 [2022-07-14 07:00:06,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 07:00:06,498 INFO L225 Difference]: With dead ends: 98 [2022-07-14 07:00:06,498 INFO L226 Difference]: Without dead ends: 98 [2022-07-14 07:00:06,499 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2022-07-14 07:00:06,499 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 188 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-14 07:00:06,499 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 212 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-14 07:00:06,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-07-14 07:00:06,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 78. [2022-07-14 07:00:06,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 62 states have (on average 1.2258064516129032) internal successors, (76), 71 states have internal predecessors, (76), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-14 07:00:06,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 82 transitions. [2022-07-14 07:00:06,505 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 82 transitions. Word has length 49 [2022-07-14 07:00:06,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 07:00:06,506 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 82 transitions. [2022-07-14 07:00:06,506 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 4.0) internal successors, (32), 9 states have internal predecessors, (32), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-14 07:00:06,506 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 82 transitions. [2022-07-14 07:00:06,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-07-14 07:00:06,506 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 07:00:06,506 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 07:00:06,518 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-14 07:00:06,718 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-14 07:00:06,718 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-07-14 07:00:06,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 07:00:06,719 INFO L85 PathProgramCache]: Analyzing trace with hash 1093628647, now seen corresponding path program 1 times [2022-07-14 07:00:06,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 07:00:06,719 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [571561392] [2022-07-14 07:00:06,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:00:06,719 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 07:00:06,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 07:00:06,721 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-14 07:00:06,723 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-14 07:00:06,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:00:06,877 INFO L263 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-14 07:00:06,879 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 07:00:06,967 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-14 07:00:06,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 16 treesize of output 8 [2022-07-14 07:00:07,001 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-07-14 07:00:07,001 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 07:00:07,001 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 07:00:07,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [571561392] [2022-07-14 07:00:07,002 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [571561392] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 07:00:07,002 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 07:00:07,002 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-14 07:00:07,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114589730] [2022-07-14 07:00:07,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 07:00:07,002 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-14 07:00:07,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 07:00:07,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-14 07:00:07,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-07-14 07:00:07,003 INFO L87 Difference]: Start difference. First operand 78 states and 82 transitions. Second operand has 10 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-14 07:00:07,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 07:00:07,252 INFO L93 Difference]: Finished difference Result 81 states and 84 transitions. [2022-07-14 07:00:07,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-14 07:00:07,253 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 50 [2022-07-14 07:00:07,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 07:00:07,254 INFO L225 Difference]: With dead ends: 81 [2022-07-14 07:00:07,254 INFO L226 Difference]: Without dead ends: 81 [2022-07-14 07:00:07,254 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2022-07-14 07:00:07,255 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 120 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 07:00:07,255 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 245 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-14 07:00:07,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-07-14 07:00:07,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 78. [2022-07-14 07:00:07,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 62 states have (on average 1.2096774193548387) internal successors, (75), 71 states have internal predecessors, (75), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-14 07:00:07,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 81 transitions. [2022-07-14 07:00:07,258 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 81 transitions. Word has length 50 [2022-07-14 07:00:07,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 07:00:07,258 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 81 transitions. [2022-07-14 07:00:07,258 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-14 07:00:07,258 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 81 transitions. [2022-07-14 07:00:07,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-07-14 07:00:07,259 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 07:00:07,259 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 07:00:07,271 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-14 07:00:07,470 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-14 07:00:07,471 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-07-14 07:00:07,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 07:00:07,472 INFO L85 PathProgramCache]: Analyzing trace with hash -1290611022, now seen corresponding path program 1 times [2022-07-14 07:00:07,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 07:00:07,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [565422905] [2022-07-14 07:00:07,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:00:07,472 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 07:00:07,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 07:00:07,473 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-14 07:00:07,474 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-14 07:00:07,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:00:07,741 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 36 conjunts are in the unsatisfiable core [2022-07-14 07:00:07,744 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 07:00:07,913 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-14 07:00:08,125 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 07:00:08,125 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-14 07:00:08,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, 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-14 07:00:08,164 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-14 07:00:08,174 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 07:00:08,175 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-14 07:00:08,248 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2022-07-14 07:00:08,254 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-14 07:00:08,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 15 treesize of output 7 [2022-07-14 07:00:08,419 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-07-14 07:00:08,419 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 07:00:08,419 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 07:00:08,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [565422905] [2022-07-14 07:00:08,419 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [565422905] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 07:00:08,419 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 07:00:08,419 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-07-14 07:00:08,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278832428] [2022-07-14 07:00:08,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 07:00:08,420 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-14 07:00:08,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 07:00:08,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-14 07:00:08,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2022-07-14 07:00:08,421 INFO L87 Difference]: Start difference. First operand 78 states and 81 transitions. Second operand has 14 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-14 07:00:08,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 07:00:08,758 INFO L93 Difference]: Finished difference Result 79 states and 82 transitions. [2022-07-14 07:00:08,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-14 07:00:08,759 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 53 [2022-07-14 07:00:08,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 07:00:08,760 INFO L225 Difference]: With dead ends: 79 [2022-07-14 07:00:08,760 INFO L226 Difference]: Without dead ends: 79 [2022-07-14 07:00:08,760 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2022-07-14 07:00:08,761 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 13 mSDsluCounter, 365 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 89 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 07:00:08,761 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 404 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 94 Invalid, 0 Unknown, 89 Unchecked, 0.2s Time] [2022-07-14 07:00:08,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-07-14 07:00:08,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2022-07-14 07:00:08,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 63 states have (on average 1.2063492063492063) internal successors, (76), 72 states have internal predecessors, (76), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-14 07:00:08,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 82 transitions. [2022-07-14 07:00:08,763 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 82 transitions. Word has length 53 [2022-07-14 07:00:08,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 07:00:08,763 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 82 transitions. [2022-07-14 07:00:08,763 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-14 07:00:08,763 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 82 transitions. [2022-07-14 07:00:08,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-07-14 07:00:08,764 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 07:00:08,764 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 07:00:08,778 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Ended with exit code 0 [2022-07-14 07:00:08,972 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-14 07:00:08,972 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-07-14 07:00:08,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 07:00:08,973 INFO L85 PathProgramCache]: Analyzing trace with hash -1354235562, now seen corresponding path program 1 times [2022-07-14 07:00:08,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 07:00:08,973 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1277971574] [2022-07-14 07:00:08,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:00:08,973 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 07:00:08,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 07:00:08,974 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-14 07:00:08,975 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-14 07:00:09,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:00:09,241 INFO L263 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 49 conjunts are in the unsatisfiable core [2022-07-14 07:00:09,245 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 07:00:09,293 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-14 07:00:09,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 12 treesize of output 8 [2022-07-14 07:00:09,678 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-14 07:00:09,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 25 [2022-07-14 07:00:09,698 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-14 07:00:09,698 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 17 treesize of output 22 [2022-07-14 07:00:09,707 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-14 07:00:09,978 INFO L356 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2022-07-14 07:00:09,978 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 26 [2022-07-14 07:00:10,097 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-14 07:00:10,110 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 07:00:10,111 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 0 case distinctions, treesize of input 36 treesize of output 27 [2022-07-14 07:00:10,215 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-14 07:00:10,414 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-14 07:00:10,415 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 48 treesize of output 27 [2022-07-14 07:00:10,875 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 26 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-14 07:00:10,875 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 07:00:11,230 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 84 treesize of output 80 [2022-07-14 07:00:18,626 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 07:00:18,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1277971574] [2022-07-14 07:00:18,626 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1277971574] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 07:00:18,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [938176098] [2022-07-14 07:00:18,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:00:18,626 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-14 07:00:18,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-14 07:00:18,629 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-14 07:00:18,630 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (24)] Waiting until timeout for monitored process [2022-07-14 07:00:19,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:00:19,062 INFO L263 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 49 conjunts are in the unsatisfiable core [2022-07-14 07:00:19,064 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 07:00:19,183 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-14 07:00:19,711 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 12 treesize of output 8 [2022-07-14 07:00:19,857 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-14 07:00:19,858 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 19 treesize of output 25 [2022-07-14 07:00:19,874 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-14 07:00:19,874 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 17 treesize of output 22 [2022-07-14 07:00:19,885 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 10 treesize of output 8 [2022-07-14 07:00:20,474 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 07:00:20,479 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 38 [2022-07-14 07:00:20,835 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 07:00:20,837 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 0 case distinctions, treesize of input 48 treesize of output 39 [2022-07-14 07:00:20,876 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-14 07:00:21,096 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-14 07:00:21,901 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 07:00:21,901 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 1 case distinctions, treesize of input 44 treesize of output 23 [2022-07-14 07:00:22,091 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 26 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-14 07:00:22,091 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 07:00:22,119 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 84 treesize of output 80 [2022-07-14 07:00:22,784 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [938176098] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 07:00:22,784 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 07:00:22,784 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 37 [2022-07-14 07:00:22,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674642294] [2022-07-14 07:00:22,785 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 07:00:22,785 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-07-14 07:00:22,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 07:00:22,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-07-14 07:00:22,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=2172, Unknown=3, NotChecked=0, Total=2352 [2022-07-14 07:00:22,786 INFO L87 Difference]: Start difference. First operand 79 states and 82 transitions. Second operand has 38 states, 35 states have (on average 2.0) internal successors, (70), 33 states have internal predecessors, (70), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-14 07:00:23,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 07:00:23,174 INFO L93 Difference]: Finished difference Result 81 states and 86 transitions. [2022-07-14 07:00:23,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-14 07:00:23,174 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 35 states have (on average 2.0) internal successors, (70), 33 states have internal predecessors, (70), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 54 [2022-07-14 07:00:23,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 07:00:23,175 INFO L225 Difference]: With dead ends: 81 [2022-07-14 07:00:23,175 INFO L226 Difference]: Without dead ends: 81 [2022-07-14 07:00:23,176 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 82 SyntacticMatches, 9 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 975 ImplicationChecksByTransitivity, 11.0s TimeCoverageRelationStatistics Valid=214, Invalid=2435, Unknown=3, NotChecked=0, Total=2652 [2022-07-14 07:00:23,177 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 29 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 236 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 07:00:23,178 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 379 Invalid, 341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 101 Invalid, 0 Unknown, 236 Unchecked, 0.2s Time] [2022-07-14 07:00:23,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-07-14 07:00:23,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2022-07-14 07:00:23,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 65 states have (on average 1.2307692307692308) internal successors, (80), 74 states have internal predecessors, (80), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-14 07:00:23,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 86 transitions. [2022-07-14 07:00:23,182 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 86 transitions. Word has length 54 [2022-07-14 07:00:23,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 07:00:23,183 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 86 transitions. [2022-07-14 07:00:23,183 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 35 states have (on average 2.0) internal successors, (70), 33 states have internal predecessors, (70), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-14 07:00:23,183 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 86 transitions. [2022-07-14 07:00:23,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-07-14 07:00:23,184 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 07:00:23,184 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 07:00:23,190 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (24)] Forceful destruction successful, exit code 0 [2022-07-14 07:00:23,396 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Forceful destruction successful, exit code 0 [2022-07-14 07:00:23,587 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 07:00:23,588 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-07-14 07:00:23,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 07:00:23,588 INFO L85 PathProgramCache]: Analyzing trace with hash -1354235561, now seen corresponding path program 1 times [2022-07-14 07:00:23,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 07:00:23,589 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [944637244] [2022-07-14 07:00:23,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:00:23,589 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 07:00:23,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 07:00:23,590 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-14 07:00:23,591 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-14 07:00:23,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:00:23,870 INFO L263 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 66 conjunts are in the unsatisfiable core [2022-07-14 07:00:23,874 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 07:00:23,920 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-14 07:00:24,129 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 9 treesize of output 5 [2022-07-14 07:00:24,137 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 7 treesize of output 3 [2022-07-14 07:00:24,429 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-14 07:00:24,430 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-14 07:00:24,449 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-07-14 07:00:24,449 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 14 treesize of output 16 [2022-07-14 07:00:24,458 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 5 [2022-07-14 07:00:24,506 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-14 07:00:24,506 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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-14 07:00:24,518 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-14 07:00:24,833 INFO L356 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2022-07-14 07:00:24,833 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 20 [2022-07-14 07:00:24,860 INFO L356 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2022-07-14 07:00:24,860 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 22 [2022-07-14 07:00:24,987 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 07:00:24,988 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 0 case distinctions, treesize of input 32 treesize of output 23 [2022-07-14 07:00:24,996 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 07:00:24,997 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 0 case distinctions, treesize of input 30 treesize of output 25 [2022-07-14 07:00:25,346 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 07:00:25,364 INFO L356 Elim1Store]: treesize reduction 31, result has 8.8 percent of original size [2022-07-14 07:00:25,364 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 75 treesize of output 43 [2022-07-14 07:00:25,373 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 07:00:25,380 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-14 07:00:25,380 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 1 case distinctions, treesize of input 28 treesize of output 18 [2022-07-14 07:00:25,981 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 26 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-14 07:00:25,982 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 07:00:30,833 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 07:00:30,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [944637244] [2022-07-14 07:00:30,833 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [944637244] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 07:00:30,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1361493019] [2022-07-14 07:00:30,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:00:30,833 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-14 07:00:30,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-14 07:00:30,835 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-14 07:00:30,837 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (26)] Waiting until timeout for monitored process [2022-07-14 07:00:31,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:00:31,263 INFO L263 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 70 conjunts are in the unsatisfiable core [2022-07-14 07:00:31,266 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 07:00:31,440 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-14 07:00:31,446 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-14 07:00:32,529 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 22 treesize of output 14 [2022-07-14 07:00:32,534 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 7 treesize of output 3 [2022-07-14 07:00:33,619 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-14 07:00:33,619 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 28 treesize of output 32 [2022-07-14 07:00:33,624 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 07:00:33,625 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 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-14 07:00:33,638 INFO L356 Elim1Store]: treesize reduction 4, result has 60.0 percent of original size [2022-07-14 07:00:33,638 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 17 treesize of output 17 [2022-07-14 07:00:33,645 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 10 [2022-07-14 07:00:33,684 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-14 07:00:33,684 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-14 07:00:33,694 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-14 07:00:34,480 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 07:00:34,481 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2022-07-14 07:00:34,501 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 07:00:34,502 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2022-07-14 07:00:34,763 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 07:00:34,764 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 0 case distinctions, treesize of input 40 treesize of output 27 [2022-07-14 07:00:34,778 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 07:00:34,779 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 0 case distinctions, treesize of input 30 treesize of output 25 [2022-07-14 07:00:35,422 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 07:00:35,427 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 07:00:35,427 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 82 treesize of output 42 [2022-07-14 07:00:35,435 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 07:00:35,442 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-14 07:00:35,442 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 18 [2022-07-14 07:00:36,078 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 20 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-14 07:00:36,079 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 07:00:41,028 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1361493019] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 07:00:41,028 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 07:00:41,028 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 46 [2022-07-14 07:00:41,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572934895] [2022-07-14 07:00:41,028 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 07:00:41,029 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-07-14 07:00:41,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 07:00:41,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-07-14 07:00:41,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=3191, Unknown=28, NotChecked=0, Total=3422 [2022-07-14 07:00:41,030 INFO L87 Difference]: Start difference. First operand 81 states and 86 transitions. Second operand has 47 states, 44 states have (on average 1.9772727272727273) internal successors, (87), 41 states have internal predecessors, (87), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-14 07:00:43,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 07:00:43,365 INFO L93 Difference]: Finished difference Result 81 states and 85 transitions. [2022-07-14 07:00:43,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-14 07:00:43,366 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 44 states have (on average 1.9772727272727273) internal successors, (87), 41 states have internal predecessors, (87), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 54 [2022-07-14 07:00:43,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 07:00:43,366 INFO L225 Difference]: With dead ends: 81 [2022-07-14 07:00:43,366 INFO L226 Difference]: Without dead ends: 81 [2022-07-14 07:00:43,368 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 77 SyntacticMatches, 5 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1657 ImplicationChecksByTransitivity, 15.9s TimeCoverageRelationStatistics Valid=308, Invalid=4773, Unknown=31, NotChecked=0, Total=5112 [2022-07-14 07:00:43,368 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 19 mSDsluCounter, 677 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 712 SdHoareTripleChecker+Invalid, 449 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 256 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 07:00:43,369 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 712 Invalid, 449 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 189 Invalid, 0 Unknown, 256 Unchecked, 0.2s Time] [2022-07-14 07:00:43,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-07-14 07:00:43,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2022-07-14 07:00:43,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 65 states have (on average 1.2153846153846153) internal successors, (79), 74 states have internal predecessors, (79), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-14 07:00:43,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 85 transitions. [2022-07-14 07:00:43,372 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 85 transitions. Word has length 54 [2022-07-14 07:00:43,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 07:00:43,372 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 85 transitions. [2022-07-14 07:00:43,372 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 44 states have (on average 1.9772727272727273) internal successors, (87), 41 states have internal predecessors, (87), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-14 07:00:43,372 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 85 transitions. [2022-07-14 07:00:43,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-07-14 07:00:43,373 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 07:00:43,373 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 07:00:43,386 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-14 07:00:43,587 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (26)] Forceful destruction successful, exit code 0 [2022-07-14 07:00:43,783 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3,26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2022-07-14 07:00:43,784 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-07-14 07:00:43,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 07:00:43,784 INFO L85 PathProgramCache]: Analyzing trace with hash 968369212, now seen corresponding path program 1 times [2022-07-14 07:00:43,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 07:00:43,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [131929249] [2022-07-14 07:00:43,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:00:43,785 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 07:00:43,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 07:00:43,786 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-14 07:00:43,788 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-14 07:00:44,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:00:44,059 INFO L263 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 44 conjunts are in the unsatisfiable core [2022-07-14 07:00:44,062 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 07:00:44,162 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 6 treesize of output 5 [2022-07-14 07:00:44,247 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 8 treesize of output 4 [2022-07-14 07:00:44,432 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-14 07:00:44,432 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 15 treesize of output 21 [2022-07-14 07:00:44,441 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 6 treesize of output 4 [2022-07-14 07:00:44,670 INFO L356 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2022-07-14 07:00:44,670 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 21 [2022-07-14 07:00:44,776 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 07:00:44,777 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 0 case distinctions, treesize of input 31 treesize of output 22 [2022-07-14 07:00:44,787 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-14 07:00:44,860 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-14 07:00:45,005 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-14 07:00:45,005 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 31 treesize of output 14 [2022-07-14 07:00:45,091 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 20 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-14 07:00:45,091 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 07:00:45,241 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 82 treesize of output 78 [2022-07-14 07:00:53,418 WARN L233 SmtUtils]: Spent 8.07s on a formula simplification. DAG size of input: 33 DAG size of output: 30 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-14 07:00:55,469 WARN L833 $PredicateComparison]: unable to prove that (and (not (= (let ((.cse2 (bvadd |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset| (_ bv4 32)))) (select (let ((.cse0 (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_prepend_~new_head~1#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_prepend_~new_head~1#1.base|) .cse2 |c_ULTIMATE.start_sll_prepend_#t~mem8#1.base|)))) (store .cse1 |c_ULTIMATE.start_sll_prepend_~head#1.base| (store (select .cse1 |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset| |c_ULTIMATE.start_sll_prepend_~new_head~1#1.base|))))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) .cse2)) (_ bv0 32))) (or (and (= |c_ULTIMATE.start_main_~#s~0#1.base| |c_ULTIMATE.start_sll_prepend_~head#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_sll_prepend_~head#1.offset|)) (forall ((v_arrayElimCell_106 (_ BitVec 32))) (not (= (select (let ((.cse3 (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_prepend_~new_head~1#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_prepend_~new_head~1#1.base|) (bvadd |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset| (_ bv4 32)) |c_ULTIMATE.start_sll_prepend_#t~mem8#1.base|)))) (store .cse4 |c_ULTIMATE.start_sll_prepend_~head#1.base| (store (select .cse4 |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset| |c_ULTIMATE.start_sll_prepend_~new_head~1#1.base|))))) (select .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (bvadd v_arrayElimCell_106 (_ bv4 32))) (_ bv0 32)))))) is different from false [2022-07-14 07:00:57,510 WARN L833 $PredicateComparison]: unable to prove that (and (not (= (let ((.cse2 (bvadd |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset| (_ bv4 32)))) (select (let ((.cse0 (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_prepend_~new_head~1#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_prepend_~new_head~1#1.base|) .cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset|))))) (store .cse1 |c_ULTIMATE.start_sll_prepend_~head#1.base| (store (select .cse1 |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset| |c_ULTIMATE.start_sll_prepend_~new_head~1#1.base|))))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) .cse2)) (_ bv0 32))) (or (and (= |c_ULTIMATE.start_main_~#s~0#1.base| |c_ULTIMATE.start_sll_prepend_~head#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_sll_prepend_~head#1.offset|)) (forall ((v_arrayElimCell_106 (_ BitVec 32))) (not (= (_ bv0 32) (select (let ((.cse3 (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_prepend_~new_head~1#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_prepend_~new_head~1#1.base|) (bvadd |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset| (_ bv4 32)) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset|))))) (store .cse4 |c_ULTIMATE.start_sll_prepend_~head#1.base| (store (select .cse4 |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset| |c_ULTIMATE.start_sll_prepend_~new_head~1#1.base|))))) (select .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (bvadd v_arrayElimCell_106 (_ bv4 32)))))))) is different from false [2022-07-14 07:01:01,072 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 07:01:01,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [131929249] [2022-07-14 07:01:01,072 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [131929249] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 07:01:01,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2138605757] [2022-07-14 07:01:01,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:01:01,073 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-14 07:01:01,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-14 07:01:01,074 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-14 07:01:01,075 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (28)] Waiting until timeout for monitored process [2022-07-14 07:01:01,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:01:01,392 INFO L263 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 43 conjunts are in the unsatisfiable core [2022-07-14 07:01:01,400 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 07:01:01,995 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 8 treesize of output 4 [2022-07-14 07:01:02,110 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-14 07:01:02,110 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 15 treesize of output 21 [2022-07-14 07:01:02,116 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 6 treesize of output 4 [2022-07-14 07:01:02,542 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 07:01:02,543 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2022-07-14 07:01:02,702 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 07:01:02,703 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 0 case distinctions, treesize of input 31 treesize of output 22 [2022-07-14 07:01:02,716 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-14 07:01:02,832 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-14 07:01:03,182 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 07:01:03,182 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 1 case distinctions, treesize of input 31 treesize of output 14 [2022-07-14 07:01:03,189 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 20 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-14 07:01:03,189 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 07:01:03,214 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 82 treesize of output 78 [2022-07-14 07:01:03,873 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2138605757] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 07:01:03,874 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 07:01:03,874 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 38 [2022-07-14 07:01:03,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365507180] [2022-07-14 07:01:03,874 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 07:01:03,874 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-07-14 07:01:03,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 07:01:03,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-07-14 07:01:03,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=1729, Unknown=9, NotChecked=170, Total=2070 [2022-07-14 07:01:03,876 INFO L87 Difference]: Start difference. First operand 81 states and 85 transitions. Second operand has 38 states, 36 states have (on average 1.9722222222222223) internal successors, (71), 33 states have internal predecessors, (71), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-14 07:01:04,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 07:01:04,456 INFO L93 Difference]: Finished difference Result 87 states and 90 transitions. [2022-07-14 07:01:04,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-14 07:01:04,457 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 36 states have (on average 1.9722222222222223) internal successors, (71), 33 states have internal predecessors, (71), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 55 [2022-07-14 07:01:04,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 07:01:04,457 INFO L225 Difference]: With dead ends: 87 [2022-07-14 07:01:04,457 INFO L226 Difference]: Without dead ends: 87 [2022-07-14 07:01:04,458 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 90 SyntacticMatches, 8 SemanticMatches, 51 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 811 ImplicationChecksByTransitivity, 18.3s TimeCoverageRelationStatistics Valid=220, Invalid=2327, Unknown=11, NotChecked=198, Total=2756 [2022-07-14 07:01:04,458 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 26 mSDsluCounter, 737 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 775 SdHoareTripleChecker+Invalid, 439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 180 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-14 07:01:04,459 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 775 Invalid, 439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 255 Invalid, 0 Unknown, 180 Unchecked, 0.3s Time] [2022-07-14 07:01:04,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-07-14 07:01:04,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 81. [2022-07-14 07:01:04,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 65 states have (on average 1.2) internal successors, (78), 74 states have internal predecessors, (78), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-14 07:01:04,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 84 transitions. [2022-07-14 07:01:04,460 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 84 transitions. Word has length 55 [2022-07-14 07:01:04,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 07:01:04,461 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 84 transitions. [2022-07-14 07:01:04,461 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 36 states have (on average 1.9722222222222223) internal successors, (71), 33 states have internal predecessors, (71), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-14 07:01:04,461 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 84 transitions. [2022-07-14 07:01:04,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-07-14 07:01:04,461 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 07:01:04,461 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 07:01:04,465 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (28)] Forceful destruction successful, exit code 0 [2022-07-14 07:01:04,671 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (27)] Ended with exit code 0 [2022-07-14 07:01:04,862 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 07:01:04,862 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-07-14 07:01:04,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 07:01:04,863 INFO L85 PathProgramCache]: Analyzing trace with hash -45283592, now seen corresponding path program 1 times [2022-07-14 07:01:04,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 07:01:04,863 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [352343633] [2022-07-14 07:01:04,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:01:04,863 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 07:01:04,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 07:01:04,864 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-14 07:01:04,866 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-14 07:01:05,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:01:05,197 INFO L263 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 44 conjunts are in the unsatisfiable core [2022-07-14 07:01:05,200 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 07:01:05,404 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 7 treesize of output 3 [2022-07-14 07:01:05,581 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-14 07:01:05,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 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-07-14 07:01:05,586 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-14 07:01:05,784 INFO L356 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2022-07-14 07:01:05,785 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 20 [2022-07-14 07:01:05,878 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-14 07:01:05,891 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 07:01:05,892 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 0 case distinctions, treesize of input 34 treesize of output 25 [2022-07-14 07:01:05,963 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 26 treesize of output 14 [2022-07-14 07:01:06,126 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 07:01:06,132 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-14 07:01:06,132 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 1 case distinctions, treesize of input 28 treesize of output 18 [2022-07-14 07:01:06,261 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 26 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-14 07:01:06,261 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 07:01:06,338 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 22 treesize of output 18 [2022-07-14 07:01:06,899 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 144 treesize of output 136 [2022-07-14 07:01:06,933 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 140 treesize of output 132 [2022-07-14 07:01:53,515 WARN L233 SmtUtils]: Spent 46.24s on a formula simplification. DAG size of input: 46 DAG size of output: 41 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-14 07:01:55,663 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (let ((.cse10 (let ((.cse11 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_prepend_~new_head~1#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_prepend_~new_head~1#1.base|) (bvadd |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset| (_ bv4 32)) |c_ULTIMATE.start_sll_prepend_#t~mem8#1.offset|)))) (store .cse11 |c_ULTIMATE.start_sll_prepend_~head#1.base| (store (select .cse11 |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset| |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|))))) (select (select .cse10 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.base|) (bvadd (select (select .cse10 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) (_ bv4 32)))))) (let ((.cse0 (= |c_ULTIMATE.start_main_~#s~0#1.base| |c_ULTIMATE.start_sll_prepend_~head#1.base|)) (.cse1 (= |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_sll_prepend_~head#1.offset|)) (.cse2 (bvadd (_ bv4 32) .cse3))) (and (or (and .cse0 .cse1 (bvule .cse2 (bvadd .cse3 (_ bv8 32)))) (forall ((v_arrayElimCell_128 (_ BitVec 32))) (let ((.cse4 (let ((.cse5 (let ((.cse6 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_prepend_~new_head~1#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_prepend_~new_head~1#1.base|) (bvadd |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset| (_ bv4 32)) |c_ULTIMATE.start_sll_prepend_#t~mem8#1.offset|)))) (store .cse6 |c_ULTIMATE.start_sll_prepend_~head#1.base| (store (select .cse6 |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset| |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|))))) (select (select .cse5 v_arrayElimCell_128) (bvadd (select (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) (_ bv4 32)))))) (bvule (bvadd (_ bv4 32) .cse4) (bvadd (_ bv8 32) .cse4))))) (or (and .cse0 .cse1 (bvule .cse3 .cse2)) (forall ((v_arrayElimCell_129 (_ BitVec 32))) (let ((.cse7 (let ((.cse8 (let ((.cse9 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_prepend_~new_head~1#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_prepend_~new_head~1#1.base|) (bvadd |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset| (_ bv4 32)) |c_ULTIMATE.start_sll_prepend_#t~mem8#1.offset|)))) (store .cse9 |c_ULTIMATE.start_sll_prepend_~head#1.base| (store (select .cse9 |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset| |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|))))) (select (select .cse8 v_arrayElimCell_129) (bvadd (select (select .cse8 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) (_ bv4 32)))))) (bvule .cse7 (bvadd (_ bv4 32) .cse7)))))))) is different from false [2022-07-14 07:01:57,789 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (let ((.cse10 (let ((.cse11 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_prepend_~new_head~1#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_prepend_~new_head~1#1.base|) (bvadd |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset| (_ bv4 32)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset|))))) (store .cse11 |c_ULTIMATE.start_sll_prepend_~head#1.base| (store (select .cse11 |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset| |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|))))) (select (select .cse10 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.base|) (bvadd (_ bv4 32) (select (select .cse10 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) (let ((.cse0 (= |c_ULTIMATE.start_main_~#s~0#1.base| |c_ULTIMATE.start_sll_prepend_~head#1.base|)) (.cse1 (= |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_sll_prepend_~head#1.offset|)) (.cse2 (bvadd .cse3 (_ bv4 32)))) (and (or (and .cse0 .cse1 (bvule .cse2 (bvadd .cse3 (_ bv8 32)))) (forall ((v_arrayElimCell_128 (_ BitVec 32))) (let ((.cse4 (let ((.cse5 (let ((.cse6 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_prepend_~new_head~1#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_prepend_~new_head~1#1.base|) (bvadd |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset| (_ bv4 32)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset|))))) (store .cse6 |c_ULTIMATE.start_sll_prepend_~head#1.base| (store (select .cse6 |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset| |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|))))) (select (select .cse5 v_arrayElimCell_128) (bvadd (_ bv4 32) (select (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) (bvule (bvadd (_ bv4 32) .cse4) (bvadd (_ bv8 32) .cse4))))) (or (and .cse0 .cse1 (bvule .cse3 .cse2)) (forall ((v_arrayElimCell_129 (_ BitVec 32))) (let ((.cse7 (let ((.cse8 (let ((.cse9 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_prepend_~new_head~1#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_prepend_~new_head~1#1.base|) (bvadd |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset| (_ bv4 32)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset|))))) (store .cse9 |c_ULTIMATE.start_sll_prepend_~head#1.base| (store (select .cse9 |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset| |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|))))) (select (select .cse8 v_arrayElimCell_129) (bvadd (_ bv4 32) (select (select .cse8 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) (bvule .cse7 (bvadd (_ bv4 32) .cse7)))))))) is different from false [2022-07-14 07:02:36,821 WARN L233 SmtUtils]: Spent 21.12s on a formula simplification that was a NOOP. DAG size: 47 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-14 07:02:39,813 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 07:02:39,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [352343633] [2022-07-14 07:02:39,813 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [352343633] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 07:02:39,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1602508867] [2022-07-14 07:02:39,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:02:39,814 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-14 07:02:39,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-14 07:02:39,816 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-14 07:02:39,817 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (30)] Waiting until timeout for monitored process [2022-07-14 07:02:40,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:02:40,234 INFO L263 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 72 conjunts are in the unsatisfiable core [2022-07-14 07:02:40,244 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 07:02:40,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-14 07:02:40,419 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-14 07:02:41,480 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 22 treesize of output 14 [2022-07-14 07:02:41,486 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 7 treesize of output 3 [2022-07-14 07:02:42,468 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-14 07:02:42,469 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-14 07:02:42,475 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-14 07:02:42,506 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 07:02:42,507 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 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-14 07:02:42,540 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-14 07:02:42,540 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 28 treesize of output 32 [2022-07-14 07:02:42,556 INFO L356 Elim1Store]: treesize reduction 4, result has 60.0 percent of original size [2022-07-14 07:02:42,556 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 17 [2022-07-14 07:02:42,570 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 10 [2022-07-14 07:02:43,410 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 07:02:43,411 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2022-07-14 07:02:43,441 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 07:02:43,441 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2022-07-14 07:02:43,756 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 07:02:43,757 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 0 case distinctions, treesize of input 40 treesize of output 27 [2022-07-14 07:02:43,768 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 07:02:43,769 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 0 case distinctions, treesize of input 30 treesize of output 25 [2022-07-14 07:02:44,525 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 07:02:44,531 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 07:02:44,532 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 82 treesize of output 42 [2022-07-14 07:02:44,544 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 07:02:44,556 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-14 07:02:44,557 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 18 [2022-07-14 07:02:45,099 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 20 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-14 07:02:45,099 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 07:02:56,411 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1602508867] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 07:02:56,411 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 07:02:56,411 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24] total 47 [2022-07-14 07:02:56,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115927650] [2022-07-14 07:02:56,411 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 07:02:56,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-07-14 07:02:56,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 07:02:56,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-07-14 07:02:56,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=280, Invalid=4380, Unknown=40, NotChecked=270, Total=4970 [2022-07-14 07:02:56,413 INFO L87 Difference]: Start difference. First operand 81 states and 84 transitions. Second operand has 48 states, 45 states have (on average 2.022222222222222) internal successors, (91), 42 states have internal predecessors, (91), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-14 07:02:58,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 07:02:58,725 INFO L93 Difference]: Finished difference Result 88 states and 90 transitions. [2022-07-14 07:02:58,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-07-14 07:02:58,726 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 45 states have (on average 2.022222222222222) internal successors, (91), 42 states have internal predecessors, (91), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 56 [2022-07-14 07:02:58,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 07:02:58,726 INFO L225 Difference]: With dead ends: 88 [2022-07-14 07:02:58,727 INFO L226 Difference]: Without dead ends: 88 [2022-07-14 07:02:58,728 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 73 SyntacticMatches, 5 SemanticMatches, 79 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 2090 ImplicationChecksByTransitivity, 109.0s TimeCoverageRelationStatistics Valid=385, Invalid=5742, Unknown=43, NotChecked=310, Total=6480 [2022-07-14 07:02:58,728 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 62 mSDsluCounter, 623 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 661 SdHoareTripleChecker+Invalid, 449 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 241 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-14 07:02:58,729 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 661 Invalid, 449 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 199 Invalid, 0 Unknown, 241 Unchecked, 0.3s Time] [2022-07-14 07:02:58,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-07-14 07:02:58,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 83. [2022-07-14 07:02:58,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 67 states have (on average 1.1940298507462686) internal successors, (80), 76 states have internal predecessors, (80), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-14 07:02:58,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 86 transitions. [2022-07-14 07:02:58,734 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 86 transitions. Word has length 56 [2022-07-14 07:02:58,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 07:02:58,734 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 86 transitions. [2022-07-14 07:02:58,734 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 45 states have (on average 2.022222222222222) internal successors, (91), 42 states have internal predecessors, (91), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-14 07:02:58,735 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 86 transitions. [2022-07-14 07:02:58,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-14 07:02:58,735 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 07:02:58,735 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 07:02:58,739 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (30)] Ended with exit code 0 [2022-07-14 07:02:58,945 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (29)] Ended with exit code 0 [2022-07-14 07:02:59,136 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 07:02:59,136 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-07-14 07:02:59,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 07:02:59,137 INFO L85 PathProgramCache]: Analyzing trace with hash -567858883, now seen corresponding path program 1 times [2022-07-14 07:02:59,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 07:02:59,137 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [576405742] [2022-07-14 07:02:59,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:02:59,137 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 07:02:59,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 07:02:59,138 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-14 07:02:59,139 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-14 07:02:59,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:02:59,520 INFO L263 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 96 conjunts are in the unsatisfiable core [2022-07-14 07:02:59,523 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 07:02:59,545 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 07:02:59,546 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 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-14 07:02:59,716 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-14 07:02:59,716 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 18 treesize of output 25 [2022-07-14 07:02:59,957 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-14 07:03:00,087 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-14 07:03:00,087 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 18 treesize of output 25 [2022-07-14 07:03:00,250 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 07:03:00,251 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-14 07:03:00,263 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 6 treesize of output 5 [2022-07-14 07:03:00,276 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 6 treesize of output 5 [2022-07-14 07:03:00,713 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 20 [2022-07-14 07:03:00,719 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 7 treesize of output 3 [2022-07-14 07:03:00,725 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 7 treesize of output 3 [2022-07-14 07:03:00,731 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 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 07:03:01,205 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 07:03:01,206 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 42 treesize of output 38 [2022-07-14 07:03:01,215 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 07:03:01,216 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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-14 07:03:01,246 INFO L356 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2022-07-14 07:03:01,246 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 25 [2022-07-14 07:03:01,308 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-14 07:03:01,308 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 14 treesize of output 20 [2022-07-14 07:03:01,317 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-14 07:03:01,887 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 07:03:01,888 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 35 [2022-07-14 07:03:01,896 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 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-14 07:03:01,961 INFO L356 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2022-07-14 07:03:01,962 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 20 [2022-07-14 07:03:02,354 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 07:03:02,357 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 36 [2022-07-14 07:03:02,369 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 07:03:02,371 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 22 treesize of output 24 [2022-07-14 07:03:02,382 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 07:03:02,383 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 25 [2022-07-14 07:03:03,044 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 07:03:03,064 INFO L356 Elim1Store]: treesize reduction 31, result has 8.8 percent of original size [2022-07-14 07:03:03,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, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 123 treesize of output 59 [2022-07-14 07:03:03,075 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 07:03:03,083 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-14 07:03:03,084 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 18 [2022-07-14 07:03:03,643 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 15 treesize of output 7 [2022-07-14 07:03:03,714 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 8 proven. 23 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-14 07:03:03,714 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 07:03:04,348 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1851 (Array (_ BitVec 32) (_ BitVec 32)))) (= (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset| |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|))) (.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset| |c_ULTIMATE.start_sll_prepend_~new_head~1#1.base|)))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (bvadd (_ bv4 32) (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1851) (select (select .cse0 .cse1) .cse2)) (select (select .cse3 .cse1) .cse2)))) |c_ULTIMATE.start_main_~data~0#1|)) is different from false [2022-07-14 07:03:04,427 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1849 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1851 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse5 (bvadd |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset| (_ bv4 32)))) (let ((.cse3 (let ((.cse6 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_prepend_~new_head~1#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_prepend_~new_head~1#1.base|) .cse5 |c_ULTIMATE.start_sll_prepend_#t~mem8#1.offset|)))) (store .cse6 |c_ULTIMATE.start_sll_prepend_~head#1.base| (store (select .cse6 |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset| |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|)))) (.cse0 (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_prepend_~new_head~1#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_prepend_~new_head~1#1.base|) .cse5 |c_ULTIMATE.start_sll_prepend_#t~mem8#1.base|)))) (store .cse4 |c_ULTIMATE.start_sll_prepend_~head#1.base| (store (select .cse4 |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset| |c_ULTIMATE.start_sll_prepend_~new_head~1#1.base|))))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (bvadd (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) (_ bv4 32)))) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~new_head~1#1.base| v_ArrVal_1849) |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1851) (select (select .cse0 .cse1) .cse2)) (select (select .cse3 .cse1) .cse2))))))) is different from false [2022-07-14 07:03:04,486 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1849 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1851 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse5 (bvadd |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset| (_ bv4 32)))) (let ((.cse3 (let ((.cse6 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_prepend_~new_head~1#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_prepend_~new_head~1#1.base|) .cse5 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset|))))) (store .cse6 |c_ULTIMATE.start_sll_prepend_~head#1.base| (store (select .cse6 |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset| |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|)))) (.cse0 (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_prepend_~new_head~1#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_prepend_~new_head~1#1.base|) .cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset|))))) (store .cse4 |c_ULTIMATE.start_sll_prepend_~head#1.base| (store (select .cse4 |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset| |c_ULTIMATE.start_sll_prepend_~new_head~1#1.base|))))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (bvadd (_ bv4 32) (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~new_head~1#1.base| v_ArrVal_1849) |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1851) (select (select .cse0 .cse1) .cse2)) (select (select .cse3 .cse1) .cse2))))))) is different from false [2022-07-14 07:03:04,562 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1849 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1851 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse5 (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_prepend_#t~ret7#1.offset|))) (let ((.cse3 (let ((.cse6 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|) .cse5 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset|))))) (store .cse6 |c_ULTIMATE.start_sll_prepend_~head#1.base| (store (select .cse6 |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.offset|)))) (.cse0 (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|) .cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset|))))) (store .cse4 |c_ULTIMATE.start_sll_prepend_~head#1.base| (store (select .cse4 |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|))))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (bvadd (_ bv4 32) (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base| v_ArrVal_1849) |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1851) (select (select .cse0 .cse1) .cse2)) (select (select .cse3 .cse1) .cse2))))))) is different from false [2022-07-14 07:03:06,503 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 07:03:06,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [576405742] [2022-07-14 07:03:06,503 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [576405742] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 07:03:06,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [12974594] [2022-07-14 07:03:06,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:03:06,503 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-14 07:03:06,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-14 07:03:06,504 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-14 07:03:06,505 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (32)] Waiting until timeout for monitored process [2022-07-14 07:03:06,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:03:06,930 INFO L263 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 83 conjunts are in the unsatisfiable core [2022-07-14 07:03:06,933 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 07:03:07,315 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-14 07:03:07,499 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-14 07:03:08,174 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 07:03:08,175 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-14 07:03:08,902 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 31 treesize of output 19 [2022-07-14 07:03:08,908 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 7 treesize of output 3 [2022-07-14 07:03:08,914 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 7 treesize of output 3 [2022-07-14 07:03:08,919 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 6 [2022-07-14 07:03:10,051 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 07:03:10,054 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 37 treesize of output 35 [2022-07-14 07:03:10,068 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 07:03:10,069 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-14 07:03:10,092 INFO L356 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-07-14 07:03:10,092 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 19 treesize of output 19 [2022-07-14 07:03:10,138 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-14 07:03:10,138 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 14 treesize of output 20 [2022-07-14 07:03:10,151 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-14 07:03:11,062 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 07:03:11,063 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 31 [2022-07-14 07:03:11,071 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-14 07:03:11,114 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 07:03:11,114 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2022-07-14 07:03:11,660 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 07:03:11,663 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 0 case distinctions, treesize of input 49 treesize of output 32 [2022-07-14 07:03:11,677 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 07:03:11,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, 2 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-14 07:03:11,691 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 07:03:11,692 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 0 case distinctions, treesize of input 30 treesize of output 25 [2022-07-14 07:03:12,545 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 07:03:12,550 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 07:03:12,550 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 95 treesize of output 47 [2022-07-14 07:03:12,562 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 07:03:12,571 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-14 07:03:12,571 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 18 [2022-07-14 07:03:13,384 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-14 07:03:13,391 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 14 proven. 17 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-14 07:03:13,391 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 07:03:13,450 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1953 (Array (_ BitVec 32) (_ BitVec 32)))) (= (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset| |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|))) (.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset| |c_ULTIMATE.start_sll_prepend_~new_head~1#1.base|)))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (bvadd (_ bv4 32) (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1953) (select (select .cse0 .cse1) .cse2)) (select (select .cse3 .cse1) .cse2)))) |c_ULTIMATE.start_main_~data~0#1|)) is different from false [2022-07-14 07:03:13,511 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1946 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1953 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse5 (bvadd |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset| (_ bv4 32)))) (let ((.cse3 (let ((.cse6 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_prepend_~new_head~1#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_prepend_~new_head~1#1.base|) .cse5 |c_ULTIMATE.start_sll_prepend_#t~mem8#1.offset|)))) (store .cse6 |c_ULTIMATE.start_sll_prepend_~head#1.base| (store (select .cse6 |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset| |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|)))) (.cse0 (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_prepend_~new_head~1#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_prepend_~new_head~1#1.base|) .cse5 |c_ULTIMATE.start_sll_prepend_#t~mem8#1.base|)))) (store .cse4 |c_ULTIMATE.start_sll_prepend_~head#1.base| (store (select .cse4 |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset| |c_ULTIMATE.start_sll_prepend_~new_head~1#1.base|))))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (bvadd (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) (_ bv4 32)))) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~new_head~1#1.base| v_ArrVal_1946) |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1953) (select (select .cse0 .cse1) .cse2)) (select (select .cse3 .cse1) .cse2))))))) is different from false [2022-07-14 07:03:13,563 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1946 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1953 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse5 (bvadd |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset| (_ bv4 32)))) (let ((.cse3 (let ((.cse6 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_prepend_~new_head~1#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_prepend_~new_head~1#1.base|) .cse5 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset|))))) (store .cse6 |c_ULTIMATE.start_sll_prepend_~head#1.base| (store (select .cse6 |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset| |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|)))) (.cse0 (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_prepend_~new_head~1#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_prepend_~new_head~1#1.base|) .cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset|))))) (store .cse4 |c_ULTIMATE.start_sll_prepend_~head#1.base| (store (select .cse4 |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset| |c_ULTIMATE.start_sll_prepend_~new_head~1#1.base|))))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (bvadd (_ bv4 32) (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_~new_head~1#1.base| v_ArrVal_1946) |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1953) (select (select .cse0 .cse1) .cse2)) (select (select .cse3 .cse1) .cse2))))))) is different from false [2022-07-14 07:03:13,620 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1946 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1953 (Array (_ BitVec 32) (_ BitVec 32)))) (= (let ((.cse5 (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_prepend_#t~ret7#1.offset|))) (let ((.cse3 (let ((.cse6 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|) .cse5 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset|))))) (store .cse6 |c_ULTIMATE.start_sll_prepend_~head#1.base| (store (select .cse6 |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.offset|)))) (.cse0 (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|) .cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset|))))) (store .cse4 |c_ULTIMATE.start_sll_prepend_~head#1.base| (store (select .cse4 |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|))))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (bvadd (_ bv4 32) (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base| v_ArrVal_1946) |c_ULTIMATE.start_sll_prepend_~head#1.base| v_ArrVal_1953) (select (select .cse0 .cse1) .cse2)) (select (select .cse3 .cse1) .cse2))))) |c_ULTIMATE.start_main_~data~0#1|)) is different from false [2022-07-14 07:03:18,022 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [12974594] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 07:03:18,022 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 07:03:18,022 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 27] total 53 [2022-07-14 07:03:18,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153154268] [2022-07-14 07:03:18,023 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 07:03:18,023 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2022-07-14 07:03:18,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 07:03:18,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2022-07-14 07:03:18,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=3577, Unknown=29, NotChecked=1016, Total=4830 [2022-07-14 07:03:18,024 INFO L87 Difference]: Start difference. First operand 83 states and 86 transitions. Second operand has 53 states, 51 states have (on average 1.9607843137254901) internal successors, (100), 46 states have internal predecessors, (100), 4 states have call successors, (4), 4 states have call predecessors, (4), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-14 07:03:22,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 07:03:22,459 INFO L93 Difference]: Finished difference Result 84 states and 87 transitions. [2022-07-14 07:03:22,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-07-14 07:03:22,460 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 51 states have (on average 1.9607843137254901) internal successors, (100), 46 states have internal predecessors, (100), 4 states have call successors, (4), 4 states have call predecessors, (4), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 58 [2022-07-14 07:03:22,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 07:03:22,461 INFO L225 Difference]: With dead ends: 84 [2022-07-14 07:03:22,461 INFO L226 Difference]: Without dead ends: 84 [2022-07-14 07:03:22,462 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 83 SyntacticMatches, 4 SemanticMatches, 86 ConstructedPredicates, 8 IntricatePredicates, 1 DeprecatedPredicates, 1669 ImplicationChecksByTransitivity, 17.7s TimeCoverageRelationStatistics Valid=355, Invalid=5965, Unknown=32, NotChecked=1304, Total=7656 [2022-07-14 07:03:22,463 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 30 mSDsluCounter, 867 mSDsCounter, 0 mSdLazyCounter, 357 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 903 SdHoareTripleChecker+Invalid, 700 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 333 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-14 07:03:22,463 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 903 Invalid, 700 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 357 Invalid, 0 Unknown, 333 Unchecked, 0.6s Time] [2022-07-14 07:03:22,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-07-14 07:03:22,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2022-07-14 07:03:22,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 68 states have (on average 1.1911764705882353) internal successors, (81), 77 states have internal predecessors, (81), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-14 07:03:22,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 87 transitions. [2022-07-14 07:03:22,465 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 87 transitions. Word has length 58 [2022-07-14 07:03:22,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 07:03:22,466 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 87 transitions. [2022-07-14 07:03:22,466 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 51 states have (on average 1.9607843137254901) internal successors, (100), 46 states have internal predecessors, (100), 4 states have call successors, (4), 4 states have call predecessors, (4), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-14 07:03:22,466 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 87 transitions. [2022-07-14 07:03:22,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-07-14 07:03:22,466 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 07:03:22,467 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 07:03:22,479 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (31)] Forceful destruction successful, exit code 0 [2022-07-14 07:03:22,675 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (32)] Forceful destruction successful, exit code 0 [2022-07-14 07:03:22,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3,32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2022-07-14 07:03:22,872 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-07-14 07:03:22,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 07:03:22,872 INFO L85 PathProgramCache]: Analyzing trace with hash -423755733, now seen corresponding path program 2 times [2022-07-14 07:03:22,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 07:03:22,872 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1872005880] [2022-07-14 07:03:22,873 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-14 07:03:22,873 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 07:03:22,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 07:03:22,874 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-14 07:03:22,874 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-14 07:03:23,192 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-14 07:03:23,192 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 07:03:23,204 INFO L263 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 82 conjunts are in the unsatisfiable core [2022-07-14 07:03:23,207 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 07:03:23,224 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-14 07:03:23,510 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-14 07:03:23,511 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 21 treesize of output 28 [2022-07-14 07:03:23,669 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-14 07:03:24,108 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-14 07:03:24,108 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 49 treesize of output 24 [2022-07-14 07:03:24,121 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 0 case distinctions, treesize of input 14 treesize of output 10 [2022-07-14 07:03:24,127 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 7 treesize of output 3 [2022-07-14 07:03:24,557 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-14 07:03:24,557 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-14 07:03:24,567 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-14 07:03:24,589 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 07:03:24,606 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-14 07:03:24,606 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 51 [2022-07-14 07:03:24,663 INFO L356 Elim1Store]: treesize reduction 66, result has 42.6 percent of original size [2022-07-14 07:03:24,663 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 38 treesize of output 67 [2022-07-14 07:03:25,325 INFO L356 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2022-07-14 07:03:25,325 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 20 [2022-07-14 07:03:25,351 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 07:03:25,352 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 07:03:25,382 INFO L356 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2022-07-14 07:03:25,382 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 3 case distinctions, treesize of input 93 treesize of output 62 [2022-07-14 07:03:25,835 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 07:03:25,895 INFO L356 Elim1Store]: treesize reduction 45, result has 13.5 percent of original size [2022-07-14 07:03:25,895 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 90 treesize of output 59 [2022-07-14 07:03:25,926 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 07:03:25,932 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 0 case distinctions, treesize of input 30 treesize of output 25 [2022-07-14 07:03:26,643 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 07:03:26,655 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-14 07:03:26,655 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 1 case distinctions, treesize of input 53 treesize of output 31 [2022-07-14 07:03:27,317 INFO L356 Elim1Store]: treesize reduction 29, result has 12.1 percent of original size [2022-07-14 07:03:27,318 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 130 treesize of output 56 [2022-07-14 07:03:29,052 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 29 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 07:03:29,052 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 07:03:34,135 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 07:03:34,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1872005880] [2022-07-14 07:03:34,135 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1872005880] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 07:03:34,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [638446601] [2022-07-14 07:03:34,136 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-14 07:03:34,136 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-14 07:03:34,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-14 07:03:34,137 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-14 07:03:34,138 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (34)] Waiting until timeout for monitored process [2022-07-14 07:03:34,514 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-14 07:03:34,514 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 07:03:34,529 INFO L263 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 84 conjunts are in the unsatisfiable core [2022-07-14 07:03:34,532 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 07:03:34,694 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-14 07:03:35,404 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-14 07:03:35,404 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 21 treesize of output 28 [2022-07-14 07:03:35,996 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-14 07:03:37,276 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 07:03:37,276 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 1 case distinctions, treesize of input 49 treesize of output 24 [2022-07-14 07:03:37,284 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 0 case distinctions, treesize of input 14 treesize of output 10 [2022-07-14 07:03:37,290 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-14 07:03:37,537 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-14 07:03:37,538 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-14 07:03:37,551 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-14 07:03:37,579 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 07:03:37,604 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-14 07:03:37,605 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 51 [2022-07-14 07:03:37,661 INFO L356 Elim1Store]: treesize reduction 66, result has 42.6 percent of original size [2022-07-14 07:03:37,662 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 38 treesize of output 67 [2022-07-14 07:03:38,891 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 07:03:38,892 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2022-07-14 07:03:38,918 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 07:03:38,919 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 07:03:38,921 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 07:03:38,943 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-07-14 07:03:38,943 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 93 treesize of output 62 [2022-07-14 07:03:40,086 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 07:03:40,090 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-14 07:03:40,090 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 90 treesize of output 59 [2022-07-14 07:03:40,126 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 07:03:40,128 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 0 case distinctions, treesize of input 30 treesize of output 25 [2022-07-14 07:03:41,818 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 07:03:41,830 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-14 07:03:41,831 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 1 case distinctions, treesize of input 53 treesize of output 31 [2022-07-14 07:03:43,495 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 07:03:43,496 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 130 treesize of output 56 [2022-07-14 07:03:44,588 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 29 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 07:03:44,588 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 07:03:46,383 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [638446601] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 07:03:46,383 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 07:03:46,383 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 54 [2022-07-14 07:03:46,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461715169] [2022-07-14 07:03:46,383 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 07:03:46,383 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2022-07-14 07:03:46,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 07:03:46,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2022-07-14 07:03:46,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=283, Invalid=4400, Unknown=9, NotChecked=0, Total=4692 [2022-07-14 07:03:46,385 INFO L87 Difference]: Start difference. First operand 84 states and 87 transitions. Second operand has 55 states, 52 states have (on average 1.5769230769230769) internal successors, (82), 46 states have internal predecessors, (82), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-14 07:03:47,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 07:03:47,628 INFO L93 Difference]: Finished difference Result 88 states and 94 transitions. [2022-07-14 07:03:47,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-07-14 07:03:47,629 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 52 states have (on average 1.5769230769230769) internal successors, (82), 46 states have internal predecessors, (82), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 59 [2022-07-14 07:03:47,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 07:03:47,630 INFO L225 Difference]: With dead ends: 88 [2022-07-14 07:03:47,630 INFO L226 Difference]: Without dead ends: 88 [2022-07-14 07:03:47,631 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 87 SyntacticMatches, 7 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1931 ImplicationChecksByTransitivity, 18.9s TimeCoverageRelationStatistics Valid=336, Invalid=5054, Unknown=12, NotChecked=0, Total=5402 [2022-07-14 07:03:47,631 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 28 mSDsluCounter, 655 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 693 SdHoareTripleChecker+Invalid, 616 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 497 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 07:03:47,631 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 693 Invalid, 616 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 111 Invalid, 0 Unknown, 497 Unchecked, 0.2s Time] [2022-07-14 07:03:47,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-07-14 07:03:47,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 86. [2022-07-14 07:03:47,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 70 states have (on average 1.2142857142857142) internal successors, (85), 79 states have internal predecessors, (85), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-14 07:03:47,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 91 transitions. [2022-07-14 07:03:47,634 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 91 transitions. Word has length 59 [2022-07-14 07:03:47,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 07:03:47,634 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 91 transitions. [2022-07-14 07:03:47,634 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 52 states have (on average 1.5769230769230769) internal successors, (82), 46 states have internal predecessors, (82), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-14 07:03:47,634 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 91 transitions. [2022-07-14 07:03:47,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-07-14 07:03:47,634 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 07:03:47,635 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 07:03:47,639 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (34)] Forceful destruction successful, exit code 0 [2022-07-14 07:03:47,844 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (33)] Ended with exit code 0 [2022-07-14 07:03:48,035 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 07:03:48,035 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-07-14 07:03:48,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 07:03:48,036 INFO L85 PathProgramCache]: Analyzing trace with hash -423755732, now seen corresponding path program 2 times [2022-07-14 07:03:48,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 07:03:48,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2101187593] [2022-07-14 07:03:48,036 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-14 07:03:48,036 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 07:03:48,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 07:03:48,038 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-14 07:03:48,043 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-14 07:03:48,375 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-14 07:03:48,376 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 07:03:48,388 INFO L263 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 100 conjunts are in the unsatisfiable core [2022-07-14 07:03:48,392 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 07:03:48,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-14 07:03:48,418 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-14 07:03:48,863 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-14 07:03:48,864 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 21 treesize of output 28 [2022-07-14 07:03:48,883 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 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-14 07:03:49,086 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-14 07:03:49,119 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-14 07:03:49,698 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-14 07:03:49,698 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 73 treesize of output 36 [2022-07-14 07:03:49,710 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 0 case distinctions, treesize of input 14 treesize of output 10 [2022-07-14 07:03:49,720 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 07:03:49,721 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 15 treesize of output 7 [2022-07-14 07:03:49,726 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-07-14 07:03:50,224 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 07:03:50,254 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-14 07:03:50,255 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 79 treesize of output 67 [2022-07-14 07:03:50,298 INFO L356 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-07-14 07:03:50,298 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 32 treesize of output 34 [2022-07-14 07:03:50,316 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 07:03:50,321 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 07:03:50,322 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 30 [2022-07-14 07:03:50,333 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 20 treesize of output 22 [2022-07-14 07:03:50,909 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 07:03:50,914 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 07:03:50,915 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 34 [2022-07-14 07:03:50,927 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 07:03:50,928 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 07:03:50,947 INFO L356 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2022-07-14 07:03:50,947 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 3 case distinctions, treesize of input 85 treesize of output 54 [2022-07-14 07:03:51,404 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 07:03:51,432 INFO L356 Elim1Store]: treesize reduction 45, result has 13.5 percent of original size [2022-07-14 07:03:51,433 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 82 treesize of output 51 [2022-07-14 07:03:51,450 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 07:03:51,452 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 07:03:51,456 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 07:03:51,456 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 43 [2022-07-14 07:03:52,894 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 07:03:52,949 INFO L356 Elim1Store]: treesize reduction 105, result has 9.5 percent of original size [2022-07-14 07:03:52,949 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 9 new quantified variables, introduced 10 case distinctions, treesize of input 189 treesize of output 95 [2022-07-14 07:03:52,964 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 07:03:52,968 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 07:03:52,989 INFO L356 Elim1Store]: treesize reduction 10, result has 41.2 percent of original size [2022-07-14 07:03:52,989 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 29 [2022-07-14 07:03:53,638 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 6 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 07:03:53,638 INFO L328 TraceCheckSpWp]: Computing backward predicates...