./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-ext3-properties/sll_of_sll_nondet_append-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version f4b24e32 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/list-ext3-properties/sll_of_sll_nondet_append-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash fabf091179f48b7141dc193b5040f4974c042bd8a2afb03b99137d693bf63ce7 --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-14 07:03:43,112 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-14 07:03:43,114 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-14 07:03:43,146 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-14 07:03:43,146 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-14 07:03:43,147 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-14 07:03:43,151 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-14 07:03:43,157 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-14 07:03:43,158 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-14 07:03:43,167 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-14 07:03:43,168 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-14 07:03:43,170 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-14 07:03:43,170 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-14 07:03:43,173 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-14 07:03:43,174 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-14 07:03:43,176 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-14 07:03:43,177 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-14 07:03:43,178 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-14 07:03:43,182 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-14 07:03:43,183 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-14 07:03:43,187 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-14 07:03:43,188 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-14 07:03:43,189 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-14 07:03:43,190 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-14 07:03:43,191 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-14 07:03:43,196 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-14 07:03:43,196 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-14 07:03:43,196 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-14 07:03:43,197 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-14 07:03:43,198 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-14 07:03:43,198 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-14 07:03:43,199 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-14 07:03:43,200 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-14 07:03:43,201 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-14 07:03:43,201 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-14 07:03:43,202 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-14 07:03:43,202 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-14 07:03:43,203 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-14 07:03:43,203 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-14 07:03:43,203 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-14 07:03:43,204 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-14 07:03:43,205 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-14 07:03:43,206 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-07-14 07:03:43,227 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-14 07:03:43,228 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-14 07:03:43,228 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-14 07:03:43,228 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-14 07:03:43,229 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-14 07:03:43,229 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-14 07:03:43,230 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-14 07:03:43,231 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-14 07:03:43,231 INFO L138 SettingsManager]: * Use SBE=true [2022-07-14 07:03:43,232 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-14 07:03:43,232 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-14 07:03:43,232 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-14 07:03:43,232 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-14 07:03:43,232 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-14 07:03:43,233 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-14 07:03:43,233 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-14 07:03:43,233 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-14 07:03:43,233 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-14 07:03:43,233 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-14 07:03:43,233 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-14 07:03:43,234 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-14 07:03:43,234 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-14 07:03:43,234 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-14 07:03:43,234 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-14 07:03:43,234 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-14 07:03:43,235 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 07:03:43,235 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-14 07:03:43,235 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-14 07:03:43,235 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-14 07:03:43,235 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-14 07:03:43,236 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 -> fabf091179f48b7141dc193b5040f4974c042bd8a2afb03b99137d693bf63ce7 [2022-07-14 07:03:43,449 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-14 07:03:43,482 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-14 07:03:43,484 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-14 07:03:43,485 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-14 07:03:43,486 INFO L275 PluginConnector]: CDTParser initialized [2022-07-14 07:03:43,487 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-ext3-properties/sll_of_sll_nondet_append-1.i [2022-07-14 07:03:43,551 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3daac0c2e/a8c8833a78f647bc92f44891aa319886/FLAG3915d5d12 [2022-07-14 07:03:44,022 INFO L306 CDTParser]: Found 1 translation units. [2022-07-14 07:03:44,023 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext3-properties/sll_of_sll_nondet_append-1.i [2022-07-14 07:03:44,054 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3daac0c2e/a8c8833a78f647bc92f44891aa319886/FLAG3915d5d12 [2022-07-14 07:03:44,553 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3daac0c2e/a8c8833a78f647bc92f44891aa319886 [2022-07-14 07:03:44,555 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-14 07:03:44,556 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-14 07:03:44,557 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-14 07:03:44,557 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-14 07:03:44,560 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-14 07:03:44,561 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 07:03:44" (1/1) ... [2022-07-14 07:03:44,562 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75e38382 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 07:03:44, skipping insertion in model container [2022-07-14 07:03:44,562 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 07:03:44" (1/1) ... [2022-07-14 07:03:44,567 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-14 07:03:44,600 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-14 07:03:44,792 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-ext3-properties/sll_of_sll_nondet_append-1.i[24987,25000] [2022-07-14 07:03:44,794 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 07:03:44,800 INFO L203 MainTranslator]: Completed pre-run [2022-07-14 07:03:44,862 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-ext3-properties/sll_of_sll_nondet_append-1.i[24987,25000] [2022-07-14 07:03:44,863 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 07:03:44,891 INFO L208 MainTranslator]: Completed translation [2022-07-14 07:03:44,893 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 07:03:44 WrapperNode [2022-07-14 07:03:44,894 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-14 07:03:44,895 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-14 07:03:44,895 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-14 07:03:44,896 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-14 07:03:44,902 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 07:03:44" (1/1) ... [2022-07-14 07:03:44,926 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 07:03:44" (1/1) ... [2022-07-14 07:03:44,956 INFO L137 Inliner]: procedures = 129, calls = 39, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 185 [2022-07-14 07:03:44,959 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-14 07:03:44,961 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-14 07:03:44,961 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-14 07:03:44,961 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-14 07:03:44,967 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 07:03:44" (1/1) ... [2022-07-14 07:03:44,967 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 07:03:44" (1/1) ... [2022-07-14 07:03:44,981 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 07:03:44" (1/1) ... [2022-07-14 07:03:44,984 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 07:03:44" (1/1) ... [2022-07-14 07:03:44,996 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 07:03:44" (1/1) ... [2022-07-14 07:03:45,000 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 07:03:44" (1/1) ... [2022-07-14 07:03:45,004 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 07:03:44" (1/1) ... [2022-07-14 07:03:45,008 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-14 07:03:45,009 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-14 07:03:45,009 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-14 07:03:45,010 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-14 07:03:45,010 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 07:03:44" (1/1) ... [2022-07-14 07:03:45,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 07:03:45,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 07:03:45,047 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-14 07:03:45,048 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-14 07:03:45,085 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2022-07-14 07:03:45,086 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2022-07-14 07:03:45,086 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-14 07:03:45,086 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-14 07:03:45,086 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-14 07:03:45,086 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-14 07:03:45,086 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-14 07:03:45,087 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-14 07:03:45,087 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-14 07:03:45,087 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-14 07:03:45,087 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-14 07:03:45,088 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-14 07:03:45,199 INFO L234 CfgBuilder]: Building ICFG [2022-07-14 07:03:45,201 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-14 07:03:45,249 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2022-07-14 07:03:45,503 INFO L275 CfgBuilder]: Performing block encoding [2022-07-14 07:03:45,509 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-14 07:03:45,509 INFO L299 CfgBuilder]: Removed 9 assume(true) statements. [2022-07-14 07:03:45,515 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 07:03:45 BoogieIcfgContainer [2022-07-14 07:03:45,515 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-14 07:03:45,517 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-14 07:03:45,518 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-14 07:03:45,521 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-14 07:03:45,521 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.07 07:03:44" (1/3) ... [2022-07-14 07:03:45,522 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67ed5668 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 07:03:45, skipping insertion in model container [2022-07-14 07:03:45,522 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 07:03:44" (2/3) ... [2022-07-14 07:03:45,522 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67ed5668 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 07:03:45, skipping insertion in model container [2022-07-14 07:03:45,523 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 07:03:45" (3/3) ... [2022-07-14 07:03:45,524 INFO L111 eAbstractionObserver]: Analyzing ICFG sll_of_sll_nondet_append-1.i [2022-07-14 07:03:45,535 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-14 07:03:45,535 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 42 error locations. [2022-07-14 07:03:45,582 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-14 07:03:45,590 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@25d334ef, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@3407fa20 [2022-07-14 07:03:45,590 INFO L358 AbstractCegarLoop]: Starting to check reachability of 42 error locations. [2022-07-14 07:03:45,594 INFO L276 IsEmpty]: Start isEmpty. Operand has 117 states, 72 states have (on average 1.9444444444444444) internal successors, (140), 115 states have internal predecessors, (140), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 07:03:45,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-07-14 07:03:45,610 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 07:03:45,611 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-07-14 07:03:45,612 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-07-14 07:03:45,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 07:03:45,617 INFO L85 PathProgramCache]: Analyzing trace with hash 1083078, now seen corresponding path program 1 times [2022-07-14 07:03:45,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 07:03:45,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52770337] [2022-07-14 07:03:45,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:03:45,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 07:03:45,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:03:45,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 07:03:45,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 07:03:45,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52770337] [2022-07-14 07:03:45,738 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [52770337] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 07:03:45,738 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 07:03:45,738 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 07:03:45,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041380305] [2022-07-14 07:03:45,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 07:03:45,744 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-14 07:03:45,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 07:03:45,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-14 07:03:45,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-14 07:03:45,782 INFO L87 Difference]: Start difference. First operand has 117 states, 72 states have (on average 1.9444444444444444) internal successors, (140), 115 states have internal predecessors, (140), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 07:03:45,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 07:03:45,809 INFO L93 Difference]: Finished difference Result 117 states and 132 transitions. [2022-07-14 07:03:45,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-14 07:03:45,811 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 [2022-07-14 07:03:45,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 07:03:45,816 INFO L225 Difference]: With dead ends: 117 [2022-07-14 07:03:45,816 INFO L226 Difference]: Without dead ends: 111 [2022-07-14 07:03:45,817 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-14 07:03:45,823 INFO L413 NwaCegarLoop]: 132 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 07:03:45,824 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 07:03:45,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-07-14 07:03:45,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2022-07-14 07:03:45,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 69 states have (on average 1.7971014492753623) internal successors, (124), 110 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 07:03:45,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 124 transitions. [2022-07-14 07:03:45,851 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 124 transitions. Word has length 4 [2022-07-14 07:03:45,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 07:03:45,852 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 124 transitions. [2022-07-14 07:03:45,852 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 07:03:45,852 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 124 transitions. [2022-07-14 07:03:45,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-07-14 07:03:45,853 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 07:03:45,853 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-07-14 07:03:45,853 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-14 07:03:45,853 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-07-14 07:03:45,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 07:03:45,854 INFO L85 PathProgramCache]: Analyzing trace with hash 1079730, now seen corresponding path program 1 times [2022-07-14 07:03:45,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 07:03:45,855 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855263247] [2022-07-14 07:03:45,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:03:45,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 07:03:45,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:03:45,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 07:03:45,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 07:03:45,936 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855263247] [2022-07-14 07:03:45,937 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855263247] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 07:03:45,937 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 07:03:45,937 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 07:03:45,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050667836] [2022-07-14 07:03:45,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 07:03:45,939 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 07:03:45,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 07:03:45,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 07:03:45,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 07:03:45,941 INFO L87 Difference]: Start difference. First operand 111 states and 124 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 07:03:46,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 07:03:46,045 INFO L93 Difference]: Finished difference Result 136 states and 151 transitions. [2022-07-14 07:03:46,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 07:03:46,047 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 [2022-07-14 07:03:46,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 07:03:46,048 INFO L225 Difference]: With dead ends: 136 [2022-07-14 07:03:46,049 INFO L226 Difference]: Without dead ends: 136 [2022-07-14 07:03:46,050 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 07:03:46,051 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 113 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 07:03:46,052 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 99 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 07:03:46,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2022-07-14 07:03:46,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 109. [2022-07-14 07:03:46,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 69 states have (on average 1.7681159420289856) internal successors, (122), 108 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 07:03:46,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 122 transitions. [2022-07-14 07:03:46,067 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 122 transitions. Word has length 4 [2022-07-14 07:03:46,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 07:03:46,068 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 122 transitions. [2022-07-14 07:03:46,068 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 07:03:46,069 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 122 transitions. [2022-07-14 07:03:46,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-07-14 07:03:46,069 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 07:03:46,069 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-07-14 07:03:46,070 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-14 07:03:46,070 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-07-14 07:03:46,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 07:03:46,071 INFO L85 PathProgramCache]: Analyzing trace with hash 1079731, now seen corresponding path program 1 times [2022-07-14 07:03:46,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 07:03:46,071 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547890578] [2022-07-14 07:03:46,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:03:46,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 07:03:46,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:03:46,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 07:03:46,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 07:03:46,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547890578] [2022-07-14 07:03:46,103 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547890578] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 07:03:46,103 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 07:03:46,103 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 07:03:46,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961056540] [2022-07-14 07:03:46,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 07:03:46,104 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 07:03:46,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 07:03:46,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 07:03:46,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 07:03:46,105 INFO L87 Difference]: Start difference. First operand 109 states and 122 transitions. Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 07:03:46,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 07:03:46,148 INFO L93 Difference]: Finished difference Result 157 states and 175 transitions. [2022-07-14 07:03:46,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 07:03:46,149 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 [2022-07-14 07:03:46,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 07:03:46,150 INFO L225 Difference]: With dead ends: 157 [2022-07-14 07:03:46,153 INFO L226 Difference]: Without dead ends: 157 [2022-07-14 07:03:46,153 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-14 07:03:46,155 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 52 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 07:03:46,156 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 226 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 07:03:46,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2022-07-14 07:03:46,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 110. [2022-07-14 07:03:46,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 70 states have (on average 1.7571428571428571) internal successors, (123), 109 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 07:03:46,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 123 transitions. [2022-07-14 07:03:46,164 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 123 transitions. Word has length 4 [2022-07-14 07:03:46,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 07:03:46,164 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 123 transitions. [2022-07-14 07:03:46,164 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 07:03:46,165 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 123 transitions. [2022-07-14 07:03:46,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-07-14 07:03:46,165 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 07:03:46,165 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 07:03:46,165 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-14 07:03:46,166 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-07-14 07:03:46,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 07:03:46,166 INFO L85 PathProgramCache]: Analyzing trace with hash -336207078, now seen corresponding path program 1 times [2022-07-14 07:03:46,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 07:03:46,167 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492668024] [2022-07-14 07:03:46,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:03:46,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 07:03:46,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:03:46,256 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-14 07:03:46,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 07:03:46,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492668024] [2022-07-14 07:03:46,257 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492668024] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 07:03:46,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [363135036] [2022-07-14 07:03:46,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:03:46,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 07:03:46,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 07:03:46,259 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 07:03:46,279 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-14 07:03:46,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:03:46,347 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-14 07:03:46,352 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 07:03:46,427 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-14 07:03:46,428 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 07:03:46,458 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-14 07:03:46,459 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [363135036] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 07:03:46,459 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 07:03:46,459 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-07-14 07:03:46,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704791116] [2022-07-14 07:03:46,459 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 07:03:46,460 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-14 07:03:46,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 07:03:46,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-14 07:03:46,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2022-07-14 07:03:46,461 INFO L87 Difference]: Start difference. First operand 110 states and 123 transitions. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 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-14 07:03:46,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 07:03:46,515 INFO L93 Difference]: Finished difference Result 244 states and 268 transitions. [2022-07-14 07:03:46,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 07:03:46,516 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 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 9 [2022-07-14 07:03:46,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 07:03:46,517 INFO L225 Difference]: With dead ends: 244 [2022-07-14 07:03:46,517 INFO L226 Difference]: Without dead ends: 244 [2022-07-14 07:03:46,517 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2022-07-14 07:03:46,518 INFO L413 NwaCegarLoop]: 148 mSDtfsCounter, 319 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 319 SdHoareTripleChecker+Valid, 603 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 07:03:46,519 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [319 Valid, 603 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 07:03:46,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2022-07-14 07:03:46,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 173. [2022-07-14 07:03:46,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 133 states have (on average 1.7518796992481203) internal successors, (233), 172 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 07:03:46,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 233 transitions. [2022-07-14 07:03:46,529 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 233 transitions. Word has length 9 [2022-07-14 07:03:46,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 07:03:46,529 INFO L495 AbstractCegarLoop]: Abstraction has 173 states and 233 transitions. [2022-07-14 07:03:46,529 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 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-14 07:03:46,530 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 233 transitions. [2022-07-14 07:03:46,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-14 07:03:46,530 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 07:03:46,530 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 07:03:46,559 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-07-14 07:03:46,747 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 07:03:46,748 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-07-14 07:03:46,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 07:03:46,748 INFO L85 PathProgramCache]: Analyzing trace with hash -991177183, now seen corresponding path program 1 times [2022-07-14 07:03:46,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 07:03:46,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996290552] [2022-07-14 07:03:46,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:03:46,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 07:03:46,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:03:46,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 07:03:46,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 07:03:46,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996290552] [2022-07-14 07:03:46,810 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996290552] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 07:03:46,810 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 07:03:46,810 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 07:03:46,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368603826] [2022-07-14 07:03:46,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 07:03:46,811 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 07:03:46,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 07:03:46,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 07:03:46,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 07:03:46,812 INFO L87 Difference]: Start difference. First operand 173 states and 233 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 07:03:46,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 07:03:46,900 INFO L93 Difference]: Finished difference Result 329 states and 444 transitions. [2022-07-14 07:03:46,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 07:03:46,901 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-07-14 07:03:46,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 07:03:46,902 INFO L225 Difference]: With dead ends: 329 [2022-07-14 07:03:46,902 INFO L226 Difference]: Without dead ends: 329 [2022-07-14 07:03:46,903 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 07:03:46,904 INFO L413 NwaCegarLoop]: 194 mSDtfsCounter, 111 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 07:03:46,904 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 270 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 07:03:46,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2022-07-14 07:03:46,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 172. [2022-07-14 07:03:46,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 133 states have (on average 1.7293233082706767) internal successors, (230), 171 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 07:03:46,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 230 transitions. [2022-07-14 07:03:46,925 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 230 transitions. Word has length 11 [2022-07-14 07:03:46,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 07:03:46,926 INFO L495 AbstractCegarLoop]: Abstraction has 172 states and 230 transitions. [2022-07-14 07:03:46,926 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 07:03:46,926 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 230 transitions. [2022-07-14 07:03:46,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-14 07:03:46,927 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 07:03:46,927 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 07:03:46,927 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-14 07:03:46,927 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-07-14 07:03:46,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 07:03:46,928 INFO L85 PathProgramCache]: Analyzing trace with hash -991177182, now seen corresponding path program 1 times [2022-07-14 07:03:46,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 07:03:46,929 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676973409] [2022-07-14 07:03:46,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:03:46,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 07:03:46,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:03:46,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 07:03:46,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 07:03:46,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676973409] [2022-07-14 07:03:46,983 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676973409] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 07:03:46,983 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 07:03:46,983 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 07:03:46,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9863775] [2022-07-14 07:03:46,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 07:03:46,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 07:03:46,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 07:03:46,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 07:03:46,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 07:03:46,985 INFO L87 Difference]: Start difference. First operand 172 states and 230 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 07:03:47,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 07:03:47,076 INFO L93 Difference]: Finished difference Result 330 states and 442 transitions. [2022-07-14 07:03:47,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 07:03:47,077 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-07-14 07:03:47,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 07:03:47,078 INFO L225 Difference]: With dead ends: 330 [2022-07-14 07:03:47,078 INFO L226 Difference]: Without dead ends: 330 [2022-07-14 07:03:47,079 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 07:03:47,079 INFO L413 NwaCegarLoop]: 198 mSDtfsCounter, 114 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 07:03:47,080 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 278 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 07:03:47,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2022-07-14 07:03:47,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 171. [2022-07-14 07:03:47,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 133 states have (on average 1.7067669172932332) internal successors, (227), 170 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 07:03:47,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 227 transitions. [2022-07-14 07:03:47,086 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 227 transitions. Word has length 11 [2022-07-14 07:03:47,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 07:03:47,087 INFO L495 AbstractCegarLoop]: Abstraction has 171 states and 227 transitions. [2022-07-14 07:03:47,087 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 07:03:47,087 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 227 transitions. [2022-07-14 07:03:47,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-14 07:03:47,088 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 07:03:47,088 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 07:03:47,088 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-14 07:03:47,088 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-07-14 07:03:47,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 07:03:47,089 INFO L85 PathProgramCache]: Analyzing trace with hash -661772220, now seen corresponding path program 1 times [2022-07-14 07:03:47,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 07:03:47,089 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210671337] [2022-07-14 07:03:47,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:03:47,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 07:03:47,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:03:47,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 07:03:47,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 07:03:47,138 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210671337] [2022-07-14 07:03:47,138 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210671337] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 07:03:47,138 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 07:03:47,138 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 07:03:47,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482043996] [2022-07-14 07:03:47,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 07:03:47,139 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 07:03:47,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 07:03:47,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 07:03:47,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 07:03:47,140 INFO L87 Difference]: Start difference. First operand 171 states and 227 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 07:03:47,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 07:03:47,205 INFO L93 Difference]: Finished difference Result 244 states and 312 transitions. [2022-07-14 07:03:47,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 07:03:47,206 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-07-14 07:03:47,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 07:03:47,207 INFO L225 Difference]: With dead ends: 244 [2022-07-14 07:03:47,207 INFO L226 Difference]: Without dead ends: 244 [2022-07-14 07:03:47,207 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 07:03:47,208 INFO L413 NwaCegarLoop]: 151 mSDtfsCounter, 105 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 07:03:47,208 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 204 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 07:03:47,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2022-07-14 07:03:47,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 169. [2022-07-14 07:03:47,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 133 states have (on average 1.6616541353383458) internal successors, (221), 168 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 07:03:47,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 221 transitions. [2022-07-14 07:03:47,213 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 221 transitions. Word has length 12 [2022-07-14 07:03:47,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 07:03:47,214 INFO L495 AbstractCegarLoop]: Abstraction has 169 states and 221 transitions. [2022-07-14 07:03:47,214 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 07:03:47,214 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 221 transitions. [2022-07-14 07:03:47,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-14 07:03:47,215 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 07:03:47,215 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 07:03:47,215 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-14 07:03:47,215 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-07-14 07:03:47,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 07:03:47,216 INFO L85 PathProgramCache]: Analyzing trace with hash -661772219, now seen corresponding path program 1 times [2022-07-14 07:03:47,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 07:03:47,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071686114] [2022-07-14 07:03:47,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:03:47,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 07:03:47,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:03:47,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 07:03:47,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 07:03:47,250 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071686114] [2022-07-14 07:03:47,250 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071686114] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 07:03:47,250 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 07:03:47,250 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-14 07:03:47,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738417027] [2022-07-14 07:03:47,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 07:03:47,251 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 07:03:47,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 07:03:47,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 07:03:47,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-14 07:03:47,252 INFO L87 Difference]: Start difference. First operand 169 states and 221 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 07:03:47,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 07:03:47,339 INFO L93 Difference]: Finished difference Result 376 states and 459 transitions. [2022-07-14 07:03:47,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 07:03:47,340 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-07-14 07:03:47,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 07:03:47,341 INFO L225 Difference]: With dead ends: 376 [2022-07-14 07:03:47,341 INFO L226 Difference]: Without dead ends: 376 [2022-07-14 07:03:47,342 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-07-14 07:03:47,342 INFO L413 NwaCegarLoop]: 289 mSDtfsCounter, 231 mSDsluCounter, 523 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 812 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 07:03:47,343 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [231 Valid, 812 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 07:03:47,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2022-07-14 07:03:47,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 172. [2022-07-14 07:03:47,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 136 states have (on average 1.6470588235294117) internal successors, (224), 171 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 07:03:47,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 224 transitions. [2022-07-14 07:03:47,348 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 224 transitions. Word has length 12 [2022-07-14 07:03:47,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 07:03:47,348 INFO L495 AbstractCegarLoop]: Abstraction has 172 states and 224 transitions. [2022-07-14 07:03:47,348 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 07:03:47,348 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 224 transitions. [2022-07-14 07:03:47,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-14 07:03:47,349 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 07:03:47,349 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 07:03:47,349 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-14 07:03:47,349 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-07-14 07:03:47,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 07:03:47,350 INFO L85 PathProgramCache]: Analyzing trace with hash -51661170, now seen corresponding path program 1 times [2022-07-14 07:03:47,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 07:03:47,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982505449] [2022-07-14 07:03:47,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:03:47,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 07:03:47,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:03:47,403 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-14 07:03:47,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 07:03:47,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982505449] [2022-07-14 07:03:47,405 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982505449] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 07:03:47,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [985210669] [2022-07-14 07:03:47,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:03:47,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 07:03:47,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 07:03:47,407 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 07:03:47,409 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-14 07:03:47,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:03:47,486 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-14 07:03:47,488 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 07:03:47,535 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-14 07:03:47,536 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 07:03:47,589 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-14 07:03:47,590 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [985210669] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 07:03:47,590 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 07:03:47,590 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2022-07-14 07:03:47,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508902473] [2022-07-14 07:03:47,590 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 07:03:47,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-14 07:03:47,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 07:03:47,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-14 07:03:47,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-07-14 07:03:47,592 INFO L87 Difference]: Start difference. First operand 172 states and 224 transitions. Second operand has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 07:03:47,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 07:03:47,701 INFO L93 Difference]: Finished difference Result 391 states and 474 transitions. [2022-07-14 07:03:47,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-14 07:03:47,702 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-07-14 07:03:47,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 07:03:47,703 INFO L225 Difference]: With dead ends: 391 [2022-07-14 07:03:47,703 INFO L226 Difference]: Without dead ends: 391 [2022-07-14 07:03:47,704 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2022-07-14 07:03:47,704 INFO L413 NwaCegarLoop]: 289 mSDtfsCounter, 477 mSDsluCounter, 525 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 477 SdHoareTripleChecker+Valid, 814 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 07:03:47,705 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [477 Valid, 814 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 07:03:47,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2022-07-14 07:03:47,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 196. [2022-07-14 07:03:47,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 160 states have (on average 1.55) internal successors, (248), 195 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 07:03:47,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 248 transitions. [2022-07-14 07:03:47,709 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 248 transitions. Word has length 16 [2022-07-14 07:03:47,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 07:03:47,710 INFO L495 AbstractCegarLoop]: Abstraction has 196 states and 248 transitions. [2022-07-14 07:03:47,710 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 07:03:47,710 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 248 transitions. [2022-07-14 07:03:47,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-14 07:03:47,710 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 07:03:47,710 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1] [2022-07-14 07:03:47,732 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-14 07:03:47,923 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,SelfDestructingSolverStorable8 [2022-07-14 07:03:47,923 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-07-14 07:03:47,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 07:03:47,924 INFO L85 PathProgramCache]: Analyzing trace with hash 1254577850, now seen corresponding path program 2 times [2022-07-14 07:03:47,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 07:03:47,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729996872] [2022-07-14 07:03:47,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:03:47,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 07:03:47,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:03:47,964 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-14 07:03:47,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 07:03:47,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729996872] [2022-07-14 07:03:47,965 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729996872] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 07:03:47,965 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 07:03:47,965 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 07:03:47,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114317283] [2022-07-14 07:03:47,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 07:03:47,966 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 07:03:47,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 07:03:47,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 07:03:47,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 07:03:47,967 INFO L87 Difference]: Start difference. First operand 196 states and 248 transitions. Second operand has 3 states, 2 states have (on average 4.5) 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-14 07:03:48,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 07:03:48,023 INFO L93 Difference]: Finished difference Result 269 states and 337 transitions. [2022-07-14 07:03:48,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 07:03:48,023 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) 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 19 [2022-07-14 07:03:48,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 07:03:48,025 INFO L225 Difference]: With dead ends: 269 [2022-07-14 07:03:48,025 INFO L226 Difference]: Without dead ends: 269 [2022-07-14 07:03:48,025 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 07:03:48,026 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 63 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 07:03:48,026 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 182 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 07:03:48,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2022-07-14 07:03:48,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 233. [2022-07-14 07:03:48,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 197 states have (on average 1.5532994923857868) internal successors, (306), 232 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 07:03:48,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 306 transitions. [2022-07-14 07:03:48,031 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 306 transitions. Word has length 19 [2022-07-14 07:03:48,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 07:03:48,031 INFO L495 AbstractCegarLoop]: Abstraction has 233 states and 306 transitions. [2022-07-14 07:03:48,032 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) 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-14 07:03:48,032 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 306 transitions. [2022-07-14 07:03:48,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-14 07:03:48,033 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 07:03:48,033 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 07:03:48,033 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-14 07:03:48,033 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-07-14 07:03:48,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 07:03:48,034 INFO L85 PathProgramCache]: Analyzing trace with hash 1435011604, now seen corresponding path program 1 times [2022-07-14 07:03:48,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 07:03:48,034 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971050338] [2022-07-14 07:03:48,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:03:48,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 07:03:48,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:03:48,078 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-14 07:03:48,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 07:03:48,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971050338] [2022-07-14 07:03:48,079 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971050338] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 07:03:48,079 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 07:03:48,079 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-14 07:03:48,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633075441] [2022-07-14 07:03:48,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 07:03:48,079 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 07:03:48,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 07:03:48,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 07:03:48,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-14 07:03:48,080 INFO L87 Difference]: Start difference. First operand 233 states and 306 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 07:03:48,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 07:03:48,143 INFO L93 Difference]: Finished difference Result 260 states and 321 transitions. [2022-07-14 07:03:48,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 07:03:48,144 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 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-14 07:03:48,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 07:03:48,145 INFO L225 Difference]: With dead ends: 260 [2022-07-14 07:03:48,145 INFO L226 Difference]: Without dead ends: 260 [2022-07-14 07:03:48,145 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-14 07:03:48,146 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 103 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 07:03:48,146 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 380 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 07:03:48,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2022-07-14 07:03:48,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 217. [2022-07-14 07:03:48,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 181 states have (on average 1.5248618784530388) internal successors, (276), 216 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 07:03:48,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 276 transitions. [2022-07-14 07:03:48,150 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 276 transitions. Word has length 23 [2022-07-14 07:03:48,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 07:03:48,150 INFO L495 AbstractCegarLoop]: Abstraction has 217 states and 276 transitions. [2022-07-14 07:03:48,150 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 07:03:48,150 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 276 transitions. [2022-07-14 07:03:48,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-14 07:03:48,151 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 07:03:48,151 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 07:03:48,151 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-14 07:03:48,151 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-07-14 07:03:48,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 07:03:48,152 INFO L85 PathProgramCache]: Analyzing trace with hash 877276576, now seen corresponding path program 2 times [2022-07-14 07:03:48,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 07:03:48,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110471393] [2022-07-14 07:03:48,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:03:48,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 07:03:48,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:03:48,251 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-14 07:03:48,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 07:03:48,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110471393] [2022-07-14 07:03:48,252 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110471393] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 07:03:48,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [223537131] [2022-07-14 07:03:48,252 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-14 07:03:48,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 07:03:48,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 07:03:48,254 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 07:03:48,281 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-14 07:03:48,352 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-14 07:03:48,352 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 07:03:48,354 INFO L263 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 17 conjunts are in the unsatisfiable core [2022-07-14 07:03:48,359 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 07:03:48,394 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 07:03:48,400 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 07:03:48,432 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 07:03:48,433 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-14 07:03:48,446 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-14 07:03:48,447 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-14 07:03:48,474 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 07:03:48,475 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-14 07:03:48,481 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 07:03:48,481 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-14 07:03:48,512 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-14 07:03:48,512 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-07-14 07:03:48,564 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-14 07:03:48,565 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 07:03:49,159 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-14 07:03:49,159 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [223537131] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 07:03:49,159 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 07:03:49,159 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 4] total 9 [2022-07-14 07:03:49,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499180713] [2022-07-14 07:03:49,160 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 07:03:49,160 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-14 07:03:49,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 07:03:49,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-14 07:03:49,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2022-07-14 07:03:49,161 INFO L87 Difference]: Start difference. First operand 217 states and 276 transitions. Second operand has 10 states, 9 states have (on average 6.111111111111111) internal successors, (55), 10 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-14 07:03:49,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 07:03:49,269 INFO L93 Difference]: Finished difference Result 272 states and 330 transitions. [2022-07-14 07:03:49,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 07:03:49,270 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.111111111111111) internal successors, (55), 10 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) Word has length 24 [2022-07-14 07:03:49,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 07:03:49,271 INFO L225 Difference]: With dead ends: 272 [2022-07-14 07:03:49,271 INFO L226 Difference]: Without dead ends: 272 [2022-07-14 07:03:49,272 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 43 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2022-07-14 07:03:49,272 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 480 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 480 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 47 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 07:03:49,272 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [480 Valid, 262 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 94 Invalid, 0 Unknown, 47 Unchecked, 0.1s Time] [2022-07-14 07:03:49,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2022-07-14 07:03:49,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 215. [2022-07-14 07:03:49,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 181 states have (on average 1.4917127071823204) internal successors, (270), 214 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 07:03:49,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 270 transitions. [2022-07-14 07:03:49,277 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 270 transitions. Word has length 24 [2022-07-14 07:03:49,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 07:03:49,277 INFO L495 AbstractCegarLoop]: Abstraction has 215 states and 270 transitions. [2022-07-14 07:03:49,277 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.111111111111111) internal successors, (55), 10 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-14 07:03:49,277 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 270 transitions. [2022-07-14 07:03:49,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-14 07:03:49,278 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 07:03:49,278 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 07:03:49,302 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-07-14 07:03:49,499 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 07:03:49,499 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-07-14 07:03:49,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 07:03:49,500 INFO L85 PathProgramCache]: Analyzing trace with hash 361607171, now seen corresponding path program 1 times [2022-07-14 07:03:49,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 07:03:49,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946404688] [2022-07-14 07:03:49,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:03:49,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 07:03:49,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:03:49,547 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-14 07:03:49,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 07:03:49,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946404688] [2022-07-14 07:03:49,547 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946404688] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 07:03:49,548 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 07:03:49,548 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-14 07:03:49,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039177691] [2022-07-14 07:03:49,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 07:03:49,548 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 07:03:49,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 07:03:49,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 07:03:49,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-14 07:03:49,549 INFO L87 Difference]: Start difference. First operand 215 states and 270 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 07:03:49,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 07:03:49,619 INFO L93 Difference]: Finished difference Result 233 states and 288 transitions. [2022-07-14 07:03:49,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 07:03:49,619 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-07-14 07:03:49,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 07:03:49,620 INFO L225 Difference]: With dead ends: 233 [2022-07-14 07:03:49,620 INFO L226 Difference]: Without dead ends: 233 [2022-07-14 07:03:49,621 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-07-14 07:03:49,621 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 14 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 07:03:49,621 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 407 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 07:03:49,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2022-07-14 07:03:49,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 217. [2022-07-14 07:03:49,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 183 states have (on average 1.4863387978142077) internal successors, (272), 216 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 07:03:49,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 272 transitions. [2022-07-14 07:03:49,625 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 272 transitions. Word has length 25 [2022-07-14 07:03:49,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 07:03:49,625 INFO L495 AbstractCegarLoop]: Abstraction has 217 states and 272 transitions. [2022-07-14 07:03:49,625 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 07:03:49,625 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 272 transitions. [2022-07-14 07:03:49,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-14 07:03:49,626 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 07:03:49,626 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 07:03:49,626 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-14 07:03:49,626 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-07-14 07:03:49,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 07:03:49,627 INFO L85 PathProgramCache]: Analyzing trace with hash -1675080075, now seen corresponding path program 1 times [2022-07-14 07:03:49,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 07:03:49,627 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265317304] [2022-07-14 07:03:49,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:03:49,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 07:03:49,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:03:49,656 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-14 07:03:49,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 07:03:49,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265317304] [2022-07-14 07:03:49,657 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265317304] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 07:03:49,657 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 07:03:49,657 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 07:03:49,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297296903] [2022-07-14 07:03:49,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 07:03:49,658 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 07:03:49,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 07:03:49,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 07:03:49,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 07:03:49,658 INFO L87 Difference]: Start difference. First operand 217 states and 272 transitions. Second operand has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 07:03:49,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 07:03:49,720 INFO L93 Difference]: Finished difference Result 219 states and 273 transitions. [2022-07-14 07:03:49,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 07:03:49,720 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-07-14 07:03:49,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 07:03:49,721 INFO L225 Difference]: With dead ends: 219 [2022-07-14 07:03:49,721 INFO L226 Difference]: Without dead ends: 211 [2022-07-14 07:03:49,721 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 07:03:49,722 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 1 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 07:03:49,722 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 264 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 07:03:49,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2022-07-14 07:03:49,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 209. [2022-07-14 07:03:49,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 175 states have (on average 1.502857142857143) internal successors, (263), 208 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 07:03:49,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 263 transitions. [2022-07-14 07:03:49,726 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 263 transitions. Word has length 26 [2022-07-14 07:03:49,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 07:03:49,726 INFO L495 AbstractCegarLoop]: Abstraction has 209 states and 263 transitions. [2022-07-14 07:03:49,726 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 07:03:49,726 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 263 transitions. [2022-07-14 07:03:49,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-14 07:03:49,726 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 07:03:49,727 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 07:03:49,727 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-14 07:03:49,727 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-07-14 07:03:49,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 07:03:49,727 INFO L85 PathProgramCache]: Analyzing trace with hash -981051253, now seen corresponding path program 1 times [2022-07-14 07:03:49,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 07:03:49,727 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124458826] [2022-07-14 07:03:49,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:03:49,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 07:03:49,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:03:49,764 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-14 07:03:49,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 07:03:49,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124458826] [2022-07-14 07:03:49,764 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124458826] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 07:03:49,764 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 07:03:49,764 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 07:03:49,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821307335] [2022-07-14 07:03:49,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 07:03:49,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 07:03:49,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 07:03:49,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 07:03:49,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-14 07:03:49,765 INFO L87 Difference]: Start difference. First operand 209 states and 263 transitions. Second operand has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 07:03:49,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 07:03:49,855 INFO L93 Difference]: Finished difference Result 235 states and 289 transitions. [2022-07-14 07:03:49,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 07:03:49,855 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-07-14 07:03:49,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 07:03:49,858 INFO L225 Difference]: With dead ends: 235 [2022-07-14 07:03:49,858 INFO L226 Difference]: Without dead ends: 235 [2022-07-14 07:03:49,859 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-07-14 07:03:49,860 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 293 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 07:03:49,860 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [293 Valid, 169 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 07:03:49,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2022-07-14 07:03:49,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 208. [2022-07-14 07:03:49,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 175 states have (on average 1.4857142857142858) internal successors, (260), 207 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 07:03:49,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 260 transitions. [2022-07-14 07:03:49,864 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 260 transitions. Word has length 29 [2022-07-14 07:03:49,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 07:03:49,865 INFO L495 AbstractCegarLoop]: Abstraction has 208 states and 260 transitions. [2022-07-14 07:03:49,865 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 07:03:49,865 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 260 transitions. [2022-07-14 07:03:49,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-14 07:03:49,867 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 07:03:49,867 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 07:03:49,867 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-14 07:03:49,867 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-07-14 07:03:49,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 07:03:49,868 INFO L85 PathProgramCache]: Analyzing trace with hash -981051252, now seen corresponding path program 1 times [2022-07-14 07:03:49,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 07:03:49,868 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157291862] [2022-07-14 07:03:49,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:03:49,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 07:03:49,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:03:49,936 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-14 07:03:49,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 07:03:49,936 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157291862] [2022-07-14 07:03:49,936 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157291862] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 07:03:49,936 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 07:03:49,937 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-14 07:03:49,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146889928] [2022-07-14 07:03:49,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 07:03:49,937 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 07:03:49,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 07:03:49,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 07:03:49,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-14 07:03:49,938 INFO L87 Difference]: Start difference. First operand 208 states and 260 transitions. Second operand has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 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-14 07:03:49,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 07:03:49,999 INFO L93 Difference]: Finished difference Result 207 states and 257 transitions. [2022-07-14 07:03:49,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 07:03:49,999 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 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 29 [2022-07-14 07:03:50,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 07:03:50,001 INFO L225 Difference]: With dead ends: 207 [2022-07-14 07:03:50,001 INFO L226 Difference]: Without dead ends: 207 [2022-07-14 07:03:50,002 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-14 07:03:50,002 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 305 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 305 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 07:03:50,003 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [305 Valid, 126 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 07:03:50,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2022-07-14 07:03:50,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 207. [2022-07-14 07:03:50,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 175 states have (on average 1.4685714285714286) internal successors, (257), 206 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 07:03:50,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 257 transitions. [2022-07-14 07:03:50,007 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 257 transitions. Word has length 29 [2022-07-14 07:03:50,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 07:03:50,007 INFO L495 AbstractCegarLoop]: Abstraction has 207 states and 257 transitions. [2022-07-14 07:03:50,008 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 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-14 07:03:50,008 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 257 transitions. [2022-07-14 07:03:50,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-14 07:03:50,008 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 07:03:50,008 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 07:03:50,009 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-14 07:03:50,009 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-07-14 07:03:50,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 07:03:50,009 INFO L85 PathProgramCache]: Analyzing trace with hash -347817722, now seen corresponding path program 1 times [2022-07-14 07:03:50,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 07:03:50,010 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464230087] [2022-07-14 07:03:50,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:03:50,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 07:03:50,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:03:50,133 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-14 07:03:50,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 07:03:50,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464230087] [2022-07-14 07:03:50,134 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464230087] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 07:03:50,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [823412122] [2022-07-14 07:03:50,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:03:50,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 07:03:50,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 07:03:50,136 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-14 07:03:50,143 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-14 07:03:50,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:03:50,244 INFO L263 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 22 conjunts are in the unsatisfiable core [2022-07-14 07:03:50,247 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 07:03:50,254 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 07:03:50,282 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 07:03:50,282 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-14 07:03:50,315 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 07:03:50,316 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-14 07:03:50,341 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 07:03:50,342 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-14 07:03:50,365 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 07:03:50,366 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-14 07:03:50,404 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-14 07:03:50,404 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 07:03:51,016 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-14 07:03:51,016 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [823412122] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 07:03:51,016 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 07:03:51,017 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2022-07-14 07:03:51,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195288829] [2022-07-14 07:03:51,017 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 07:03:51,018 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-14 07:03:51,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 07:03:51,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-14 07:03:51,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2022-07-14 07:03:51,019 INFO L87 Difference]: Start difference. First operand 207 states and 257 transitions. Second operand has 11 states, 10 states have (on average 7.6) internal successors, (76), 11 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 07:03:51,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 07:03:51,149 INFO L93 Difference]: Finished difference Result 395 states and 483 transitions. [2022-07-14 07:03:51,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 07:03:51,150 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 7.6) internal successors, (76), 11 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-07-14 07:03:51,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 07:03:51,151 INFO L225 Difference]: With dead ends: 395 [2022-07-14 07:03:51,151 INFO L226 Difference]: Without dead ends: 395 [2022-07-14 07:03:51,152 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 53 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2022-07-14 07:03:51,152 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 403 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 403 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 79 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 07:03:51,152 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [403 Valid, 404 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 136 Invalid, 0 Unknown, 79 Unchecked, 0.1s Time] [2022-07-14 07:03:51,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2022-07-14 07:03:51,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 278. [2022-07-14 07:03:51,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 247 states have (on average 1.3441295546558705) internal successors, (332), 277 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 07:03:51,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 332 transitions. [2022-07-14 07:03:51,158 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 332 transitions. Word has length 30 [2022-07-14 07:03:51,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 07:03:51,159 INFO L495 AbstractCegarLoop]: Abstraction has 278 states and 332 transitions. [2022-07-14 07:03:51,159 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 7.6) internal successors, (76), 11 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 07:03:51,159 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 332 transitions. [2022-07-14 07:03:51,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-14 07:03:51,159 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 07:03:51,160 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 07:03:51,180 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-07-14 07:03:51,375 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-07-14 07:03:51,375 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-07-14 07:03:51,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 07:03:51,376 INFO L85 PathProgramCache]: Analyzing trace with hash -347817723, now seen corresponding path program 1 times [2022-07-14 07:03:51,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 07:03:51,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374271428] [2022-07-14 07:03:51,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:03:51,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 07:03:51,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:03:51,483 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-14 07:03:51,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 07:03:51,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374271428] [2022-07-14 07:03:51,484 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374271428] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 07:03:51,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1604840912] [2022-07-14 07:03:51,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:03:51,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 07:03:51,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 07:03:51,486 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-14 07:03:51,509 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-14 07:03:51,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:03:51,588 INFO L263 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 23 conjunts are in the unsatisfiable core [2022-07-14 07:03:51,590 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 07:03:51,594 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 07:03:51,616 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-14 07:03:51,616 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-07-14 07:03:51,645 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 07:03:51,646 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-14 07:03:51,671 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 07:03:51,672 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-14 07:03:51,702 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-14 07:03:51,703 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 16 treesize of output 22 [2022-07-14 07:03:51,897 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-14 07:03:51,897 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 07:03:52,151 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-14 07:03:52,152 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1604840912] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 07:03:52,152 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 07:03:52,152 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 8] total 15 [2022-07-14 07:03:52,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818159975] [2022-07-14 07:03:52,152 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 07:03:52,154 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-14 07:03:52,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 07:03:52,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-14 07:03:52,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2022-07-14 07:03:52,154 INFO L87 Difference]: Start difference. First operand 278 states and 332 transitions. Second operand has 16 states, 15 states have (on average 5.0) internal successors, (75), 16 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-14 07:03:52,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 07:03:52,317 INFO L93 Difference]: Finished difference Result 303 states and 352 transitions. [2022-07-14 07:03:52,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 07:03:52,317 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 5.0) internal successors, (75), 16 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-07-14 07:03:52,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 07:03:52,318 INFO L225 Difference]: With dead ends: 303 [2022-07-14 07:03:52,319 INFO L226 Difference]: Without dead ends: 303 [2022-07-14 07:03:52,319 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 42 SyntacticMatches, 14 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=100, Invalid=242, Unknown=0, NotChecked=0, Total=342 [2022-07-14 07:03:52,319 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 775 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 775 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 60 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 07:03:52,320 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [775 Valid, 285 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 134 Invalid, 0 Unknown, 60 Unchecked, 0.1s Time] [2022-07-14 07:03:52,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2022-07-14 07:03:52,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 276. [2022-07-14 07:03:52,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 247 states have (on average 1.3076923076923077) internal successors, (323), 275 states have internal predecessors, (323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 07:03:52,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 323 transitions. [2022-07-14 07:03:52,324 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 323 transitions. Word has length 30 [2022-07-14 07:03:52,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 07:03:52,324 INFO L495 AbstractCegarLoop]: Abstraction has 276 states and 323 transitions. [2022-07-14 07:03:52,324 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 5.0) internal successors, (75), 16 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-14 07:03:52,325 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 323 transitions. [2022-07-14 07:03:52,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-07-14 07:03:52,325 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 07:03:52,325 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 07:03:52,352 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-14 07:03:52,535 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-07-14 07:03:52,536 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-07-14 07:03:52,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 07:03:52,536 INFO L85 PathProgramCache]: Analyzing trace with hash 1918350099, now seen corresponding path program 1 times [2022-07-14 07:03:52,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 07:03:52,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239492921] [2022-07-14 07:03:52,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:03:52,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 07:03:52,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:03:52,819 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-14 07:03:52,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 07:03:52,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239492921] [2022-07-14 07:03:52,820 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239492921] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 07:03:52,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [657247864] [2022-07-14 07:03:52,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:03:52,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 07:03:52,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 07:03:52,821 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-14 07:03:52,827 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-14 07:03:52,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:03:52,938 INFO L263 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 51 conjunts are in the unsatisfiable core [2022-07-14 07:03:52,944 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 07:03:53,082 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 07:03:53,083 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-14 07:03:53,087 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 07:03:53,088 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-14 07:03:53,220 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 07:03:53,222 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-14 07:03:53,228 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 07:03:53,228 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2022-07-14 07:03:53,347 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 07:03:53,349 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 07:03:53,366 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-14 07:03:53,366 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 30 [2022-07-14 07:03:53,371 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 07:03:53,375 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-14 07:03:53,446 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 07:03:53,446 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-14 07:03:53,455 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 07:03:53,456 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-14 07:03:53,479 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 07:03:53,481 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-14 07:03:53,486 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 07:03:53,486 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-14 07:03:53,551 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 07:03:53,551 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-14 07:03:53,555 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 07:03:53,556 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-14 07:03:53,581 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-14 07:03:53,584 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-14 07:03:53,590 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 07:03:53,591 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 07:03:53,606 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_504 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~new_last~0#1.base| v_ArrVal_504) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_503 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~new_last~0#1.base| v_ArrVal_503) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))) is different from false [2022-07-14 07:03:53,638 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| Int)) (or (and (forall ((v_ArrVal_503 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_503) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_504 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_504) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))) (not (<= |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| |c_ULTIMATE.start_node_create_with_sublist_#res#1.base|)))) is different from false [2022-07-14 07:03:53,660 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| Int)) (or (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14|) (and (forall ((v_ArrVal_503 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_503) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_504 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_504) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))))) is different from false [2022-07-14 07:03:53,692 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_502 (Array Int Int)) (v_ArrVal_501 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| Int)) (or (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14|) (and (forall ((v_ArrVal_503 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_502) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_503) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_504 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_501) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_504) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))))) is different from false [2022-07-14 07:03:53,741 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| Int)) (or (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14|) (and (forall ((v_ArrVal_501 (Array Int Int)) (v_ArrVal_504 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_501) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_504) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_502 (Array Int Int)) (v_ArrVal_503 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_502) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_503) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))))) is different from false [2022-07-14 07:03:53,831 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| Int) (v_ArrVal_498 (Array Int Int)) (v_ArrVal_497 (Array Int Int))) (or (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14|) (and (forall ((v_ArrVal_501 (Array Int Int)) (v_ArrVal_504 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| v_ArrVal_498) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_501) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_504) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_502 (Array Int Int)) (v_ArrVal_503 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| v_ArrVal_497) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_502) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_503) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))))) is different from false [2022-07-14 07:03:55,947 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| Int)) (or (forall ((|v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| Int) (v_ArrVal_498 (Array Int Int)) (v_ArrVal_497 (Array Int Int))) (or (and (forall ((v_ArrVal_501 (Array Int Int)) (v_ArrVal_504 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| v_ArrVal_498) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_501) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_504) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_502 (Array Int Int)) (v_ArrVal_503 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| v_ArrVal_497) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_502) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_503) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))) (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14|))) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| |c_#StackHeapBarrier|)))) is different from false [2022-07-14 07:03:56,097 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| Int) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| Int) (v_ArrVal_495 (Array Int Int))) (or (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14|) (and (forall ((v_ArrVal_501 (Array Int Int)) (v_ArrVal_504 (Array Int Int)) (v_ArrVal_498 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| v_ArrVal_498) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_501) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_504) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_502 (Array Int Int)) (v_ArrVal_503 (Array Int Int)) (v_ArrVal_497 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| v_ArrVal_495) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| v_ArrVal_497) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_502) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_503) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| |c_#StackHeapBarrier|)))) is different from false [2022-07-14 07:03:56,243 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| Int) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| Int) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| Int)) (or (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14|) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| |c_#StackHeapBarrier|)) (and (forall ((v_ArrVal_502 (Array Int Int)) (v_ArrVal_503 (Array Int Int)) (v_ArrVal_495 (Array Int Int)) (v_ArrVal_497 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| v_ArrVal_495) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| v_ArrVal_497) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_502) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_503) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_501 (Array Int Int)) (v_ArrVal_504 (Array Int Int)) (v_ArrVal_498 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_25|) 0 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| v_ArrVal_498) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_501) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_504) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| |c_#StackHeapBarrier|)))) is different from false [2022-07-14 07:03:56,333 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| Int) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| Int) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| Int)) (or (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14|) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| |c_#StackHeapBarrier|)) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| |c_#StackHeapBarrier|)) (and (forall ((v_ArrVal_502 (Array Int Int)) (v_ArrVal_503 (Array Int Int)) (v_ArrVal_495 (Array Int Int)) (v_ArrVal_497 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| v_ArrVal_495) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| v_ArrVal_497) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_502) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_503) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_501 (Array Int Int)) (v_ArrVal_504 (Array Int Int)) (v_ArrVal_498 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_25|) 0 |c_ULTIMATE.start_sll_create_~new_head~0#1.offset|)) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| v_ArrVal_498) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_501) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_504) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))))) is different from false [2022-07-14 07:03:56,427 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_492 (Array Int Int)) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| Int) (v_ArrVal_493 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| Int) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| Int)) (or (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14|) (and (forall ((v_ArrVal_501 (Array Int Int)) (v_ArrVal_504 (Array Int Int)) (v_ArrVal_498 (Array Int Int))) (= (select (select (store (store (store (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| v_ArrVal_493))) (store .cse0 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| (store (select .cse0 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_25|) 0 |c_ULTIMATE.start_sll_create_~new_head~0#1.offset|))) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| v_ArrVal_498) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_501) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_504) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_502 (Array Int Int)) (v_ArrVal_503 (Array Int Int)) (v_ArrVal_495 (Array Int Int)) (v_ArrVal_497 (Array Int Int))) (= (select (select (store (store (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| v_ArrVal_492) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| v_ArrVal_495) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| v_ArrVal_497) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_502) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_503) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| |c_#StackHeapBarrier|)) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| |c_#StackHeapBarrier|)))) is different from false [2022-07-14 07:03:56,638 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| Int) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_26| Int) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| Int) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| Int)) (or (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14|) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| |c_#StackHeapBarrier|)) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| |c_#StackHeapBarrier|)) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_26| |c_#StackHeapBarrier|)) (and (forall ((v_ArrVal_501 (Array Int Int)) (v_ArrVal_504 (Array Int Int)) (v_ArrVal_493 (Array Int Int)) (v_ArrVal_498 (Array Int Int))) (= (select (select (store (store (store (let ((.cse0 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_26| v_ArrVal_493))) (store .cse0 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| (store (select .cse0 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_25|) 0 0))) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| v_ArrVal_498) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_501) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_504) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_502 (Array Int Int)) (v_ArrVal_503 (Array Int Int)) (v_ArrVal_492 (Array Int Int)) (v_ArrVal_495 (Array Int Int)) (v_ArrVal_497 (Array Int Int))) (= (select (select (store (store (store (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_26| v_ArrVal_492) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| v_ArrVal_495) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| v_ArrVal_497) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_502) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_503) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))))) is different from false [2022-07-14 07:03:59,042 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| Int) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_26| Int) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| Int) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| Int) (|v_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base_16| Int)) (or (< |v_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base_16| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14|) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| |c_#StackHeapBarrier|)) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| |c_#StackHeapBarrier|)) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_26| |c_#StackHeapBarrier|)) (and (forall ((v_ArrVal_502 (Array Int Int)) (v_ArrVal_503 (Array Int Int)) (v_ArrVal_492 (Array Int Int)) (v_ArrVal_495 (Array Int Int)) (v_ArrVal_497 (Array Int Int))) (= (select (select (store (store (store (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_26| v_ArrVal_492) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| v_ArrVal_495) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| v_ArrVal_497) |v_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base_16| v_ArrVal_502) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_503) |c_ULTIMATE.start_main_~#head~1#1.base|) |c_ULTIMATE.start_main_~#head~1#1.offset|) 0)) (forall ((v_ArrVal_501 (Array Int Int)) (v_ArrVal_504 (Array Int Int)) (v_ArrVal_493 (Array Int Int)) (v_ArrVal_498 (Array Int Int))) (= (select (select (store (store (store (let ((.cse0 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_26| v_ArrVal_493))) (store .cse0 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| (store (select .cse0 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_25|) 0 0))) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| v_ArrVal_498) |v_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base_16| v_ArrVal_501) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_504) |c_ULTIMATE.start_main_~#head~1#1.base|) |c_ULTIMATE.start_main_~#head~1#1.offset|) 0))) (not (< |v_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base_16| |c_#StackHeapBarrier|)))) is different from false [2022-07-14 07:03:59,543 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 15 not checked. [2022-07-14 07:03:59,543 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [657247864] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 07:03:59,544 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 07:03:59,544 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 16, 18] total 37 [2022-07-14 07:03:59,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662236887] [2022-07-14 07:03:59,544 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 07:03:59,544 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-07-14 07:03:59,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 07:03:59,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-07-14 07:03:59,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=451, Unknown=13, NotChecked=728, Total=1332 [2022-07-14 07:03:59,546 INFO L87 Difference]: Start difference. First operand 276 states and 323 transitions. Second operand has 37 states, 37 states have (on average 2.324324324324324) internal successors, (86), 37 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 07:04:01,561 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~#head~1#1.offset| 0) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#head~1#1.base|) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#head~1#1.base|) |c_ULTIMATE.start_main_~#head~1#1.offset|) 0) (= (select |c_#valid| |c_ULTIMATE.start_main_~#head~1#1.base|) 1) (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| Int) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_26| Int) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| Int) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| Int) (|v_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base_16| Int)) (or (< |v_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base_16| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14|) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| |c_#StackHeapBarrier|)) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| |c_#StackHeapBarrier|)) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_26| |c_#StackHeapBarrier|)) (and (forall ((v_ArrVal_502 (Array Int Int)) (v_ArrVal_503 (Array Int Int)) (v_ArrVal_492 (Array Int Int)) (v_ArrVal_495 (Array Int Int)) (v_ArrVal_497 (Array Int Int))) (= (select (select (store (store (store (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_26| v_ArrVal_492) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| v_ArrVal_495) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| v_ArrVal_497) |v_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base_16| v_ArrVal_502) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_503) |c_ULTIMATE.start_main_~#head~1#1.base|) |c_ULTIMATE.start_main_~#head~1#1.offset|) 0)) (forall ((v_ArrVal_501 (Array Int Int)) (v_ArrVal_504 (Array Int Int)) (v_ArrVal_493 (Array Int Int)) (v_ArrVal_498 (Array Int Int))) (= (select (select (store (store (store (let ((.cse0 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_26| v_ArrVal_493))) (store .cse0 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| (store (select .cse0 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_25|) 0 0))) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| v_ArrVal_498) |v_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base_16| v_ArrVal_501) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_504) |c_ULTIMATE.start_main_~#head~1#1.base|) |c_ULTIMATE.start_main_~#head~1#1.offset|) 0))) (not (< |v_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base_16| |c_#StackHeapBarrier|)))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#head~1#1.base|) |c_ULTIMATE.start_main_~#head~1#1.offset|) 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#head~1#1.base|)) is different from false [2022-07-14 07:04:03,585 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~head#1.base|) 0) 0) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~head#1.base|) 0) 0) (= |c_ULTIMATE.start_sll_append_~head#1.offset| 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_sll_append_~head#1.base|) (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |c_#StackHeapBarrier|) (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| Int) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_26| Int) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| Int) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| Int)) (or (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14|) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| |c_#StackHeapBarrier|)) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| |c_#StackHeapBarrier|)) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_26| |c_#StackHeapBarrier|)) (and (forall ((v_ArrVal_501 (Array Int Int)) (v_ArrVal_504 (Array Int Int)) (v_ArrVal_493 (Array Int Int)) (v_ArrVal_498 (Array Int Int))) (= (select (select (store (store (store (let ((.cse0 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_26| v_ArrVal_493))) (store .cse0 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| (store (select .cse0 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_25|) 0 0))) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| v_ArrVal_498) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_501) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_504) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_502 (Array Int Int)) (v_ArrVal_503 (Array Int Int)) (v_ArrVal_492 (Array Int Int)) (v_ArrVal_495 (Array Int Int)) (v_ArrVal_497 (Array Int Int))) (= (select (select (store (store (store (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_26| v_ArrVal_492) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| v_ArrVal_495) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| v_ArrVal_497) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_502) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_503) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)))))) is different from false [2022-07-14 07:04:03,603 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~head#1.base|) 0) 0) (forall ((v_ArrVal_492 (Array Int Int)) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| Int) (v_ArrVal_493 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| Int) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| Int)) (or (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14|) (and (forall ((v_ArrVal_501 (Array Int Int)) (v_ArrVal_504 (Array Int Int)) (v_ArrVal_498 (Array Int Int))) (= (select (select (store (store (store (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| v_ArrVal_493))) (store .cse0 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| (store (select .cse0 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_25|) 0 |c_ULTIMATE.start_sll_create_~new_head~0#1.offset|))) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| v_ArrVal_498) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_501) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_504) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_502 (Array Int Int)) (v_ArrVal_503 (Array Int Int)) (v_ArrVal_495 (Array Int Int)) (v_ArrVal_497 (Array Int Int))) (= (select (select (store (store (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| v_ArrVal_492) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| v_ArrVal_495) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| v_ArrVal_497) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_502) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_503) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| |c_#StackHeapBarrier|)) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| |c_#StackHeapBarrier|)))) (= |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~head#1.base|) 0) 0) (= |c_ULTIMATE.start_sll_append_~head#1.offset| 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_sll_append_~head#1.base|) (< |c_ULTIMATE.start_sll_create_~new_head~0#1.base| |c_#StackHeapBarrier|) (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |c_#StackHeapBarrier|)) is different from false [2022-07-14 07:04:05,607 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~head#1.base|) 0) 0) (= |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~head#1.base|) 0) 0) (= |c_ULTIMATE.start_sll_append_~head#1.offset| 0) (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| Int) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| Int) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| Int)) (or (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14|) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| |c_#StackHeapBarrier|)) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| |c_#StackHeapBarrier|)) (and (forall ((v_ArrVal_502 (Array Int Int)) (v_ArrVal_503 (Array Int Int)) (v_ArrVal_495 (Array Int Int)) (v_ArrVal_497 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| v_ArrVal_495) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| v_ArrVal_497) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_502) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_503) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_501 (Array Int Int)) (v_ArrVal_504 (Array Int Int)) (v_ArrVal_498 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_25|) 0 |c_ULTIMATE.start_sll_create_~new_head~0#1.offset|)) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| v_ArrVal_498) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_501) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_504) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))))) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_sll_append_~head#1.base|) (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |c_#StackHeapBarrier|)) is different from false [2022-07-14 07:04:07,610 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~head#1.base|) 0) 0) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~head#1.base|) 0) 0) (= |c_ULTIMATE.start_sll_append_~head#1.offset| 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_sll_append_~head#1.base|) (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |c_#StackHeapBarrier|) (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| Int) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| Int) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| Int)) (or (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14|) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| |c_#StackHeapBarrier|)) (and (forall ((v_ArrVal_502 (Array Int Int)) (v_ArrVal_503 (Array Int Int)) (v_ArrVal_495 (Array Int Int)) (v_ArrVal_497 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| v_ArrVal_495) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| v_ArrVal_497) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_502) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_503) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_501 (Array Int Int)) (v_ArrVal_504 (Array Int Int)) (v_ArrVal_498 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_25|) 0 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| v_ArrVal_498) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_501) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_504) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| |c_#StackHeapBarrier|)))) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0)) is different from false [2022-07-14 07:04:07,632 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~head#1.base|) 0) 0) (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| Int) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| Int) (v_ArrVal_495 (Array Int Int))) (or (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14|) (and (forall ((v_ArrVal_501 (Array Int Int)) (v_ArrVal_504 (Array Int Int)) (v_ArrVal_498 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| v_ArrVal_498) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_501) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_504) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_502 (Array Int Int)) (v_ArrVal_503 (Array Int Int)) (v_ArrVal_497 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| v_ArrVal_495) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| v_ArrVal_497) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_502) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_503) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| |c_#StackHeapBarrier|)))) (= |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~head#1.base|) 0) 0) (= |c_ULTIMATE.start_sll_append_~head#1.offset| 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_sll_append_~head#1.base|) (< |c_ULTIMATE.start_sll_create_~new_head~0#1.base| |c_#StackHeapBarrier|) (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0)) is different from false [2022-07-14 07:04:09,634 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~head#1.base|) 0) 0) (= |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 0) (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| Int)) (or (forall ((|v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| Int) (v_ArrVal_498 (Array Int Int)) (v_ArrVal_497 (Array Int Int))) (or (and (forall ((v_ArrVal_501 (Array Int Int)) (v_ArrVal_504 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| v_ArrVal_498) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_501) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_504) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_502 (Array Int Int)) (v_ArrVal_503 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| v_ArrVal_497) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_502) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_503) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))) (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14|))) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| |c_#StackHeapBarrier|)))) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~head#1.base|) 0) 0) (= |c_ULTIMATE.start_sll_append_~head#1.offset| 0) (exists ((|ULTIMATE.start_sll_create_~new_head~0#1.base| Int)) (and (< |ULTIMATE.start_sll_create_~new_head~0#1.base| |c_#StackHeapBarrier|) (= (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~new_head~0#1.base|) 0) 0))) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_sll_append_~head#1.base|) (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |c_#StackHeapBarrier|)) is different from false [2022-07-14 07:04:11,637 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~head#1.base|) 0) 0) (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| Int)) (or (forall ((|v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| Int) (v_ArrVal_498 (Array Int Int)) (v_ArrVal_497 (Array Int Int))) (or (and (forall ((v_ArrVal_501 (Array Int Int)) (v_ArrVal_504 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| v_ArrVal_498) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_501) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_504) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_502 (Array Int Int)) (v_ArrVal_503 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| v_ArrVal_497) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_502) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_503) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))) (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14|))) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| |c_#StackHeapBarrier|)))) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~head#1.base|) 0) 0) (= |c_ULTIMATE.start_sll_append_~head#1.offset| 0) (exists ((|ULTIMATE.start_sll_create_~new_head~0#1.base| Int)) (and (< |ULTIMATE.start_sll_create_~new_head~0#1.base| |c_#StackHeapBarrier|) (= (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~new_head~0#1.base|) 0) 0))) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_sll_append_~head#1.base|) (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0)) is different from false [2022-07-14 07:05:09,759 WARN L233 SmtUtils]: Spent 40.04s on a formula simplification. DAG size of input: 47 DAG size of output: 41 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-14 07:06:07,830 WARN L233 SmtUtils]: Spent 40.05s on a formula simplification. DAG size of input: 47 DAG size of output: 41 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-14 07:07:07,966 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~head#1.base|) 0) 0) (forall ((|v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| Int)) (or (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14|) (and (forall ((v_ArrVal_503 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_503) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_504 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_504) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))))) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~head#1.base|) 0) 0) (= |c_ULTIMATE.start_sll_append_~head#1.offset| 0) (< (+ |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| 1) |c_ULTIMATE.start_sll_append_~head#1.base|)) is different from false [2022-07-14 07:07:09,971 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~head#1.base|) 0) 0) (forall ((|v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| Int)) (or (and (forall ((v_ArrVal_503 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_503) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_504 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_504) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))) (not (<= |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| |c_ULTIMATE.start_node_create_with_sublist_#res#1.base|)))) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~head#1.base|) 0) 0) (= |c_ULTIMATE.start_sll_append_~head#1.offset| 0) (< (+ |c_ULTIMATE.start_node_create_with_sublist_#res#1.base| 1) |c_ULTIMATE.start_sll_append_~head#1.base|)) is different from false [2022-07-14 07:07:16,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 07:07:16,138 INFO L93 Difference]: Finished difference Result 313 states and 362 transitions. [2022-07-14 07:07:16,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-14 07:07:16,139 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 2.324324324324324) internal successors, (86), 37 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2022-07-14 07:07:16,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 07:07:16,140 INFO L225 Difference]: With dead ends: 313 [2022-07-14 07:07:16,140 INFO L226 Difference]: Without dead ends: 313 [2022-07-14 07:07:16,141 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 47 SyntacticMatches, 6 SemanticMatches, 50 ConstructedPredicates, 23 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 200.9s TimeCoverageRelationStatistics Valid=209, Invalid=651, Unknown=44, NotChecked=1748, Total=2652 [2022-07-14 07:07:16,141 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 12 mSDsluCounter, 1513 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 1603 SdHoareTripleChecker+Invalid, 618 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 442 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 07:07:16,141 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 1603 Invalid, 618 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 168 Invalid, 0 Unknown, 442 Unchecked, 0.1s Time] [2022-07-14 07:07:16,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2022-07-14 07:07:16,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 303. [2022-07-14 07:07:16,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 274 states have (on average 1.2846715328467153) internal successors, (352), 302 states have internal predecessors, (352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 07:07:16,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 352 transitions. [2022-07-14 07:07:16,147 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 352 transitions. Word has length 33 [2022-07-14 07:07:16,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 07:07:16,147 INFO L495 AbstractCegarLoop]: Abstraction has 303 states and 352 transitions. [2022-07-14 07:07:16,147 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 2.324324324324324) internal successors, (86), 37 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 07:07:16,148 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 352 transitions. [2022-07-14 07:07:16,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-07-14 07:07:16,148 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 07:07:16,148 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 07:07:16,175 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-14 07:07:16,349 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 07:07:16,349 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-07-14 07:07:16,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 07:07:16,349 INFO L85 PathProgramCache]: Analyzing trace with hash -990413803, now seen corresponding path program 1 times [2022-07-14 07:07:16,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 07:07:16,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224826100] [2022-07-14 07:07:16,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:07:16,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 07:07:16,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:07:16,374 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-14 07:07:16,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 07:07:16,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224826100] [2022-07-14 07:07:16,375 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224826100] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 07:07:16,375 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 07:07:16,375 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 07:07:16,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125597574] [2022-07-14 07:07:16,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 07:07:16,376 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 07:07:16,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 07:07:16,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 07:07:16,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 07:07:16,377 INFO L87 Difference]: Start difference. First operand 303 states and 352 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 07:07:16,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 07:07:16,384 INFO L93 Difference]: Finished difference Result 284 states and 331 transitions. [2022-07-14 07:07:16,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 07:07:16,384 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2022-07-14 07:07:16,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 07:07:16,386 INFO L225 Difference]: With dead ends: 284 [2022-07-14 07:07:16,386 INFO L226 Difference]: Without dead ends: 284 [2022-07-14 07:07:16,387 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-14 07:07:16,388 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 0 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 07:07:16,388 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 216 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 07:07:16,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2022-07-14 07:07:16,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 283. [2022-07-14 07:07:16,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 254 states have (on average 1.2992125984251968) internal successors, (330), 282 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 07:07:16,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 330 transitions. [2022-07-14 07:07:16,397 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 330 transitions. Word has length 33 [2022-07-14 07:07:16,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 07:07:16,397 INFO L495 AbstractCegarLoop]: Abstraction has 283 states and 330 transitions. [2022-07-14 07:07:16,397 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 07:07:16,397 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 330 transitions. [2022-07-14 07:07:16,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-14 07:07:16,398 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 07:07:16,398 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 07:07:16,398 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-14 07:07:16,398 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-07-14 07:07:16,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 07:07:16,399 INFO L85 PathProgramCache]: Analyzing trace with hash 74446604, now seen corresponding path program 1 times [2022-07-14 07:07:16,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 07:07:16,399 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441319209] [2022-07-14 07:07:16,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:07:16,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 07:07:16,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:07:16,482 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 07:07:16,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 07:07:16,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441319209] [2022-07-14 07:07:16,483 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441319209] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 07:07:16,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1045287320] [2022-07-14 07:07:16,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:07:16,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 07:07:16,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 07:07:16,508 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-14 07:07:16,510 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-14 07:07:16,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:07:16,618 INFO L263 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-14 07:07:16,624 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 07:07:16,653 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 07:07:16,653 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 07:07:16,691 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 07:07:16,692 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1045287320] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 07:07:16,692 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 07:07:16,692 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 9 [2022-07-14 07:07:16,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535616847] [2022-07-14 07:07:16,692 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 07:07:16,693 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-14 07:07:16,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 07:07:16,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-14 07:07:16,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-07-14 07:07:16,694 INFO L87 Difference]: Start difference. First operand 283 states and 330 transitions. Second operand has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 07:07:16,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 07:07:16,835 INFO L93 Difference]: Finished difference Result 502 states and 569 transitions. [2022-07-14 07:07:16,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-14 07:07:16,836 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2022-07-14 07:07:16,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 07:07:16,837 INFO L225 Difference]: With dead ends: 502 [2022-07-14 07:07:16,838 INFO L226 Difference]: Without dead ends: 502 [2022-07-14 07:07:16,838 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 75 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2022-07-14 07:07:16,838 INFO L413 NwaCegarLoop]: 307 mSDtfsCounter, 264 mSDsluCounter, 1027 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 1334 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 07:07:16,838 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 1334 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 07:07:16,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states. [2022-07-14 07:07:16,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 317. [2022-07-14 07:07:16,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 317 states, 288 states have (on average 1.3090277777777777) internal successors, (377), 316 states have internal predecessors, (377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 07:07:16,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 377 transitions. [2022-07-14 07:07:16,845 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 377 transitions. Word has length 38 [2022-07-14 07:07:16,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 07:07:16,845 INFO L495 AbstractCegarLoop]: Abstraction has 317 states and 377 transitions. [2022-07-14 07:07:16,846 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 07:07:16,846 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 377 transitions. [2022-07-14 07:07:16,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-07-14 07:07:16,846 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 07:07:16,846 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 07:07:16,873 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-14 07:07:17,061 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 07:07:17,061 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-07-14 07:07:17,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 07:07:17,061 INFO L85 PathProgramCache]: Analyzing trace with hash -1481327645, now seen corresponding path program 2 times [2022-07-14 07:07:17,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 07:07:17,062 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472626637] [2022-07-14 07:07:17,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:07:17,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 07:07:17,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:07:17,325 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-07-14 07:07:17,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 07:07:17,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472626637] [2022-07-14 07:07:17,326 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472626637] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 07:07:17,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1699951753] [2022-07-14 07:07:17,326 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-14 07:07:17,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 07:07:17,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 07:07:17,328 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-14 07:07:17,357 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-14 07:07:17,465 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-14 07:07:17,465 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 07:07:17,466 INFO L263 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 61 conjunts are in the unsatisfiable core [2022-07-14 07:07:17,471 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 07:07:17,658 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 07:07:17,659 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-14 07:07:17,662 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 07:07:17,664 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-14 07:07:17,786 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 07:07:17,787 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2022-07-14 07:07:17,791 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 07:07:17,792 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-14 07:07:17,971 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 07:07:17,972 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-14 07:07:17,979 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 07:07:17,979 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 07:07:17,989 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-07-14 07:07:17,989 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2022-07-14 07:07:18,127 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 07:07:18,129 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-14 07:07:18,133 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 07:07:18,134 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 07:07:18,142 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-14 07:07:18,142 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 30 [2022-07-14 07:07:18,197 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 07:07:18,198 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-14 07:07:18,205 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 07:07:18,205 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-14 07:07:18,219 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 07:07:18,220 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-14 07:07:18,227 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 07:07:18,228 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-14 07:07:18,316 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 07:07:18,317 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-14 07:07:18,328 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 07:07:18,329 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-14 07:07:18,351 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-14 07:07:18,353 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-14 07:07:18,360 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 11 proven. 17 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-14 07:07:18,360 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 07:07:18,385 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_766 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~new_last~0#1.base| v_ArrVal_766) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_765 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~new_last~0#1.base| v_ArrVal_765) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))) is different from false [2022-07-14 07:07:18,400 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| Int)) (or (and (forall ((v_ArrVal_765 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| v_ArrVal_765) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_766 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| v_ArrVal_766) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))) (not (<= |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| |c_ULTIMATE.start_node_create_with_sublist_#res#1.base|)))) is different from false [2022-07-14 07:07:18,414 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| Int)) (or (and (forall ((v_ArrVal_765 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| v_ArrVal_765) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_766 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| v_ArrVal_766) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))) (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18|))) is different from false [2022-07-14 07:07:18,433 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| Int) (v_ArrVal_764 (Array Int Int)) (v_ArrVal_763 (Array Int Int))) (or (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18|) (and (forall ((v_ArrVal_765 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_764) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| v_ArrVal_765) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_766 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_763) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| v_ArrVal_766) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))))) is different from false [2022-07-14 07:07:18,462 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| Int)) (or (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18|) (and (forall ((v_ArrVal_765 (Array Int Int)) (v_ArrVal_764 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_764) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| v_ArrVal_765) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_766 (Array Int Int)) (v_ArrVal_763 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_763) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| v_ArrVal_766) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))))) is different from false [2022-07-14 07:07:18,525 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_759 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| Int) (v_ArrVal_760 (Array Int Int))) (or (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18|) (and (forall ((v_ArrVal_765 (Array Int Int)) (v_ArrVal_764 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| v_ArrVal_760) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_764) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| v_ArrVal_765) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_766 (Array Int Int)) (v_ArrVal_763 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| v_ArrVal_759) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_763) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| v_ArrVal_766) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))))) is different from false [2022-07-14 07:07:20,612 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| Int)) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_759 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| Int) (v_ArrVal_760 (Array Int Int))) (or (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18|) (and (forall ((v_ArrVal_765 (Array Int Int)) (v_ArrVal_764 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| v_ArrVal_760) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_764) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| v_ArrVal_765) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_766 (Array Int Int)) (v_ArrVal_763 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| v_ArrVal_759) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_763) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| v_ArrVal_766) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))))))) is different from false [2022-07-14 07:07:20,742 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_757 (Array Int Int)) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| Int) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| Int)) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| |c_#StackHeapBarrier|)) (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18|) (and (forall ((v_ArrVal_765 (Array Int Int)) (v_ArrVal_760 (Array Int Int)) (v_ArrVal_764 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| v_ArrVal_760) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_764) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| v_ArrVal_765) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_766 (Array Int Int)) (v_ArrVal_759 (Array Int Int)) (v_ArrVal_763 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| v_ArrVal_757) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| v_ArrVal_759) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_763) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| v_ArrVal_766) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))))) is different from false [2022-07-14 07:07:20,886 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| Int) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| Int) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_34| Int)) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| |c_#StackHeapBarrier|)) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_34| |c_#StackHeapBarrier|)) (and (forall ((v_ArrVal_765 (Array Int Int)) (v_ArrVal_760 (Array Int Int)) (v_ArrVal_764 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_34| (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_34|) 0 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| v_ArrVal_760) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_764) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| v_ArrVal_765) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_766 (Array Int Int)) (v_ArrVal_757 (Array Int Int)) (v_ArrVal_759 (Array Int Int)) (v_ArrVal_763 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_34| v_ArrVal_757) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| v_ArrVal_759) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_763) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| v_ArrVal_766) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))) (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18|))) is different from false [2022-07-14 07:07:20,974 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| Int) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| Int) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_34| Int)) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| |c_#StackHeapBarrier|)) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_34| |c_#StackHeapBarrier|)) (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18|) (and (forall ((v_ArrVal_765 (Array Int Int)) (v_ArrVal_760 (Array Int Int)) (v_ArrVal_764 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_34| (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_34|) 0 |c_ULTIMATE.start_sll_create_~new_head~0#1.offset|)) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| v_ArrVal_760) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_764) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| v_ArrVal_765) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_766 (Array Int Int)) (v_ArrVal_757 (Array Int Int)) (v_ArrVal_759 (Array Int Int)) (v_ArrVal_763 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_34| v_ArrVal_757) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| v_ArrVal_759) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_763) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| v_ArrVal_766) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))))) is different from false [2022-07-14 07:07:21,073 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| Int) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| Int) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_34| Int) (v_ArrVal_753 (Array Int Int))) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| |c_#StackHeapBarrier|)) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_34| |c_#StackHeapBarrier|)) (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18|) (and (forall ((v_ArrVal_765 (Array Int Int)) (v_ArrVal_760 (Array Int Int)) (v_ArrVal_764 (Array Int Int))) (= (select (select (store (store (store (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |c_ULTIMATE.start_sll_create_~head~0#1.offset|)))) (store .cse0 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_34| (store (select .cse0 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_34|) 0 |c_ULTIMATE.start_sll_create_~new_head~0#1.offset|))) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| v_ArrVal_760) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_764) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| v_ArrVal_765) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_766 (Array Int Int)) (v_ArrVal_757 (Array Int Int)) (v_ArrVal_759 (Array Int Int)) (v_ArrVal_763 (Array Int Int))) (= (select (select (store (store (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| v_ArrVal_753) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_34| v_ArrVal_757) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| v_ArrVal_759) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_763) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| v_ArrVal_766) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))))) is different from false [2022-07-14 07:07:21,311 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| Int) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| Int) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_35| Int) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_34| Int)) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| |c_#StackHeapBarrier|)) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_34| |c_#StackHeapBarrier|)) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_35| |c_#StackHeapBarrier|)) (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18|) (and (forall ((v_ArrVal_765 (Array Int Int)) (v_ArrVal_760 (Array Int Int)) (v_ArrVal_764 (Array Int Int))) (= (select (select (store (store (store (let ((.cse0 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_35| (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_35|) 0 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)))) (store .cse0 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_34| (store (select .cse0 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_34|) 0 0))) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| v_ArrVal_760) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_764) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| v_ArrVal_765) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_766 (Array Int Int)) (v_ArrVal_757 (Array Int Int)) (v_ArrVal_759 (Array Int Int)) (v_ArrVal_753 (Array Int Int)) (v_ArrVal_763 (Array Int Int))) (= (select (select (store (store (store (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_35| v_ArrVal_753) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_34| v_ArrVal_757) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| v_ArrVal_759) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_763) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| v_ArrVal_766) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))))) is different from false [2022-07-14 07:07:21,420 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| Int) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| Int) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_35| Int) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_34| Int)) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| |c_#StackHeapBarrier|)) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_34| |c_#StackHeapBarrier|)) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_35| |c_#StackHeapBarrier|)) (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18|) (and (forall ((v_ArrVal_766 (Array Int Int)) (v_ArrVal_757 (Array Int Int)) (v_ArrVal_759 (Array Int Int)) (v_ArrVal_753 (Array Int Int)) (v_ArrVal_763 (Array Int Int))) (= (select (select (store (store (store (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_35| v_ArrVal_753) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_34| v_ArrVal_757) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| v_ArrVal_759) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_763) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| v_ArrVal_766) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_765 (Array Int Int)) (v_ArrVal_760 (Array Int Int)) (v_ArrVal_764 (Array Int Int))) (= (select (select (store (store (store (let ((.cse0 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_35| (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_35|) 0 |c_ULTIMATE.start_sll_create_~new_head~0#1.offset|)))) (store .cse0 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_34| (store (select .cse0 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_34|) 0 0))) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| v_ArrVal_760) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_764) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| v_ArrVal_765) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))))) is different from false [2022-07-14 07:07:21,542 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| Int) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| Int) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_35| Int) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_34| Int) (v_ArrVal_751 (Array Int Int)) (v_ArrVal_752 (Array Int Int))) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| |c_#StackHeapBarrier|)) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_34| |c_#StackHeapBarrier|)) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_35| |c_#StackHeapBarrier|)) (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18|) (and (forall ((v_ArrVal_765 (Array Int Int)) (v_ArrVal_760 (Array Int Int)) (v_ArrVal_764 (Array Int Int))) (= (select (select (store (store (store (let ((.cse0 (let ((.cse1 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| v_ArrVal_752))) (store .cse1 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_35| (store (select .cse1 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_35|) 0 |c_ULTIMATE.start_sll_create_~new_head~0#1.offset|))))) (store .cse0 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_34| (store (select .cse0 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_34|) 0 0))) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| v_ArrVal_760) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_764) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| v_ArrVal_765) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_766 (Array Int Int)) (v_ArrVal_757 (Array Int Int)) (v_ArrVal_759 (Array Int Int)) (v_ArrVal_753 (Array Int Int)) (v_ArrVal_763 (Array Int Int))) (= (select (select (store (store (store (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| v_ArrVal_751) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_35| v_ArrVal_753) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_34| v_ArrVal_757) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| v_ArrVal_759) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_763) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| v_ArrVal_766) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))))) is different from false [2022-07-14 07:07:21,805 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| Int) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| Int) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_35| Int) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_34| Int) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_36| Int)) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| |c_#StackHeapBarrier|)) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_34| |c_#StackHeapBarrier|)) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_35| |c_#StackHeapBarrier|)) (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18|) (and (forall ((v_ArrVal_766 (Array Int Int)) (v_ArrVal_757 (Array Int Int)) (v_ArrVal_759 (Array Int Int)) (v_ArrVal_751 (Array Int Int)) (v_ArrVal_753 (Array Int Int)) (v_ArrVal_763 (Array Int Int))) (= (select (select (store (store (store (store (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_36| v_ArrVal_751) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_35| v_ArrVal_753) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_34| v_ArrVal_757) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| v_ArrVal_759) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_763) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| v_ArrVal_766) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_765 (Array Int Int)) (v_ArrVal_760 (Array Int Int)) (v_ArrVal_764 (Array Int Int)) (v_ArrVal_752 (Array Int Int))) (= (select (select (store (store (store (let ((.cse0 (let ((.cse1 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_36| v_ArrVal_752))) (store .cse1 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_35| (store (select .cse1 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_35|) 0 0))))) (store .cse0 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_34| (store (select .cse0 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_34|) 0 0))) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| v_ArrVal_760) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_764) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| v_ArrVal_765) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_36| |c_#StackHeapBarrier|)))) is different from false [2022-07-14 07:07:22,302 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| Int) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| Int) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_35| Int) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_34| Int) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_36| Int) (|v_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base_18| Int)) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| |c_#StackHeapBarrier|)) (and (forall ((v_ArrVal_765 (Array Int Int)) (v_ArrVal_760 (Array Int Int)) (v_ArrVal_764 (Array Int Int)) (v_ArrVal_752 (Array Int Int))) (= (select (select (store (store (store (let ((.cse0 (let ((.cse1 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_36| v_ArrVal_752))) (store .cse1 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_35| (store (select .cse1 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_35|) 0 0))))) (store .cse0 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_34| (store (select .cse0 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_34|) 0 0))) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| v_ArrVal_760) |v_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base_18| v_ArrVal_764) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| v_ArrVal_765) |c_ULTIMATE.start_main_~#head~1#1.base|) |c_ULTIMATE.start_main_~#head~1#1.offset|) 0)) (forall ((v_ArrVal_766 (Array Int Int)) (v_ArrVal_757 (Array Int Int)) (v_ArrVal_759 (Array Int Int)) (v_ArrVal_751 (Array Int Int)) (v_ArrVal_753 (Array Int Int)) (v_ArrVal_763 (Array Int Int))) (= (select (select (store (store (store (store (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_36| v_ArrVal_751) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_35| v_ArrVal_753) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_34| v_ArrVal_757) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| v_ArrVal_759) |v_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base_18| v_ArrVal_763) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| v_ArrVal_766) |c_ULTIMATE.start_main_~#head~1#1.base|) |c_ULTIMATE.start_main_~#head~1#1.offset|) 0))) (not (< |v_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base_18| |c_#StackHeapBarrier|)) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_34| |c_#StackHeapBarrier|)) (< |v_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base_18| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18|) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_35| |c_#StackHeapBarrier|)) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_36| |c_#StackHeapBarrier|)))) is different from false [2022-07-14 07:07:23,929 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 28 not checked. [2022-07-14 07:07:23,929 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1699951753] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 07:07:23,930 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 07:07:23,930 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 19, 21] total 43 [2022-07-14 07:07:23,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594617403] [2022-07-14 07:07:23,930 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 07:07:23,931 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-07-14 07:07:23,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 07:07:23,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-07-14 07:07:23,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=566, Unknown=16, NotChecked=1040, Total=1806 [2022-07-14 07:07:23,932 INFO L87 Difference]: Start difference. First operand 317 states and 377 transitions. Second operand has 43 states, 43 states have (on average 2.3255813953488373) internal successors, (100), 43 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 07:07:25,948 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~#head~1#1.offset| 0) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#head~1#1.base|) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#head~1#1.base|) |c_ULTIMATE.start_main_~#head~1#1.offset|) 0) (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| Int) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| Int) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_35| Int) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_34| Int) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_36| Int) (|v_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base_18| Int)) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| |c_#StackHeapBarrier|)) (and (forall ((v_ArrVal_765 (Array Int Int)) (v_ArrVal_760 (Array Int Int)) (v_ArrVal_764 (Array Int Int)) (v_ArrVal_752 (Array Int Int))) (= (select (select (store (store (store (let ((.cse0 (let ((.cse1 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_36| v_ArrVal_752))) (store .cse1 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_35| (store (select .cse1 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_35|) 0 0))))) (store .cse0 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_34| (store (select .cse0 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_34|) 0 0))) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| v_ArrVal_760) |v_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base_18| v_ArrVal_764) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| v_ArrVal_765) |c_ULTIMATE.start_main_~#head~1#1.base|) |c_ULTIMATE.start_main_~#head~1#1.offset|) 0)) (forall ((v_ArrVal_766 (Array Int Int)) (v_ArrVal_757 (Array Int Int)) (v_ArrVal_759 (Array Int Int)) (v_ArrVal_751 (Array Int Int)) (v_ArrVal_753 (Array Int Int)) (v_ArrVal_763 (Array Int Int))) (= (select (select (store (store (store (store (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_36| v_ArrVal_751) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_35| v_ArrVal_753) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_34| v_ArrVal_757) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| v_ArrVal_759) |v_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base_18| v_ArrVal_763) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| v_ArrVal_766) |c_ULTIMATE.start_main_~#head~1#1.base|) |c_ULTIMATE.start_main_~#head~1#1.offset|) 0))) (not (< |v_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base_18| |c_#StackHeapBarrier|)) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_34| |c_#StackHeapBarrier|)) (< |v_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base_18| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18|) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_35| |c_#StackHeapBarrier|)) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_36| |c_#StackHeapBarrier|)))) (= (select |c_#valid| |c_ULTIMATE.start_main_~#head~1#1.base|) 1) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#head~1#1.base|) |c_ULTIMATE.start_main_~#head~1#1.offset|) 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#head~1#1.base|)) is different from false [2022-07-14 07:07:27,953 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~head#1.base|) 0) 0) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~head#1.base|) 0) 0) (= |c_ULTIMATE.start_sll_append_~head#1.offset| 0) (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| Int) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| Int) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_35| Int) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_34| Int) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_36| Int)) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| |c_#StackHeapBarrier|)) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_34| |c_#StackHeapBarrier|)) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_35| |c_#StackHeapBarrier|)) (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18|) (and (forall ((v_ArrVal_766 (Array Int Int)) (v_ArrVal_757 (Array Int Int)) (v_ArrVal_759 (Array Int Int)) (v_ArrVal_751 (Array Int Int)) (v_ArrVal_753 (Array Int Int)) (v_ArrVal_763 (Array Int Int))) (= (select (select (store (store (store (store (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_36| v_ArrVal_751) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_35| v_ArrVal_753) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_34| v_ArrVal_757) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| v_ArrVal_759) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_763) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| v_ArrVal_766) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_765 (Array Int Int)) (v_ArrVal_760 (Array Int Int)) (v_ArrVal_764 (Array Int Int)) (v_ArrVal_752 (Array Int Int))) (= (select (select (store (store (store (let ((.cse0 (let ((.cse1 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_36| v_ArrVal_752))) (store .cse1 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_35| (store (select .cse1 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_35|) 0 0))))) (store .cse0 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_34| (store (select .cse0 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_34|) 0 0))) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| v_ArrVal_760) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_764) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| v_ArrVal_765) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_36| |c_#StackHeapBarrier|)))) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_sll_append_~head#1.base|) (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |c_#StackHeapBarrier|)) is different from false [2022-07-14 07:07:27,959 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~head#1.base|) 0) 0) (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| Int) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| Int) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_35| Int) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_34| Int) (v_ArrVal_751 (Array Int Int)) (v_ArrVal_752 (Array Int Int))) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| |c_#StackHeapBarrier|)) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_34| |c_#StackHeapBarrier|)) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_35| |c_#StackHeapBarrier|)) (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18|) (and (forall ((v_ArrVal_765 (Array Int Int)) (v_ArrVal_760 (Array Int Int)) (v_ArrVal_764 (Array Int Int))) (= (select (select (store (store (store (let ((.cse0 (let ((.cse1 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| v_ArrVal_752))) (store .cse1 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_35| (store (select .cse1 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_35|) 0 |c_ULTIMATE.start_sll_create_~new_head~0#1.offset|))))) (store .cse0 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_34| (store (select .cse0 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_34|) 0 0))) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| v_ArrVal_760) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_764) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| v_ArrVal_765) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_766 (Array Int Int)) (v_ArrVal_757 (Array Int Int)) (v_ArrVal_759 (Array Int Int)) (v_ArrVal_753 (Array Int Int)) (v_ArrVal_763 (Array Int Int))) (= (select (select (store (store (store (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| v_ArrVal_751) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_35| v_ArrVal_753) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_34| v_ArrVal_757) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| v_ArrVal_759) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_763) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| v_ArrVal_766) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))))) (= |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~head#1.base|) 0) 0) (= |c_ULTIMATE.start_sll_append_~head#1.offset| 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_sll_append_~head#1.base|) (< |c_ULTIMATE.start_sll_create_~new_head~0#1.base| |c_#StackHeapBarrier|) (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |c_#StackHeapBarrier|)) is different from false [2022-07-14 07:07:29,963 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~head#1.base|) 0) 0) (= |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 0) (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| Int) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| Int) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_35| Int) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_34| Int)) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| |c_#StackHeapBarrier|)) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_34| |c_#StackHeapBarrier|)) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_35| |c_#StackHeapBarrier|)) (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18|) (and (forall ((v_ArrVal_766 (Array Int Int)) (v_ArrVal_757 (Array Int Int)) (v_ArrVal_759 (Array Int Int)) (v_ArrVal_753 (Array Int Int)) (v_ArrVal_763 (Array Int Int))) (= (select (select (store (store (store (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_35| v_ArrVal_753) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_34| v_ArrVal_757) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| v_ArrVal_759) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_763) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| v_ArrVal_766) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_765 (Array Int Int)) (v_ArrVal_760 (Array Int Int)) (v_ArrVal_764 (Array Int Int))) (= (select (select (store (store (store (let ((.cse0 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_35| (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_35|) 0 |c_ULTIMATE.start_sll_create_~new_head~0#1.offset|)))) (store .cse0 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_34| (store (select .cse0 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_34|) 0 0))) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| v_ArrVal_760) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_764) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| v_ArrVal_765) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))))) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~head#1.base|) 0) 0) (= |c_ULTIMATE.start_sll_append_~head#1.offset| 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_sll_append_~head#1.base|) (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |c_#StackHeapBarrier|)) is different from false [2022-07-14 07:07:31,969 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~head#1.base|) 0) 0) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~head#1.base|) 0) 0) (= |c_ULTIMATE.start_sll_append_~head#1.offset| 0) (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| Int) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| Int) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_35| Int) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_34| Int)) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| |c_#StackHeapBarrier|)) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_34| |c_#StackHeapBarrier|)) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_35| |c_#StackHeapBarrier|)) (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18|) (and (forall ((v_ArrVal_765 (Array Int Int)) (v_ArrVal_760 (Array Int Int)) (v_ArrVal_764 (Array Int Int))) (= (select (select (store (store (store (let ((.cse0 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_35| (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_35|) 0 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)))) (store .cse0 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_34| (store (select .cse0 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_34|) 0 0))) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| v_ArrVal_760) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_764) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| v_ArrVal_765) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_766 (Array Int Int)) (v_ArrVal_757 (Array Int Int)) (v_ArrVal_759 (Array Int Int)) (v_ArrVal_753 (Array Int Int)) (v_ArrVal_763 (Array Int Int))) (= (select (select (store (store (store (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_35| v_ArrVal_753) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_34| v_ArrVal_757) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| v_ArrVal_759) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_763) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| v_ArrVal_766) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))))) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_sll_append_~head#1.base|) (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0)) is different from false [2022-07-14 07:07:32,008 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~head#1.base|) 0) 0) (= |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 0) (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| Int) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| Int) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_34| Int) (v_ArrVal_753 (Array Int Int))) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| |c_#StackHeapBarrier|)) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_34| |c_#StackHeapBarrier|)) (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18|) (and (forall ((v_ArrVal_765 (Array Int Int)) (v_ArrVal_760 (Array Int Int)) (v_ArrVal_764 (Array Int Int))) (= (select (select (store (store (store (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |c_ULTIMATE.start_sll_create_~head~0#1.offset|)))) (store .cse0 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_34| (store (select .cse0 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_34|) 0 |c_ULTIMATE.start_sll_create_~new_head~0#1.offset|))) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| v_ArrVal_760) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_764) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| v_ArrVal_765) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_766 (Array Int Int)) (v_ArrVal_757 (Array Int Int)) (v_ArrVal_759 (Array Int Int)) (v_ArrVal_763 (Array Int Int))) (= (select (select (store (store (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| v_ArrVal_753) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_34| v_ArrVal_757) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| v_ArrVal_759) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_763) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| v_ArrVal_766) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))))) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~head#1.base|) 0) 0) (= |c_ULTIMATE.start_sll_append_~head#1.offset| 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_sll_append_~head#1.base|) (< |c_ULTIMATE.start_sll_create_~new_head~0#1.base| |c_#StackHeapBarrier|) (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0)) is different from false [2022-07-14 07:07:34,019 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~head#1.base|) 0) 0) (= |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 0) (exists ((|ULTIMATE.start_sll_create_~new_head~0#1.base| Int)) (and (= (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_create_~new_head~0#1.offset|) 0) (< |ULTIMATE.start_sll_create_~new_head~0#1.base| |c_#StackHeapBarrier|))) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~head#1.base|) 0) 0) (= |c_ULTIMATE.start_sll_append_~head#1.offset| 0) (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| Int) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| Int) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_34| Int)) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| |c_#StackHeapBarrier|)) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_34| |c_#StackHeapBarrier|)) (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18|) (and (forall ((v_ArrVal_765 (Array Int Int)) (v_ArrVal_760 (Array Int Int)) (v_ArrVal_764 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_34| (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_34|) 0 |c_ULTIMATE.start_sll_create_~new_head~0#1.offset|)) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| v_ArrVal_760) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_764) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| v_ArrVal_765) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_766 (Array Int Int)) (v_ArrVal_757 (Array Int Int)) (v_ArrVal_759 (Array Int Int)) (v_ArrVal_763 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_34| v_ArrVal_757) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| v_ArrVal_759) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_763) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| v_ArrVal_766) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))))) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_sll_append_~head#1.base|) (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |c_#StackHeapBarrier|)) is different from false [2022-07-14 07:07:36,030 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~head#1.base|) 0) 0) (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| Int) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| Int) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_34| Int)) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| |c_#StackHeapBarrier|)) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_34| |c_#StackHeapBarrier|)) (and (forall ((v_ArrVal_765 (Array Int Int)) (v_ArrVal_760 (Array Int Int)) (v_ArrVal_764 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_34| (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_34|) 0 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| v_ArrVal_760) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_764) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| v_ArrVal_765) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_766 (Array Int Int)) (v_ArrVal_757 (Array Int Int)) (v_ArrVal_759 (Array Int Int)) (v_ArrVal_763 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_34| v_ArrVal_757) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| v_ArrVal_759) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_763) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| v_ArrVal_766) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))) (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18|))) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~head#1.base|) 0) 0) (= |c_ULTIMATE.start_sll_append_~head#1.offset| 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_sll_append_~head#1.base|) (exists ((|ULTIMATE.start_sll_create_~new_head~0#1.base| Int)) (and (< |ULTIMATE.start_sll_create_~new_head~0#1.base| |c_#StackHeapBarrier|) (= (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_create_~head~0#1.offset|) 0))) (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0)) is different from false [2022-07-14 07:07:36,040 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~head#1.base|) 0) 0) (= |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~head#1.base|) 0) 0) (= |c_ULTIMATE.start_sll_append_~head#1.offset| 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_sll_append_~head#1.base|) (< |c_ULTIMATE.start_sll_create_~new_head~0#1.base| |c_#StackHeapBarrier|) (exists ((|ULTIMATE.start_sll_create_~new_head~0#1.base| Int)) (and (< |ULTIMATE.start_sll_create_~new_head~0#1.base| |c_#StackHeapBarrier|) (= (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_create_~head~0#1.offset|) 0))) (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0) (forall ((v_ArrVal_757 (Array Int Int)) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| Int) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| Int)) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| |c_#StackHeapBarrier|)) (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18|) (and (forall ((v_ArrVal_765 (Array Int Int)) (v_ArrVal_760 (Array Int Int)) (v_ArrVal_764 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| v_ArrVal_760) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_764) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| v_ArrVal_765) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_766 (Array Int Int)) (v_ArrVal_759 (Array Int Int)) (v_ArrVal_763 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| v_ArrVal_757) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| v_ArrVal_759) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_763) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| v_ArrVal_766) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)))))) is different from false [2022-07-14 07:07:38,045 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~head#1.base|) 0) 0) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~head#1.base|) 0) 0) (= |c_ULTIMATE.start_sll_append_~head#1.offset| 0) (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| Int)) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_759 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| Int) (v_ArrVal_760 (Array Int Int))) (or (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18|) (and (forall ((v_ArrVal_765 (Array Int Int)) (v_ArrVal_764 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| v_ArrVal_760) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_764) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| v_ArrVal_765) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_766 (Array Int Int)) (v_ArrVal_763 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| v_ArrVal_759) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_763) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_18| v_ArrVal_766) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))))))) (exists ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_32| Int)) (and (= (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_32|) 0) 0) (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_32| |c_#StackHeapBarrier|))) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_sll_append_~head#1.base|) (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |c_#StackHeapBarrier|)) is different from false