./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-simple/dll2n_remove_all.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 6c24879c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/list-simple/dll2n_remove_all.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 b594cdd667b896d6ce097f6fd96950290806f015d929f3b2b06ffea35d861f89 --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 19:14:18,559 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 19:14:18,561 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 19:14:18,597 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 19:14:18,597 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 19:14:18,599 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 19:14:18,602 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 19:14:18,607 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 19:14:18,609 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 19:14:18,613 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 19:14:18,614 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 19:14:18,616 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 19:14:18,616 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 19:14:18,618 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 19:14:18,619 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 19:14:18,620 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 19:14:18,621 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 19:14:18,623 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 19:14:18,626 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 19:14:18,632 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 19:14:18,633 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 19:14:18,634 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 19:14:18,635 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 19:14:18,636 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 19:14:18,637 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 19:14:18,643 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 19:14:18,644 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 19:14:18,644 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 19:14:18,645 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 19:14:18,646 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 19:14:18,647 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 19:14:18,647 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 19:14:18,648 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 19:14:18,649 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 19:14:18,650 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 19:14:18,651 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 19:14:18,651 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 19:14:18,652 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 19:14:18,652 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 19:14:18,652 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 19:14:18,654 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 19:14:18,655 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 19:14:18,656 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-07-12 19:14:18,684 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 19:14:18,685 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 19:14:18,685 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 19:14:18,685 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 19:14:18,686 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 19:14:18,686 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 19:14:18,687 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 19:14:18,687 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 19:14:18,687 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 19:14:18,688 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 19:14:18,688 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-12 19:14:18,689 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-12 19:14:18,689 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 19:14:18,689 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-12 19:14:18,689 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 19:14:18,690 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-12 19:14:18,690 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-12 19:14:18,690 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-12 19:14:18,690 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 19:14:18,691 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-12 19:14:18,692 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-12 19:14:18,692 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 19:14:18,692 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 19:14:18,692 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 19:14:18,693 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 19:14:18,693 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 19:14:18,693 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 19:14:18,693 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 19:14:18,694 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 19:14:18,694 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 19:14:18,694 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 -> b594cdd667b896d6ce097f6fd96950290806f015d929f3b2b06ffea35d861f89 [2022-07-12 19:14:18,936 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 19:14:18,960 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 19:14:18,962 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 19:14:18,963 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 19:14:18,964 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 19:14:18,964 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/dll2n_remove_all.i [2022-07-12 19:14:19,015 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e767f6836/0f34fca601324075a1d562bb9ed8fa53/FLAGfc9a6a6d5 [2022-07-12 19:14:19,485 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 19:14:19,486 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2n_remove_all.i [2022-07-12 19:14:19,496 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e767f6836/0f34fca601324075a1d562bb9ed8fa53/FLAGfc9a6a6d5 [2022-07-12 19:14:19,515 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e767f6836/0f34fca601324075a1d562bb9ed8fa53 [2022-07-12 19:14:19,518 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 19:14:19,519 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 19:14:19,521 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 19:14:19,522 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 19:14:19,524 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 19:14:19,525 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 07:14:19" (1/1) ... [2022-07-12 19:14:19,526 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2258eab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:14:19, skipping insertion in model container [2022-07-12 19:14:19,526 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 07:14:19" (1/1) ... [2022-07-12 19:14:19,533 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 19:14:19,576 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 19:14:19,871 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/dll2n_remove_all.i[24090,24103] [2022-07-12 19:14:19,873 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 19:14:19,881 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 19:14:19,931 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/dll2n_remove_all.i[24090,24103] [2022-07-12 19:14:19,933 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 19:14:19,957 INFO L208 MainTranslator]: Completed translation [2022-07-12 19:14:19,958 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:14:19 WrapperNode [2022-07-12 19:14:19,959 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 19:14:19,960 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 19:14:19,960 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 19:14:19,960 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 19:14:19,966 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:14:19" (1/1) ... [2022-07-12 19:14:19,988 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:14:19" (1/1) ... [2022-07-12 19:14:20,016 INFO L137 Inliner]: procedures = 126, calls = 31, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 81 [2022-07-12 19:14:20,017 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 19:14:20,018 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 19:14:20,018 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 19:14:20,018 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 19:14:20,023 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:14:19" (1/1) ... [2022-07-12 19:14:20,023 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:14:19" (1/1) ... [2022-07-12 19:14:20,026 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:14:19" (1/1) ... [2022-07-12 19:14:20,026 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:14:19" (1/1) ... [2022-07-12 19:14:20,032 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:14:19" (1/1) ... [2022-07-12 19:14:20,034 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:14:19" (1/1) ... [2022-07-12 19:14:20,035 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:14:19" (1/1) ... [2022-07-12 19:14:20,038 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 19:14:20,038 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 19:14:20,038 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 19:14:20,039 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 19:14:20,048 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:14:19" (1/1) ... [2022-07-12 19:14:20,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 19:14:20,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 19:14:20,075 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-12 19:14:20,095 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-12 19:14:20,119 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2022-07-12 19:14:20,120 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2022-07-12 19:14:20,120 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-12 19:14:20,120 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-12 19:14:20,120 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 19:14:20,120 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-12 19:14:20,120 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-12 19:14:20,121 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-12 19:14:20,121 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 19:14:20,121 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-12 19:14:20,121 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 19:14:20,121 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 19:14:20,121 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 19:14:20,240 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 19:14:20,241 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 19:14:20,293 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2022-07-12 19:14:20,577 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 19:14:20,582 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 19:14:20,583 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-12 19:14:20,585 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 07:14:20 BoogieIcfgContainer [2022-07-12 19:14:20,585 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 19:14:20,587 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 19:14:20,587 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 19:14:20,590 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 19:14:20,590 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 07:14:19" (1/3) ... [2022-07-12 19:14:20,591 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f2e7ce6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 07:14:20, skipping insertion in model container [2022-07-12 19:14:20,591 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:14:19" (2/3) ... [2022-07-12 19:14:20,591 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f2e7ce6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 07:14:20, skipping insertion in model container [2022-07-12 19:14:20,592 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 07:14:20" (3/3) ... [2022-07-12 19:14:20,593 INFO L111 eAbstractionObserver]: Analyzing ICFG dll2n_remove_all.i [2022-07-12 19:14:20,610 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 19:14:20,611 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 25 error locations. [2022-07-12 19:14:20,642 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 19:14:20,647 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@7ac158cc, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@6e5c939f [2022-07-12 19:14:20,647 INFO L358 AbstractCegarLoop]: Starting to check reachability of 25 error locations. [2022-07-12 19:14:20,652 INFO L276 IsEmpty]: Start isEmpty. Operand has 59 states, 32 states have (on average 2.03125) internal successors, (65), 57 states have internal predecessors, (65), 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-12 19:14:20,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-07-12 19:14:20,657 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:14:20,658 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-07-12 19:14:20,658 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-12 19:14:20,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:14:20,664 INFO L85 PathProgramCache]: Analyzing trace with hash 33471376, now seen corresponding path program 1 times [2022-07-12 19:14:20,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:14:20,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698277831] [2022-07-12 19:14:20,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:14:20,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:14:20,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:14:20,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:14:20,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:14:20,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698277831] [2022-07-12 19:14:20,809 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698277831] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:14:20,809 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:14:20,809 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 19:14:20,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671705648] [2022-07-12 19:14:20,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:14:20,814 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 19:14:20,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:14:20,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 19:14:20,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 19:14:20,837 INFO L87 Difference]: Start difference. First operand has 59 states, 32 states have (on average 2.03125) internal successors, (65), 57 states have internal predecessors, (65), 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) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:14:20,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:14:20,973 INFO L93 Difference]: Finished difference Result 86 states and 93 transitions. [2022-07-12 19:14:20,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 19:14:20,976 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-07-12 19:14:20,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:14:20,983 INFO L225 Difference]: With dead ends: 86 [2022-07-12 19:14:20,983 INFO L226 Difference]: Without dead ends: 81 [2022-07-12 19:14:20,985 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 19:14:20,988 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 43 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 19:14:20,989 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 93 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 19:14:21,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-07-12 19:14:21,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 51. [2022-07-12 19:14:21,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 29 states have (on average 1.8620689655172413) internal successors, (54), 50 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:14:21,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 54 transitions. [2022-07-12 19:14:21,023 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 54 transitions. Word has length 5 [2022-07-12 19:14:21,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:14:21,023 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 54 transitions. [2022-07-12 19:14:21,024 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:14:21,024 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 54 transitions. [2022-07-12 19:14:21,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-07-12 19:14:21,025 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:14:21,025 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-07-12 19:14:21,026 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 19:14:21,026 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-12 19:14:21,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:14:21,027 INFO L85 PathProgramCache]: Analyzing trace with hash 33471377, now seen corresponding path program 1 times [2022-07-12 19:14:21,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:14:21,028 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694956560] [2022-07-12 19:14:21,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:14:21,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:14:21,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:14:21,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:14:21,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:14:21,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694956560] [2022-07-12 19:14:21,107 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694956560] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:14:21,107 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:14:21,107 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 19:14:21,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940719716] [2022-07-12 19:14:21,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:14:21,109 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 19:14:21,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:14:21,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 19:14:21,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 19:14:21,111 INFO L87 Difference]: Start difference. First operand 51 states and 54 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:14:21,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:14:21,190 INFO L93 Difference]: Finished difference Result 85 states and 90 transitions. [2022-07-12 19:14:21,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 19:14:21,191 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-07-12 19:14:21,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:14:21,194 INFO L225 Difference]: With dead ends: 85 [2022-07-12 19:14:21,194 INFO L226 Difference]: Without dead ends: 85 [2022-07-12 19:14:21,199 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 19:14:21,201 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 47 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 96 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-12 19:14:21,202 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 96 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 19:14:21,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-07-12 19:14:21,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 48. [2022-07-12 19:14:21,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 29 states have (on average 1.7586206896551724) internal successors, (51), 47 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:14:21,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 51 transitions. [2022-07-12 19:14:21,214 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 51 transitions. Word has length 5 [2022-07-12 19:14:21,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:14:21,215 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 51 transitions. [2022-07-12 19:14:21,216 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:14:21,216 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 51 transitions. [2022-07-12 19:14:21,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-12 19:14:21,217 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:14:21,218 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:14:21,218 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-12 19:14:21,218 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-12 19:14:21,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:14:21,221 INFO L85 PathProgramCache]: Analyzing trace with hash 2100113076, now seen corresponding path program 1 times [2022-07-12 19:14:21,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:14:21,221 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896215799] [2022-07-12 19:14:21,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:14:21,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:14:21,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:14:21,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:14:21,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:14:21,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896215799] [2022-07-12 19:14:21,255 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896215799] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:14:21,255 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:14:21,256 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 19:14:21,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620194053] [2022-07-12 19:14:21,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:14:21,256 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 19:14:21,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:14:21,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 19:14:21,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 19:14:21,258 INFO L87 Difference]: Start difference. First operand 48 states and 51 transitions. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:14:21,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:14:21,267 INFO L93 Difference]: Finished difference Result 58 states and 62 transitions. [2022-07-12 19:14:21,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 19:14:21,268 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-07-12 19:14:21,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:14:21,268 INFO L225 Difference]: With dead ends: 58 [2022-07-12 19:14:21,268 INFO L226 Difference]: Without dead ends: 58 [2022-07-12 19:14:21,271 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 19:14:21,273 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 10 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 96 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-12 19:14:21,276 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 96 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 19:14:21,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-07-12 19:14:21,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 49. [2022-07-12 19:14:21,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 30 states have (on average 1.7333333333333334) internal successors, (52), 48 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:14:21,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 52 transitions. [2022-07-12 19:14:21,282 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 52 transitions. Word has length 7 [2022-07-12 19:14:21,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:14:21,283 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 52 transitions. [2022-07-12 19:14:21,283 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:14:21,283 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2022-07-12 19:14:21,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-07-12 19:14:21,284 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:14:21,284 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:14:21,284 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-12 19:14:21,284 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-12 19:14:21,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:14:21,289 INFO L85 PathProgramCache]: Analyzing trace with hash 638916372, now seen corresponding path program 1 times [2022-07-12 19:14:21,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:14:21,290 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22978793] [2022-07-12 19:14:21,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:14:21,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:14:21,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:14:21,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:14:21,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:14:21,354 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22978793] [2022-07-12 19:14:21,354 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22978793] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:14:21,354 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:14:21,354 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 19:14:21,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210782987] [2022-07-12 19:14:21,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:14:21,355 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 19:14:21,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:14:21,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 19:14:21,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 19:14:21,356 INFO L87 Difference]: Start difference. First operand 49 states and 52 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:14:21,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:14:21,369 INFO L93 Difference]: Finished difference Result 55 states and 58 transitions. [2022-07-12 19:14:21,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 19:14:21,369 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-07-12 19:14:21,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:14:21,370 INFO L225 Difference]: With dead ends: 55 [2022-07-12 19:14:21,370 INFO L226 Difference]: Without dead ends: 55 [2022-07-12 19:14:21,371 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 19:14:21,371 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 1 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 19:14:21,372 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 91 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 19:14:21,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-07-12 19:14:21,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 54. [2022-07-12 19:14:21,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 35 states have (on average 1.6285714285714286) internal successors, (57), 53 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:14:21,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 57 transitions. [2022-07-12 19:14:21,376 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 57 transitions. Word has length 9 [2022-07-12 19:14:21,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:14:21,377 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 57 transitions. [2022-07-12 19:14:21,377 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:14:21,377 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2022-07-12 19:14:21,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-12 19:14:21,377 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:14:21,378 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:14:21,378 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-12 19:14:21,378 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-12 19:14:21,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:14:21,379 INFO L85 PathProgramCache]: Analyzing trace with hash -763066877, now seen corresponding path program 1 times [2022-07-12 19:14:21,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:14:21,379 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327583722] [2022-07-12 19:14:21,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:14:21,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:14:21,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:14:21,464 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:14:21,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:14:21,465 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327583722] [2022-07-12 19:14:21,465 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327583722] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:14:21,465 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1663530265] [2022-07-12 19:14:21,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:14:21,465 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:14:21,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 19:14:21,471 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 19:14:21,478 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-12 19:14:21,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:14:21,564 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-12 19:14:21,570 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:14:21,635 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:14:21,636 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:14:21,669 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:14:21,670 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1663530265] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 19:14:21,670 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 19:14:21,671 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2022-07-12 19:14:21,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168435220] [2022-07-12 19:14:21,671 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 19:14:21,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 19:14:21,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:14:21,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 19:14:21,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-07-12 19:14:21,676 INFO L87 Difference]: Start difference. First operand 54 states and 57 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:14:21,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:14:21,696 INFO L93 Difference]: Finished difference Result 56 states and 59 transitions. [2022-07-12 19:14:21,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 19:14:21,697 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-07-12 19:14:21,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:14:21,697 INFO L225 Difference]: With dead ends: 56 [2022-07-12 19:14:21,698 INFO L226 Difference]: Without dead ends: 56 [2022-07-12 19:14:21,701 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-07-12 19:14:21,702 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 16 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 19:14:21,703 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 134 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 19:14:21,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-07-12 19:14:21,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2022-07-12 19:14:21,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 37 states have (on average 1.5945945945945945) internal successors, (59), 55 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:14:21,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 59 transitions. [2022-07-12 19:14:21,711 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 59 transitions. Word has length 14 [2022-07-12 19:14:21,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:14:21,711 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 59 transitions. [2022-07-12 19:14:21,711 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:14:21,711 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 59 transitions. [2022-07-12 19:14:21,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-12 19:14:21,712 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:14:21,712 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-07-12 19:14:21,740 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-12 19:14:21,923 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:14:21,924 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-12 19:14:21,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:14:21,924 INFO L85 PathProgramCache]: Analyzing trace with hash -2097949021, now seen corresponding path program 1 times [2022-07-12 19:14:21,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:14:21,925 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623086276] [2022-07-12 19:14:21,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:14:21,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:14:21,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:14:22,011 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:14:22,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:14:22,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623086276] [2022-07-12 19:14:22,012 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1623086276] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:14:22,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [116543454] [2022-07-12 19:14:22,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:14:22,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:14:22,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 19:14:22,014 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 19:14:22,025 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-12 19:14:22,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:14:22,098 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-12 19:14:22,100 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:14:22,126 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 19:14:22,167 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-12 19:14:22,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 17 treesize of output 21 [2022-07-12 19:14:22,177 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:14:22,178 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:14:22,281 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:14:22,281 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [116543454] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 19:14:22,282 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 19:14:22,282 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 4] total 6 [2022-07-12 19:14:22,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755197296] [2022-07-12 19:14:22,282 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 19:14:22,283 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 19:14:22,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:14:22,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 19:14:22,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-12 19:14:22,284 INFO L87 Difference]: Start difference. First operand 56 states and 59 transitions. Second operand has 7 states, 6 states have (on average 4.5) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:14:22,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:14:22,379 INFO L93 Difference]: Finished difference Result 82 states and 87 transitions. [2022-07-12 19:14:22,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 19:14:22,380 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.5) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-07-12 19:14:22,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:14:22,381 INFO L225 Difference]: With dead ends: 82 [2022-07-12 19:14:22,381 INFO L226 Difference]: Without dead ends: 82 [2022-07-12 19:14:22,381 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-07-12 19:14:22,382 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 76 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 46 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 19:14:22,382 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 123 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 95 Invalid, 0 Unknown, 46 Unchecked, 0.1s Time] [2022-07-12 19:14:22,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-07-12 19:14:22,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 55. [2022-07-12 19:14:22,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 37 states have (on average 1.5675675675675675) internal successors, (58), 54 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:14:22,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 58 transitions. [2022-07-12 19:14:22,386 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 58 transitions. Word has length 16 [2022-07-12 19:14:22,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:14:22,386 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 58 transitions. [2022-07-12 19:14:22,387 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.5) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:14:22,387 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 58 transitions. [2022-07-12 19:14:22,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-12 19:14:22,387 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:14:22,388 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-07-12 19:14:22,406 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-12 19:14:22,595 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,SelfDestructingSolverStorable5 [2022-07-12 19:14:22,596 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-12 19:14:22,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:14:22,596 INFO L85 PathProgramCache]: Analyzing trace with hash -2097949020, now seen corresponding path program 1 times [2022-07-12 19:14:22,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:14:22,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202327373] [2022-07-12 19:14:22,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:14:22,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:14:22,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:14:22,701 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:14:22,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:14:22,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202327373] [2022-07-12 19:14:22,701 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202327373] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:14:22,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2091903482] [2022-07-12 19:14:22,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:14:22,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:14:22,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 19:14:22,703 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 19:14:22,720 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-12 19:14:22,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:14:22,809 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-12 19:14:22,812 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:14:22,821 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 19:14:22,900 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:14:22,902 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-12 19:14:22,910 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 19:14:22,910 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-12 19:14:22,943 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:14:22,944 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:14:23,125 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 50 treesize of output 46 [2022-07-12 19:14:23,182 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:14:23,182 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2091903482] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 19:14:23,183 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 19:14:23,183 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2022-07-12 19:14:23,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129706154] [2022-07-12 19:14:23,183 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 19:14:23,184 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-12 19:14:23,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:14:23,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-12 19:14:23,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2022-07-12 19:14:23,185 INFO L87 Difference]: Start difference. First operand 55 states and 58 transitions. Second operand has 14 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 14 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:14:23,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:14:23,314 INFO L93 Difference]: Finished difference Result 81 states and 86 transitions. [2022-07-12 19:14:23,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 19:14:23,314 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 14 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-07-12 19:14:23,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:14:23,315 INFO L225 Difference]: With dead ends: 81 [2022-07-12 19:14:23,315 INFO L226 Difference]: Without dead ends: 81 [2022-07-12 19:14:23,316 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2022-07-12 19:14:23,316 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 323 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 323 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 58 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 19:14:23,317 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [323 Valid, 60 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 105 Invalid, 0 Unknown, 58 Unchecked, 0.1s Time] [2022-07-12 19:14:23,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-07-12 19:14:23,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 54. [2022-07-12 19:14:23,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 37 states have (on average 1.5405405405405406) internal successors, (57), 53 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:14:23,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 57 transitions. [2022-07-12 19:14:23,321 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 57 transitions. Word has length 16 [2022-07-12 19:14:23,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:14:23,321 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 57 transitions. [2022-07-12 19:14:23,321 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 14 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:14:23,322 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2022-07-12 19:14:23,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-12 19:14:23,322 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:14:23,322 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:14:23,351 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-12 19:14:23,535 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:14:23,536 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-12 19:14:23,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:14:23,536 INFO L85 PathProgramCache]: Analyzing trace with hash -1307957292, now seen corresponding path program 2 times [2022-07-12 19:14:23,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:14:23,537 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274116669] [2022-07-12 19:14:23,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:14:23,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:14:23,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:14:23,582 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:14:23,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:14:23,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274116669] [2022-07-12 19:14:23,582 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274116669] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:14:23,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [393583967] [2022-07-12 19:14:23,583 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 19:14:23,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:14:23,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 19:14:23,585 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 19:14:23,589 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-12 19:14:23,669 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-12 19:14:23,669 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 19:14:23,670 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-12 19:14:23,671 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:14:23,701 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-12 19:14:23,702 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 19:14:23,702 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [393583967] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:14:23,702 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 19:14:23,702 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2022-07-12 19:14:23,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318958950] [2022-07-12 19:14:23,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:14:23,703 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 19:14:23,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:14:23,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 19:14:23,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 19:14:23,704 INFO L87 Difference]: Start difference. First operand 54 states and 57 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:14:23,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:14:23,719 INFO L93 Difference]: Finished difference Result 80 states and 84 transitions. [2022-07-12 19:14:23,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 19:14:23,720 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-07-12 19:14:23,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:14:23,721 INFO L225 Difference]: With dead ends: 80 [2022-07-12 19:14:23,721 INFO L226 Difference]: Without dead ends: 80 [2022-07-12 19:14:23,721 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 20 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-12 19:14:23,722 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 90 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 19:14:23,722 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 91 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 19:14:23,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-07-12 19:14:23,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 55. [2022-07-12 19:14:23,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 38 states have (on average 1.5263157894736843) internal successors, (58), 54 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:14:23,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 58 transitions. [2022-07-12 19:14:23,734 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 58 transitions. Word has length 21 [2022-07-12 19:14:23,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:14:23,734 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 58 transitions. [2022-07-12 19:14:23,734 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:14:23,734 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 58 transitions. [2022-07-12 19:14:23,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-12 19:14:23,735 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:14:23,735 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:14:23,763 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-12 19:14:23,955 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:14:23,956 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-12 19:14:23,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:14:23,956 INFO L85 PathProgramCache]: Analyzing trace with hash -1307957265, now seen corresponding path program 1 times [2022-07-12 19:14:23,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:14:23,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311828375] [2022-07-12 19:14:23,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:14:23,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:14:23,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:14:23,997 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:14:23,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:14:23,997 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311828375] [2022-07-12 19:14:23,998 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311828375] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:14:23,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2053760830] [2022-07-12 19:14:23,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:14:23,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:14:23,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 19:14:24,000 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 19:14:24,001 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-12 19:14:24,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:14:24,093 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-12 19:14:24,094 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:14:24,112 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:14:24,113 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:14:24,126 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:14:24,126 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2053760830] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 19:14:24,126 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 19:14:24,127 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 4 [2022-07-12 19:14:24,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179439252] [2022-07-12 19:14:24,127 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 19:14:24,127 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 19:14:24,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:14:24,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 19:14:24,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 19:14:24,128 INFO L87 Difference]: Start difference. First operand 55 states and 58 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:14:24,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:14:24,150 INFO L93 Difference]: Finished difference Result 55 states and 57 transitions. [2022-07-12 19:14:24,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 19:14:24,151 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-07-12 19:14:24,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:14:24,151 INFO L225 Difference]: With dead ends: 55 [2022-07-12 19:14:24,152 INFO L226 Difference]: Without dead ends: 55 [2022-07-12 19:14:24,152 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-12 19:14:24,153 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 81 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 19:14:24,153 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 45 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 19:14:24,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-07-12 19:14:24,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2022-07-12 19:14:24,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 38 states have (on average 1.5) internal successors, (57), 54 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:14:24,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 57 transitions. [2022-07-12 19:14:24,156 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 57 transitions. Word has length 21 [2022-07-12 19:14:24,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:14:24,156 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 57 transitions. [2022-07-12 19:14:24,156 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:14:24,156 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 57 transitions. [2022-07-12 19:14:24,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-12 19:14:24,157 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:14:24,157 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:14:24,184 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-12 19:14:24,359 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:14:24,360 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-12 19:14:24,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:14:24,360 INFO L85 PathProgramCache]: Analyzing trace with hash 2020822154, now seen corresponding path program 1 times [2022-07-12 19:14:24,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:14:24,361 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251229207] [2022-07-12 19:14:24,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:14:24,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:14:24,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:14:24,446 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 19:14:24,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:14:24,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251229207] [2022-07-12 19:14:24,447 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251229207] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:14:24,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [957977480] [2022-07-12 19:14:24,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:14:24,448 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:14:24,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 19:14:24,449 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 19:14:24,455 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-12 19:14:24,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:14:24,564 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-12 19:14:24,565 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:14:24,571 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 19:14:24,589 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:14:24,590 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-12 19:14:24,608 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 19:14:24,609 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-07-12 19:14:24,627 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-12 19:14:24,627 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:14:24,687 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-12 19:14:24,688 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [957977480] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 19:14:24,688 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 19:14:24,688 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 8 [2022-07-12 19:14:24,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928289109] [2022-07-12 19:14:24,688 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 19:14:24,689 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 19:14:24,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:14:24,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 19:14:24,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-07-12 19:14:24,690 INFO L87 Difference]: Start difference. First operand 55 states and 57 transitions. Second operand has 9 states, 8 states have (on average 4.25) internal successors, (34), 9 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:14:24,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:14:24,763 INFO L93 Difference]: Finished difference Result 72 states and 75 transitions. [2022-07-12 19:14:24,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 19:14:24,764 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.25) internal successors, (34), 9 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-07-12 19:14:24,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:14:24,764 INFO L225 Difference]: With dead ends: 72 [2022-07-12 19:14:24,764 INFO L226 Difference]: Without dead ends: 72 [2022-07-12 19:14:24,765 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2022-07-12 19:14:24,765 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 99 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 19 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 19:14:24,766 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 92 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 90 Invalid, 0 Unknown, 19 Unchecked, 0.1s Time] [2022-07-12 19:14:24,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-07-12 19:14:24,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 55. [2022-07-12 19:14:24,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 39 states have (on average 1.4871794871794872) internal successors, (58), 54 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:14:24,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 58 transitions. [2022-07-12 19:14:24,768 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 58 transitions. Word has length 22 [2022-07-12 19:14:24,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:14:24,769 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 58 transitions. [2022-07-12 19:14:24,769 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.25) internal successors, (34), 9 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:14:24,769 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 58 transitions. [2022-07-12 19:14:24,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-12 19:14:24,769 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:14:24,770 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:14:24,795 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-12 19:14:24,985 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:14:24,986 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-12 19:14:24,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:14:24,986 INFO L85 PathProgramCache]: Analyzing trace with hash 2020822155, now seen corresponding path program 1 times [2022-07-12 19:14:24,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:14:24,986 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288164178] [2022-07-12 19:14:24,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:14:24,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:14:25,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:14:25,131 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:14:25,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:14:25,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288164178] [2022-07-12 19:14:25,132 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288164178] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:14:25,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [674983179] [2022-07-12 19:14:25,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:14:25,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:14:25,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 19:14:25,134 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 19:14:25,136 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-12 19:14:25,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:14:25,235 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 18 conjunts are in the unsatisfiable core [2022-07-12 19:14:25,236 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:14:25,243 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 19:14:25,258 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:14:25,258 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-12 19:14:25,295 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:14:25,296 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-12 19:14:25,328 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 19:14:25,328 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:14:27,602 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 19:14:27,603 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [674983179] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 19:14:27,603 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 19:14:27,603 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4] total 10 [2022-07-12 19:14:27,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242798621] [2022-07-12 19:14:27,604 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 19:14:27,604 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-12 19:14:27,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:14:27,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-12 19:14:27,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2022-07-12 19:14:27,605 INFO L87 Difference]: Start difference. First operand 55 states and 58 transitions. Second operand has 11 states, 10 states have (on average 5.9) internal successors, (59), 11 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:14:27,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:14:27,715 INFO L93 Difference]: Finished difference Result 81 states and 84 transitions. [2022-07-12 19:14:27,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 19:14:27,716 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.9) internal successors, (59), 11 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-07-12 19:14:27,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:14:27,716 INFO L225 Difference]: With dead ends: 81 [2022-07-12 19:14:27,716 INFO L226 Difference]: Without dead ends: 81 [2022-07-12 19:14:27,717 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2022-07-12 19:14:27,717 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 130 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 25 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 19:14:27,717 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 115 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 108 Invalid, 0 Unknown, 25 Unchecked, 0.1s Time] [2022-07-12 19:14:27,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-07-12 19:14:27,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 53. [2022-07-12 19:14:27,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 39 states have (on average 1.4102564102564104) internal successors, (55), 52 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:14:27,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 55 transitions. [2022-07-12 19:14:27,719 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 55 transitions. Word has length 22 [2022-07-12 19:14:27,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:14:27,720 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 55 transitions. [2022-07-12 19:14:27,720 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.9) internal successors, (59), 11 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:14:27,720 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 55 transitions. [2022-07-12 19:14:27,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-12 19:14:27,720 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:14:27,720 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:14:27,747 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-12 19:14:27,931 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:14:27,932 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-12 19:14:27,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:14:27,932 INFO L85 PathProgramCache]: Analyzing trace with hash -1779022636, now seen corresponding path program 1 times [2022-07-12 19:14:27,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:14:27,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550012558] [2022-07-12 19:14:27,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:14:27,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:14:27,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:14:27,994 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-12 19:14:27,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:14:27,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550012558] [2022-07-12 19:14:27,995 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550012558] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:14:27,995 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:14:27,995 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 19:14:27,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77868149] [2022-07-12 19:14:27,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:14:27,996 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 19:14:27,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:14:27,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 19:14:27,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-12 19:14:27,997 INFO L87 Difference]: Start difference. First operand 53 states and 55 transitions. Second operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:14:28,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:14:28,160 INFO L93 Difference]: Finished difference Result 74 states and 77 transitions. [2022-07-12 19:14:28,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 19:14:28,160 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-07-12 19:14:28,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:14:28,161 INFO L225 Difference]: With dead ends: 74 [2022-07-12 19:14:28,161 INFO L226 Difference]: Without dead ends: 74 [2022-07-12 19:14:28,161 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2022-07-12 19:14:28,162 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 109 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 19:14:28,162 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 131 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 19:14:28,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-07-12 19:14:28,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 54. [2022-07-12 19:14:28,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 40 states have (on average 1.425) internal successors, (57), 53 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:14:28,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 57 transitions. [2022-07-12 19:14:28,164 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 57 transitions. Word has length 23 [2022-07-12 19:14:28,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:14:28,164 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 57 transitions. [2022-07-12 19:14:28,164 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:14:28,164 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2022-07-12 19:14:28,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-12 19:14:28,165 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:14:28,165 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:14:28,165 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-12 19:14:28,165 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-12 19:14:28,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:14:28,165 INFO L85 PathProgramCache]: Analyzing trace with hash -1779022635, now seen corresponding path program 1 times [2022-07-12 19:14:28,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:14:28,166 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943954611] [2022-07-12 19:14:28,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:14:28,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:14:28,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:14:28,268 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 19:14:28,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:14:28,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943954611] [2022-07-12 19:14:28,268 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943954611] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:14:28,269 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:14:28,269 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 19:14:28,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664864670] [2022-07-12 19:14:28,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:14:28,269 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 19:14:28,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:14:28,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 19:14:28,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-12 19:14:28,270 INFO L87 Difference]: Start difference. First operand 54 states and 57 transitions. Second operand has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 8 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:14:28,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:14:28,452 INFO L93 Difference]: Finished difference Result 68 states and 71 transitions. [2022-07-12 19:14:28,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 19:14:28,453 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 8 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-07-12 19:14:28,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:14:28,454 INFO L225 Difference]: With dead ends: 68 [2022-07-12 19:14:28,454 INFO L226 Difference]: Without dead ends: 68 [2022-07-12 19:14:28,454 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2022-07-12 19:14:28,454 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 190 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 19:14:28,455 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 89 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 19:14:28,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-07-12 19:14:28,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 54. [2022-07-12 19:14:28,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 40 states have (on average 1.4) internal successors, (56), 53 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:14:28,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 56 transitions. [2022-07-12 19:14:28,457 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 56 transitions. Word has length 23 [2022-07-12 19:14:28,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:14:28,457 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 56 transitions. [2022-07-12 19:14:28,457 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 8 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:14:28,457 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 56 transitions. [2022-07-12 19:14:28,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-12 19:14:28,458 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:14:28,458 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] [2022-07-12 19:14:28,458 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-12 19:14:28,458 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-12 19:14:28,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:14:28,458 INFO L85 PathProgramCache]: Analyzing trace with hash 1033116430, now seen corresponding path program 1 times [2022-07-12 19:14:28,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:14:28,459 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68149688] [2022-07-12 19:14:28,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:14:28,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:14:28,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:14:28,650 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:14:28,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:14:28,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68149688] [2022-07-12 19:14:28,650 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68149688] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:14:28,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2115196445] [2022-07-12 19:14:28,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:14:28,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:14:28,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 19:14:28,656 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 19:14:28,685 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-12 19:14:28,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:14:28,780 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 49 conjunts are in the unsatisfiable core [2022-07-12 19:14:28,786 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:14:28,807 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 19:14:28,871 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 19:14:28,871 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-12 19:14:28,908 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 19:14:28,943 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-07-12 19:14:28,943 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 23 treesize of output 22 [2022-07-12 19:14:28,963 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 19:14:28,964 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 35 [2022-07-12 19:14:29,122 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 49 treesize of output 37 [2022-07-12 19:14:29,170 INFO L356 Elim1Store]: treesize reduction 3, result has 78.6 percent of original size [2022-07-12 19:14:29,170 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 47 treesize of output 27 [2022-07-12 19:14:29,178 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:14:29,178 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:14:29,283 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 28 treesize of output 20 [2022-07-12 19:14:29,411 INFO L356 Elim1Store]: treesize reduction 5, result has 79.2 percent of original size [2022-07-12 19:14:29,412 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 28 treesize of output 27 [2022-07-12 19:14:29,419 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_812 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_812))) (let ((.cse1 (select (select .cse0 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= (select (select .cse0 .cse1) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse1)))))) is different from false [2022-07-12 19:14:29,436 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_812 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int) (v_ArrVal_810 Int)) (let ((.cse1 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) v_ArrVal_810)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_812))) (let ((.cse0 (select (select .cse1 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse0)) (= (select (select .cse1 .cse0) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|))))) is different from false [2022-07-12 19:14:29,455 INFO L356 Elim1Store]: treesize reduction 27, result has 43.8 percent of original size [2022-07-12 19:14:29,456 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 76 treesize of output 51 [2022-07-12 19:14:29,496 INFO L356 Elim1Store]: treesize reduction 36, result has 48.6 percent of original size [2022-07-12 19:14:29,496 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 123 treesize of output 124 [2022-07-12 19:14:29,508 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:14:29,508 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 108 treesize of output 104 [2022-07-12 19:14:29,638 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-07-12 19:14:29,639 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2115196445] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 19:14:29,639 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 19:14:29,639 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 14] total 35 [2022-07-12 19:14:29,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352680637] [2022-07-12 19:14:29,640 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 19:14:29,641 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-07-12 19:14:29,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:14:29,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-07-12 19:14:29,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=1027, Unknown=2, NotChecked=130, Total=1260 [2022-07-12 19:14:29,642 INFO L87 Difference]: Start difference. First operand 54 states and 56 transitions. Second operand has 36 states, 35 states have (on average 1.9714285714285715) internal successors, (69), 36 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:14:29,770 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)))) (and (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (not (= .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= .cse0 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (forall ((v_ArrVal_812 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int) (v_ArrVal_810 Int)) (let ((.cse2 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) v_ArrVal_810)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_812))) (let ((.cse1 (select (select .cse2 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse1)) (= (select (select .cse2 .cse1) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|))))) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= (select |c_#valid| .cse0) 1))) is different from false [2022-07-12 19:14:29,773 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (forall ((v_ArrVal_812 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_812))) (let ((.cse1 (select (select .cse0 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= (select (select .cse0 .cse1) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse1))))))) is different from false [2022-07-12 19:14:29,776 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (forall ((v_ArrVal_812 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_812))) (let ((.cse1 (select (select .cse0 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= (select (select .cse0 .cse1) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse1))))))) is different from false [2022-07-12 19:14:30,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:14:30,472 INFO L93 Difference]: Finished difference Result 114 states and 120 transitions. [2022-07-12 19:14:30,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-12 19:14:30,473 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 1.9714285714285715) internal successors, (69), 36 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-07-12 19:14:30,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:14:30,474 INFO L225 Difference]: With dead ends: 114 [2022-07-12 19:14:30,474 INFO L226 Difference]: Without dead ends: 114 [2022-07-12 19:14:30,475 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=236, Invalid=1585, Unknown=5, NotChecked=430, Total=2256 [2022-07-12 19:14:30,475 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 141 mSDsluCounter, 599 mSDsCounter, 0 mSdLazyCounter, 756 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 651 SdHoareTripleChecker+Invalid, 1107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 756 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 343 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-12 19:14:30,476 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 651 Invalid, 1107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 756 Invalid, 0 Unknown, 343 Unchecked, 0.4s Time] [2022-07-12 19:14:30,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2022-07-12 19:14:30,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 70. [2022-07-12 19:14:30,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 56 states have (on average 1.3392857142857142) internal successors, (75), 69 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:14:30,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 75 transitions. [2022-07-12 19:14:30,478 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 75 transitions. Word has length 26 [2022-07-12 19:14:30,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:14:30,478 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 75 transitions. [2022-07-12 19:14:30,479 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 1.9714285714285715) internal successors, (69), 36 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:14:30,479 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 75 transitions. [2022-07-12 19:14:30,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-12 19:14:30,479 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:14:30,480 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] [2022-07-12 19:14:30,506 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-07-12 19:14:30,691 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-07-12 19:14:30,692 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-12 19:14:30,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:14:30,692 INFO L85 PathProgramCache]: Analyzing trace with hash 1033116431, now seen corresponding path program 1 times [2022-07-12 19:14:30,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:14:30,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011962948] [2022-07-12 19:14:30,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:14:30,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:14:30,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:14:30,991 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:14:30,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:14:30,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011962948] [2022-07-12 19:14:30,991 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011962948] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:14:30,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1735285844] [2022-07-12 19:14:30,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:14:30,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:14:30,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 19:14:30,993 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 19:14:31,020 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-12 19:14:31,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:14:31,116 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 69 conjunts are in the unsatisfiable core [2022-07-12 19:14:31,118 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:14:31,137 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 19:14:31,237 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 19:14:31,237 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-12 19:14:31,279 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 19:14:31,286 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 19:14:31,331 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-07-12 19:14:31,332 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 23 treesize of output 22 [2022-07-12 19:14:31,339 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:14:31,340 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 23 treesize of output 22 [2022-07-12 19:14:31,417 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 19:14:31,418 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 68 [2022-07-12 19:14:31,424 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 50 treesize of output 48 [2022-07-12 19:14:31,761 INFO L356 Elim1Store]: treesize reduction 56, result has 1.8 percent of original size [2022-07-12 19:14:31,762 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 161 treesize of output 74 [2022-07-12 19:14:31,784 INFO L356 Elim1Store]: treesize reduction 14, result has 57.6 percent of original size [2022-07-12 19:14:31,784 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 57 treesize of output 45 [2022-07-12 19:14:31,882 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:14:31,882 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:14:32,557 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:14:32,557 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 264 treesize of output 328 [2022-07-12 19:14:33,043 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse12 (forall ((v_ArrVal_920 (Array Int Int)) (v_ArrVal_921 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse53 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_921))) (let ((.cse55 (select (select .cse53 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse54 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_920) |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (<= 0 (+ (select (select .cse53 .cse54) (+ .cse55 4)) 8)) (not (= .cse55 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (not (= .cse54 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)))))))) (and (forall ((v_prenex_7 Int) (v_prenex_4 Int) (v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int)) (v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_6))) (let ((.cse4 (select (select .cse1 v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5))) (let ((.cse2 (select (select .cse6 v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (+ .cse4 4))) (let ((.cse0 (select (select .cse6 .cse2) .cse3))) (or (= .cse0 0) (<= (select (select .cse1 .cse2) .cse3) |c_ULTIMATE.start_dll_create_~head~0#1.offset|) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse2)) (not (= .cse4 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (= .cse0 (select (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2))) (select .cse5 (select (select .cse5 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ 4 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3) v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))))))) (or (forall ((v_prenex_7 Int) (v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int))) (let ((.cse10 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5))) (let ((.cse8 (select (select .cse10 v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse9 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_6) v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse7 (select (select .cse10 .cse8) (+ .cse9 4)))) (or (= .cse7 0) (= .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse8)) (not (= .cse9 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))))))) (forall ((v_prenex_4 Int) (v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int))) (= (select (let ((.cse11 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2))) (select .cse11 (select (select .cse11 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ 4 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3) v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|))) |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (or .cse12 (forall ((v_prenex_7 Int) (v_prenex_4 Int) (v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int)) (v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int))) (= (select (let ((.cse13 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5))) (select .cse13 (select (select .cse13 v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_6) v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)) (select (let ((.cse14 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2))) (select .cse14 (select (select .cse14 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ 4 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3) v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) (or (forall ((v_prenex_7 Int) (v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int))) (= (select (let ((.cse15 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5))) (select .cse15 (select (select .cse15 v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_6) v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (forall ((v_prenex_4 Int) (v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int))) (let ((.cse16 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3))) (let ((.cse20 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2)) (.cse19 (select (select .cse16 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse18 (+ 4 .cse19)) (.cse17 (select (select .cse20 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= (select (select .cse16 .cse17) .cse18) 0) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| .cse19)) (= (select (select .cse20 .cse17) .cse18) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse17)))))))) (forall ((v_prenex_7 Int) (v_prenex_4 Int) (v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int)) (v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int))) (let ((.cse25 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5))) (let ((.cse22 (select (select .cse25 v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse23 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_6) v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse21 (select (select .cse25 .cse22) (+ .cse23 4)))) (or (= .cse21 0) (= .cse21 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse22)) (not (= .cse23 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (= .cse21 (select (let ((.cse24 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2))) (select .cse24 (select (select .cse24 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ 4 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3) v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|))))))))) (or (forall ((v_prenex_7 Int) (v_prenex_4 Int) (v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int)) (v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int))) (let ((.cse26 (select (let ((.cse28 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2))) (select .cse28 (select (select .cse28 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ 4 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3) v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= .cse26 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (= (select (let ((.cse27 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5))) (select .cse27 (select (select .cse27 v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_6) v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)) .cse26)))) .cse12) .cse12 (forall ((v_prenex_7 Int) (v_prenex_4 Int) (v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int)) (v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int))) (let ((.cse29 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3))) (let ((.cse32 (select (select .cse29 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse35 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2))) (let ((.cse30 (select (select .cse35 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse31 (+ 4 .cse32))) (let ((.cse33 (select (select .cse35 .cse30) .cse31))) (or (= (select (select .cse29 .cse30) .cse31) 0) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| .cse32)) (= .cse33 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse30)) (= (select (let ((.cse34 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5))) (select .cse34 (select (select .cse34 v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_6) v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)) .cse33))))))) (or .cse12 (forall ((v_prenex_7 Int) (v_prenex_4 Int) (v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int)) (v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int))) (let ((.cse36 (select (let ((.cse38 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5))) (select .cse38 (select (select .cse38 v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_6) v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))) (or (= .cse36 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (= .cse36 (select (let ((.cse37 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2))) (select .cse37 (select (select .cse37 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ 4 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3) v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))))) (forall ((v_prenex_4 Int) (v_prenex_3 (Array Int Int))) (or (forall ((v_prenex_2 (Array Int Int))) (let ((.cse40 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2) v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse39 (let ((.cse41 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3))) (select (select .cse41 .cse40) (+ 4 (select (select .cse41 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) (or (<= .cse39 |c_ULTIMATE.start_dll_create_~head~0#1.offset|) (= .cse39 0) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse40)))))) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3) v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (forall ((v_prenex_7 Int) (v_prenex_6 (Array Int Int))) (or (forall ((v_prenex_5 (Array Int Int))) (let ((.cse42 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5)) (.cse45 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_6))) (let ((.cse44 (+ (select (select .cse45 v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)) (.cse43 (select (select .cse42 v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= (select (select .cse42 .cse43) .cse44) 0) (<= (select (select .cse45 .cse43) .cse44) |c_ULTIMATE.start_dll_create_~head~0#1.offset|) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse43)))))) (not (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_6) v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)))) (forall ((v_prenex_7 Int) (v_prenex_4 Int) (v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int)) (v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int))) (let ((.cse52 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3))) (let ((.cse47 (select (select .cse52 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse50 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2))) (let ((.cse48 (select (select .cse50 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse51 (+ 4 .cse47))) (let ((.cse46 (select (select .cse52 .cse48) .cse51))) (or (<= .cse46 |c_ULTIMATE.start_dll_create_~head~0#1.offset|) (= .cse46 0) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| .cse47)) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse48)) (= (select (let ((.cse49 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5))) (select .cse49 (select (select .cse49 v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_6) v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)) (select (select .cse50 .cse48) .cse51)))))))))) is different from false [2022-07-12 19:14:33,213 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_prenex_7 Int) (v_prenex_4 Int) (v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int)) (v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_6))) (let ((.cse4 (select (select .cse1 v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5))) (let ((.cse2 (select (select .cse6 v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (+ .cse4 4))) (let ((.cse0 (select (select .cse6 .cse2) .cse3))) (or (= .cse0 0) (<= (select (select .cse1 .cse2) .cse3) |c_ULTIMATE.start_dll_create_~head~0#1.offset|) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse2)) (not (= .cse4 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (= .cse0 (select (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2))) (select .cse5 (select (select .cse5 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ 4 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3) v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))))))) (or (forall ((v_prenex_7 Int) (v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int))) (let ((.cse10 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5))) (let ((.cse8 (select (select .cse10 v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse9 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_6) v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse7 (select (select .cse10 .cse8) (+ .cse9 4)))) (or (= .cse7 0) (= .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse8)) (not (= .cse9 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))))))) (forall ((v_prenex_4 Int) (v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int))) (= (select (let ((.cse11 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2))) (select .cse11 (select (select .cse11 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ 4 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3) v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|))) |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (or (forall ((v_prenex_7 Int) (v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int))) (= (select (let ((.cse12 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5))) (select .cse12 (select (select .cse12 v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_6) v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (forall ((v_prenex_4 Int) (v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int))) (let ((.cse13 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3))) (let ((.cse17 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2)) (.cse16 (select (select .cse13 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse15 (+ 4 .cse16)) (.cse14 (select (select .cse17 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= (select (select .cse13 .cse14) .cse15) 0) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| .cse16)) (= (select (select .cse17 .cse14) .cse15) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse14)))))))) (forall ((v_prenex_7 Int) (v_prenex_4 Int) (v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int)) (v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int))) (let ((.cse22 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5))) (let ((.cse19 (select (select .cse22 v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse20 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_6) v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse18 (select (select .cse22 .cse19) (+ .cse20 4)))) (or (= .cse18 0) (= .cse18 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse19)) (not (= .cse20 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (= .cse18 (select (let ((.cse21 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2))) (select .cse21 (select (select .cse21 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ 4 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3) v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|))))))))) (forall ((v_ArrVal_920 (Array Int Int)) (v_ArrVal_921 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse23 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_921))) (let ((.cse25 (select (select .cse23 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse24 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_920) |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (<= 0 (+ (select (select .cse23 .cse24) (+ .cse25 4)) 8)) (not (= .cse25 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (not (= .cse24 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)))))) (forall ((v_prenex_7 Int) (v_prenex_4 Int) (v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int)) (v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int))) (let ((.cse26 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3))) (let ((.cse29 (select (select .cse26 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse32 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2))) (let ((.cse27 (select (select .cse32 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse28 (+ 4 .cse29))) (let ((.cse30 (select (select .cse32 .cse27) .cse28))) (or (= (select (select .cse26 .cse27) .cse28) 0) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| .cse29)) (= .cse30 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse27)) (= (select (let ((.cse31 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5))) (select .cse31 (select (select .cse31 v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_6) v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)) .cse30))))))) (forall ((v_prenex_4 Int) (v_prenex_3 (Array Int Int))) (or (forall ((v_prenex_2 (Array Int Int))) (let ((.cse34 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2) v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse33 (let ((.cse35 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3))) (select (select .cse35 .cse34) (+ 4 (select (select .cse35 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) (or (<= .cse33 |c_ULTIMATE.start_dll_create_~head~0#1.offset|) (= .cse33 0) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse34)))))) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3) v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (forall ((v_prenex_7 Int) (v_prenex_6 (Array Int Int))) (or (forall ((v_prenex_5 (Array Int Int))) (let ((.cse36 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5)) (.cse39 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_6))) (let ((.cse38 (+ (select (select .cse39 v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)) (.cse37 (select (select .cse36 v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= (select (select .cse36 .cse37) .cse38) 0) (<= (select (select .cse39 .cse37) .cse38) |c_ULTIMATE.start_dll_create_~head~0#1.offset|) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse37)))))) (not (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_6) v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)))) (forall ((v_prenex_7 Int) (v_prenex_4 Int) (v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int)) (v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int))) (let ((.cse46 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3))) (let ((.cse41 (select (select .cse46 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse44 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2))) (let ((.cse42 (select (select .cse44 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse45 (+ 4 .cse41))) (let ((.cse40 (select (select .cse46 .cse42) .cse45))) (or (<= .cse40 |c_ULTIMATE.start_dll_create_~head~0#1.offset|) (= .cse40 0) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| .cse41)) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse42)) (= (select (let ((.cse43 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5))) (select .cse43 (select (select .cse43 v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_6) v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)) (select (select .cse44 .cse42) .cse45))))))))) is different from false [2022-07-12 19:14:33,444 WARN L833 $PredicateComparison]: unable to prove that (and (or (forall ((v_prenex_7 Int) (v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int))) (= (let ((.cse1 (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))) (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1 0)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5))) (select .cse0 (select (select .cse0 v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1 0)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_6) v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (forall ((v_prenex_4 Int) (v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int))) (let ((.cse7 (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))) (let ((.cse2 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse7 0)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3))) (let ((.cse6 (select (select .cse2 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse7 0)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2))) (let ((.cse3 (select (select .cse5 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (+ .cse6 4))) (or (= (select (select .cse2 .cse3) .cse4) 0) (not (= .cse3 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= (select (select .cse5 .cse3) .cse4) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= .cse6 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))))))))) (forall ((v_prenex_7 Int) (v_prenex_4 Int) (v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int)) (v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int))) (let ((.cse15 (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))) (let ((.cse12 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse15 0)))) (let ((.cse13 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse15 0))) (.cse14 (store .cse12 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5))) (let ((.cse10 (select (select .cse14 v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse9 (select (select (store .cse13 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_6) v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse8 (select (select .cse14 .cse10) (+ .cse9 4)))) (or (= .cse8 0) (= .cse8 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= .cse9 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (not (= .cse10 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= (select (let ((.cse11 (store .cse12 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2))) (select .cse11 (select (select .cse11 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store .cse13 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3) v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)) .cse8)))))))) (forall ((v_prenex_7 Int) (v_prenex_4 Int) (v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int)) (v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int))) (let ((.cse25 (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))) (let ((.cse22 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse25 0)))) (let ((.cse21 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse25 0))) (.cse24 (store .cse22 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3))) (let ((.cse23 (select (select .cse24 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse18 (store .cse21 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2))) (let ((.cse17 (select (select .cse18 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse19 (+ .cse23 4))) (let ((.cse16 (select (select .cse24 .cse17) .cse19))) (or (= .cse16 0) (not (= .cse17 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (<= .cse16 |c_ULTIMATE.start_dll_create_~head~0#1.offset|) (= (select (select .cse18 .cse17) .cse19) (select (let ((.cse20 (store .cse21 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5))) (select .cse20 (select (select .cse20 v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store .cse22 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_6) v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (not (= .cse23 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)))))))))) (forall ((v_prenex_7 Int) (v_prenex_6 (Array Int Int))) (or (forall ((v_prenex_5 (Array Int Int))) (let ((.cse30 (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))) (let ((.cse26 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse30 0)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5)) (.cse29 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse30 0)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_6))) (let ((.cse28 (+ (select (select .cse29 v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)) (.cse27 (select (select .cse26 v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= (select (select .cse26 .cse27) .cse28) 0) (<= (select (select .cse29 .cse27) .cse28) |c_ULTIMATE.start_dll_create_~head~0#1.offset|) (not (= .cse27 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))))))) (not (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) 0)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_6) v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)))) (or (forall ((v_prenex_7 Int) (v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int))) (let ((.cse35 (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))) (let ((.cse34 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse35 0)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5))) (let ((.cse33 (select (select .cse34 v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse32 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse35 0)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_6) v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse31 (select (select .cse34 .cse33) (+ .cse32 4)))) (or (= .cse31 0) (= .cse31 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= .cse32 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (not (= .cse33 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)))))))) (forall ((v_prenex_4 Int) (v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int))) (= (let ((.cse37 (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))) (select (let ((.cse36 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse37 0)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2))) (select .cse36 (select (select .cse36 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse37 0)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3) v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (forall ((v_prenex_7 Int) (v_prenex_4 Int) (v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int)) (v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int))) (let ((.cse47 (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))) (let ((.cse44 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse47 0)))) (let ((.cse43 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse47 0))) (.cse38 (store .cse44 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3))) (let ((.cse45 (select (select .cse38 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse46 (store .cse43 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2))) (let ((.cse39 (select (select .cse46 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse40 (+ .cse45 4))) (let ((.cse41 (select (select .cse46 .cse39) .cse40))) (or (= (select (select .cse38 .cse39) .cse40) 0) (not (= .cse39 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= .cse41 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (= .cse41 (select (let ((.cse42 (store .cse43 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5))) (select .cse42 (select (select .cse42 v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store .cse44 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_6) v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (not (= .cse45 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)))))))))) (forall ((v_ArrVal_920 (Array Int Int)) (v_ArrVal_921 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse51 (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))) (let ((.cse48 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse51 0)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_921))) (let ((.cse50 (select (select .cse48 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse49 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse51 0)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_920) |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (<= 0 (+ (select (select .cse48 .cse49) (+ .cse50 4)) 8)) (not (= .cse50 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (not (= .cse49 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))))))) (forall ((v_prenex_4 Int) (v_prenex_3 (Array Int Int))) (or (forall ((v_prenex_2 (Array Int Int))) (let ((.cse55 (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))) (let ((.cse53 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse55 0)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2) v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse52 (let ((.cse54 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse55 0)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3))) (select (select .cse54 .cse53) (+ (select (select .cse54 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))))) (or (= .cse52 0) (not (= .cse53 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (<= .cse52 |c_ULTIMATE.start_dll_create_~head~0#1.offset|)))))) (not (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) 0)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3) v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)))) (forall ((v_prenex_7 Int) (v_prenex_4 Int) (v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int)) (v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int))) (let ((.cse65 (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))) (let ((.cse63 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse65 0)))) (let ((.cse62 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse65 0))) (.cse57 (store .cse63 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_6))) (let ((.cse60 (select (select .cse57 v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse64 (store .cse62 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5))) (let ((.cse58 (select (select .cse64 v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse59 (+ .cse60 4))) (let ((.cse56 (select (select .cse64 .cse58) .cse59))) (or (= .cse56 0) (<= (select (select .cse57 .cse58) .cse59) |c_ULTIMATE.start_dll_create_~head~0#1.offset|) (not (= .cse60 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (not (= .cse58 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= (select (let ((.cse61 (store .cse62 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2))) (select .cse61 (select (select .cse61 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store .cse63 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3) v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)) .cse56)))))))))) is different from false [2022-07-12 19:14:33,504 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:14:33,512 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:14:33,512 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 308 treesize of output 223 [2022-07-12 19:14:34,084 INFO L356 Elim1Store]: treesize reduction 345, result has 36.1 percent of original size [2022-07-12 19:14:34,084 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 11 new quantified variables, introduced 28 case distinctions, treesize of input 1158 treesize of output 1078 [2022-07-12 19:14:34,120 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:14:34,124 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:14:34,138 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:14:34,138 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 860 treesize of output 463 [2022-07-12 19:14:34,220 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:14:36,249 INFO L356 Elim1Store]: treesize reduction 736, result has 56.7 percent of original size [2022-07-12 19:14:36,250 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 15 select indices, 15 select index equivalence classes, 1 disjoint index pairs (out of 105 index pairs), introduced 17 new quantified variables, introduced 104 case distinctions, treesize of input 86164 treesize of output 71100 [2022-07-12 19:14:37,528 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:14:37,530 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 70405 treesize of output 67577 [2022-07-12 19:14:38,110 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:14:38,214 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:14:38,215 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 66874 treesize of output 62162 [2022-07-12 19:14:39,447 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:14:39,448 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 61990 treesize of output 57350 [2022-07-12 19:14:40,063 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:14:40,064 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 1079 treesize of output 1019 [2022-07-12 19:14:41,216 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 394 treesize of output 336